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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI (1) ![In: 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), November 3-5, 2008, Dayton, Ohio, USA, Volume 1, pp. 491-495, 2008, IEEE Computer Society, 978-0-7695-3440-4. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
61 | Per Bjesse, James H. Kukula, Robert F. Damiano, Ted Stanion, Yunshan Zhu |
Guiding SAT Diagnosis with Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers, pp. 315-329, 2003, Springer, 3-540-20851-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
51 | Martin Grohe |
Definable Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 406-417, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers, pp. 150-161, 2006, Springer, 978-3-540-70903-9. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
45 | Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse |
Nondeterministic Graph Searching: From Pathwidth to Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 53(3), pp. 358-373, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Treewidth, Graph searching, Pathwidth |
45 | Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse |
Nondeterministic Graph Searching: From Pathwidth to Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 364-375, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
treewidth, graph searching, pathwidth |
42 | Gianluigi Greco, Francesco Scarcello |
Tree Projections: Hypergraph Games and Minimality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 736-747, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RECOMB ![In: Research in Computational Molecular Biology, 13th Annual International Conference, RECOMB 2009, Tucson, AZ, USA, May 18-21, 2009. Proceedings, pp. 400-417, 2009, Springer, 978-3-642-02007-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 566-577, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
39 | Jörg Flum, Markus Frick, Martin Grohe |
Query evaluation via tree-decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 49(6), pp. 716-752, 2002. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EvoCOP ![In: Evolutionary Computation in Combinatorial Optimization, 7th European Conference, EvoCOP 2007, Valencia, Spain, April 11-13, 2007, Proceedings, pp. 130-141, 2007, Springer, 978-3-540-71614-3. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Jörg Flum, Markus Frick, Martin Grohe |
Query Evaluation via Tree-Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2001, 8th International Conference, London, UK, January 4-6, 2001, Proceedings., pp. 22-38, 2001, Springer, 3-540-41456-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
34 | Hans L. Bodlaender |
Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: SWAT 88, 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988, Proceedings, pp. 223-232, 1988, Springer, 3-540-19487-8. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT 2002, 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 Proceedings, pp. 378-387, 2002, Springer, 3-540-43866-1. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2006: Theoretical Informatics, 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings, pp. 386-397, 2006, Springer, 3-540-32755-X. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle |
Graph Searching, Elimination Trees, and a Generalization of Bandwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 41(2), pp. 73-87, 2005. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings, pp. 73-85, 2003, Springer, 3-540-40543-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Philippe Jégou, Samba Ndiaye, Cyril Terrioux |
Computing and Exploiting Tree-Decompositions for Solving Constraint Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings, pp. 777-781, 2005, Springer, 3-540-29238-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
29 | Hans L. Bodlaender, Torben Hagerup |
Tree Decompositions of Small Diameter. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998, Proceedings, pp. 702-712, 1998, Springer, 3-540-64827-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Hans L. Bodlaender, Joost Engelfriet |
Domino Treewith (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings, pp. 1-13, 1994, Springer, 3-540-59071-4. The full citation details ...](Pics/full.jpeg) |
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). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2017 |
RDF |
|
28 | Bi Li 0004 |
Tree decompositions and routing problems. (Décompositions arborescentes et problèmes de routage). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2014 |
RDF |
|
28 | Ioan Todinca |
Décompositions arborescentes de graphes : calcul, approximations, heuristiques. (Tree decompositions of graphs: computation, approximations, heuristics). ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2006 |
RDF |
|
28 | Reinhard Diestel |
Simplicial tree-decompositions of infinite graphs. III. The uniqueness of prime decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 50(1), pp. 117-128, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
28 | Reinhard Diestel |
Simplicial tree-decompositions of infinite graphs. II. The existence of prime decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 50(1), pp. 93-116, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
27 | Georg Gottlob, Marko Samer |
A backtracking-based algorithm for hypertree decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 13, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hypertree decomposition, Constraint satisfaction |
27 | Bruno Courcelle, David Janin |
Workshop on Logic, Graph Transformations, Finite and Infinite Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICGT ![In: Graph Transformations, Second International Conference, ICGT 2004, Rome, Italy, September 28 - October 2, 2004, Proceedings, pp. 448-450, 2004, Springer, 3-540-23207-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
26 | Caroline Chaux, Jean-Christophe Pesquet, Laurent Duval |
Noise Covariance Properties in Dual-Tree Wavelet Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 53(12), pp. 4680-4700, 2007. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Frontiers Inf. Technol. Electron. Eng. ![In: Frontiers Inf. Technol. Electron. Eng. 16(2), pp. 98-108, 2015. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 71(3), pp. 636-660, 2015. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1305.7448, 2013. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, pp. 321-334, 2013, Springer, 978-3-319-03897-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
22 | Anna Lladó, Susana-Clara López Masip |
Minimum tree decompositions with a given tree as a factor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Australas. J Comb. ![In: Australas. J Comb. 31, pp. 47-60, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP BibTeX RDF |
|
22 | Reinhard Diestel |
Tree-decompositions, tree-representability and chordal graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 71(2), pp. 181-184, 1988. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
21 | Anthony Monnet, Roger Villemaire |
Scalable formula decomposition for propositional satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
C3S2E ![In: Canadian Conference on Computer Science & Software Engineering, C3S2E 2010, Montreal, Quebec, Canada, May 19-20, 2010, Proceedings, pp. 43-52, 2010, ACM, 978-1-60558-901-5. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
scalability, SAT, tree decomposition, propositional satisfiability, DPLL |
21 | Nysret Musliu |
An Iterative Heuristic Algorithm for Tree Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Recent Advances in Evolutionary Computation for Combinatorial Optimization ![In: Recent Advances in Evolutionary Computation for Combinatorial Optimization, pp. 133-150, 2008, Springer, 978-3-540-70806-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 46(3-4), pp. 505-527, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Frederic Dorn |
How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 280-291, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
19 | Mathieu Chapelle, Frédéric Mazoit, Ioan Todinca |
Constructing Brambles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2009, 34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings, pp. 223-234, 2009, Springer, 978-3-642-03815-0. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 164, pp. 371-403, January 2024. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 164, pp. 443-472, January 2024. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2402.15834, 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
17 | Louis Carpentier, Jorik Jooken, Jan Goedgebeur |
A heuristic algorithm using tree decompositions for the maximum happy vertices problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Heuristics ![In: J. Heuristics 30(1), pp. 67-107, April 2024. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 105(4), pp. 542-561, April 2024. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
17 | Samuel Eduardo da Silva, Uéverton S. Souza |
Decoding Tree Decompositions from Permutations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN (1) ![In: LATIN 2024: Theoretical Informatics - 16th Latin American Symposium, Puerto Varas, Chile, March 18-22, 2024, Proceedings, Part I, pp. 19-34, 2024, Springer, 978-3-031-55597-8. The full citation details ...](Pics/full.jpeg) |
2024 |
DBLP DOI BibTeX RDF |
|
17 | Marcel Koloschin, Thilo Krill, Max Pitz |
End spaces and tree-decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 161, pp. 147-179, July 2023. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 30(2), 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Corentin Lunel, Arnaud de Mesmay |
A Structural Approach to Tree Decompositions of Knots and Spatial Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2303.07982, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos |
Dynamic programming on bipartite tree decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2309.07754, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Corentin Lunel, Arnaud de Mesmay |
A Structural Approach to Tree Decompositions of Knots and Spatial Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 39th International Symposium on Computational Geometry, SoCG 2023, June 12-15, 2023, Dallas, Texas, USA, pp. 50:1-50:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-273-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Andrei Popescu 0005, Johannes Peter Wallner |
Reasoning in Assumption-Based Argumentation Using Tree-Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JELIA ![In: Logics in Artificial Intelligence - 18th European Conference, JELIA 2023, Dresden, Germany, September 20-22, 2023, Proceedings, pp. 192-208, 2023, Springer, 978-3-031-43618-5. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICAPS ![In: Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, July 8-13, 2023, Prague, Czech Republic, pp. 100-108, 2023, AAAI Press. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos |
Dynamic Programming on Bipartite Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, September 6-8, 2023, Amsterdam, The Netherlands, pp. 26:1-26:22, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-305-8. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
17 | Johannes Carmesin, Matthias Hamann, Babak Miraftab |
Canonical trees of tree-decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 152, pp. 1-26, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 157, pp. 144-175, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
17 | Max Pitz |
Constructing Tree-Decompositions That Display All Topological Ends. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 42(5), pp. 763-769, 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2207.09993, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
17 | Louis Carpentier, Jorik Jooken, Jan Goedgebeur |
A heuristic algorithm for the maximum happy vertices problem using tree decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.14921, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
17 | Martin Milanic, Pawel Rzazewski |
Tree decompositions with bounded independence number: beyond independent sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2209.12315, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
17 | Mikolaj Bojanczyk, Michal Pilipczuk |
Optimizing tree decompositions in MSO. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 18(1), 2022. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 44(4), pp. 2681-2699, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
17 | Archontia C. Giannopoulou, Ken-ichi Kawarabayashi, Stephan Kreutzer, O-joung Kwon |
Directed Tangle Tree-Decompositions and Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022, pp. 377-405, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
17 | Brian Hu Zhang, Tuomas Sandholm |
Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, Thirty-Fourth Conference on Innovative Applications of Artificial Intelligence, IAAI 2022, The Twelveth Symposium on Educational Advances in Artificial Intelligence, EAAI 2022 Virtual Event, February 22 - March 1, 2022, pp. 5252-5259, 2022, AAAI Press, 978-1-57735-876-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
17 | Lon H. Mitchell |
Propagation tree decompositions and linearly independent vertices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 849, pp. 159-162, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
17 | Julien Grange |
On the nonexistence of FO-continuous path and tree-decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2106.04201, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
17 | Brian Hu Zhang, Tuomas Sandholm |
Team Correlated Equilibria in Zero-Sum Extensive-Form Games via Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2109.05284, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
17 | Clément Dallard, Martin Milanic, Kenny Storgel |
Tree decompositions with bounded independence number and their algorithmic applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2111.04543, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP BibTeX RDF |
|
17 | Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran |
DynASP2.5: Dynamic Programming on Tree Decompositions in Action. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 14(3), pp. 81, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
17 | Johan M. M. van Rooij |
A Generic Convolution Algorithm for Join Operations on Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28 - July 2, 2021, Proceedings, pp. 435-459, 2021, Springer, 978-3-030-79415-6. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
17 | Tuukka Korhonen, Matti Järvisalo |
Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters (Short Paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: 27th International Conference on Principles and Practice of Constraint Programming, CP 2021, Montpellier, France (Virtual Conference), October 25-29, 2021., pp. 8:1-8:11, 2021, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-211-2. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2005.05569, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
17 | Johan M. M. van Rooij |
Fast Algorithms for Join Operations on Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2006.01588, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
17 | Jaehoon Kim, Younjin Kim, Hong Liu 0010 |
Tree decompositions of graphs without large bipartite holes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Random Struct. Algorithms ![In: Random Struct. Algorithms 57(1), pp. 150-168, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
17 | Sriram Sankaranarayanan 0001 |
Reachability Analysis Using Message Passing over Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV (1) ![In: Computer Aided Verification - 32nd International Conference, CAV 2020, Los Angeles, CA, USA, July 21-24, 2020, Proceedings, Part I, pp. 604-628, 2020, Springer, 978-3-030-53287-1. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
17 | Michal Pilipczuk |
Computing Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Treewidth, Kernels, and Algorithms ![In: Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday, pp. 189-213, 2020, Springer, 978-3-030-42070-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
17 | Johan M. M. van Rooij |
Fast Algorithms for Join Operations on Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Treewidth, Kernels, and Algorithms ![In: Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday, pp. 262-297, 2020, Springer, 978-3-030-42070-3. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29-31, 2020, Proceedings, pp. 384-396, 2020, Springer, 978-3-030-58149-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
17 | Günther Charwat, Stefan Woltran |
Expansion-based QBF Solving on Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 167(1-2), pp. 59-92, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
17 | Marek Cygan, Lukasz Kowalik, Arkadiusz Socala |
Improving TSP Tours Using Dynamic Programming over Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 15(4), pp. 54:1-54:19, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
17 | Johannes Carmesin |
All Graphs Have Tree-Decompositions Displaying Their Topological Ends. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 39(3), pp. 545-596, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
17 | Michal Wlodarczyk 0001 |
Clifford Algebras Meet Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 81(2), pp. 497-518, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
17 | Ernst Althaus, Sarah Ziegler |
Optimal Tree Decompositions Revisited: A Simpler Linear-Time FPT Algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1912.09144, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
17 | Giuseppe Mazzuoccolo, Gloria Rinaldi |
Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 342(4), pp. 1006-1016, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
17 | Max Bannach, Sebastian Berndt 0001 |
Practical Access to Dynamic Programming on Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 12(8), pp. 172, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
17 | Michael Hamann, Ben Strasser |
Correspondence between Multilevel Graph Partitions and Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 12(9), pp. 198, 2019. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 25(1), pp. 1, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
17 | Michael Abseher, Bernhard Bliem, Markus Hecher, Marius Moldovan, Stefan Woltran |
Dynamic Programming on Tree Decompositions with D-FLAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Künstliche Intell. ![In: Künstliche Intell. 32(2-3), pp. 191-192, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
17 | Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood |
Corrigendum: Orthogonal Tree Decompositions of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 32(4), pp. 3003-3004, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
17 | Vida Dujmovic, Gwenaël Joret, Pat Morin, Sergey Norin, David R. Wood |
Orthogonal Tree Decompositions of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 32(2), pp. 839-863, 2018. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 32(2), pp. 902-918, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
17 | Marthe Bonamy, Nicolas Bousquet |
Recoloring graphs via tree decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 69, pp. 200-213, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
17 | Navid Tafaghodi Khajavi, Anthony Kuh |
Model Approximation Using Cascade of Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1808.03504, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
17 | Max Bannach, Sebastian Berndt 0001 |
Practical Access to Dynamic Programming on Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1806.10176, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
17 | Bruno Courcelle |
From tree-decompositions to clique-width terms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 248, pp. 125-144, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
17 | Bi Li 0004, Fatima Zahra Moataz, Nicolas Nisse, Karol Suchan |
Minimum size tree-decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 245, pp. 109-127, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
17 | Joshua Erde |
A unified treatment of linked and lean tree-decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 130, pp. 114-143, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
17 | Max Bannach, Sebastian Berndt 0001 |
Practical Access to Dynamic Programming on Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, pp. 6:1-6:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-081-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
17 | Cong Chen, Changhe Yuan, Ze Ye, Chao Chen 0012 |
Solving M-Modes in Loopy Graphs Using Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PGM ![In: International Conference on Probabilistic Graphical Models, PGM 2018, 11-14 September 2018, Prague, Czech Republic, pp. 145-156, 2018, PMLR. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
17 | Philippe Jégou, Hélène Kanso, Cyril Terrioux |
On the Relevance of Optimal Tree Decompositions for Constraint Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: IEEE 30th International Conference on Tools with Artificial Intelligence, ICTAI 2018, 5-7 November 2018, Volos, Greece., pp. 738-743, 2018, IEEE. The full citation details ...](Pics/full.jpeg) |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 61, pp. 415-420, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|