Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | Anshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma, Sonika Thakral |
Replica Placement on Bounded Treewidth Graphs. |
WADS |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Robert Ganian, M. S. Ramanujan 0001, Stefan Szeider |
Combining Treewidth and Backdoors for CSP. |
STACS |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Therese Biedl, Saeed Mehrabi 0001 |
On Guarding Orthogonal Polygons with Bounded Treewidth. |
CCCG |
2017 |
DBLP BibTeX RDF |
|
15 | Bernhard Bliem |
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs. |
Ausgezeichnete Informatikdissertationen |
2017 |
DBLP BibTeX RDF |
|
15 | Gianluigi Greco, Francesco Lupia, Francesco Scarcello |
The Tractability of the Shapley Value over Bounded Treewidth Matching Games. |
IJCAI |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Bernhard Bliem, Marius Moldovan, Michael Morak, Stefan Woltran |
The Impact of Treewidth on ASP Grounding and Solving. |
IJCAI |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Mark Rowland, Aldo Pacchiano, Adrian Weller |
Conditions beyond treewidth for tightness of higher-order LP relaxations. |
AISTATS |
2017 |
DBLP BibTeX RDF |
|
15 | Michael Lampis, Valia Mitsou |
Treewidth with a Quantifier Alternation Revisited. |
IPEC |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Julien Baste, Ignasi Sau, Dimitrios M. Thilikos |
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. |
IPEC |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Tom C. van der Zanden, Hans L. Bodlaender |
Computing Treewidth on the GPU. |
IPEC |
2017 |
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. |
IPEC |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Ioan Todinca |
Exact Algorithms for Treewidth. |
Encyclopedia of Algorithms |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Hans L. Bodlaender |
Treewidth of Graphs. |
Encyclopedia of Algorithms |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Stefan Kratsch |
Kernelization, Preprocessing for Treewidth. |
Encyclopedia of Algorithms |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Julia Chuzhoy |
Large-Treewidth Graph Decompositions. |
Encyclopedia of Algorithms |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Henning Bruhn, Laura Gellert, Richard Lang |
Chromatic index, treewidth and maximum degree. |
Electron. Notes Discret. Math. |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Mehdy Roayaei, Mohammadreza Razzazi |
An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification. |
Inf. Process. Lett. |
2016 |
DBLP DOI BibTeX RDF |
|
15 | David Coudert, Guillaume Ducoffe, Nicolas Nisse |
To Approximate Treewidth, Use Treelength! |
SIAM J. Discret. Math. |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Igor Razgon |
On the Read-Once Property of Branching Programs and CNFs of Bounded Treewidth. |
Algorithmica |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider |
Model Counting for CNF Formulas of Bounded Modular Treewidth. |
Algorithmica |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Sigve Hortemo Sæther, Jan Arne Telle |
Between Treewidth and Clique-Width. |
Algorithmica |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks |
Constructing minimum changeover cost arborescenses in bounded treewidth graphs. |
Theor. Comput. Sci. |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Jie Liu, Jinglei Liu |
The Treewidth of Induced Graphs of Conditional Preference Networks Is Small. |
Inf. |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Mikolaj Bojanczyk, Michal Pilipczuk |
Definability equals recognizability for graphs of bounded treewidth. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
15 | Julien Baste, Marc Noy, Ignasi Sau |
The number of labeled graphs of bounded treewidth. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
15 | Mateus de Oliveira Oliveira |
A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth. |
CoRR |
2016 |
DBLP 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. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
15 | Robert Ganian, M. S. Ramanujan 0001, Stefan Szeider |
Combining Treewidth and Backdoors for CSP. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
15 | Nikhil Bansal 0001, Daniel Reichman 0001, Seeun William Umboh |
Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
15 | Zongwen Bai, Jianhua Tu, Yongtang Shi |
An improved algorithm for the vertex cover P3 problem on graphs of bounded treewidth. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
15 | Mauro Scanagatta, Giorgio Corani, Cassio P. de Campos, Marco Zaffalon |
Learning Bounded Treewidth Bayesian Networks with Thousands of Variables. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
15 | Kitty Meeks |
The challenges of unbounded treewidth in parameterised subgraph counting problems. |
Discret. Appl. Math. |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Masashi Kiyomi, Yoshio Okamoto, Yota Otachi |
On the treewidth of toroidal grids. |
Discret. Appl. Math. |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Mateus de Oliveira Oliveira |
An algorithmic metatheorem for directed treewidth. |
Discret. Appl. Math. |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Itamar Hartstein, Mordechai Shalom, Shmuel Zaks |
On the complexity of the regenerator location problem treewidth and other parameters. |
Discret. Appl. Math. |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Uriel Feige, Jonathan Hermon, Daniel Reichman 0001 |
On giant components and treewidth in the layers model. |
Random Struct. Algorithms |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Kitty Meeks, Alexander Scott 0001 |
The parameterised complexity of list problems on graphs of bounded treewidth. |
Inf. Comput. |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Chi Wang, Edmond A. Jonckheere, Todd A. Brun |
Differential geometric treewidth estimation in adiabatic quantum computation. |
Quantum Inf. Process. |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Hao Chen, Zihan Lei, Tian Liu 0001, Ziyang Tang, Chaoyi Wang, Ke Xu 0001 |
Complexity of domination, hamiltonicity and treewidth for tree convex bipartite graphs. |
J. Comb. Optim. |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk |
A ck n 5-Approximation Algorithm for Treewidth. |
SIAM J. Comput. |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Henning Bruhn, Richard Lang, Maya Stein |
List Edge-Coloring and Total Coloring in Graphs of Low Treewidth. |
J. Graph Theory |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Radu Curticapean, Dániel Marx |
Tight conditional lower bounds for counting perfect matchings on graphs of bounded treewidth, cliquewidth, and genus. |
SODA |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Mikolaj Bojanczyk, Michal Pilipczuk |
Definability equals recognizability for graphs of bounded treewidth. |
LICS |
2016 |
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. |
FOCS |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis |
Algorithms for algebraic path properties in concurrent systems of constant treewidth components. |
POPL |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Thomas Bläsius, Tobias Friedrich 0001, Anton Krohmer |
Hyperbolic Random Graphs: Separators and Treewidth. |
ESA |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis |
Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs. |
ESA |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Eduard Eiben, Robert Ganian, Kustaa Kangas, Sebastian Ordyniak |
Counting Linear Extensions: Parameterizations by Treewidth. |
ESA |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Dániel Marx, Valia Mitsou |
Double-Exponential and Triple-Exponential Bounds for Choosability Problems Parameterized by Treewidth. |
ICALP |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Mikaël Monet |
Probabilistic Evaluation of Expressive Queries on Bounded-Treewidth Instances. |
SIGMOD PhD Symposium |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Dominik Peters |
Graphical Hedonic Games of Bounded Treewidth. |
AAAI |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Mateus de Oliveira Oliveira |
Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function. |
STACS |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Petr Kolman, Martin Koutecký, Hans Raj Tiwary |
Extension Complexity, MSO Logic, and Treewidth . |
SWAT |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski |
On Routing Disjoint Paths in Bounded Treewidth Graphs. |
SWAT |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Mauro Scanagatta, Giorgio Corani, Cassio P. de Campos, Marco Zaffalon |
Learning Treewidth-Bounded Bayesian Networks with Thousands of Variables. |
NIPS |
2016 |
DBLP BibTeX RDF |
|
15 | Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele |
Turbocharging Treewidth Heuristics. |
IPEC |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Thore Husfeldt |
Computing Graph Distances Parameterized by Treewidth and Diameter. |
IPEC |
2016 |
DBLP DOI BibTeX RDF |
|
15 | Hans L. Bodlaender, Pinar Heggernes, Jan Arne Telle |
Recognizability Equals Definability for Graphs of Bounded Treewidth and Bounded Chordality. |
Electron. Notes Discret. Math. |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Petr Kolman, Martin Koutecký |
Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth. |
Electron. J. Comb. |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Chia-Jung Chang, Takeyuki Tamura, Kun-Mao Chao, Tatsuya Akutsu |
A Fixed-Parameter Algorithm for Detecting a Singleton Attractor in an AND/OR Boolean Network with Bounded Treewidth. |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Alexander Grigoriev, Steven Kelk, Nela Lekic |
On Low Treewidth Graphs and Supertrees. |
J. Graph Algorithms Appl. |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Adrian Kosowski, Bi Li 0004, Nicolas Nisse, Karol Suchan |
k-Chordal Graphs: From Cops and Robber to Compact Routing via Treewidth. |
Algorithmica |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Bart M. P. Jansen |
On Sparsification for Computing Treewidth. |
Algorithmica |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Antonis Thomas, Jan van Leeuwen |
Pure Nash Equilibria in Graphical Games and Treewidth. |
Algorithmica |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Julien Baste, Ignasi Sau |
The role of planarity in connectivity problems parameterized by treewidth. |
Theor. Comput. Sci. |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Steven Chaplick, Jirí Fiala 0001, Pim van 't Hof, Daniël Paulusma, Marek Tesar 0001 |
Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree. |
Theor. Comput. Sci. |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Krishnendu Chatterjee, Amir Kafshdar Goharshady, Rasmus Ibsen-Jensen, Andreas Pavlogiannis |
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
15 | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis |
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
15 | Marcin Pilipczuk |
A tight lower bound for Vertex Planarization on graphs of bounded treewidth. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
15 | Vida Dujmovic, David Eppstein, David R. Wood |
Genus, Treewidth, and Local Crossing Number. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
15 | Nikhil Balaji, Samir Datta, Venkatesh Ganesan |
Counting Euler Tours in Undirected Bounded Treewidth Graphs. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
15 | Igor Razgon |
On oblivious branching programs with bounded repetition that cannot efficiently compute CNFs of bounded treewidth. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
15 | Alina Ene, Matthias Mnich, Marcin Pilipczuk, Andrej Risteski |
On Routing Disjoint Paths in Bounded Treewidth Graphs. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
15 | Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post |
A (1 + ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
15 | Bart M. P. Jansen, Stefan Kratsch |
A structural approach to kernels for ILPs: Treewidth and Total Unimodularity. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
15 | Petr Kolman, Martin Koutecký |
Extended Formulation for CSP that is Compact for Instances of Bounded Treewidth. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
15 | Petr Kolman, Martin Koutecký, Hans Raj Tiwary |
Extension Complexity, MSO Logic, and Treewidth. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
15 | Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh 0001, Marcin Wrochna |
Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
15 | Justin Domke |
Maximum Likelihood Learning With Arbitrary Treewidth via Fast-Mixing Parameter Sets. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
15 | Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof |
Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. |
Inf. Comput. |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Daniel J. Harvey, David R. Wood |
Treewidth of the Line Graph of a Complete Graph. |
J. Graph Theory |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis |
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs. |
CAV (1) |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Didem Gözüpek, Hadas Shachnai, Mordechai Shalom, Shmuel Zaks |
Constructing Minimum Changeover Cost Arborescenses in Bounded Treewidth Graphs. |
CTW |
2015 |
DBLP BibTeX RDF |
|
15 | Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, M. S. Ramanujan 0001, Saket Saurabh 0001 |
Solving d-SAT via Backdoors to Small Treewidth. |
SODA |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Chandra Chekuri, Julia Chuzhoy |
Degree-3 Treewidth Sparsifiers. |
SODA |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Nikhil Balaji, Samir Datta |
Bounded Treewidth and Space-Efficient Linear Algebra. |
TAMC |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal |
Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth. |
POPL |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Bart M. P. Jansen, Stefan Kratsch |
A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity. |
ESA |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Andreas Emil Feldmann, Wai Shing Fung, Jochen Könemann, Ian Post |
A (1+ε)-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs. |
ICALP (1) |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Arnoud Pastink, Linda C. van der Gaag |
Multi-classifiers of Small Treewidth. |
ECSQARU |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Mateus de Oliveira Oliveira |
On the Satisfiability of Quantum Circuits of Small Treewidth. |
CSR |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Vida Dujmovic, David Eppstein, David R. Wood |
Genus, Treewidth, and Local Crossing Number. |
GD |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Justin Domke |
Maximum Likelihood Learning With Arbitrary Treewidth via Fast-Mixing Parameter Sets. |
NIPS |
2015 |
DBLP BibTeX RDF |
|
15 | Jessica A. Enright, Kitty Meeks |
Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth. |
COCOA |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Niranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman 0001, Sasanka Roy, Saket Saurabh 0001 |
Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs. |
COCOON |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Nikhil Balaji, Samir Datta, Venkatesh Ganesan |
Counting Euler Tours in Undirected Bounded Treewidth Graphs. |
FSTTCS |
2015 |
DBLP DOI BibTeX RDF |
|
15 | Yu (Ledell) Wu, Per Austrin, Toniann Pitassi, David Liu 0003 |
Inapproximability of Treewidth and Related Problems (Extended Abstract). |
IJCAI |
2015 |
DBLP BibTeX RDF |
|
15 | Daniel J. Harvey, David R. Wood |
Treewidth of the Kneser Graph and the Erdős-Ko-Rado Theorem. |
Electron. J. Comb. |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Arash Farzan, Shahin Kamali |
Compact Navigation and Distance Oracles for Graphs with Small Treewidth. |
Algorithmica |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Bernard Mans, Luke Mathieson |
On the treewidth of dynamic graphs. |
Theor. Comput. Sci. |
2014 |
DBLP DOI BibTeX RDF |
|