Result 1 to 20 from 84 total
Packing and covering triangles in $K_{4}$-free planar graphs. (English)
Graphs Comb. 28, No. 5, 653-662 (2012).
1
Parameterized domination in circle graphs. (English)
Golumbic, Martin Charles (ed.) et al., Graph-theoretic concepts in computer science. 38th international workshop, WG 2012, Jerusalem, Israel, June 26‒28, 2012. Revised selcted papers. Berlin: Springer (ISBN 978-3-642-34610-1/pbk). Lecture Notes in Computer Science 7551, 308-319 (2012).
2
Scott’s induced subdivision conjecture for maximal triangle-free graphs. (English)
Comb. Probab. Comput. 21, No. 4, 512-514 :SO: (2012).
3
On spanning galaxies in digraphs. (English)
Discrete Appl. Math. 160, No. 6, 744-754 (2012).
4
Cyclic orderings and cyclic arboricity of matroids. (English)
J. Comb. Theory, Ser. B 102, No. 3, 638-646 (2012).
5
Simultaneously satisfying linear equations over $\mathbb {F}_2$: MaxLin2 and Max-$r$-Lin2 parameterized above average. (English)
Chakraborthy, Supraik (ed.) et al., IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12‒14, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-34-7). LIPICS ‒ Leibniz International Proceedings in Informatics 13, 229-240, electronic only (2011).
6
The domination number of grids. (English)
SIAM J. Discrete Math. 25, No. 3, 1443-1453 (2011).
7
Kernels for feedback arc set in tournaments. (English)
J. Comput. Syst. Sci. 77, No. 6, 1071-1078 (2011).
8
Hitting and harvesting pumpkins. (English)
Demetrescu, Camil (ed.) et al., Algorithms ‒ ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5‒9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 394-407 (2011).
9
Kernel bounds for disjoint cycles and disjoint paths. (English)
Theor. Comput. Sci. 412, No. 35, 4570-4578 (2011).
10
Conflict packing yields linear vertex-kernels for $k$-FAST, $k$-dense RTI and a related problem. (English)
Murlak, Filip (ed.) et al., Mathematical foundations of computer science 2011. 36th international symposium, MFCS 2011, Warsaw, Poland, August 22‒26, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22992-3/pbk). Lecture Notes in Computer Science 6907, 497-507 (2011).
11
Hitting and harvesting pumpkins. (English)
Comput. Res. Repos. 2011, Article No. 1105.2704 (2011).
12
The domination number of grids. (English)
Comput. Res. Repos. 2011, Article No. 1102.5206 (2011).
13
Conflict packing yields linear vertex-kernels for rooted triplet inconsistency and other problems. (English)
Comput. Res. Repos. 2011, Article No. 1101.4491 (2011).
14
Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem. (English)
Discrete Appl. Math. 159, No. 1, 23-30 (2011).
15
Hitting and harvesting pumpkins (English)
ESA, 394-407 (2011).
16
Conflict packing yields linear vertex-kernels for k -FAST, k -dense RTI and a related problem (English)
MFCS, 497-507 (2011).
17
Simultaneously satisfying linear equations over F\_2: maxlin2 and Max-r-lin2 parameterized above average (English)
FSTTCS, 229-240 (2011).
18
Multicut is FPT (English)
STOC, 459-468 (2011).
19
Almost all $H$-free graphs have the Erdős-Hajnal property. (English)
Bárány, Imre (ed.) et al., An irregular mind. Szemerédi is 70. Dedicated to Endre Szemerédi on the occasion of his seventieth birthday. Berlin: Springer (ISBN 978-3-642-14443-1/pbk). Bolyai Society Mathematical Studies 21, 405-414 (2010).
20
Result 1 to 20 from 84 total
Start
Contact
Print
General Help
