Search results for "tree-decompositions"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
70	Cédric Pinto, Cyril Terrioux	A New Method for Computing Suitable Tree-Decompositions with Respect to Structured CSP Solving.	ICTAI (1)	2008	DBLP DOI BibTeX RDF
61	Per Bjesse, James H. Kukula, Robert F. Damiano, Ted Stanion, Yunshan Zhu	Guiding SAT Diagnosis with Tree Decompositions.	SAT	2003	DBLP DOI BibTeX RDF
51	Martin Grohe	Definable Tree Decompositions.	LICS	2008	DBLP DOI BibTeX RDF	fixed point logic, descriptive complexity, tree decomposition
46	David R. Wood, Jan Arne Telle	Planar Decompositions and the Crossing Number of Graphs with an Excluded Minor.	GD	2006	DBLP DOI BibTeX RDF
45	Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse	Nondeterministic Graph Searching: From Pathwidth to Treewidth.	Algorithmica	2009	DBLP DOI BibTeX RDF	Treewidth, Graph searching, Pathwidth
45	Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse	Nondeterministic Graph Searching: From Pathwidth to Treewidth.	MFCS	2005	DBLP DOI BibTeX RDF	treewidth, graph searching, pathwidth
42	Gianluigi Greco, Francesco Scarcello	Tree Projections: Hypergraph Games and Minimality.	ICALP (1)	2008	DBLP DOI BibTeX RDF
40	Saket Navlakha, James Robert White, Niranjan Nagarajan, Mihai Pop, Carl Kingsford	Finding Biologically Accurate Clusterings in Hierarchical Tree Decompositions Using the Variation of Information.	RECOMB	2009	DBLP DOI BibTeX RDF	Hierarchical Tree Decompositions, Variation of Information, OTUs, Clustering, Protein Interaction Networks, Metagenomics
40	Johan M. M. van Rooij, Hans L. Bodlaender, Peter Rossmanith	Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution.	ESA	2009	DBLP DOI BibTeX RDF
39	Jörg Flum, Markus Frick, Martin Grohe	Query evaluation via tree-decompositions.	J. ACM	2002	DBLP DOI BibTeX RDF	Acyclic conjunctive queries, combined complexity, hypergraphs, monadic second-order logic, tree-width
38	Nysret Musliu	Generation of Tree Decompositions by Iterated Local Search.	EvoCOP	2007	DBLP DOI BibTeX RDF
36	Jörg Flum, Markus Frick, Martin Grohe	Query Evaluation via Tree-Decompositions.	ICDT	2001	DBLP DOI BibTeX RDF
34	Hans L. Bodlaender	Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees.	SWAT	1988	DBLP DOI BibTeX RDF	Chromatic Index, graphs with small treewidth, polynomial time algorithms, NP-complete problems, Graph Isomorphism, tree-decompositions, partial k-trees
34	Hans L. Bodlaender, Fedor V. Fomin	Tree Decompositions with Small Cost.	SWAT	2002	DBLP DOI BibTeX RDF
33	Frederic Dorn, Jan Arne Telle	Two Birds with One Stone: The Best of Branchwidth and Treewidth with One Algorithm.	LATIN	2006	DBLP DOI BibTeX RDF
32	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
32	Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle	Graph Searching, Elimination Trees, and a Generalization of Bandwidth.	FCT	2003	DBLP DOI BibTeX RDF
29	Philippe Jégou, Samba Ndiaye, Cyril Terrioux	Computing and Exploiting Tree-Decompositions for Solving Constraint Networks.	CP	2005	DBLP DOI BibTeX RDF
29	Hans L. Bodlaender, Torben Hagerup	Tree Decompositions of Small Diameter.	MFCS	1998	DBLP DOI BibTeX RDF
28	Hans L. Bodlaender, Joost Engelfriet	Domino Treewith (Extended Abstract).	WG	1994	DBLP DOI BibTeX RDF
28	Hélène Kanso	Résolution des problèmes (W)CSP et #CSP par approches structurelles: Calcul et exploitation dynamique de décompositions arborescentes. (Solving (W)CSP and #CSP problems by structural approaches: computation and dynamic exploitation of tree decompositions).		2017	RDF
28	Bi Li 0004	Tree decompositions and routing problems. (Décompositions arborescentes et problèmes de routage).		2014	RDF
28	Ioan Todinca	Décompositions arborescentes de graphes : calcul, approximations, heuristiques. (Tree decompositions of graphs: computation, approximations, heuristics).		2006	RDF
28	Reinhard Diestel	Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions.	J. Comb. Theory, Ser. B	1990	DBLP DOI BibTeX RDF
28	Reinhard Diestel	Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions.	J. Comb. Theory, Ser. B	1990	DBLP DOI BibTeX RDF
27	Georg Gottlob, Marko Samer	A backtracking-based algorithm for hypertree decomposition.	ACM J. Exp. Algorithmics	2008	DBLP DOI BibTeX RDF	hypertree decomposition, Constraint satisfaction
27	Bruno Courcelle, David Janin	Workshop on Logic, Graph Transformations, Finite and Infinite Structures.	ICGT	2004	DBLP DOI BibTeX RDF
26	Caroline Chaux, Jean-Christophe Pesquet, Laurent Duval	Noise Covariance Properties in Dual-Tree Wavelet Decompositions.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
22	Ahmet Sayar, Süleyman Eken, Okan Öztürk	Kd-tree and quad-tree decompositions for declustering of 2D range queries over uncertain space.	Frontiers Inf. Technol. Electron. Eng.	2015	DBLP DOI BibTeX RDF
22	Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof	Speeding Up Dynamic Programming with Representative Sets: An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions.	Algorithmica	2015	DBLP DOI BibTeX RDF
22	Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof	Speeding-up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions.	CoRR	2013	DBLP BibTeX RDF
22	Stefan Fafianie, Hans L. Bodlaender, Jesper Nederlof	Speeding Up Dynamic Programming with Representative Sets - An Experimental Evaluation of Algorithms for Steiner Tree on Tree Decompositions.	IPEC	2013	DBLP DOI BibTeX RDF
22	Anna Lladó, Susana-Clara López Masip	Minimum tree decompositions with a given tree as a factor.	Australas. J Comb.	2005	DBLP BibTeX RDF
22	Reinhard Diestel	Tree-decompositions, tree-representability and chordal graphs.	Discret. Math.	1988	DBLP DOI BibTeX RDF
21	Anthony Monnet, Roger Villemaire	Scalable formula decomposition for propositional satisfiability.	C3S2E	2010	DBLP DOI BibTeX RDF	scalability, SAT, tree decomposition, propositional satisfiability, DPLL
21	Nysret Musliu	An Iterative Heuristic Algorithm for Tree Decomposition.	Recent Advances in Evolutionary Computation for Combinatorial Optimization	2008	DBLP DOI BibTeX RDF	Heuristics, Constraint Satisfaction Problem, Tree Decomposition, Graph Decomposition, Iterated Local Search
21	Dominique Poulalhon, Gilles Schaeffer	Optimal Coding and Sampling of Triangulations.	Algorithmica	2006	DBLP DOI BibTeX RDF
20	Frederic Dorn	How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms.	WG	2007	DBLP DOI BibTeX RDF
19	Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca	Constructing Brambles.	MFCS	2009	DBLP DOI BibTeX RDF
17	Tara Abrishami, Maria Chudnovsky, Cemil Dibek, Sepehr Hajebi, Pawel Rzazewski, Sophie Spirkl, Kristina Vuskovic	Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree.	J. Comb. Theory, Ser. B	2024	DBLP DOI BibTeX RDF
17	Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl	Induced subgraphs and tree decompositions VII. Basic obstructions in H-free graphs.	J. Comb. Theory, Ser. B	2024	DBLP DOI BibTeX RDF
17	Paloma T. Lima, Martin Milanic, Peter Mursic, Karolina Okrasa, Pawel Rzazewski, Kenny Storgel	Tree decompositions meet induced matchings: beyond Max Weight Independent Set.	CoRR	2024	DBLP DOI BibTeX RDF
17	Louis Carpentier, Jorik Jooken, Jan Goedgebeur	A heuristic algorithm using tree decompositions for the maximum happy vertices problem.	J. Heuristics	2024	DBLP DOI BibTeX RDF
17	Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl, Kristina Vuskovic	Induced subgraphs and tree decompositions V. one neighbor in a hole.	J. Graph Theory	2024	DBLP DOI BibTeX RDF
17	Samuel Eduardo da Silva, Uéverton S. Souza	Decoding Tree Decompositions from Permutations.	LATIN (1)	2024	DBLP DOI BibTeX RDF
17	Marcel Koloschin, Thilo Krill, Max Pitz	End spaces and tree-decompositions.	J. Comb. Theory, Ser. B	2023	DBLP DOI BibTeX RDF
17	Tara Abrishami, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl	Induced Subgraphs and Tree Decompositions IV. (Even Hole, Diamond, Pyramid)-Free Graphs.	Electron. J. Comb.	2023	DBLP DOI BibTeX RDF
17	Corentin Lunel, Arnaud de Mesmay	A Structural Approach to Tree Decompositions of Knots and Spatial Graphs.	CoRR	2023	DBLP DOI BibTeX RDF
17	Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos	Dynamic programming on bipartite tree decompositions.	CoRR	2023	DBLP DOI BibTeX RDF
17	Corentin Lunel, Arnaud de Mesmay	A Structural Approach to Tree Decompositions of Knots and Spatial Graphs.	SoCG	2023	DBLP DOI BibTeX RDF
17	Andrei Popescu 0005, Johannes Peter Wallner	Reasoning in Assumption-Based Argumentation Using Tree-Decompositions.	JELIA	2023	DBLP DOI BibTeX RDF
17	Augusto B. Corrêa, Markus Hecher, Malte Helmert, Davide Mario Longo, Florian Pommerening, Stefan Woltran	Grounding Planning Tasks Using Tree Decompositions and Iterated Solving.	ICAPS	2023	DBLP DOI BibTeX RDF
17	Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos	Dynamic Programming on Bipartite Tree Decompositions.	IPEC	2023	DBLP DOI BibTeX RDF
17	Johannes Carmesin, Matthias Hamann, Babak Miraftab	Canonical trees of tree-decompositions.	J. Comb. Theory, Ser. B	2022	DBLP DOI BibTeX RDF
17	Tara Abrishami, Maria Chudnovsky, Kristina Vuskovic	Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree.	J. Comb. Theory, Ser. B	2022	DBLP DOI BibTeX RDF
17	Max Pitz	Constructing Tree-Decompositions That Display All Topological Ends.	Comb.	2022	DBLP DOI BibTeX RDF
17	Clément Dallard, Fedor V. Fomin, Petr A. Golovach, Tuukka Korhonen, Martin Milanic	Computing Tree Decompositions with Small Independence Number.	CoRR	2022	DBLP DOI BibTeX RDF
17	Louis Carpentier, Jorik Jooken, Jan Goedgebeur	A heuristic algorithm for the maximum happy vertices problem using tree decompositions.	CoRR	2022	DBLP DOI BibTeX RDF
17	Martin Milanic, Pawel Rzazewski	Tree decompositions with bounded independence number: beyond independent sets.	CoRR	2022	DBLP DOI BibTeX RDF
17	Mikolaj Bojanczyk, Michal Pilipczuk	Optimizing tree decompositions in MSO.	Log. Methods Comput. Sci.	2022	DBLP DOI BibTeX RDF
17	Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit	Constructing tree decompositions of graphs with bounded gonality.	J. Comb. Optim.	2022	DBLP DOI BibTeX RDF
17	Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon	Directed Tangle Tree-Decompositions and Applications.	SODA	2022	DBLP DOI BibTeX RDF
17	Brian Hu Zhang, Tuomas Sandholm	Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions.	AAAI	2022	DBLP DOI BibTeX RDF
17	Lon H. Mitchell	Propagation tree decompositions and linearly independent vertices.	Theor. Comput. Sci.	2021	DBLP DOI BibTeX RDF
17	Julien Grange	On the nonexistence of FO-continuous path and tree-decompositions.	CoRR	2021	DBLP BibTeX RDF
17	Brian Hu Zhang, Tuomas Sandholm	Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions.	CoRR	2021	DBLP BibTeX RDF
17	Clément Dallard, Martin Milanic, Kenny Storgel	Tree decompositions with bounded independence number and their algorithmic applications.	CoRR	2021	DBLP BibTeX RDF
17	Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran	DynASP2.5: Dynamic Programming on Tree Decompositions in Action.	Algorithms	2021	DBLP DOI BibTeX RDF
17	Johan M. M. van Rooij	A Generic Convolution Algorithm for Join Operations on Tree Decompositions.	CSR	2021	DBLP DOI BibTeX RDF
17	Tuukka Korhonen, Matti Järvisalo	Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper).	CP	2021	DBLP DOI BibTeX RDF
17	Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit	Constructing Tree Decompositions of Graphs with Bounded Gonality.	CoRR	2020	DBLP BibTeX RDF
17	Johan M. M. van Rooij	Fast Algorithms for Join Operations on Tree Decompositions.	CoRR	2020	DBLP BibTeX RDF
17	Jaehoon Kim, Younjin Kim, Hong Liu 0010	Tree decompositions of graphs without large bipartite holes.	Random Struct. Algorithms	2020	DBLP DOI BibTeX RDF
17	Sriram Sankaranarayanan 0001	Reachability Analysis Using Message Passing over Tree Decompositions.	CAV (1)	2020	DBLP DOI BibTeX RDF
17	Michal Pilipczuk	Computing Tree Decompositions.	Treewidth, Kernels, and Algorithms	2020	DBLP DOI BibTeX RDF
17	Johan M. M. van Rooij	Fast Algorithms for Join Operations on Tree Decompositions.	Treewidth, Kernels, and Algorithms	2020	DBLP DOI BibTeX RDF
17	Hans L. Bodlaender, Josse van Dobben de Bruyn, Dion Gijswijt, Harry Smit	Constructing Tree Decompositions of Graphs with Bounded Gonality.	COCOON	2020	DBLP DOI BibTeX RDF
17	Günther Charwat, Stefan Woltran	Expansion-based QBF Solving on Tree Decompositions.	Fundam. Informaticae	2019	DBLP DOI BibTeX RDF
17	Marek Cygan, Lukasz Kowalik, Arkadiusz Socala	Improving TSP Tours Using Dynamic Programming over Tree Decompositions.	ACM Trans. Algorithms	2019	DBLP DOI BibTeX RDF
17	Johannes Carmesin	All Graphs Have Tree-Decompositions Displaying Their Topological Ends.	Comb.	2019	DBLP DOI BibTeX RDF
17	Michal Wlodarczyk 0001	Clifford Algebras Meet Tree Decompositions.	Algorithmica	2019	DBLP DOI BibTeX RDF
17	Ernst Althaus, Sarah Ziegler	Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm.	CoRR	2019	DBLP BibTeX RDF
17	Giuseppe Mazzuoccolo, Gloria Rinaldi	Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations.	Discret. Math.	2019	DBLP DOI BibTeX RDF
17	Max Bannach, Sebastian Berndt 0001	Practical Access to Dynamic Programming on Tree Decompositions.	Algorithms	2019	DBLP DOI BibTeX RDF
17	Michael Hamann, Ben Strasser	Correspondence between Multilevel Graph Partitions and Tree Decompositions.	Algorithms	2019	DBLP DOI BibTeX RDF
17	Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert	Burling Graphs, Chromatic Number, and Orthogonal Tree-Decompositions.	Electron. J. Comb.	2018	DBLP DOI BibTeX RDF
17	Michael Abseher, Bernhard Bliem, Markus Hecher, Marius Moldovan, Stefan Woltran	Dynamic Programming on Tree Decompositions with D-FLAT.	Künstliche Intell.	2018	DBLP DOI BibTeX RDF
17	Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood	Corrigendum: Orthogonal Tree Decompositions of Graphs.	SIAM J. Discret. Math.	2018	DBLP DOI BibTeX RDF
17	Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood	Orthogonal Tree Decompositions of Graphs.	SIAM J. Discret. Math.	2018	DBLP DOI BibTeX RDF
17	Laurent Beaudou, Peter Dankelmann, Florent Foucaud, Michael A. Henning, Arnaud Mary, Aline Parreau	Bounding the Order of a Graph Using Its Diameter and Metric Dimension: A Study Through Tree Decompositions and VC Dimension.	SIAM J. Discret. Math.	2018	DBLP DOI BibTeX RDF
17	Marthe Bonamy, Nicolas Bousquet	Recoloring graphs via tree decompositions.	Eur. J. Comb.	2018	DBLP DOI BibTeX RDF
17	Navid Tafaghodi Khajavi, Anthony Kuh	Model Approximation Using Cascade of Tree Decompositions.	CoRR	2018	DBLP BibTeX RDF
17	Max Bannach, Sebastian Berndt 0001	Practical Access to Dynamic Programming on Tree Decompositions.	CoRR	2018	DBLP BibTeX RDF
17	Bruno Courcelle	From tree-decompositions to clique-width terms.	Discret. Appl. Math.	2018	DBLP DOI BibTeX RDF
17	Bi Li 0004, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan	Minimum size tree-decompositions.	Discret. Appl. Math.	2018	DBLP DOI BibTeX RDF
17	Joshua Erde	A unified treatment of linked and lean tree-decompositions.	J. Comb. Theory, Ser. B	2018	DBLP DOI BibTeX RDF
17	Max Bannach, Sebastian Berndt 0001	Practical Access to Dynamic Programming on Tree Decompositions.	ESA	2018	DBLP DOI BibTeX RDF
17	Cong Chen, Changhe Yuan, Ze Ye, Chao Chen 0012	Solving M-Modes in Loopy Graphs Using Tree Decompositions.	PGM	2018	DBLP BibTeX RDF
17	Philippe Jégou, Hélène Kanso, Cyril Terrioux	On the Relevance of Optimal Tree Decompositions for Constraint Networks.	ICTAI	2018	DBLP DOI BibTeX RDF
17	Stefan Felsner, Gwenaël Joret, Piotr Micek, William T. Trotter, Veit Wiechert	Burling graphs, chromatic number, and orthogonal tree-decompositions.	Electron. Notes Discret. Math.	2017	DBLP DOI BibTeX RDF