Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | Valentin Bartier, Nicolas Bousquet, Marc Heinrich |
Recoloring graphs of treewidth 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2012.11459, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
15 | Ivan Aidun, Frances Dean, Ralph Morrison, Teresa Yu, Julie Yuan |
Treewidth and gonality of glued grid graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 279, pp. 1-11, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Tatsuya Akutsu, Avraham A. Melkman, Takeyuki Tamura |
Improved Hardness of Maximum Common Subgraph Problems on Labeled Graphs of Bounded Treewidth and Bounded Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 31(2), pp. 253-273, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Sebastian Wiederrecht |
Digraphs of directed treewidth one. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 343(12), pp. 112124, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Michal T. Seweryn |
Improved bound for the dimension of posets of treewidth two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 343(1), pp. 111605, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Nicolas Baudru, Séverine Fratani |
On exteriority notions in book embeddings and treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 343(4), pp. 111703, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Christian Doczkal, Damien Pous |
Graph Theory in Coq: Minors, Treewidth, and Isomorphisms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 64(5), pp. 795-825, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Bi Li 0004, Xin Zhang 0017 |
Tree-coloring problems of bounded treewidth graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 39(1), pp. 156-169, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Ken-ichi Kawarabayashi, Yusuke Kobayashi 0001 |
Linear min-max relation between the treewidth of an H-minor-free graph and its largest grid minor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 141, pp. 165-180, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Fábio Botler, Maycon Sambinelli, Rafael S. Coelho, Orlando Lee |
Gallai's path decomposition conjecture for graphs with treewidth at most 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 93(3), pp. 328-349, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran |
Exploiting Database Management Systems and Treewidth for Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PADL ![In: Practical Aspects of Declarative Languages - 22nd International Symposium, PADL 2020, New Orleans, LA, USA, January 20-21, 2020, Proceedings, pp. 151-167, 2020, Springer, 978-3-030-39196-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Julien Baste, Ignasi Sau, Dimitrios M. Thilikos |
A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020., pp. 951-970, 2020, SIAM, 978-1-61197-599-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Karolina Okrasa, Pawel Rzazewski |
Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020., pp. 1578-1590, 2020, SIAM, 978-1-61197-599-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Pradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid, Dolly Yadav |
Minimum Conflict Free Colouring Parameterized by Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CALDAM ![In: Algorithms and Discrete Applied Mathematics - 6th International Conference, CALDAM 2020, Hyderabad, India, February 13-15, 2020, Proceedings, pp. 439-450, 2020, Springer, 978-3-030-39218-5. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler |
Lower Bounds for QBFs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, Saarbrücken, Germany, July 8-11, 2020., pp. 410-424, 2020, ACM, 978-1-4503-7104-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Vincent Cohen-Addad, Arnold Filtser, Philip N. Klein, Hung Le 0001 |
On Light Spanners, Low-treewidth Embeddings and Efficient Traversing in Minor-free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020, pp. 589-600, 2020, IEEE, 978-1-7281-9621-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse |
Approximate Turing Kernelization for Problems Parameterized by Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 60:1-60:23, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Karolina Okrasa, Marta Piecyk, Pawel Rzazewski |
Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 74:1-74:24, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Rémy Belmonte, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Yota Otachi |
Grundy Distinguishes Treewidth from Pathwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 28th Annual European Symposium on Algorithms, ESA 2020, September 7-9, 2020, Pisa, Italy (Virtual Conference)., pp. 14:1-14:19, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-162-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Martin Fürer, Carlos Hoppen, Vilmar Trevisan |
Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 52:1-52:18, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Daniel Wiebking |
Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 103:1-103:16, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Taisuke Izumi, Yota Otachi |
Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8-11, 2020, Saarbrücken, Germany (Virtual Conference)., pp. 67:1-67:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-138-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Ali Asadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Kiarash Mohammadi, Andreas Pavlogiannis |
Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ATVA ![In: Automated Technology for Verification and Analysis - 18th International Symposium, ATVA 2020, Hanoi, Vietnam, October 19-23, 2020, Proceedings, pp. 253-270, 2020, Springer, 978-3-030-59151-9. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Youssou Dieng, Cyril Gavoille |
On the Treewidth of Planar Minor Free Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
InterSol ![In: Innovations and Interdisciplinary Solutions for Underserved Areas - 4th EAI International Conference, InterSol 2020, Nairobi, Kenya, March 8-9, 2020, Proceedings, pp. 238-250, 2020, Springer, 978-3-030-51050-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Ignasi Sau, Uéverton dos Santos Souza |
Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24-28, 2020, Prague, Czech Republic., pp. 82:1-82:15, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-159-7. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Clément Dallard, Martin Milanic, Kenny Storgel |
Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers, pp. 92-105, 2020, Springer, 978-3-030-60439-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev |
Knot Diagrams of Treewidth Two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 46th International Workshop, WG 2020, Leeds, UK, June 24-26, 2020, Revised Selected Papers, pp. 80-91, 2020, Springer, 978-3-030-60439-4. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone |
An Optimal Algorithm for Bisection for Bounded-Treewidth Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics - 14th International Workshop, FAW 2020, Haikou, China, October 19-21, 2020, Proceedings, pp. 25-36, 2020, Springer, 978-3-030-59900-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Markus Hecher, Patrick Thier, Stefan Woltran |
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings, pp. 343-360, 2020, Springer, 978-3-030-51824-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Friedrich Slivovsky, Stefan Szeider |
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2020 - 23rd International Conference, Alghero, Italy, July 3-10, 2020, Proceedings, pp. 267-276, 2020, Springer, 978-3-030-51824-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Laura Merker, Torsten Ueckerdt |
The Local Queue Number of Graphs with Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing and Network Visualization - 28th International Symposium, GD 2020, Vancouver, BC, Canada, September 16-18, 2020, Revised Selected Papers, pp. 26-39, 2020, Springer, 978-3-030-68765-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher, Maximilian F. I. Kieler |
Treewidth-Aware Quantifier Elimination and Expansion for QCSP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - 26th International Conference, CP 2020, Louvain-la-Neuve, Belgium, September 7-11, 2020, Proceedings, pp. 248-266, 2020, Springer, 978-3-030-58474-0. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Markus Hecher |
Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? ![Search on Bibsonomy](Pics/bibsonomy.png) |
KR ![In: Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece, September 12-18, 2020., pp. 485-495, 2020, 978-0-9992411-7-2. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Jaemin Yoo, U Kang, Mauro Scanagatta, Giorgio Corani, Marco Zaffalon |
Sampling Subgraphs with Guaranteed Treewidth for Accurate and Efficient Graphical Inference. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WSDM ![In: WSDM '20: The Thirteenth ACM International Conference on Web Search and Data Mining, Houston, TX, USA, February 3-7, 2020, pp. 708-716, 2020, ACM, 978-1-4503-6822-3. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Daniel N. Baker, Vladimir Braverman, Lingxiao Huang, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu 0002 |
Coresets for Clustering in Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML ![In: Proceedings of the 37th International Conference on Machine Learning, ICML 2020, 13-18 July 2020, Virtual Event., pp. 569-579, 2020, PMLR. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
15 | Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider |
Threshold Treewidth and Hypertree Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, pp. 1898-1904, 2020, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Benjamin Bergougnoux, Édouard Bonnet, Nick Brettell, O-joung Kwon |
Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 15th International Symposium on Parameterized and Exact Computation, IPEC 2020, December 14-18, 2020, Hong Kong, China (Virtual Conference)., pp. 3:1-3:17, 2020, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-172-6. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Daniel Vaz 0001 |
Approximation algorithms for network design and cut problems in bounded-treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2020 |
RDF |
|
15 | Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez |
On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LAGOS ![In: Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2019, Belo Horizonte, Brazil, June 2-7, 2019, pp. 171-183, 2019, Elsevier. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Zongwen Bai, Jianhua Tu, Yongtang Shi |
An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 21(4), 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Remie Janssen, Mark Jones 0001, Steven Kelk, Georgios Stamoulis, Taoyang Wu |
Treewidth of display graphs: bounds, brambles and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 23(4), pp. 715-743, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak |
Counting Linear Extensions: Parameterizations by Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 81(4), pp. 1657-1683, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele |
Turbocharging Treewidth Heuristics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 81(2), pp. 439-475, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Édouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx |
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 81(10), pp. 3890-3935, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Júlio Araújo 0001, Cláudia Linhares Sales, Ignasi Sau, Ana Silva 0001 |
Weighted proper orientations of trees and graphs of bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 771, pp. 39-48, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Michal Ziobro, Marcin Pilipczuk |
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM J. Exp. Algorithmics ![In: ACM J. Exp. Algorithmics 24(1), pp. 2.7:1-2.7:18, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Ludmila Glinskih, Dmitry Itsykson |
On Tseitin formulas, read-once branching programs and treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR19, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon |
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1908.10132, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Silviu Maniu, Pierre Senellart, Suraj Jog |
An Experimental Study of the Treewidth of Real-World Graph Data (Extended Version). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.06862, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher |
Treewidth and Counting Projected Answer Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1903.11316, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | David A. Cohen, Martin C. Cooper, Artem Kaznatcheev, Mark Wallace 0001 |
Steepest ascent can be exponential in bounded treewidth problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1911.08600, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Miguel Romero 0001, Marcin Wrochna, Stanislav Zivný |
Treewidth-Pliability and PTAS for Max-CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1911.03204, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Rahul Jain 0015, Raghunath Tewari |
Reachability in High Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1901.11285, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani |
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1908.05015, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Karolina Okrasa, Pawel Rzazewski |
Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1906.08371, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Sergio Cabello |
Computing the inverse geodesic length in planar graphs and graphs of bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1908.01317, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Boi Faltings, Martin Charles Golumbic |
An Effective Upperbound on Treewidth Using Partial Fill-in of Separators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1909.02789, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev |
Knot Diagrams of Treewidth Two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.03117, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Andrea Calì, Igor Razgon |
Regular resolution for CNF of bounded incidence treewidth with few long clauses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1905.10867, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Markus Hecher |
Answer Set Solving exploiting Treewidth and its Limits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1905.01688, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Ei Ando |
The Distribution Function of the Longest Path Length in Constant Treewidth DAGs with Random Edge Length. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1910.09791, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Gregory Rosenthal |
Beating Treewidth for Average-Case Subgraph Isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1902.06380, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Hisao Tamaki |
A heuristic use of dynamic programming to upperbound treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1909.07647, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Édouard Bonnet, Nidhi Purohit |
Metric Dimension Parameterized by Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.08093, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Dehia Ait-Ferhat, Vincent Juliard, Gautier Stauffer, Andres J. Torres |
The $k$-path coloring problem in graphs with bounded treewidth: an application in integrated circuit manufacturing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1904.11805, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Julien Baste, Ignasi Sau, Dimitrios M. Thilikos |
Hitting minors on bounded treewidth graphs. IV. An optimal algorithm. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.04442, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Sebastian Wiederrecht |
A Note on Directed Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1910.01826, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler |
TE-ETH: Lower Bounds for QBFs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1910.01047, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Daniel Wiebking |
Graph isomorphism in quasipolynomial time parameterized by treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1911.11257, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Nina Kamcev, Anita Liebenau, David Wood, Liana Yepremyan |
The size Ramsey number of graphs with bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1906.09185, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Vladimir Braverman, Lingxiao Huang, Shaofeng H.-C. Jiang, Robert Krauthgamer, Xuan Wu 0002 |
Coresets for Clustering in Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.04733, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Frank Kammer, Johannes Meintrup, Andrej Sajenko |
Space-Efficient Vertex Separators for Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1907.00676, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Dusan Knop, Martin Koutecký, Tomás Masarík, Tomás Toufar |
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 15(4), 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Kristóf Huszár, Jonathan Spreer, Uli Wagner 0001 |
On the treewidth of triangulated 3-manifolds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Geom. ![In: J. Comput. Geom. 10(2), pp. 70-98, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Borislav Slavchev, Evelina Masliankova, Steven Kelk |
A Machine Learning Approach to Algorithm Selection for Exact Computation of Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms ![In: Algorithms 12(10), pp. 200, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Krishnendu Chatterjee, Amir Kafshdar Goharshady, Prateesh Goyal, Rasmus Ibsen-Jensen, Andreas Pavlogiannis |
Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 41(4), pp. 23:1-23:46, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Hisao Tamaki |
Positive-instance driven dynamic programming for treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 37(4), pp. 1283-1311, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Zdenek Dvorák 0001, Sergey Norin |
Treewidth of graphs with balanced separations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 137, pp. 137-144, 2019. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Rahul Jain 0015, Raghunath Tewari |
Reachability in High Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 30th International Symposium on Algorithms and Computation, ISAAC 2019, December 8-11, 2019, Shanghai University of Finance and Economics, Shanghai, China., pp. 12:1-12:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-130-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Anupam Gupta 0001, Euiwoong Lee, Jason Li 0006, Pasin Manurangsi, Michal Wlodarczyk 0001 |
Losing Treewidth by Separating Subsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pp. 1731-1749, 2019, SIAM, 978-1-61197-548-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Eli Fox-Epstein, Philip N. Klein, Aaron Schild |
Embedding Planar Graphs into Low-Treewidth Graphs with Applications to Efficient Approximation Schemes for Metric Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019, pp. 1069-1088, 2019, SIAM, 978-1-61197-548-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady |
The treewidth of smart contracts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 34th ACM/SIGAPP Symposium on Applied Computing, SAC 2019, Limassol, Cyprus, April 8-12, 2019, pp. 400-408, 2019, ACM, 978-1-4503-5933-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad |
Bisection of Bounded Treewidth Graphs by Convolutions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany., pp. 42:1-42:11, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-124-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Kristóf Huszár, Jonathan Spreer |
3-Manifold Triangulations with Small Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 35th International Symposium on Computational Geometry, SoCG 2019, June 18-21, 2019, Portland, Oregon, USA., pp. 44:1-44:20, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-104-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Hisao Tamaki |
Computing Treewidth via Exact and Heuristic Lists of Minimal Separators. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEA² ![In: Analysis of Experimental Algorithms - Special Event, SEA² 2019, Kalamata, Greece, June 24-29, 2019, Revised Selected Papers, pp. 219-236, 2019, Springer, 978-3-030-34028-5. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Eduard Eiben, Robert Ganian, Thekla Hamm, O-joung Kwon |
Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 44th International Symposium on Mathematical Foundations of Computer Science, MFCS 2019, August 26-30, 2019, Aachen, Germany., pp. 42:1-42:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-117-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher |
Treewidth and Counting Projected Answer Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPNMR ![In: Logic Programming and Nonmonotonic Reasoning - 15th International Conference, LPNMR 2019, Philadelphia, PA, USA, June 3-7, 2019, Proceedings, pp. 105-119, 2019, Springer, 978-3-030-20527-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Ludmila Glinskih, Dmitry Itsykson |
On Tseitin Formulas, Read-Once Branching Programs and Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1-5, 2019, Proceedings, pp. 143-155, 2019, Springer, 978-3-030-19954-8. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Daniel Lokshtanov, M. S. Ramanujan 0001, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi |
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures - 16th International Symposium, WADS 2019, Edmonton, AB, Canada, August 5-7, 2019, Proceedings, pp. 523-537, 2019, Springer, 978-3-030-24765-2. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani |
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD ![In: Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, Prague, Czech Republic, September 17-20, 2019, Proceedings, pp. 379-392, 2019, Springer, 978-3-030-35801-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Silviu Maniu, Pierre Senellart, Suraj Jog |
An Experimental Study of the Treewidth of Real-World Graph Data. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: 22nd International Conference on Database Theory, ICDT 2019, March 26-28, 2019, Lisbon, Portugal, pp. 12:1-12:18, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-101-6. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | David Mitchell |
Guarded Constraint Models Define Treewidth Preserving Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - 25th International Conference, CP 2019, Stamford, CT, USA, September 30 - October 4, 2019, Proceedings, pp. 350-365, 2019, Springer, 978-3-030-30047-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Lusheng Wang 0001, Boting Yang |
The One-Cop-Moves Game on Graphs of Small Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA ![In: Combinatorial Optimization and Applications - 13th International Conference, COCOA 2019, Xiamen, China, December 13-15, 2019, Proceedings, pp. 517-528, 2019, Springer, 978-3-030-36411-3. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Aldo Pacchiano, Yoram Bachrach |
Computing Stable Solutions in Threshold Network Flow Games With Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS '19, Montreal, QC, Canada, May 13-17, 2019, pp. 2153-2155, 2019, International Foundation for Autonomous Agents and Multiagent Systems, 978-1-4503-6309-9. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP BibTeX RDF |
|
15 | Édouard Bonnet, Nidhi Purohit |
Metric Dimension Parameterized by Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany., pp. 5:1-5:15, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-129-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Gregory Rosenthal |
Beating Treewidth for Average-Case Subgraph Isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany., pp. 24:1-24:14, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-129-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Jiawei Gao 0001 |
On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 14th International Symposium on Parameterized and Exact Computation, IPEC 2019, September 11-13, 2019, Munich, Germany., pp. 16:1-16:17, 2019, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-129-0. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Tom C. van der Zanden |
Theory and Practical Applications of Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2019 |
RDF |
|
15 | Henning Bruhn, Laura Gellert, Richard Lang |
Chromatic Index, Treewidth and Maximum Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 25(2), pp. 2, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Thiago Braga Marcilon, Rudini Menezes Sampaio |
The P3 infection time is W[1]-hard parameterized by the treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 132, pp. 55-61, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|