WG 2003 : graph-theoretic concepts in computer science (Elspeet, 19-21 June 2003, revised papers)Bodlaender, Hans L.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-20452-0, XI, 386 p, isbn 3-540-20452-0Conference Proceedings

Algorithms for graphs embeddable with few crossings per edgeGRIGORIEV, Alexander; BODLAENDER, Hans L.Algorithmica. 2007, Vol 49, Num 1, pp 1-11, issn 0178-4617, 11 p.Article

Kayles and nimbersBODLAENDER, Hans L; KRATSCH, Dieter.Journal of algorithms (Print). 2002, Vol 43, Num 1, pp 106-119, issn 0196-6774Article

Matching, edge-colouring, dimersSCHRIJVER, Alexander.Lecture notes in computer science. 2003, pp 13-22, issn 0302-9743, isbn 3-540-20452-0, 10 p.Conference Paper

Short cycles in planar graphsKOWALIK, Łukasz.Lecture notes in computer science. 2003, pp 284-296, issn 0302-9743, isbn 3-540-20452-0, 13 p.Conference Paper

The complexity of the Matching-Cut problem for planar graphs and other graph classesBONSMA, Paul.Lecture notes in computer science. 2003, pp 93-105, issn 0302-9743, isbn 3-540-20452-0, 13 p.Conference Paper

Complexity of hypergraph coloring and Seidel's switchingKRATOCHVIL, Jan.Lecture notes in computer science. 2003, pp 297-308, issn 0302-9743, isbn 3-540-20452-0, 12 p.Conference Paper

Coloring powers of graphs of bounded clique-widthTODINCA, Ioan.Lecture notes in computer science. 2003, pp 370-382, issn 0302-9743, isbn 3-540-20452-0, 13 p.Conference Paper

Treewidth computations I. Upper boundsBODLAENDER, Hans L; KOSTER, Arie M. C. A.Information and computation (Print). 2010, Vol 208, Num 3, pp 259-275, issn 0890-5401, 17 p.Article

Reduction algorithms for graphs of small treewidthBODLAENDER, Hans L; VAN ANTWERPEN-DE FLUITER, Babette.Information and computation (Print). 2001, Vol 167, Num 2, pp 86-119, issn 0890-5401Article

Exact Algorithms for Edge DominationROOIJ, Johan M. M. Van; BODLAENDER, Hans L.Algorithmica. 2012, Vol 64, Num 4, pp 535-563, issn 0178-4617, 29 p.Article

Approximation of pathwidth of outerplanar graphsBODLAENDER, Hans L; FOMIN, Fedor V.Journal of algorithms (Print). 2002, Vol 43, Num 2, pp 190-200, issn 0196-6774Article

Exact algorithms for dominating setVAN ROOIJ, Johan M. M; BODLAENDER, Hans L.Discrete applied mathematics. 2011, Vol 159, Num 17, pp 2147-2164, issn 0166-218X, 18 p.Article

Kernel bounds for disjoint cycles and disjoint pathsBODLAENDER, Hans L; THOMASSE, Stéphan; YEO, Anders et al.Theoretical computer science. 2011, Vol 412, Num 35, pp 4570-4578, issn 0304-3975, 9 p.Article

Faster Parameterized Algorithms for MINIMUM FILL-INBODLAENDER, Hans L; HEGGERNES, Pinar; VILLANGER, Yngve et al.Algorithmica. 2011, Vol 61, Num 4, pp 817-838, issn 0178-4617, 22 p.Conference Paper

Treewidth : Characterizations, applications, and computationsBODLAENDER, Hans L.Lecture notes in computer science. 2006, pp 1-14, issn 0302-9743, isbn 3-540-48381-0, 14 p.Conference Paper

Cutwidth I : A linear time fixed parameter algorithmTHILIKOS, Dimitrios M; SEMA, Maria; BODLAENDER, Hans L et al.Journal of algorithms (Print). 2005, Vol 56, Num 1, pp 1-24, issn 0196-6774, 24 p.Article

Completely connected clustered graphsCORNELSEN, Sabine; WAGNER, Dorothea.Lecture notes in computer science. 2003, pp 168-179, issn 0302-9743, isbn 3-540-20452-0, 12 p.Conference Paper

Chordal probe graphsGOLUMBIC, Martin Charles; LIPSHTEYN, Marina.Lecture notes in computer science. 2003, pp 249-260, issn 0302-9743, isbn 3-540-20452-0, 12 p.Conference Paper

Recognizing bipolarizable and P₄-Simplicial graphsNIKOLOPOULOS, Stavros D; PALIOS, Leonidas.Lecture notes in computer science. 2003, pp 358-369, issn 0302-9743, isbn 3-540-20452-0, 12 p.Conference Paper

Tree-partitions of k-trees with applications in graph layoutDUJMOVIC, Vida; WOOD, David R.Lecture notes in computer science. 2003, pp 205-217, issn 0302-9743, isbn 3-540-20452-0, 13 p.Conference Paper

Randomized approximations of parameterized counting problemsMÜLLER, Moritz.Lecture notes in computer science. 2006, pp 50-59, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 10 p.Conference Paper

Edge dominating set : Efficient enumeration-based exact algorithmsFERNAU, Henning.Lecture notes in computer science. 2006, pp 142-153, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Blow-ups, win/win's, and crown rules: Some new directions in FPTFELLOWS, Michael R.Lecture notes in computer science. 2003, pp 1-12, issn 0302-9743, isbn 3-540-20452-0, 12 p.Conference Paper

Treewidth Lower Bounds with BramblesBODLAENDER, Hans L; GRIGORIEV, Alexander; KOSTER, Arie M. C. A et al.Algorithmica. 2008, Vol 51, Num 1, pp 81-98, issn 0178-4617, 18 p.Article