Result 1 to 20 of 122 total
Cops and robber game without recharging. (English)
Theory Comput. Syst. 50, No. 4, 611-620 (2012).
1
Kernelization ‒ preprocessing with a guarantee. (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, 129-161 (2012).
2
Local search: is brute-force avoidable? (English)
J. Comput. Syst. Sci. 78, No. 3, 707-719 (2012).
3
Faster algorithms for finding and counting subgraphs. (English)
J. Comput. Syst. Sci. 78, No. 3, 698-706 (2012).
4
On cutwidth parameterized by vertex cover. (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, 246-258 (2012).
5
On the hardness of losing width. (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, 159-168 (2012).
6
Contracting graphs to paths and trees. (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, 55-66 (2012).
7
Sharp separation and applications to exact and parameterized algorithms. (English)
Algorithmica 63, No. 3, 692-706 (2012).
8
On the directed full degree spanning tree problem. (English)
Discrete Optim. 8, No. 1, 97-109 (2011).
9
Treewidth governs the complexity of target set selection. (English)
Discrete Optim. 8, No. 1, 87-96 (2011).
10
Obtaining a bipartite graph by contracting few edges. (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, 217-228, electronic only (2011).
11
Cutwidth of split graphs and threshold graphs. (English)
SIAM J. Discrete Math. 25, No. 3, 1418-1437 (2011).
12
Hitting forbidden minors: approximation and kernelization. (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, 189-200, electronic only (2011).
13
Planar $k$-path in subexponential time and polynomial space. (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, 262-270 (2011).
14
Bandwidth on AT-free graphs. (English)
Theor. Comput. Sci. 412, No. 50, 7001-7008 (2011).
15
Guard games on graphs: keep the intruder out! (English)
Theor. Comput. Sci. 412, No. 46, 6484-6497 (2011).
16
On the complexity of reconstructing $H$-free graphs from their star systems. (English)
J. Graph Theory 68, No. 2, 113-124 (2011).
17
Kernelization: An overview. (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, 39-40 (2011).
18
Feedback vertex set in mixed graphs. (English)
Dehne, Frank (ed.) et al., Algorithms and data structures. 12th international symposium, WADS 2011, New York, NY, USA, August 15‒17, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22299-3/pbk). Lecture Notes in Computer Science 6844, 122-133 (2011).
19
Contracting graphs to paths and trees. (English)
Comput. Res. Repos. 2011, Article No. 1104.3677 (2011).
20
Result 1 to 20 of 122 total
Start
Contact
Print
General Help
