Nonrepetitive colorings of graphs of bounded tree-widthKÜNDGEN, André; PELSMAJER, Michael J.Discrete mathematics. 2008, Vol 308, Num 19, pp 4473-4478, issn 0012-365X, 6 p.Conference Paper

Tree-width of graphs without a 3 x 3 grid minorBIRMELE, E; BONDY, J. A; REED, B. A et al.Discrete applied mathematics. 2009, Vol 157, Num 12, pp 2577-2596, issn 0166-218X, 20 p.Conference Paper

The treewidth of Java ProgramsGUSTEDT, Jens; MAEHLE, Ole A; TELLE, Jan Arne et al.Lecture notes in computer science. 2002, pp 86-97, issn 0302-9743, isbn 3-540-43977-3, 12 p.Conference Paper

Dominating sets and local treewidthFOMIN, Fedor V; THILIKOS, Dimtirios M.Lecture notes in computer science. 2003, pp 221-229, issn 0302-9743, isbn 3-540-20064-9, 9 p.Conference Paper

Recent developments on graphs of bounded clique-widthKAMIRISKI, Marcin; LOZIN, Vadim V; MILANIC, Martin et al.Discrete applied mathematics. 2009, Vol 157, Num 12, pp 2747-2761, issn 0166-218X, 15 p.Conference Paper

Dominating sets in planar graphs : Branch-width and exponential speed-upFOMIN, Fedor V; THILIKOS, Dimitrios M.SIAM journal on computing (Print). 2007, Vol 36, Num 2, pp 281-309, issn 0097-5397, 29 p.Article

Line graphs of bounded clique-widthGURSKI, Frank; WANKE, Egon.Discrete mathematics. 2007, Vol 307, Num 22, pp 2734-2754, issn 0012-365X, 21 p.Article

Graph minors and reliable single message transmissionFICH, Faith Ellen; KÜNDGEN, André; PELSMAJER, Michael J et al.SIAM journal on discrete mathematics (Print). 2006, Vol 19, Num 4, pp 815-847, issn 0895-4801, 33 p.Article

On the OBDD size for graphs of bounded tree-and clique-widthMEER, Klaus; RAUTENBACH, Dieter.Discrete mathematics. 2009, Vol 309, Num 4, pp 843-851, issn 0012-365X, 9 p.Article

Vertex-minor reductions can simulate edge contractionsMAMADOU MOUSTAPHA KANTE.Discrete applied mathematics. 2007, Vol 155, Num 17, pp 2328-2340, issn 0166-218X, 13 p.Article

Graph minor hierarchiesDIESTEL, Reinhard; KÜHN, Daniela.Discrete applied mathematics. 2005, Vol 145, Num 2, pp 167-182, issn 0166-218X, 16 p.Article

Upper bounds on the bisection width of 3- and 4-regular graphsMONIEN, Burkhard; PREIS, Robert.Lecture notes in computer science. 2001, pp 524-536, issn 0302-9743, isbn 3-540-42496-2Conference Paper

The treewidth and pathwidth of hypercubesCHANDRAN, L. Sunil; KAVITHA, T.Discrete mathematics. 2006, Vol 306, Num 3, pp 359-365, issn 0012-365X, 7 p.Article

Layout of graphs with bounded tree-widthDUJMOVIC, Vida; MORIN, Pat; WOOD, David R et al.SIAM journal on computing (Print). 2005, Vol 34, Num 3, pp 553-579, issn 0097-5397, 27 p.Article

INTRACTABILITY OF CLIQUE-WIDTH PARAMETERIZATIONSFOMIN, Fedor V; GOLOVACH, Petr A; LOKSHTANOV, Daniel et al.SIAM journal on computing (Print). 2010, Vol 39, Num 5, pp 1941-1956, issn 0097-5397, 16 p.Article

TREE-RELATED WIDTHS OF GRAPHS AND HYPERGRAPHSADLER, Isolde.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 1, pp 102-123, issn 0895-4801, 22 p.Article

Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-widthFERNANDES, Cristina G; LEE, Orlando; WAKABAYASHI, Yoshiko et al.Discrete applied mathematics. 2009, Vol 157, Num 2, pp 272-279, issn 0166-218X, 8 p.Article

Vertex disjoint paths on clique-width bounded graphsGURSKI, Frank; WANKE, Egon.Theoretical computer science. 2006, Vol 359, Num 1-3, pp 188-199, issn 0304-3975, 12 p.Article

On the band-, tree-, and clique-width of graphs with bounded vertex degreeLOZIN, V; RAUTENBACH, D.SIAM journal on discrete mathematics (Print). 2005, Vol 18, Num 1, pp 195-206, issn 0895-4801, 12 p.Article

On the complexity of the multicut problem in bounded tree-width graphs and digraphsBENTZ, Cédric.Discrete applied mathematics. 2008, Vol 156, Num 10, pp 1908-1917, issn 0166-218X, 10 p.Article

Efficient frequent connected subgraph mining in graphs of bounded tree-widthHORVATH, Tamás; RAMON, Jan.Theoretical computer science. 2010, Vol 411, Num 31-33, pp 2784-2797, issn 0304-3975, 14 p.Article

Disjoint paths in sparse graphsBENTZ, Cédric.Discrete applied mathematics. 2009, Vol 157, Num 17, pp 3558-3568, issn 0166-218X, 11 p.Conference Paper

On complexity of Minimum Leaf Out-Branching problemDANKELMANN, Peter; GUTIN, Gregory; EUN JUNG KIM et al.Discrete applied mathematics. 2009, Vol 157, Num 13, pp 3000-3004, issn 0166-218X, 5 p.Article

Efficient Computation of the Characteristic Polynomial of a Tree and Related TasksFÜRER, Martin.Algorithmica. 2014, Vol 68, Num 3, pp 626-642, issn 0178-4617, 17 p.Article

Bounded tree-width and LOGCFLWANKE, E.Journal of algorithms (Print). 1994, Vol 16, Num 3, pp 470-491, issn 0196-6774Article