Safe reduction rules for weighted treewidthVAN DEN EIJKHOF, Frank; BODLAENDER, Hans L; KOSTER, Arie M. C. A et al.Algorithmica. 2007, Vol 47, Num 2, pp 139-158, issn 0178-4617, 20 p.Article

Computing the treewidth and the minimum fill-in with the modular decompositionBODLAENDER, Hans L; ROTICS, Udi.Algorithmica. 2003, Vol 36, Num 4, pp 375-408, issn 0178-4617, 34 p.Article

Diameter and treewidth in minor-closed graph families, revisitedDEMAINE, Erik D; MOHAMMAD TAGHI HAJIAGHAYI.Algorithmica. 2004, Vol 40, Num 3, pp 211-215, issn 0178-4617, 5 p.Article

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

New upper bound heuristics for treewidthBACHOORE, Emgad H; BODLAENDER, Hans L.Lecture notes in computer science. 2005, pp 216-227, issn 0302-9743, isbn 3-540-25920-1, 12 p.Conference Paper

Preservation under extensions on well-behaved finite structuresATSERIAS, Albert; DAWAR, Anuj; GROHE, Martin et al.Lecture notes in computer science. 2005, pp 1437-1449, issn 0302-9743, isbn 3-540-27580-0, 13 p.Conference Paper

Treewidth lower bounds with bramblesBODLAENDER, Hans L; GRIGORIEV, Alexander; KOSTER, Arie M. C. A et al.Lecture notes in computer science. 2005, pp 391-402, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

ROMAN DOMINATION : A parameterized perspectiveFERNAU, Henning.Lecture notes in computer science. 2006, pp 262-271, issn 0302-9743, isbn 3-540-31198-X, 1Vol, 10 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

Solving Problems on Recursively Constructed GraphsBORIE, Richard B; PARKER, R. Gary; TOVEY, Craig A et al.ACM computing surveys. 2009, Vol 41, Num 1, issn 0360-0300, D1-D51Article

A Note on Multiflows and TreewidthCHEKURI, Chandra; SANJEEV KHANNA; SHEPHERD, F. Bruce et al.Algorithmica. 2009, Vol 54, Num 3, pp 400-412, issn 0178-4617, 13 p.Article

Nondeterministic Graph Searching : From Pathwidth to TreewidthFOMIN, Fedor V; FRAIGNIAUD, Pierre; NISSE, Nicolas et al.Algorithmica. 2009, Vol 53, Num 3, pp 358-373, issn 0178-4617, 16 p.Article

Bidimensional parameters and local treewidthDEMAINE, Erik D; FOMIN, Fedor V; HAJIAGHAYI, Mohammadtaghi et al.SIAM journal on discrete mathematics (Print). 2005, Vol 18, Num 3, pp 501-511, issn 0895-4801, 11 p.Article

On finding short resolution refutations and small unsatisfiable subsetsFELLOWS, Michael R; SZEIDER, Stefan; WRIGHTSON, Graham et al.Lecture notes in computer science. 2004, pp 223-234, issn 0302-9743, isbn 3-540-23071-8, 12 p.Conference Paper

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

Small k-dominating sets in planar graphs with applicationsGAVOILLE, Cyril; PELEG, David; RASPAUD, André et al.Lecture notes in computer science. 2001, pp 201-216, issn 0302-9743, isbn 3-540-42707-4Conference Paper

Treewidth of chordal bipartite graphsKLOKS, T; KRATSCH, D.Journal of algorithms (Print). 1995, Vol 19, Num 2, pp 266-281, issn 0196-6774Article

Header-size lower bounds for end-to-end communication in memoryless networks : Algorithms for distributed systemsFRAIGNIAUD, Pierre; GAVOILLE, Cyril.Computer networks (1999). 2006, Vol 50, Num 10, pp 1630-1638, issn 1389-1286, 9 p.Article

On the OBDD size for graphs of bounded tree-and clique-widthMEER, Klaus; RAUTENBACH, Dieter.Lecture notes in computer science. 2006, pp 72-83, issn 0302-9743, isbn 3-540-39098-7, 1Vol, 12 p.Conference Paper

Equitable colorings of bounded treewidth graphsBODLAENDER, Hans L; FOMIN, Fedor V.Lecture notes in computer science. 2004, pp 180-190, issn 0302-9743, isbn 3-540-22823-3, 11 p.Conference Paper

Minimizing NLC-width is NP-completeGURSKI, Frank; WANKE, Egon.Lecture notes in computer science. 2005, pp 69-80, issn 0302-9743, isbn 3-540-31000-2, 1Vol, 12 p.Conference 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

Clique-width for four-vertex forbidden subgraphsBRANDSTÄDT, Andreas; ENGELFRIET, Joost; LE, Hoang-Oanh et al.Lecture notes in computer science. 2005, pp 185-196, issn 0302-9743, isbn 3-540-28193-2, 12 p.Conference Paper

Exact (exponential) algorithms for treewidth and minimum fill-inFOMIN, Fedor V; KRATSCH, Dieter; TODINCA, Ioan et al.Lecture notes in computer science. 2004, pp 568-580, issn 0302-9743, isbn 3-540-22849-7, 13 p.Conference Paper

Consequence-based and fixed-parameter tractable reasoning in description logicsSIMANCIK, František; MOTIK, Boris; HORROCKS, Ian et al.Artificial intelligence (General ed.). 2014, Vol 209, pp 29-77, issn 0004-3702, 49 p.Article