Search results for "pathwidth"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
21	Jens Gustedt	On the Pathwidth of Chordal Graphs.	Discret. Appl. Math.	1993	DBLP DOI BibTeX RDF
21	András Kornai, Zsolt Tuza	Narrowness, pathwidth, and their application in natural language processing.	Discret. Appl. Math.	1992	DBLP DOI BibTeX RDF
16	Michael R. Fellows, Jiong Guo, Iyad A. Kanj	The Parameterized Complexity of Some Minimum Label Problems.	WG	2009	DBLP DOI BibTeX RDF
16	Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A. Kanj, Frances A. Rosamond, Ondrej Suchý	What Makes Equitable Connected Partition Easy.	IWPEC	2009	DBLP DOI BibTeX RDF
16	Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood	On the Parameterized Complexity of Layered Graph Drawing.	Algorithmica	2008	DBLP DOI BibTeX RDF
16	Michael Lampis, Georgia Kaouri, Valia Mitsou	On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures.	ISAAC	2008	DBLP DOI BibTeX RDF	Digraph decompositions, Treewidth, Parameterized Complexity
16	Andrei A. Bulatov, Andrei A. Krokhin, Benoît Larose	Dualities for Constraint Satisfaction Problems.	Complexity of Constraints	2008	DBLP DOI BibTeX RDF
16	Md. Jawaherul Alam, Md. Abul Hassan Samee, Mashfiqui Rabbi, Md. Saidur Rahman 0001	Upward Drawings of Trees on the Minimum Number of Layers.	WALCOM	2008	DBLP DOI BibTeX RDF	Planar Drawing, k-layer Planar Drawing, Upward Drawing, Minimum Layer Upward Drawing, Algorithm, Trees, Line-labeling, Straight-line Drawing
16	Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin	On Problems without Polynomial Kernels (Extended Abstract).	ICALP (1)	2008	DBLP DOI BibTeX RDF
16	Robert Mateescu, Rina Dechter	AND/OR Multi-valued Decision Diagrams for Constraint Networks.	Concurrency, Graphs and Models	2008	DBLP DOI BibTeX RDF
16	Navin Kashyap	The "Art of Trellis Decoding" Is NP-Hard.	AAECC	2007	DBLP DOI BibTeX RDF
16	David Richerby, Dimitrios M. Thilikos	Graph Searching in a Crime Wave.	WG	2007	DBLP DOI BibTeX RDF
16	Pinar Heggernes, Karol Suchan, Ioan Todinca, Yngve Villanger	Characterizing Minimal Interval Completions.	STACS	2007	DBLP DOI BibTeX RDF
16	Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001	Improved Exact Algorithms for Counting 3- and 4-Colorings.	COCOON	2007	DBLP DOI BibTeX RDF
16	Noga Alon, Fedor V. Fomin, Gregory Z. Gutin, Michael Krivelevich, Saket Saurabh 0001	Better Algorithms and Bounds for Directed Maximum Leaf Problems.	FSTTCS	2007	DBLP DOI BibTeX RDF
16	Robert Mateescu, Rina Dechter	Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs).	CP	2006	DBLP DOI BibTeX RDF
16	Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle	Graph Searching, Elimination Trees, and a Generalization of Bandwidth.	Algorithmica	2005	DBLP DOI BibTeX RDF	Bandwidth, Chordal graph, Graph searching, Tree decomposition, Elimination tree
16	Joachim Kneis, Daniel Mölle, Stefan Richter 0001, Peter Rossmanith	Algorithms Based on the Treewidth of Sparse Graphs.	WG	2005	DBLP DOI BibTeX RDF
16	Jinbo Huang, Adnan Darwiche	Using DPLL for Efficient OBDD Construction.	SAT (Selected Papers	2004	DBLP DOI BibTeX RDF
16	Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos	Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms.	MFCS	2003	DBLP DOI BibTeX RDF
16	Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle	Graph Searching, Elimination Trees, and a Generalization of Bandwidth.	FCT	2003	DBLP DOI BibTeX RDF
16	Claudson F. Bornstein, Santosh S. Vempala	Flow Metrics.	LATIN	2002	DBLP DOI BibTeX RDF
16	Vida Dujmovic, Michael R. Fellows, Michael T. Hallett, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Matthew Suderman, Sue Whitesides, David R. Wood	On the Parameterized Complexity of Layered Graph Drawing.	ESA	2001	DBLP DOI BibTeX RDF
16	Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender	A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth.	ESA	2001	DBLP DOI BibTeX RDF
16	Fedor V. Fomin, Petr A. Golovach	Interval Completion with the Smallest Max-degree.	WG	1998	DBLP DOI BibTeX RDF
16	Hans L. Bodlaender, Babette de Fluiter	Intervalizing k-Colored Graphs.	ICALP	1995	DBLP DOI BibTeX RDF
16	Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos	Fugitive-Search Games on Graphs and Related Parameters.	WG	1994	DBLP DOI BibTeX RDF
16	Ton Kloks, Dieter Kratsch, Haiko Müller	Dominoes.	WG	1994	DBLP DOI BibTeX RDF
16	Ton Kloks, Hans L. Bodlaender, Haiko Müller, Dieter Kratsch	Computing Treewidth and Minimum Fill-In: All You Need are the Minimal Separators. (Erratum: ESA 1994: 508)	ESA	1993	DBLP DOI BibTeX RDF
16	Hans L. Bodlaender	Improved Self-Reduction Algorithms for Graphs with Bounded Treewidth.	WG	1989	DBLP DOI BibTeX RDF