Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | Valentin Bartier, Nicolas Bousquet, Marc Heinrich |
Recoloring graphs of treewidth 2. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
15 | Ivan Aidun, Frances Dean, Ralph Morrison, Teresa Yu, Julie Yuan |
Treewidth and gonality of glued grid graphs. |
Discret. Appl. Math. |
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. |
Int. J. Found. Comput. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Sebastian Wiederrecht |
Digraphs of directed treewidth one. |
Discret. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Michal T. Seweryn |
Improved bound for the dimension of posets of treewidth two. |
Discret. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Nicolas Baudru, Séverine Fratani |
On exteriority notions in book embeddings and treewidth. |
Discret. Math. |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Christian Doczkal, Damien Pous |
Graph Theory in Coq: Minors, Treewidth, and Isomorphisms. |
J. Autom. Reason. |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Bi Li 0004, Xin Zhang 0017 |
Tree-coloring problems of bounded treewidth graphs. |
J. Comb. Optim. |
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. |
J. Comb. Theory, Ser. B |
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. |
J. Graph Theory |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher, Patrick Thier, Stefan Woltran |
Exploiting Database Management Systems and Treewidth for Counting. |
PADL |
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. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Karolina Okrasa, Pawel Rzazewski |
Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs. |
SODA |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Pradeesha Ashok, Rathin Bhargava, Naman Gupta, Mohammad Khalid, Dolly Yadav |
Minimum Conflict Free Colouring Parameterized by Treewidth. |
CALDAM |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler |
Lower Bounds for QBFs of Bounded Treewidth. |
LICS |
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. |
FOCS |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Eva-Maria C. Hols, Stefan Kratsch, Astrid Pieterse |
Approximate Turing Kernelization for Problems Parameterized by Treewidth. |
ESA |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Karolina Okrasa, Marta Piecyk, Pawel Rzazewski |
Full Complexity Classification of the List Homomorphism Problem for Bounded-Treewidth Graphs. |
ESA |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Rémy Belmonte, Eun Jung Kim 0002, Michael Lampis, Valia Mitsou, Yota Otachi |
Grundy Distinguishes Treewidth from Pathwidth. |
ESA |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Martin Fürer, Carlos Hoppen, Vilmar Trevisan |
Efficient Diagonalization of Symmetric Matrices Associated with Graphs of Small Treewidth. |
ICALP |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Daniel Wiebking |
Graph Isomorphism in Quasipolynomial Time Parameterized by Treewidth. |
ICALP |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Taisuke Izumi, Yota Otachi |
Sublinear-Space Lexicographic Depth-First Search for Bounded Treewidth Graphs and Planar Graphs. |
ICALP |
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. |
ATVA |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Youssou Dieng, Cyril Gavoille |
On the Treewidth of Planar Minor Free Graphs. |
InterSol |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Ignasi Sau, Uéverton dos Santos Souza |
Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs. |
MFCS |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Clément Dallard, Martin Milanic, Kenny Storgel |
Treewidth Versus Clique Number in Graph Classes with a Forbidden Structure. |
WG |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev |
Knot Diagrams of Treewidth Two. |
WG |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Tesshu Hanaka, Yasuaki Kobayashi, Taiga Sone |
An Optimal Algorithm for Bisection for Bounded-Treewidth Graph. |
FAW |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Markus Hecher, Patrick Thier, Stefan Woltran |
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Friedrich Slivovsky, Stefan Szeider |
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth. |
SAT |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Laura Merker, Torsten Ueckerdt |
The Local Queue Number of Graphs with Bounded Treewidth. |
GD |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher, Maximilian F. I. Kieler |
Treewidth-Aware Quantifier Elimination and Expansion for QCSP. |
CP |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Markus Hecher |
Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All? |
KR |
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. |
WSDM |
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. |
ICML |
2020 |
DBLP BibTeX RDF |
|
15 | Robert Ganian, André Schidler, Manuel Sorge, Stefan Szeider |
Threshold Treewidth and Hypertree Width. |
IJCAI |
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. |
IPEC |
2020 |
DBLP DOI BibTeX RDF |
|
15 | Daniel Vaz 0001 |
Approximation algorithms for network design and cut problems in bounded-treewidth. |
|
2020 |
RDF |
|
15 | Fábio Botler, Cristina G. Fernandes, Juan Gutiérrez |
On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth. |
LAGOS |
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. |
Discret. Math. Theor. Comput. Sci. |
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. |
J. Graph Algorithms Appl. |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak |
Counting Linear Extensions: Parameterizations by Treewidth. |
Algorithmica |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele |
Turbocharging Treewidth Heuristics. |
Algorithmica |
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. |
Algorithmica |
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. |
Theor. Comput. Sci. |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Michal Ziobro, Marcin Pilipczuk |
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation. |
ACM J. Exp. Algorithmics |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Ludmila Glinskih, Dmitry Itsykson |
On Tseitin formulas, read-once branching programs and treewidth. |
Electron. Colloquium Comput. Complex. |
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. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Silviu Maniu, Pierre Senellart, Suraj Jog |
An Experimental Study of the Treewidth of Real-World Graph Data (Extended Version). |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher |
Treewidth and Counting Projected Answer Sets. |
CoRR |
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. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Miguel Romero 0001, Marcin Wrochna, Stanislav Zivný |
Treewidth-Pliability and PTAS for Max-CSPs. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Rahul Jain 0015, Raghunath Tewari |
Reachability in High Treewidth Graphs. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani |
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Karolina Okrasa, Pawel Rzazewski |
Fine-grained complexity of graph homomorphism problem for bounded-treewidth graphs. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Sergio Cabello |
Computing the inverse geodesic length in planar graphs and graphs of bounded treewidth. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Boi Faltings, Martin Charles Golumbic |
An Effective Upperbound on Treewidth Using Partial Fill-in of Separators. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Hans L. Bodlaender, Benjamin A. Burton, Fedor V. Fomin, Alexander Grigoriev |
Knot Diagrams of Treewidth Two. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Andrea Calì, Igor Razgon |
Regular resolution for CNF of bounded incidence treewidth with few long clauses. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Markus Hecher |
Answer Set Solving exploiting Treewidth and its Limits. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Ei Ando |
The Distribution Function of the Longest Path Length in Constant Treewidth DAGs with Random Edge Length. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Gregory Rosenthal |
Beating Treewidth for Average-Case Subgraph Isomorphism. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Hisao Tamaki |
A heuristic use of dynamic programming to upperbound treewidth. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Édouard Bonnet, Nidhi Purohit |
Metric Dimension Parameterized by Treewidth. |
CoRR |
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. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Julien Baste, Ignasi Sau, Dimitrios M. Thilikos |
Hitting minors on bounded treewidth graphs. IV. An optimal algorithm. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Sebastian Wiederrecht |
A Note on Directed Treewidth. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher, Andreas Pfandler |
TE-ETH: Lower Bounds for QBFs of Bounded Treewidth. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Daniel Wiebking |
Graph isomorphism in quasipolynomial time parameterized by treewidth. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Nina Kamcev, Anita Liebenau, David Wood, Liana Yepremyan |
The size Ramsey number of graphs with bounded treewidth. |
CoRR |
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. |
CoRR |
2019 |
DBLP BibTeX RDF |
|
15 | Frank Kammer, Johannes Meintrup, Andrej Sajenko |
Space-Efficient Vertex Separators for Treewidth. |
CoRR |
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. |
Log. Methods Comput. Sci. |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Kristóf Huszár, Jonathan Spreer, Uli Wagner 0001 |
On the treewidth of triangulated 3-manifolds. |
J. Comput. Geom. |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Borislav Slavchev, Evelina Masliankova, Steven Kelk |
A Machine Learning Approach to Algorithm Selection for Exact Computation of Treewidth. |
Algorithms |
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. |
ACM Trans. Program. Lang. Syst. |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Hisao Tamaki |
Positive-instance driven dynamic programming for treewidth. |
J. Comb. Optim. |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Zdenek Dvorák 0001, Sergey Norin |
Treewidth of graphs with balanced separations. |
J. Comb. Theory, Ser. B |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Rahul Jain 0015, Raghunath Tewari |
Reachability in High Treewidth Graphs. |
ISAAC |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Anupam Gupta 0001, Euiwoong Lee, Jason Li 0006, Pasin Manurangsi, Michal Wlodarczyk 0001 |
Losing Treewidth by Separating Subsets. |
SODA |
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. |
SODA |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady |
The treewidth of smart contracts. |
SAC |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Eduard Eiben, Daniel Lokshtanov, Amer E. Mouawad |
Bisection of Bounded Treewidth Graphs by Convolutions. |
ESA |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Kristóf Huszár, Jonathan Spreer |
3-Manifold Triangulations with Small Treewidth. |
SoCG |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Hisao Tamaki |
Computing Treewidth via Exact and Heuristic Lists of Minimal Separators. |
SEA² |
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. |
MFCS |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher |
Treewidth and Counting Projected Answer Sets. |
LPNMR |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Ludmila Glinskih, Dmitry Itsykson |
On Tseitin Formulas, Read-Once Branching Programs and Treewidth. |
CSR |
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. |
WADS |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Emilio Di Giacomo, Giuseppe Liotta, Fabrizio Montecchiani |
Sketched Representations and Orthogonal Planarity of Bounded Treewidth Graphs. |
GD |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Silviu Maniu, Pierre Senellart, Suraj Jog |
An Experimental Study of the Treewidth of Real-World Graph Data. |
ICDT |
2019 |
DBLP DOI BibTeX RDF |
|
15 | David Mitchell |
Guarded Constraint Models Define Treewidth Preserving Reductions. |
CP |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Lusheng Wang 0001, Boting Yang |
The One-Cop-Moves Game on Graphs of Small Treewidth. |
COCOA |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Aldo Pacchiano, Yoram Bachrach |
Computing Stable Solutions in Threshold Network Flow Games With Bounded Treewidth. |
AAMAS |
2019 |
DBLP BibTeX RDF |
|
15 | Édouard Bonnet, Nidhi Purohit |
Metric Dimension Parameterized by Treewidth. |
IPEC |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Gregory Rosenthal |
Beating Treewidth for Average-Case Subgraph Isomorphism. |
IPEC |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Jiawei Gao 0001 |
On the Fine-Grained Complexity of Least Weight Subsequence in Multitrees and Bounded Treewidth DAGs. |
IPEC |
2019 |
DBLP DOI BibTeX RDF |
|
15 | Tom C. van der Zanden |
Theory and Practical Applications of Treewidth. |
|
2019 |
RDF |
|
15 | Henning Bruhn, Laura Gellert, Richard Lang |
Chromatic Index, Treewidth and Maximum Degree. |
Electron. J. Comb. |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Thiago Braga Marcilon, Rudini Menezes Sampaio |
The P3 infection time is W[1]-hard parameterized by the treewidth. |
Inf. Process. Lett. |
2018 |
DBLP DOI BibTeX RDF |
|