Search results for "tree-width"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
16	Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas 0001, Paul Wollan	K_6 minors in 6-connected graphs of bounded tree-width	CoRR	2012	DBLP BibTeX RDF
16	Giovanna D'Agostino, Giacomo Lenzi	On Modal μ-Calculus over Finite Graphs with Small Components or Small Tree Width.	Int. J. Found. Comput. Sci.	2012	DBLP DOI BibTeX RDF
16	Reinhard Diestel, Ken-ichi Kawarabayashi, Theodor Müller, Paul Wollan	On the excluded minor structure theorem for graphs of large tree-width.	J. Comb. Theory, Ser. B	2012	DBLP DOI BibTeX RDF
16	Frédéric Mazoit	Tree-width of hypergraphs and surface duality.	J. Comb. Theory, Ser. B	2012	DBLP DOI BibTeX RDF
16	Tommy Färnqvist	Constraint Optimization Problems and Bounded Tree-Width Revisited.	CPAIOR	2012	DBLP DOI BibTeX RDF
16	Martin Fürer	Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width.	LATIN	2012	DBLP DOI BibTeX RDF
16	Salvatore La Torre, Gennaro Parlato	Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width.	FSTTCS	2012	DBLP DOI BibTeX RDF
16	Takuya Akiba, Christian Sommer 0001, Ken-ichi Kawarabayashi	Shortest-path queries for complex networks: exploiting low tree-width outside the core.	EDBT	2012	DBLP DOI BibTeX RDF
16	Alexander Grigoriev	Tree-width and large grid minors in planar graphs.	Discret. Math. Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
16	Magnus Bordewich, Ross J. Kang	Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width	CoRR	2011	DBLP BibTeX RDF
16	P. Madhusudan, Gennaro Parlato	The tree width of auxiliary storage.	POPL	2011	DBLP DOI BibTeX RDF
16	Magnus Bordewich, Ross J. Kang	Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width.	ICALP (1)	2011	DBLP DOI BibTeX RDF
16	John Fearnley, Oded Lachish	Parity Games on Graphs with Medium Tree-Width.	MFCS	2011	DBLP DOI BibTeX RDF
16	Klaus Meer	An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents.	CSR	2011	DBLP DOI BibTeX RDF
16	Klaus Meer	Tree-width in Algebraic Complexity.	Fundam. Informaticae	2010	DBLP DOI BibTeX RDF
16	Tamás Horváth 0001, Jan Ramon	Efficient frequent connected subgraph mining in graphs of bounded tree-width.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
16	Isolde Adler, Philipp Klaus Krause	A lower bound for the tree-width of planar graphs with vital linkages	CoRR	2010	DBLP BibTeX RDF
16	Frédéric Mazoit	Tree-width of hypergraphs and surface duality	CoRR	2010	DBLP BibTeX RDF
16	Mathieu Chapelle	Parameterized Complexity of Generalized Domination Problems on Bounded Tree-Width Graphs	CoRR	2010	DBLP BibTeX RDF
16	Alexandr V. Kostochka, Daniel Král', Jean-Sébastien Sereni, Michael Stiebitz	Graphs with bounded tree-width and large odd-girth are almost bipartite.	J. Comb. Theory, Ser. B	2010	DBLP DOI BibTeX RDF
16	Tamás Horváth 0001, Jan Ramon	Efficient frequent connected subgraph mining in graphs of bounded tree-width.	LWA	2010	DBLP BibTeX RDF
16	Martin Fürer	Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width.	LATIN	2010	DBLP DOI BibTeX RDF
16	Bruno Courcelle	Special tree-width and the verification of monadic second-order graph pr operties.	FSTTCS	2010	DBLP DOI BibTeX RDF
16	Alexander Grigoriev, Bert Marchal, Natalya Usotskaya	On planar graphs with large tree-width and small grid minors.	Electron. Notes Discret. Math.	2009	DBLP DOI BibTeX RDF
16	Youssou Dieng, Cyril Gavoille	On the Tree-Width of Planar Graphs.	Electron. Notes Discret. Math.	2009	DBLP DOI BibTeX RDF
16	Frédéric Mazoit	Tree-width of graphs and surface duality.	Electron. Notes Discret. Math.	2009	DBLP DOI BibTeX RDF
16	Steven D. Noble	Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width.	Electron. J. Comb.	2009	DBLP DOI BibTeX RDF
16	Petr Hlinený, Geoff Whittle	Addendum to matroid tree-width.	Eur. J. Comb.	2009	DBLP DOI BibTeX RDF
16	Cristina G. Fernandes, Orlando Lee, Yoshiko Wakabayashi	Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width.	Discret. Appl. Math.	2009	DBLP DOI BibTeX RDF
16	Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed	Tree-width of graphs without a 3×3 grid minor.	Discret. Appl. Math.	2009	DBLP DOI BibTeX RDF
16	Martin Grohe, Dániel Marx	On tree width, bramble size, and expansion.	J. Comb. Theory, Ser. B	2009	DBLP DOI BibTeX RDF
16	Matthew Kitching, Fahiem Bacchus	Exploiting Decomposition on Constraint Problems with High Tree-Width.	IJCAI	2009	DBLP BibTeX RDF
16	Frédéric Mazoit	Tree-width of hypergraphs and surface duality	CoRR	2008	DBLP BibTeX RDF
16	Cédric Bentz	On the complexity of the multicut problem in bounded tree-width graphs and digraphs.	Discret. Appl. Math.	2008	DBLP DOI BibTeX RDF
16	André Kündgen, Michael J. Pelsmajer	Nonrepetitive colorings of graphs of bounded tree-width.	Discret. Math.	2008	DBLP DOI BibTeX RDF
16	Isolde Adler	Directed tree-width examples.	J. Comb. Theory, Ser. B	2007	DBLP DOI BibTeX RDF
16	Petr Hlinený, Geoff Whittle	Matroid tree-width.	Eur. J. Comb.	2006	DBLP DOI BibTeX RDF
16	Takehiro Ito, Xiao Zhou 0001, Takao Nishizeki	Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size.	J. Discrete Algorithms	2006	DBLP DOI BibTeX RDF
16	Johann A. Makowsky	Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width.	Discret. Appl. Math.	2005	DBLP DOI BibTeX RDF
16	Vida Dujmovic, Pat Morin, David R. Wood	Layout of Graphs with Bounded Tree-Width.	SIAM J. Comput.	2005	DBLP DOI BibTeX RDF
16	Vida Dujmovic, Pat Morin, David R. Wood	Layout of Graphs with Bounded Tree-Width	CoRR	2004	DBLP BibTeX RDF
16	Daniel Bienstock, Nuri Özbay	Tree-width and the Sherali-Adams operator.	Discret. Optim.	2004	DBLP DOI BibTeX RDF
16	Yuan Hong	Tree-width, clique-minors, and eigenvalues.	Discret. Math.	2004	DBLP DOI BibTeX RDF
16	Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan	Excluding any graph as a minor allows a low tree-width 2-coloring.	J. Comb. Theory, Ser. B	2004	DBLP DOI BibTeX RDF
16	Mukund Narasimhan, Jeff A. Bilmes	PAC-learning Bounded Tree-width Graphical Models.	UAI	2004	DBLP BibTeX RDF
16	Johann A. Makowsky, Julian Mariño	Farrell polynomials on graphs of bounded tree width.	Adv. Appl. Math.	2003	DBLP DOI BibTeX RDF
16	Brian Lucena	A New Lower Bound for Tree-Width Using Maximum Cardinality Search.	SIAM J. Discret. Math.	2003	DBLP DOI BibTeX RDF
16	Nathan Srebro	Maximum likelihood bounded tree-width Markov networks.	Artif. Intell.	2003	DBLP DOI BibTeX RDF
16	Johann A. Makowsky, Julian Mariño	Tree-width and the monadic quantifier hierarchy.	Theor. Comput. Sci.	2003	DBLP DOI BibTeX RDF
16	Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed	Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width.	J. Algorithms	2003	DBLP DOI BibTeX RDF
16	Etienne Birmelé	Tree-width and circumference of graphs.	J. Graph Theory	2003	DBLP DOI BibTeX RDF
16	Thomas Böhme 0001, John Maharry, Bojan Mohar	Ka, k Minors in Graphs of Bounded Tree-Width.	J. Comb. Theory, Ser. B	2002	DBLP DOI BibTeX RDF
16	Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano, Masato Takeichi	Algebraic construction of graphs with bounded tree width and its applications - Catamorphic Approach to Program Analyses.	APLAS	2002	DBLP BibTeX RDF
16	Gruia Calinescu, Cristina G. Fernandes	Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width.	Electron. Notes Discret. Math.	2001	DBLP DOI BibTeX RDF
16	Andrei Kotlov	Tree width and regular triangulations.	Discret. Math.	2001	DBLP DOI BibTeX RDF
16	Thor Johnson, Neil Robertson 0001, Paul D. Seymour, Robin Thomas 0001	Directed Tree-Width.	J. Comb. Theory, Ser. B	2001	DBLP DOI BibTeX RDF
16	David R. Karger, Nathan Srebro	Learning Markov networks: maximum bounded tree-width graphs.	SODA	2001	DBLP BibTeX RDF
16	Nathan Srebro	Maximum Likelihood Bounded Tree-Width Markov Networks.	UAI	2001	DBLP BibTeX RDF
16	Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk L. Vertigan	Surfaces, Tree-Width, Clique-Minors, and Partitions.	J. Comb. Theory, Ser. B	2000	DBLP DOI BibTeX RDF
16	Bruce A. Reed	Introducing Directed Tree Width.	Electron. Notes Discret. Math.	1999	DBLP DOI BibTeX RDF
16	Steven D. Noble	Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width.	Comb. Probab. Comput.	1998	DBLP BibTeX RDF
16	Mikkel Thorup	All Structured Programs have Small Tree-Width and Good Register Allocation.	Inf. Comput.	1998	DBLP DOI BibTeX RDF
16	Yves Colin de Verdière	Multiplicities of Eigenvalues and Tree-Width of Graphs.	J. Comb. Theory, Ser. B	1998	DBLP DOI BibTeX RDF
16	David Fernández-Baca, Giora Slutzki	Optimal Parametric Search on Graphs of Bounded Tree-Width.	J. Algorithms	1997	DBLP DOI BibTeX RDF
16	Bruno Courcelle, Jens Lagergren	Equivalent Definitions of Recognizability for Sets of Graphs of Bounded Tree-Width.	Math. Struct. Comput. Sci.	1996	DBLP DOI BibTeX RDF
16	Daniel P. Sanders	On Linear Recognition of Tree-Width at Most Four.	SIAM J. Discret. Math.	1996	DBLP DOI BibTeX RDF
16	Jens Lagergren	Efficient Parallel Algorithms for Graphs of Bounded Tree-Width.	J. Algorithms	1996	DBLP DOI BibTeX RDF
16	Egon Wanke	Bounded Tree-Width and LOGCFL.	J. Algorithms	1994	DBLP DOI BibTeX RDF
16	David Fernández-Baca, Giora Slutzki	Parametric Problems on Graphs of Bounded Tree-Width.	J. Algorithms	1994	DBLP DOI BibTeX RDF
16	Ephraim Korach, Nir Solel	Tree-Width, Path-Widt, and Cutwidth.	Discret. Appl. Math.	1993	DBLP DOI BibTeX RDF
16	Paul D. Seymour, Robin Thomas 0001	Graph Searching and a Min-Max Theorem for Tree-Width.	J. Comb. Theory, Ser. B	1993	DBLP DOI BibTeX RDF
16	Bruno Courcelle, Jens Lagergren	Recognizable Sets of Graphs of Bounded Tree-Width.	Dagstuhl Seminar on Graph Transformations in Computer Science	1993	DBLP DOI BibTeX RDF
16	Robert F. Cohen, Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter	Dynamic algorithms for optimization problems in bounded tree-width graphs.	IPCO	1993	DBLP BibTeX RDF
16	Bruce A. Reed	Finding Approximate Separators and Computing Tree Width Quickly	STOC	1992	DBLP DOI BibTeX RDF
16	Igor Kríz, Robin Thomas 0001	The menger-like property of the tree-width of infinite graphs.	J. Comb. Theory, Ser. B	1991	DBLP DOI BibTeX RDF
16	Robin Thomas 0001	A menger-like property of tree-width: The finite case.	J. Comb. Theory, Ser. B	1990	DBLP DOI BibTeX RDF
16	Neil Robertson 0001, Paul D. Seymour	Graph minors. IV. Tree-width and well-quasi-ordering.	J. Comb. Theory, Ser. B	1990	DBLP DOI BibTeX RDF
16	Neil Robertson 0001, Paul D. Seymour	Graph Minors. II. Algorithmic Aspects of Tree-Width.	J. Algorithms	1986	DBLP DOI BibTeX RDF
16	Neil Robertson 0001, Paul D. Seymour	Graph minors. III. Planar tree-width.	J. Comb. Theory, Ser. B	1984	DBLP DOI BibTeX RDF
16	Zdenek Dvorák 0001, Daniel Král	Algorithms for Classes of Graphs with Bounded Expansion.	WG	2009	DBLP DOI BibTeX RDF
16	Noga Alon, Shai Gutner	Balanced Hashing, Color Coding and Approximate Counting.	IWPEC	2009	DBLP DOI BibTeX RDF	Approximate counting of subgraphs, derandomization, expanders, perfect hashing, color-coding, k-wise independence
16	Anuj Dawar, Martin Grohe, Stephan Kreutzer	Locally Excluding a Minor.	LICS	2007	DBLP DOI BibTeX RDF
16	Anuj Dawar, David Richerby	The Power of Counting Logics on Restricted Classes of Finite Structures.	CSL	2007	DBLP DOI BibTeX RDF
16	Yinglei Song, Chunmei Liu, Xiuzhen Huang, Russell L. Malmberg, Ying Xu, Liming Cai	Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment.	IEEE ACM Trans. Comput. Biol. Bioinform.	2006	DBLP DOI BibTeX RDF	Structure-sequence alignment, RNA structure homology search, dynamic programming, tree decomposition, parameterized algorithm, protein threading
16	Yinglei Song, Chunmei Liu, Xiuzhen Huang, Russell L. Malmberg, Ying Xu, Liming Cai	Efficient Parameterized Algorithm for Biopolymer Structure-Sequence Alignment.	WABI	2005	DBLP DOI BibTeX RDF
16	Martin Grohe, Thomas Schwentick, Luc Segoufin	When is the evaluation of conjunctive queries tractable?	STOC	2001	DBLP DOI BibTeX RDF
16	Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis	All-Pairs Min-Cut in Sparse Networks.	FSTTCS	1995	DBLP DOI BibTeX RDF
15	Jinbo Xu	Rapid Protein Side-Chain Packing via Tree Decomposition.	RECOMB	2005	DBLP DOI BibTeX RDF
15	Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fangfang Pan, Liming Cai	Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes.	CSB	2005	DBLP DOI BibTeX RDF	RNA secondary structure profiling, Pseudo-knot search, Covariance model, Tree decomposition
15	Radu Marinescu 0002, Rina Dechter	AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems.	CP	2005	DBLP DOI BibTeX RDF
15	Jens Gustedt, Ole A. Mæhle, Jan Arne Telle	The Treewidth of Java Programs.	ALENEX	2002	DBLP DOI BibTeX RDF
15	Markus Frick, Martin Grohe	Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs.	ICALP	1999	DBLP DOI BibTeX RDF
13	Ilya Averbouch, Johann A. Makowsky, Peter Tittmann 0001	A Graph Polynomial Arising from Community Structure (Extended Abstract).	WG	2009	DBLP DOI BibTeX RDF
13	Isolde Adler, Martin Grohe, Stephan Kreutzer	Computing excluded minors.	SODA	2008	DBLP BibTeX RDF
13	Bruno Courcelle	Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects.	ICALP (1)	2008	DBLP DOI BibTeX RDF
12	Cyril Terrioux, Philippe Jégou	Bounded Backtracking for the Valued Constraint Satisfaction Problems.	CP	2003	DBLP DOI BibTeX RDF
12	Takehiro Ito, Takao Nishizeki, Xiao Zhou 0001	Algorithms for the Multicolorings of Partial k-Trees.	COCOON	2002	DBLP DOI BibTeX RDF
12	Erich Grädel	Invited Talk: Decision procedures for guarded logics.	CADE	1999	DBLP DOI BibTeX RDF
10	Omid Amini, Ignasi Sau, Saket Saurabh 0001	Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem.	IWPEC	2008	DBLP DOI BibTeX RDF
10	Shuji Isobe, Xiao Zhou 0001, Takao Nishizeki	Total Colorings Of Degenerate Graphs.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C15, 05C85, 90C39