Result 1 to 20 from 318 total
A note on exact algorithms for vertex ordering problems on graphs. (English)
Theory Comput. Syst. 50, No. 3, 420-432 (2012).
1
Parameterized complexity of the spanning tree congestion problem. (English)
Algorithmica 64, No. 1, 85-111 (2012).
2
Fixed-parameter tractability of treewidth and pathwidth. (English)
Bodlaender, Hans L. (ed.) et al., The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). Lecture Notes in Computer Science 7370, 196-227 (2012).
3
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).
4
The multivariate algorithmic revolution and beyond. Essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. (English)
Lecture Notes in Computer Science 7370. Berlin: Springer (ISBN 978-3-642-30890-1/pbk). xxx, 497~p. EUR~74.90 (2012).
5
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).
6
On switching classes, NLC-width, cliquewidth and treewidth. (English)
Theor. Comput. Sci. 429, 30-35 (2012).
7
Exact algorithms for dominating set. (English)
Discrete Appl. Math. 159, No. 17, 2147-2164 (2011).
8
Vertex cover kernelization revisited: upper and lower bounds for a refined parameter. (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, 177-188, electronic only (2011).
9
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).
10
Exact algorithms for kayles. (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, 59-70 (2011).
11
Faster parameterized algorithms for {\sc Minimum Fill-in}. (English)
Algorithmica 61, No. 4, 817-838 (2011).
12
Quadratic kernelization for convex recoloring of trees. (English)
Algorithmica 61, No. 2, 362-388 (2011).
13
Kernel bounds for disjoint cycles and disjoint paths. (English)
Theor. Comput. Sci. 412, No. 35, 4570-4578 (2011).
14
Kernel bounds for path and cycle problems. (English)
Comput. Res. Repos. 2011, Article No. 1106.4141 (2011).
15
Treewidth computations. II. Lower bounds. (English)
Inf. Comput. 209, No. 7, 1103-1119 (2011).
16
Preprocessing for treewidth: A combinatorial analysis through kernelization. (English)
Comput. Res. Repos. 2011, Article No. 1104.4217 (2011).
17
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).
18
On stopping evidence gathering for diagnostic Bayesian networks. (English)
Liu, Weiru (ed.), Symbolic and quantitative approaches to reasoning with uncertainty. 11th European conference, ECSQARU 2011, Belfast, UK, June 29 ‒ July 1, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22151-4/pbk). Lecture Notes in Computer Science 6717. Lecture Notes in Artificial Intelligence, 170-181 (2011).
19
Spanning tree congestion of $k$-outerplanar graphs. (English)
Discrete Math. 311, No. 12, 1040-1045 (2011).
20
Result 1 to 20 from 318 total
Start
Contact
Print
General Help
