Result 1 to 20 of 38 total
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs. (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, 34-45 (2012).
1
Kernel lower bounds using co-nondeterminism: finding induced hereditary subgraphs. (English)
Fomin, Fedor V. (ed.) et al., Algorithm theory ‒ SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 364-375 (2012).
2
Kernel bounds for structural parameterizations of pathwidth. (English)
Fomin, Fedor V. (ed.) et al., Algorithm theory ‒ SWAT 2012. 13th Scandinavian symposium and workshops, Helsinki, Finland, July 4‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31154-3/pbk). Lecture Notes in Computer Science 7357, 352-363 (2012).
3
Safe approximation and its relation to kernelization. (English)
Marx, Dániel (ed.) et al., Parameterized and exact computation. 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6‒8, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28049-8/pbk). Lecture Notes in Computer Science 7112, 169-180 (2012).
4
Kernel bounds for path and cycle problems. (English)
Marx, Dániel (ed.) et al., Parameterized and exact computation. 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6‒8, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28049-8/pbk). Lecture Notes in Computer Science 7112, 145-158 (2012).
5
On polynomial kernels for structural parameterizations of odd cycle transversal. (English)
Marx, Dániel (ed.) et al., Parameterized and exact computation. 6th international symposium, IPEC 2011, Saarbrücken, Germany, September 6‒8, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28049-8/pbk). Lecture Notes in Computer Science 7112, 132-144 (2012).
6
Polynomial kernelizations for MIN $F^{+}Π_{1}$ and MAX NP. (English)
Algorithmica 63, No. 1-2, 532-550 (2012).
7
Cross-composition: a new technique for kernelization lower bounds. (English)
Schwentick, Thomas (ed.) et al., STACS 2011. 28th international symposium on theoretical aspects of computer science, Dortmund, Germany, March 10‒12, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-25-5). LIPICS ‒ Leibniz International Proceedings in Informatics 9, 165-176, electronic only (2011).
8
Parameterized two-player Nash equilibrium. (English)
Kolman, Petr (ed.) et al., Graph-theoretic concepts in computer science. 37th international workshop, WG 2011, Teplá Monastery, Czech Republic, June 21‒24, 2011. Revised papers. Berlin: Springer (ISBN 978-3-642-25869-5/pbk). Lecture Notes in Computer Science 6986, 215-226 (2011).
9
Parameterized complexity of vertex deletion into perfect graph classes. (English)
Owe, Olaf (ed.) et al., Fundamentals of computation theory. 18th international symposium, FCT 2011, Oslo, Norway, August 22‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22952-7/pbk). Lecture Notes in Computer Science 6914, 240-251 (2011).
10
Data reduction for graph coloring problems. (English)
Owe, Olaf (ed.) et al., Fundamentals of computation theory. 18th international symposium, FCT 2011, Oslo, Norway, August 22‒25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22952-7/pbk). Lecture Notes in Computer Science 6914, 90-101 (2011).
11
Kernel bounds for path and cycle problems. (English)
Comput. Res. Repos. 2011, Article No. 1106.4141 (2011).
12
Data reduction for graph coloring problems. (English)
Comput. Res. Repos. 2011, Article No. 1104.4229 (2011).
13
Preprocessing for treewidth: A combinatorial analysis through kernelization. (English)
Comput. Res. Repos. 2011, Article No. 1104.4217 (2011).
14
Preprocessing for treewidth: a combinatorial analysis through kernelization. (English)
Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4‒8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 437-448 (2011).
15
Parameterized two-player Nash equilibrium (English)
WG, 215-226 (2011).
16
Preprocessing for treewidth: A combinatorial analysis through kernelization (English)
ICALP (1), 437-448 (2011).
17
Cross-composition: A new technique for kernelization lower bounds (English)
STACS, 165-176 (2011).
18
Data reduction for graph coloring problems (English)
FCT, 90-101 (2011).
19
Parameterized complexity of vertex deletion into perfect graph classes (English)
FCT, 240-251 (2011).
20
Result 1 to 20 of 38 total
Start
Contact
Print
General Help
