Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | Steven Chaplick, Steven Kelk, Ruben Meuwese, Matús Mihalák, Georgios Stamoulis |
Snakes and Ladders: A Treewidth Story. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers, pp. 187-200, 2023, Springer, 978-3-031-43379-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Falko Hegerfeld, Stefan Kratsch |
Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers, pp. 388-402, 2023, Springer, 978-3-031-43379-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Juhi Chaudhary, Meirav Zehavi |
P-Matchings Parameterized by Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers, pp. 217-231, 2023, Springer, 978-3-031-43379-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Nicolas Bousquet, Quentin Deschamps, Aline Parreau |
Metric Dimension Parameterized by Treewidth in Chordal Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Fribourg, Switzerland, June 28-30, 2023, Revised Selected Papers, pp. 130-142, 2023, Springer, 978-3-031-43379-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Markus Hecher |
Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth? ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Thirty-Seventh AAAI Conference on Artificial Intelligence, AAAI 2023, Thirty-Fifth Conference on Innovative Applications of Artificial Intelligence, IAAI 2023, Thirteenth Symposium on Educational Advances in Artificial Intelligence, EAAI 2023, Washington, DC, USA, February 7-14, 2023, pp. 6407-6415, 2023, AAAI Press, 978-1-57735-880-0. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Viktor Besin, Markus Hecher, Stefan Woltran |
On the Structural Complexity of Grounding - Tackling the ASP Grounding Bottleneck via Epistemic Programs and Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECAI ![In: ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland - Including 12th Conference on Prestigious Applications of Intelligent Systems (PAIS 2023), pp. 247-254, 2023, IOS Press, 978-1-64368-436-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Bart M. P. Jansen, Liana Khazaliya, Philipp Kindermann, Giuseppe Liotta, Fabrizio Montecchiani, Kirill Simonov |
Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GD (2) ![In: Graph Drawing and Network Visualization - 31st International Symposium, GD 2023, Isola delle Femmine, Palermo, Italy, September 20-22, 2023, Revised Selected Papers, Part II, pp. 203-217, 2023, Springer, 978-3-031-49274-7. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Sven Mallach |
On Integer Linear Programs for Treewidth Based on Perfect Elimination Orderings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings, pp. 294-306, 2023, Springer, 978-3-031-34346-9. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Maurício Pires, Uéverton S. Souza, Bruno Lopes 0001 |
Twin-Treewidth: A Single-Exponential Logic-Based Approach. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOA (2) ![In: Combinatorial Optimization and Applications - 17th International Conference, COCOA 2023, Hawaii, HI, USA, December 15-17, 2023, Proceedings, Part II, pp. 43-55, 2023, Springer, 978-3-031-49613-4. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Tobias Friedrich 0001, Davis Issac, Nikhil Kumar 0001, Nadym Mallek, Ziena Zeif |
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pp. 1325-1334, 2023, ACM, 978-1-4503-9913-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Tuukka Korhonen, Daniel Lokshtanov |
An Improved Parameterized Algorithm for Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, June 20-23, 2023, pp. 528-541, 2023, ACM, 978-1-4503-9913-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Amir Kafshdar Goharshady, Ahmed Khaled Zaher |
Efficient Interprocedural Data-Flow Analysis Using Treedepth and Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
VMCAI ![In: Verification, Model Checking, and Abstract Interpretation - 24th International Conference, VMCAI 2023, Boston, MA, USA, January 16-17, 2023, Proceedings, pp. 177-202, 2023, Springer, 978-3-031-24949-5. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Hauke Brinkop, Klaus Jansen |
Solving Cut-Problems in Quadratic Time for Graphs with Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2023: Theory and Practice of Computer Science - 48th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2023, Nový Smokovec, Slovakia, January 15-18, 2023, Proceedings, pp. 33-46, 2023, Springer, 978-3-031-23100-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Jorge Fandinno, Markus Hecher |
Treewidth-Aware Complexity for Evaluating Epistemic Logic Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI 2023, 19th-25th August 2023, Macao, SAR, China, pp. 3203-3211, 2023, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
15 | Hisao Tamaki |
A Contraction-Recursive Algorithm for Treewidth. ![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. 34:1-34:15, 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 |
|
15 | Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý |
Treewidth Is NP-Complete on Cubic Graphs. ![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. 7:1-7:13, 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 |
|
15 | Cristina Feier, Tomasz Gogacz, Filip Murlak |
Exploiting Semantic Treewidth for Graph Queries Evaluation (short paper). ![Search on Bibsonomy](Pics/bibsonomy.png) |
AMW ![In: Proceedings of the 15th Alberto Mendelzon International Workshop on Foundations of Data Management (AMW 2023), Santiago de Chile, Chile, May 22-26, 2023., 2023, CEUR-WS.org. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
15 | C. Aiswarya |
How treewidth helps in verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM SIGLOG News ![In: ACM SIGLOG News 9(1), pp. 6-21, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Ke Liu, Mengyu Cao, Mei Lu |
Treewidth of the Generalized Kneser Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 29(1), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Kolja Knauer, Hoang La, Petru Valicov |
Feedback Vertex Sets in (Directed) Graphs of Bounded Degeneracy or Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 29(4), 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Simon Schierreich, Ondrej Suchý |
Waypoint routing on bounded treewidth graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 173, pp. 106165, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Bertrand Marchand, Yann Ponty, Laurent Bulteau |
Tree diet: reducing the treewidth to unlock FPT algorithms in RNA bioinformatics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms Mol. Biol. ![In: Algorithms Mol. Biol. 17(1), pp. 8, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Céline Scornavacca, Mathias Weller |
Treewidth-based algorithms for the small parsimony problem on networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithms Mol. Biol. ![In: Algorithms Mol. Biol. 17(1), pp. 15, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Marek Cygan, Jesper Nederlof, Marcin Pilipczuk, Michal Pilipczuk, Johan M. M. van Rooij, Jakub Onufry Wojtaszczyk |
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 18(2), pp. 17:1-17:31, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Sergio Cabello |
Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 18(2), pp. 14:1-14:26, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
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) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 36(3), pp. 1761-1787, September 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Sushmita Gupta, Saket Saurabh 0001, Meirav Zehavi |
On Treewidth and Stable Marriage: Parameterized Algorithms and Hardness Results (Complete Characterization). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 36(1), pp. 596-681, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Mahdi Belbasi, Martin Fürer |
An Improvement of Reed's Treewidth Approximation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 26(2), pp. 257-282, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
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) |
Artif. Intell. ![In: Artif. Intell. 304, pp. 103651, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Shaohua Li 0005, Marcin Pilipczuk |
Hardness of Metric Dimension in Graphs of Constant Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(11), pp. 3110-3155, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Frank Kammer, Johannes Meintrup, Andrej Sajenko |
Space-Efficient Vertex Separators for Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 84(9), pp. 2414-2461, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | David Eppstein, Daniel Frishberg, William Maxwell |
On the treewidth of Hanoi graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 906, pp. 1-17, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani |
Orthogonal planarity testing of bounded treewidth graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Syst. Sci. ![In: J. Comput. Syst. Sci. 125, pp. 129-148, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider |
Threshold Treewidth and Hypertree Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 74, pp. 1687-1713, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Akanksha Agrawal 0001, Dániel Marx, Daniel Neuen, Jasper Slusallek |
Computing Square Colorings on Bounded-Treewidth and Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.04458, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Clément Dallard, Martin Milanic, Kenny Storgel |
Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.15092, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Rutger Campbell, Katie Clinch, Marc Distel, J. Pascal Gollin, Kevin Hendrey, Robert Hickingbotham, Tony Huynh, Freddie Illingworth, Youri Tamitegama, Jane Tan, David R. Wood |
Product structure of graph classes with bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.02395, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Arnold Filtser, Hung Le 0001 |
Low Treewidth Embeddings of Planar and Minor-Free Metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2203.15627, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Hermish Mehta, Daniel Reichman 0001 |
Local treewidth of random and noisy graphs with applications to stopping contagion in networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.07827, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Mitchell Black, Nello Blaser, Amir Nayyeri, Erlend Raa Vågset |
ETH-tight algorithms for finding surfaces in simplicial complexes of bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2203.07566, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Jeroen L. G. Schols |
Kernelization for Treewidth-2 Vertex Deletion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2203.10070, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Tom C. van der Zanden, Hans L. Bodlaender, Herbert J. M. Hamers |
Efficiently Computing the Shapley Value of Connectivity Games in Low-Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.12868, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Tuukka Korhonen, Daniel Lokshtanov |
An Improved Parameterized Algorithm for Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.07154, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Baris Can Esmer, Jacob Focke, Dániel Marx, Pawel Rzazewski |
List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.10677, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | André Schidler, Robert Ganian, Manuel Sorge, Stefan Szeider |
Threshold Treewidth and Hypertree Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2210.07040, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Leo van Iersel, Mark Jones 0001, Mathias Weller |
Embedding phylogenetic trees in networks of low treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2207.00574, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek |
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.00594, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Antoine Amarilli, Mikaël Monet |
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.00851, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Markus Hecher |
Advanced Tools and Methods for Treewidth-Based Problem Solving - Extended Abstract. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2208.11340, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini |
Recognizing Map Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2206.14898, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
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) |
CoRR ![In: CoRR abs/2210.03553, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Vladislavs Klevickis, Krisjanis Prusis, Jevgenijs Vihrovs |
Quantum speedups for treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.08186, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
15 | Tesshu Hanaka, Michael Lampis |
Hedonic Games and Treewidth Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.06925, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
15 | Yuzhou Gu, Zhao Song 0002 |
A Faster Small Treewidth SDP Solver. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.06033, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman |
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2205.14897, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Hugo Jacob 0001, Marcin Pilipczuk |
Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2201.09749, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
15 | Cornelius Brand, Esra Ceylan, Christian Hatschka, Robert Ganian, Viktoriia Korchemna |
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.13661, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
15 | Jacob Focke, Dániel Marx, Fionn Mc Inerney, Daniel Neuen, Govind S. Sankar, Philipp Schepper, Philip Wellnitz |
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.04278, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Bogdan Alecu, Vadim V. Lozin, Daniel A. Quiroz, Roman Rabinovich 0001, Igor Razgon, Viktor Zamaraev |
The treewidth and pathwidth of graph unions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.07752, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
15 | Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen |
Problems hard for treewidth but easy for stable gonality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.06838, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
15 | Édouard Bonnet, Hugues Déprés |
Twin-width can be exponential in treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2204.07670, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Hisao Tamaki |
Heuristic computation of exact treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2202.07793, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
15 | Tobias Friedrich 0001, Davis Issac, Nikhil Kumar 0001, Nadym Mallek, Ziena Zeif |
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2211.06267, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Guillaume Mescoff, Christophe Paul, Dimitrios M. Thilikos |
A polynomial time algorithm to compute the connected treewidth of a series-parallel graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 312, pp. 72-85, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Soumen Maity, Charles J. Colbourn |
Mixed covering arrays on graphs of small treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Algorithms Appl. ![In: Discret. Math. Algorithms Appl. 14(1), pp. 2150085:1-2150085:15, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Yuri Faenza, Gonzalo Muñoz, Sebastian Pokutta |
New limits of treewidth-based tractability in optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Program. ![In: Math. Program. 191(2), pp. 559-594, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
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) |
Theory Pract. Log. Program. ![In: Theory Pract. Log. Program. 22(1), pp. 128-157, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher, Irina Schindler |
Default logic and bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 283, pp. 104675, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 |
Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 51(6), pp. 1866-1930, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Peter Bradshaw |
Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 100(2), pp. 362-370, 2022. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Markus Hecher |
Advanced Tools and Methods for Treewidth-Based Problem Solving ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2022 |
DOI RDF |
|
15 | Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo |
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings, pp. 112-125, 2022, Springer, 978-3-031-06900-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Jacob Focke, Dániel Marx, Pawel Rzazewski |
Counting list homomorphisms from graphs of bounded treewidth: tight complexity bounds. ![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. 431-458, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Aditya Jayaprakash, Mohammad R. Salavatipour |
Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension. ![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. 877-893, 2022, SIAM, 978-1-61197-707-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Vladislavs Klevickis, Krisjanis Prusis, Jevgenijs Vihrovs |
Quantum Speedups for Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TQC ![In: 17th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2022, July 11-15, 2022, Urbana Champaign, Illinois, USA., pp. 11:1-11:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-237-2. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Ajinkya Gaikwad, Soumen Maity |
On the Harmless Set Problem Parameterized by Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WALCOM ![In: WALCOM: Algorithms and Computation - 16th International Conference and Workshops, WALCOM 2022, Jember, Indonesia, March 24-26, 2022, Proceedings, pp. 227-238, 2022, Springer, 978-3-030-96730-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Hisao Tamaki |
Heuristic Computation of Exact Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SEA ![In: 20th International Symposium on Experimental Algorithms, SEA 2022, July 25-27, 2022, Heidelberg, Germany., pp. 17:1-17:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-251-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Arnold Filtser, Hung Le 0001 |
Low Treewidth Embeddings of Planar and Minor-Free Metrics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2022, Denver, CO, USA, October 31 - November 3, 2022, pp. 1081-1092, 2022, IEEE, 978-1-6654-5519-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Yizuo Chen, Adnan Darwiche |
On the definition and computation of causal treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UAI ![In: Uncertainty in Artificial Intelligence, Proceedings of the Thirty-Eighth Conference on Uncertainty in Artificial Intelligence, UAI 2022, 1-5 August 2022, Eindhoven, The Netherlands., pp. 368-377, 2022, PMLR. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
15 | Tesshu Hanaka, Michael Lampis |
Hedonic Games and Treewidth Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany., pp. 64:1-64:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-247-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Leo van Iersel, Mark Jones 0001, Mathias Weller |
Embedding Phylogenetic Trees in Networks of Low Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 30th Annual European Symposium on Algorithms, ESA 2022, September 5-9, 2022, Berlin/Potsdam, Germany., pp. 69:1-69:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-247-1. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Mitchell Black, Nello Blaser, Amir Nayyeri, Erlend Raa Vågset |
ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SoCG ![In: 38th International Symposium on Computational Geometry, SoCG 2022, June 7-10, 2022, Berlin, Germany., pp. 17:1-17:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-227-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Antoine Amarilli, Mikaël Monet |
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria., pp. 9:1-9:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-256-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Hans L. Bodlaender, Gunther Cornelissen, Marieke van der Wegen |
Problems Hard for Treewidth but Easy for Stable Gonality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers, pp. 84-97, 2022, Springer, 978-3-031-15913-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Hugo Jacob 0001, Marcin Pilipczuk |
Bounding Twin-Width for Bounded-Treewidth Graphs, Planar Graphs, and Bipartite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers, pp. 287-299, 2022, Springer, 978-3-031-15913-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Cornelius Brand, Esra Ceylan, Robert Ganian, Christian Hatschka, Viktoriia Korchemna |
Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers, pp. 98-113, 2022, Springer, 978-3-031-15913-8. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Wolfgang Dvorák, Markus Hecher, Matthias König 0002, André Schidler, Stefan Szeider, Stefan Woltran |
Tractable Abstract Argumentation via Backdoor-Treewidth. ![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. 5608-5615, 2022, AAAI Press, 978-1-57735-876-3. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Florentina Voboril |
Computing Treewidth with Constraint Programming. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SKILL ![In: Studierendenkonferenz Informatik, SKILL 2022, Hamburg, Germany, 29.-30. September 2022., pp. 115-126, 2022, Gesellschaft für Informatik, Bonn, 978-3-88579-752-4. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
15 | Wolfgang Dvorák, Matthias König 0002, Stefan Woltran |
Treewidth for Argumentation Frameworks with Collective Attacks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMMA ![In: Computational Models of Argument - Proceedings of COMMA 2022, Cardiff, Wales, UK, 14-16 September 2022, pp. 140-151, 2022, IOS Press, 978-1-64368-306-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Matej Lieskovský, Jirí Sgall |
Graph Burning and Non-uniform k-centers for Small Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WAOA ![In: Approximation and Online Algorithms - 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings, pp. 20-35, 2022, Springer, 978-3-031-18366-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Patrizio Angelini, Michael A. Bekos, Giordano Da Lozzo, Martin Gronemann, Fabrizio Montecchiani, Alessandra Tappini |
Recognizing Map Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: 18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2022, June 27-29, 2022, Tórshavn, Faroe Islands., pp. 8:1-8:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-236-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Tobias Friedrich 0001, Davis Issac, Nikhil Kumar 0001, Nadym Mallek, Ziena Zeif |
A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 55:1-55:18, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Hermish Mehta, Daniel Reichman 0001 |
Local Treewidth of Random and Noisy Graphs with Applications to Stopping Contagion in Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX/RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, USA (Virtual Conference)., pp. 7:1-7:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-249-5. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Viktor Besin, Markus Hecher, Stefan Woltran |
Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, IJCAI 2022, Vienna, Austria, 23-29 July 2022., pp. 5264-5268, 2022, ijcai.org. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Taisuke Izumi, Naoki Kitamura, Takamasa Naruse, Gregory Schwartzman |
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SPAA ![In: SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11 - 14, 2022, pp. 11-22, 2022, ACM, 978-1-4503-9146-7. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Dániel Marx, Govind S. Sankar, Philipp Schepper |
Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard). ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 17th International Symposium on Parameterized and Exact Computation, IPEC 2022, September 7-9, 2022, Potsdam, Germany., pp. 22:1-22:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-260-0. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
15 | Ke Liu, Mei Lu |
The treewidth of 2-section of hypergraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 23(3), 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Nina Kamcev, Anita Liebenau, David R. Wood, Liana Yepremyan |
The Size Ramsey Number of Graphs with Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 35(1), pp. 281-293, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Clément Dallard, Martin Milanic, Kenny Storgel |
Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 35(4), pp. 2618-2646, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|
15 | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis |
Faster algorithms for quantitative verification in bounded treewidth graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Formal Methods Syst. Des. ![In: Formal Methods Syst. Des. 57(3), pp. 401-428, 2021. The full citation details ...](Pics/full.jpeg) |
2021 |
DBLP DOI BibTeX RDF |
|