Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | Daniel Lokshtanov, Dániel Marx, Saket Saurabh 0001 |
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 14(2), pp. 13:1-13:30, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Michal Pilipczuk, Marcin Wrochna |
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 14(3), pp. 34:1-34:45, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Pengfei Wan, Jianhua Tu, Shenggui Zhang, Binlong Li |
Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Math. Comput. ![In: Appl. Math. Comput. 332, pp. 42-47, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Mauro Scanagatta, Giorgio Corani, Marco Zaffalon, Jaemin Yoo, U Kang |
Efficient learning of bounded-treewidth Bayesian networks from complete and incomplete data sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Approx. Reason. ![In: Int. J. Approx. Reason. 95, pp. 152-166, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Michael J. Bannister, David Eppstein |
Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 22(4), pp. 577-606, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Petr Kolman |
On Algorithms Employing Treewidth for L-bounded Cut Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 22(2), pp. 177-191, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Eli Berger, Zdenek Dvorák 0001, Sergey Norin |
Treewidth of Grid Subsets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 38(6), pp. 1337-1352, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Jessica A. Enright, Kitty Meeks |
Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 80(6), pp. 1857-1889, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Julien Baste, Marc Noy, Ignasi Sau |
On the number of labeled graphs of bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 71, pp. 12-21, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Steven Kelk, Georgios Stamoulis, Taoyang Wu |
Treewidth distance on phylogenetic trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 731, pp. 99-117, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Xinmin Hou, Lei Yu, Jiaao Li, Boyuan Liu |
Odd Induced Subgraphs in Graphs with Treewidth at Most Two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Graphs Comb. ![In: Graphs Comb. 34(4), pp. 535-544, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Mateus de Oliveira Oliveira |
Size-Treewidth Tradeoffs for Circuits Computing the Element Distinctness Function. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 62(1), pp. 136-161, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
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) |
CoRR ![In: CoRR abs/1804.03884, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Kristóf Huszár, Jonathan Spreer |
3-Manifold triangulations with small treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1812.05528, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Karl Bringmann, Thore Husfeldt, Måns Magnusson |
Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1805.07135, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Yuri Faenza, Gonzalo Muñoz, Sebastian Pokutta |
Limits of Treewidth-based tractability in Optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1807.02551, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Michal Ziobro, Marcin Pilipczuk |
Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1803.00927, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz 0001 |
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1802.10403, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP 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) |
CoRR ![In: CoRR abs/1809.00907, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Mauro Scanagatta, Giorgio Corani, Marco Zaffalon, Jaemin Yoo, U Kang |
Efficient Learning of Bounded-Treewidth Bayesian Networks from Complete and Incomplete Data Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1802.02468, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Jason Li 0006 |
Distributed Treewidth Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1805.10708, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Johannes Klaus Fichte, Michael Morak, Markus Hecher, Stefan Woltran |
Exploiting Treewidth for Projected Model Counting and its Limits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1805.05445, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Eugene F. Dumitrescu, Allison L. Fisher, Timothy D. Goodrich, Travis S. Humble, Blair D. Sullivan, Andrew L. Wright |
Benchmarking treewidth as a practical component of tensor-network-based quantum simulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1807.04599, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP 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) |
CoRR ![In: CoRR abs/1804.01366, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Bernhard Bliem, Stefan Woltran |
Defensive alliances in graphs of bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 251, pp. 334-339, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady, Andreas Pavlogiannis |
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Program. Lang. Syst. ![In: ACM Trans. Program. Lang. Syst. 40(3), pp. 9:1-9:43, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Miaomiao Han, You Lu 0002, Rong Luo, Zhengke Miao |
Neighbor sum distinguishing total coloring of graphs with bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 36(1), pp. 23-34, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Daniel J. Harvey, David R. Wood |
The treewidth of line graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 132, pp. 157-179, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 47(4), pp. 1667-1704, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi, Pavel Pudlák |
Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pp. 247-261, 2018, SIAM, 978-1-61197-503-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Mateus de Oliveira Oliveira |
A Near-Quadratic Lower Bound for the Size of Quantum Circuits of Constant Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018, pp. 136-145, 2018, SIAM, 978-1-61197-503-1. The full citation details ...](Pics/full.jpeg) |
2018 |
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) |
SEA ![In: 17th International Symposium on Experimental Algorithms, SEA 2018, June 27-29, 2018, L'Aquila, Italy, pp. 29:1-29:14, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-070-5. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher, Stefan Woltran, Markus Zisser |
Weighted Model Counting on the GPU by Exploiting Small Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, pp. 28:1-28:16, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-081-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Daniel Lokshtanov, M. S. Ramanujan 0001, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi |
Brief Announcement: Treewidth Modulator: Emergency Exit for DFVS. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018, July 9-13, 2018, Prague, Czech Republic, pp. 110:1-110:4, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-076-7. The full citation details ...](Pics/full.jpeg) |
2018 |
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) |
SoCG ![In: 34th International Symposium on Computational Geometry, SoCG 2018, June 11-14, 2018, Budapest, Hungary, pp. 46:1-46:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-066-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher, Irina Schindler |
Default Logic and Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATA ![In: Language and Automata Theory and Applications - 12th International Conference, LATA 2018, Ramat Gan, Israel, April 9-11, 2018, Proceedings, pp. 130-142, 2018, Springer, 978-3-319-77312-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Christian Doczkal, Damien Pous |
Treewidth-Two Graphs as a Free Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, August 27-31, 2018, Liverpool, UK, pp. 60:1-60:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-086-6. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna |
On Directed Feedback Vertex Set Parameterized by Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 44th International Workshop, WG 2018, Cottbus, Germany, June 27-29, 2018, Proceedings, pp. 65-78, 2018, Springer, 978-3-030-00255-8. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran |
Exploiting Treewidth for Projected Model Counting and Its Limits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2018 - 21st International Conference, SAT 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings, pp. 165-184, 2018, Springer, 978-3-319-94143-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Eduard Eiben, Robert Ganian, Sebastian Ordyniak |
Small Resolution Proofs for QBF using Dependency Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 28:1-28:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | László Egri, Dániel Marx, Pawel Rzazewski |
Finding List Homomorphisms from Bounded-treewidth Graphs to Reflexive Graphs: a Complete Complexity Characterization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France, pp. 27:1-27:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-062-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Christian Doczkal, Guillaume Combette, Damien Pous |
A Formal Proof of the Minor-Exclusion Property for Treewidth-Two Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ITP ![In: Interactive Theorem Proving - 9th International Conference, ITP 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings, pp. 178-195, 2018, Springer, 978-3-319-94820-1. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher |
Exploiting Treewidth for Counting Projected Answer Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KR ![In: Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 October - 2 November 2018., pp. 639-640, 2018, AAAI Press, 978-1-57735-803-9. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
15 | Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz 0001 |
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APPROX-RANDOM ![In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2018, August 20-22, 2018 - Princeton, NJ, USA, pp. 8:1-8:19, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-085-9. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Bernhard Bliem |
ASP Programs with Groundings of Small Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoIKS ![In: Foundations of Information and Knowledge Systems - 10th International Symposium, FoIKS 2018, Budapest, Hungary, May 14-18, 2018, Proceedings, pp. 97-113, 2018, Springer, 978-3-319-90049-0. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Julien Baste, Ignasi Sau, Dimitrios M. Thilikos |
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: 13th International Symposium on Parameterized and Exact Computation, IPEC 2018, August 20-24, 2018, Helsinki, Finland, pp. 2:1-2:13, 2018, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-084-2. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
15 | Fábio Botler, Maycon Sambinelli |
Gallai's conjecture for graphs with treewidth 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 62, pp. 147-152, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Gwenaël Joret, Piotr Micek, William T. Trotter, Ruidong Wang, Veit Wiechert |
On the Dimension of Posets with Cover Graphs of Treewidth 2. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 34(2), pp. 185-234, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Krishnendu Chatterjee, Georg Osang |
Pushdown reachability with constant treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Process. Lett. ![In: Inf. Process. Lett. 122, pp. 25-29, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Takayoshi Shoudai, Takashi Yamada |
A Polynomial Time Pattern Matching Algorithm on Graph Patterns of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEICE Trans. Fundam. Electron. Commun. Comput. Sci. ![In: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(9), pp. 1764-1772, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Dieter Mitsche, Guillem Perarnau |
On Treewidth and Related Parameters of Random Geometric Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 31(2), pp. 1328-1354, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Mateus de Oliveira Oliveira |
On the Satisfiability of Quantum Circuits of Small Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 61(2), pp. 656-688, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Igor Razgon |
On Oblivious Branching Programs with Bounded Repetition that Cannot Efficiently Compute CNFs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 61(3), pp. 755-776, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Glencora Borradaile, Jeff Erickson 0001, Hung Le 0001, Robbie Weber |
Embedded-width: A variant of treewidth for plane graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1703.07532, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Bernhard Bliem, Stefan Woltran |
Defensive Alliances in Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1707.04251, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
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) |
CoRR ![In: CoRR abs/1703.00544, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher, Irina Schindler |
Default Logic and Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1706.09393, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Vladislav Ryzhikov, Michael Zakharyaschev |
The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1702.03358, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Therese Biedl, Saeed Mehrabi 0001 |
On Guarding Orthogonal Polygons with Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1706.02028, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Simone Bova, Stefan Szeider |
Circuit Treewidth, Sentential Decision, and Query Compilation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1701.04626, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Fábio Botler, Maycon Sambinelli, Rafael S. Coelho, Orlando Lee |
On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1706.04334, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Hisao Tamaki |
Positive-instance driven dynamic programming for treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1704.05286, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Sushmita Gupta, Saket Saurabh 0001, Meirav Zehavi |
On Treewidth and Stable Marriage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1707.05404, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Glencora Borradaile, Morgan Shirley |
Time-dependent shortest paths in bounded treewidth graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1706.01508, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran |
Answer Set Solving with Bounded Treewidth Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1702.02890, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Julien Baste, Ignasi Sau, Dimitrios M. Thilikos |
Hitting minors on bounded treewidth graphs. I. General upper bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1704.07284, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Amir Kafshdar Goharshady, Fatemeh Mohammadi |
A Short Note on Parameterized Computation of Network Reliability with respect to Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1712.09692, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP 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) |
CoRR ![In: CoRR abs/1712.00434, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP 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) |
CoRR ![In: CoRR abs/1704.06757, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Eduard Eiben, Robert Ganian, Sebastian Ordyniak |
Small Resolution Proofs for QBF using Dependency Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1711.02120, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Tom C. van der Zanden, Hans L. Bodlaender |
Computing Treewidth on the GPU. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1709.09990, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Glencora Borradaile, Hung Le 0001 |
Light spanners for bounded treewidth graphs imply light spanners for $H$-minor-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1703.10633, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna |
On Directed Feedback Vertex Set parameterized by treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1707.01470, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Steven Kelk, Georgios Stamoulis, Taoyang Wu |
Treewidth distance on phylogenetic trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1703.10840, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Shai Vardi |
Randomly coloring graphs of bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1708.02677, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Anshul Aggarwal, Venkatesan T. Chakaravarthy, Neelima Gupta, Yogish Sabharwal, Sachin Sharma, Sonika Thakral |
Replica Placement on Bounded Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1705.00145, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP BibTeX RDF |
|
15 | Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen, O-joung Kwon, Seongmin Ok |
Characterizing width two for variants of treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 216, pp. 29-46, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Marcin Pilipczuk |
A tight lower bound for Vertex Planarization on graphs of bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 231, pp. 211-216, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger |
Treewidth and Pathwidth parameterized by the vertex cover number. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 216, pp. 114-129, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Moritz Müller, Stefan Szeider |
The treewidth of proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 255, pp. 147-164, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk |
Hitting forbidden subgraphs in graphs of bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 256, pp. 62-82, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Jianhua Tu, Lidong Wu, Jing Yuan 0002, Lei Cui 0010 |
On the vertex cover P3 problem parameterized by treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 34(2), pp. 414-425, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 |
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 46(1), pp. 161-189, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Daniel J. Harvey, David R. Wood |
Parameters Tied to Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 84(4), pp. 364-385, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Amir Nayyeri, Benjamin Raichel |
A Treehouse with Custom Windows: Minimum Distortion Embeddings into Bounded Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pp. 724-736, 2017, SIAM, 978-1-61197-478-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Nikhil Bansal 0001, Daniel Reichman 0001, Seeun William Umboh |
LP-Based Robust Algorithms for Noisy Minor-Free and Bounded Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pp. 1964-1979, 2017, SIAM, 978-1-61197-478-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz 0001 |
Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pp. 737-751, 2017, SIAM, 978-1-61197-478-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI 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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pp. 1419-1432, 2017, SIAM, 978-1-61197-478-2. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Hisao Tamaki |
Positive-Instance Driven Dynamic Programming for Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: 25th Annual European Symposium on Algorithms, ESA 2017, September 4-6, 2017, Vienna, Austria, pp. 68:1-68:13, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-049-1. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Bernhard Bliem |
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICLP (Technical Communications) ![In: Technical Communications of the 33rd International Conference on Logic Programming, ICLP 2017, August 28 to September 1, 2017, Melbourne, Australia, pp. 12:1-12:12, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-058-3. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Michal Pilipczuk |
On Definable and Recognizable Properties of Graphs of Bounded Treewidth (Invited Talk). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark, pp. 82:1-82:2, 2017, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-046-0. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Johannes Klaus Fichte, Markus Hecher, Michael Morak, Stefan Woltran |
Answer Set Solving with Bounded Treewidth Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPNMR ![In: Logic Programming and Nonmonotonic Reasoning - 14th International Conference, LPNMR 2017, Espoo, Finland, July 3-6, 2017, Proceedings, pp. 132-145, 2017, Springer, 978-3-319-61659-9. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, Vladislav Ryzhikov, Michael Zakharyaschev |
The Complexity of Ontology-Based Data Access with OWL 2 QL and Bounded Treewidth Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017, pp. 201-216, 2017, ACM, 978-1-4503-4198-1. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Simone Bova, Stefan Szeider |
Circuit Treewidth, Sentential Decision, and Query Compilation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2017, Chicago, IL, USA, May 14-19, 2017, pp. 233-246, 2017, ACM, 978-1-4503-4198-1. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI 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) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers, pp. 344-357, 2017, Springer, 978-3-319-68704-9. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Julien Baste, Marc Noy, Ignasi Sau |
On the Number of Labeled Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers, pp. 88-99, 2017, Springer, 978-3-319-68704-9. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Akanksha Agrawal 0001, Daniel Lokshtanov, Amer E. Mouawad |
Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 43rd International Workshop, WG 2017, Eindhoven, The Netherlands, June 21-23, 2017, Revised Selected Papers, pp. 32-44, 2017, Springer, 978-3-319-68704-9. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Robert Ganian, Sebastian Ordyniak, M. S. Ramanujan 0001 |
Going Beyond Primal Treewidth for (M)ILP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAAI ![In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., pp. 815-821, 2017, AAAI Press. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Neha Lodha, Sebastian Ordyniak, Stefan Szeider |
SAT-Encodings for Special Treewidth and Pathwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings, pp. 429-445, 2017, Springer, 978-3-319-66262-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
15 | Robert Ganian, M. S. Ramanujan 0001, Stefan Szeider |
Backdoor Treewidth for SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings, pp. 20-37, 2017, Springer, 978-3-319-66262-6. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|