Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
15 | Masanobu Furuse, Koichi Yamazaki |
A revisit of the scheme for computing treewidth and minimum fill-in. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 531, pp. 66-76, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Yu (Ledell) Wu, Per Austrin, Toniann Pitassi, David Liu 0003 |
Inapproximability of Treewidth and Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 49, pp. 569-600, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Maurice J. Jansen, Jayalal Sarma |
Balancing Bounded Treewidth Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Comput. Syst. ![In: Theory Comput. Syst. 54(2), pp. 318-336, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Nikhil Balaji, Samir Datta |
Bounded Treewidth and Space-Efficient Linear Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1412.2470, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Siqi Nie, Denis Deratani Mauá, Cassio Polpo de Campos, Qiang Ji |
Advances in Learning Bayesian Networks of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1406.1411, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Igor Razgon |
On the read-once property of branching programs and CNFs of bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1411.0264, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Alexander Grigoriev, Steven Kelk, Nela Lekic |
On low treewidth graphs and supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1402.7224, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis, Prateesh Goyal |
Faster Algorithms for Algebraic Path Properties in RSMs with Constant Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1410.7724, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Chandra Chekuri, Julia Chuzhoy |
Degree-3 Treewidth Sparsifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1410.1016, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Sigve Hortemo Sæther, Jan Arne Telle |
Between Treewidth and Clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1404.7758, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Zdenek Dvorák 0001, Sergey Norin |
Treewidth of graphs with balanced separations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1408.3869, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Léon Planken, Mathijs Michiel de Weerdt, Roman van der Krogt |
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1401.4609, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Uriel Feige, Jonathan Hermon, Daniel Reichman 0001 |
On giant components and treewidth in the layers model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1401.6681, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP 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) |
CoRR ![In: CoRR abs/1404.0818, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Mateus de Oliveira Oliveira |
An Algorithmic Metatheorem for Directed Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1410.0589, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Mateus de Oliveira Oliveira |
On the Satisfiability of Quantum Circuits of Small Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1404.5565, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP 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) |
CoRR ![In: CoRR abs/1411.4184, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP 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) |
CoRR ![In: CoRR abs/1408.6321, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP 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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1408.6676, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Kitty Meeks |
The challenges of unbounded treewidth in parameterised subgraph counting problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1402.5857, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Igor Razgon |
No small nondeterministic read-once branching programs for CNFs of bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1407.0491, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Kyohei Kozawa, Yota Otachi, Koichi Yamazaki |
Lower bounds for treewidth of product graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 162, pp. 251-258, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran |
Tractable answer-set programming with weight constraints: bounded treewidth is not enough. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theory Pract. Log. Program. ![In: Theory Pract. Log. Program. 14(2), pp. 141-164, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Daniel Reidenbach, Markus L. Schmid |
Patterns with bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 239, pp. 87-99, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Jonathan L. Gross |
Embeddings of graphs of fixed treewidth and bounded degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Math. Contemp. ![In: Ars Math. Contemp. 7(2), pp. 379-403, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Georg Gottlob, Gianluigi Greco, Francesco Scarcello |
Treewidth and Hypertree Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Tractability ![In: Tractability: Practical Approaches to Hard Problems, pp. 3-38, 2014, Cambridge University Press, 9781139177801. The full citation details ...](Pics/full.jpeg) |
2014 |
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) |
FOCS ![In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18-21, 2014, pp. 186-195, 2014, IEEE Computer Society, 978-1-4799-6517-5. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Daniel J. Rosenkrantz, Madhav V. Marathe, Ravi Sundaram, Anil Vullikanti |
Bayesian Inference in Treewidth-Bounded Graphical Models Without Indegree Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UAI ![In: Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, UAI 2014, Quebec City, Quebec, Canada, July 23-27, 2014, pp. 702-711, 2014, AUAI Press, 978-0-9749039-1-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP 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) |
MFCS (2) ![In: Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II, pp. 189-200, 2014, Springer, 978-3-662-44464-1. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Johan Kwisthout |
Treewidth and the Computational Complexity of MAP Approximations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Probabilistic Graphical Models ![In: Probabilistic Graphical Models - 7th European Workshop, PGM 2014, Utrecht, The Netherlands, September 17-19, 2014. Proceedings, pp. 271-285, 2014, Springer, 978-3-319-11432-3. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Sigve Hortemo Sæther, Jan Arne Telle |
Between Treewidth and Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, pp. 396-407, 2014, Springer, 978-3-319-12339-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Alexander Grigoriev, Steven Kelk, Nela Lekic |
On Low Treewidth Graphs and Supertrees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AlCoB ![In: Algorithms for Computational Biology - First International Conference, AlCoB 2014, Tarragona, Spain, July 1-3, 2014, Proceedigns, pp. 71-82, 2014, Springer, 978-3-319-07952-3. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Chaoyi Wang, Hao Chen, Zihan Lei, Ziyang Tang, Tian Liu 0001, Ke Xu 0001 |
Tree Convex Bipartite Graphs: NP -Complete Domination, Hamiltonicity and Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FAW ![In: Frontiers in Algorithmics - 8th International Workshop, FAW 2014, Zhangjiajie, China, June 28-30, 2014. Proceedings, pp. 252-263, 2014, Springer, 978-3-319-08015-4. The full citation details ...](Pics/full.jpeg) |
2014 |
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) |
GD ![In: Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014, Revised Selected Papers, pp. 210-221, 2014, Springer, 978-3-662-45802-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Jeremias Berg, Matti Järvisalo |
SAT-Based Approaches to Treewidth Computation: An Evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, Cyprus, November 10-12, 2014, pp. 328-335, 2014, IEEE Computer Society, 978-1-4799-6572-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Siqi Nie, Denis Deratani Mauá, Cassio P. de Campos, Qiang Ji |
Advances in Learning Bayesian Networks of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
NIPS ![In: Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, December 8-13 2014, Montreal, Quebec, Canada, pp. 2285-2293, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Igor Razgon |
On OBDDs for CNFs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KR ![In: Principles of Knowledge Representation and Reasoning: Proceedings of the Fourteenth International Conference, KR 2014, Vienna, Austria, July 20-24, 2014, 2014, AAAI Press, 978-1-57735-657-8. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Riko Jacob, Tobias Lieber, Matthias Mnich |
Treewidth Computation and Kernelization in the Parallel External Memory Model. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFIP TCS ![In: Theoretical Computer Science - 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings, pp. 78-89, 2014, Springer, 978-3-662-44601-0. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Hasna Mohsen Alqahtani, Thomas Erlebach |
Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2014: Theory and Practice of Computer Science - 40th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 26-29, 2014, Proceedings, pp. 65-76, 2014, Springer, 978-3-319-04297-8. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Jeremias Berg, Matti Järvisalo, Brandon M. Malone |
Learning Optimal Bounded Treewidth Bayesian Networks via Maximum Satisfiability. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISTATS ![In: Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics, AISTATS 2014, Reykjavik, Iceland, April 22-25, 2014, pp. 86-95, 2014, JMLR.org. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
15 | Jakub Gajarský, Jan Obdrzálek, Sebastian Ordyniak, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar |
Finite Integer Index of Pathwidth and Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers, pp. 258-269, 2014, Springer, 978-3-319-13523-6. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Julien Baste, Ignasi Sau |
The Role of Planarity in Connectivity Problems Parameterized by Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers, pp. 63-74, 2014, Springer, 978-3-319-13523-6. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Igor Razgon |
No Small Nondeterministic Read-Once Branching Programs for CNFs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: Parameterized and Exact Computation - 9th International Symposium, IPEC 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected Papers, pp. 319-331, 2014, Springer, 978-3-319-13523-6. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
15 | Tobias Lieber |
On Optimal Algorithms for List Ranking in the Parallel External Memory Model with Applications to Treewidth and other Elementary Graph Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
|
2014 |
RDF |
|
15 | Marthe Bonamy, Nicolas Bousquet |
Recoloring bounded treewidth graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 44, pp. 257-262, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai |
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Chic. J. Theor. Comput. Sci. ![In: Chic. J. Theor. Comput. Sci. 2013, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
15 | Glenn G. Chappell, Michael J. Pelsmajer |
Maximum Induced Forests in Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 20(4), pp. 8, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad, Roohani Sharma |
Product Dimension of Forests and Bounded Treewidth Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 20(3), pp. 42, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | M. Praveen |
Does Treewidth Help in Modal Satisfiability? ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 14(3), pp. 18:1-18:32, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Dániel Marx, Barry O'Sullivan, Igor Razgon |
Finding small separators in linear time via treewidth reduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 9(4), pp. 30:1-30:35, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch |
Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 27(4), pp. 2108-2142, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Moritz Müller, Stefan Szeider |
Revisiting Space in Proof Complexity: Treewidth and Pathwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Colloquium Comput. Complex. ![In: Electron. Colloquium Comput. Complex. TR13, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
15 | Julien Baste, Ignasi Sau |
The role of planarity in connectivity problems parameterized by treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1312.2889, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
15 | Chandra Chekuri, Julia Chuzhoy |
Large-Treewidth Graph Decompositions and Applications ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1304.1577, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
15 | Mathieu Chapelle, Mathieu Liedloff, Ioan Todinca, Yngve Villanger |
TREEWIDTH and PATHWIDTH parameterized by vertex cover ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1305.0433, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
15 | Bart M. P. Jansen |
On Sparsification for Computing Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1308.3665, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
15 | John Fearnley, Sven Schewe |
Time and Space Results for Parity Games with Bounded Treewidth ![Search on Bibsonomy](Pics/bibsonomy.png) |
Log. Methods Comput. Sci. ![In: Log. Methods Comput. Sci. 9(2), 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Marthe Bonamy, Nicolas Bousquet |
Recoloring bounded treewidth graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1302.3486, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
15 | Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk |
A O(c^k n) 5-Approximation Algorithm for Treewidth ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1304.6321, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
15 | Anupam Gupta 0001, Kunal Talwar, David Witmer |
Sparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1305.1347, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
15 | Eyal Amir |
Efficient Approximation for Triangulation of Minimum Treewidth ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1301.2253, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
15 | Prasad Chebolu, Mary Cryan, Russell Martin |
Exact counting of Euler Tours for Graphs of Bounded Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1310.0185, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
15 | Igor Razgon |
On OBDDs for CNFs of bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1308.3829, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
15 | Krishnendu Chatterjee, Jakub Lacki |
Faster Algorithms for Markov Decision Processes with Low Treewidth ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1304.0084, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
15 | Bernardetta Addis, Marco Di Summa, Andrea Grosso |
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 161(16-17), pp. 2349-2360, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Christoph Blume, H. J. Sander Bruggink, Martin Friedrich, Barbara König 0001 |
Treewidth, pathwidth and cospan decompositions with applications to graph-accepting tree automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Vis. Lang. Comput. ![In: J. Vis. Lang. Comput. 24(3), pp. 192-206, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann |
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Optim. ![In: J. Comb. Optim. 25(1), pp. 19-46, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | David R. Wood |
Treewidth of Cartesian Products of Highly Connected Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 73(3), pp. 318-321, 2013. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Krishnendu Chatterjee, Jakub Lacki |
Faster Algorithms for Markov Decision Processes with Low Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification - 25th International Conference, CAV 2013, Saint Petersburg, Russia, July 13-19, 2013. Proceedings, pp. 543-558, 2013, Springer, 978-3-642-39798-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Serge Gaspers, Stefan Szeider |
Strong Backdoors to Bounded Treewidth SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pp. 489-498, 2013, IEEE Computer Society, 978-0-7695-5135-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk |
An O(c^k n) 5-Approximation Algorithm for Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA, pp. 499-508, 2013, IEEE Computer Society, 978-0-7695-5135-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof |
Deterministic Single Exponential Time Algorithms for Connectivity Problems Parameterized by Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I, pp. 196-207, 2013, Springer, 978-3-642-39205-4. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Moritz Müller, Stefan Szeider |
Revisiting Space in Proof Complexity: Treewidth and Pathwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings, pp. 704-716, 2013, Springer, 978-3-642-40312-5. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Hans L. Bodlaender, Stefan Kratsch, Vincent J. C. Kreuzen |
Fixed-Parameter Tractability and Characterizations of Small Special Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science - 39th International Workshop, WG 2013, Lübeck, Germany, June 19-21, 2013, Revised Papers, pp. 88-99, 2013, Springer, 978-3-642-45042-6. The full citation details ...](Pics/full.jpeg) |
2013 |
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. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory - 19th International Symposium, FCT 2013, Liverpool, UK, August 19-21, 2013. Proceedings, pp. 121-132, 2013, Springer, 978-3-642-40163-3. The full citation details ...](Pics/full.jpeg) |
2013 |
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) |
WADS ![In: Algorithms and Data Structures - 13th International Symposium, WADS 2013, London, ON, Canada, August 12-14, 2013. Proceedings, pp. 232-243, 2013, Springer, 978-3-642-40103-9. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Daniël Paulusma, Friedrich Slivovsky, Stefan Szeider |
Model Counting for CNF Formulas of Bounded Modular Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: 30th International Symposium on Theoretical Aspects of Computer Science, STACS 2013, February 27 - March 2, 2013, Kiel, Germany, pp. 55-66, 2013, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-50-7. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Anupam Gupta 0001, Kunal Talwar, David Witmer |
Sparsest cut on bounded treewidth graphs: algorithms and hardness results. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013, pp. 281-290, 2013, ACM, 978-1-4503-2029-0. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Chandra Chekuri, Julia Chuzhoy |
Large-treewidth graph decompositions and applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA, USA, June 1-4, 2013, pp. 291-300, 2013, ACM, 978-1-4503-2029-0. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Bernard Mans, Luke Mathieson |
On the Treewidth of Dynamic Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 19th International Conference, COCOON 2013, Hangzhou, China, June 21-23, 2013. Proceedings, pp. 349-360, 2013, Springer, 978-3-642-38767-8. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | K. S. Sesh Kumar, Francis R. Bach |
Convex Relaxations for Learning Bounded-Treewidth Decomposable Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICML (1) ![In: Proceedings of the 30th International Conference on Machine Learning, ICML 2013, Atlanta, GA, USA, 16-21 June 2013, pp. 525-533, 2013, JMLR.org. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
15 | Anisse Ismaili, Evripidis Bampis, Nicolas Maudet, Patrice Perny |
A study on the stability and efficiency of graphical games with unbounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AAMAS ![In: International conference on Autonomous Agents and Multi-Agent Systems, AAMAS '13, Saint Paul, MN, USA, May 6-10, 2013, pp. 263-270, 2013, IFAAMAS, 978-1-4503-1993-5. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP BibTeX RDF |
|
15 | Bart M. P. Jansen |
On Sparsification for Computing Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, pp. 216-229, 2013, Springer, 978-3-319-03897-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Antonis Thomas, Jan van Leeuwen |
Treewidth and Pure Nash Equilibria. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPEC ![In: Parameterized and Exact Computation - 8th International Symposium, IPEC 2013, Sophia Antipolis, France, September 4-6, 2013, Revised Selected Papers, pp. 348-360, 2013, Springer, 978-3-319-03897-1. The full citation details ...](Pics/full.jpeg) |
2013 |
DBLP DOI BibTeX RDF |
|
15 | Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos |
On exact algorithms for treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Algorithms ![In: ACM Trans. Algorithms 9(1), pp. 12:1-12:23, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Fedor V. Fomin, Yngve Villanger |
Treewidth computation and extremal combinatorics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 32(3), pp. 289-308, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Michael R. Fellows, Danny Hermelin, Frances A. Rosamond |
Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 64(1), pp. 3-18, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Michael Lampis |
Algorithmic Meta-theorems for Restrictions of Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Algorithmica ![In: Algorithmica 64(1), pp. 19-37, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Bruce A. Reed, David R. Wood |
Polynomial treewidth forces a large grid-like-minor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 33(3), pp. 374-379, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Gwenaël Joret, David R. Wood |
Nordhaus-Gaddum for treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 33(4), pp. 488-490, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Hans L. Bodlaender, Jurriaan Hage |
On switching classes, NLC-width, cliquewidth and treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 429, pp. 30-35, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Georg Gottlob, Stephanie Tien Lee, Gregory Valiant, Paul Valiant |
Size and Treewidth Bounds for Conjunctive Queries. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 59(3), pp. 16:1-16:35, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Léon Planken, Mathijs de Weerdt, Roman van der Krogt |
Computing All-Pairs Shortest Paths by Leveraging Low Treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Artif. Intell. Res. ![In: J. Artif. Intell. Res. 43, pp. 353-388, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Markus Chimani, Petra Mutzel, Bernd Zey |
Improved Steiner tree algorithms for bounded treewidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Discrete Algorithms ![In: J. Discrete Algorithms 16, pp. 67-78, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Navin Kashyap, Andrew Thangaraj |
The Treewidth of MDS and Reed-Muller Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 58(7), pp. 4837-4847, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
15 | Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran |
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1204.3040, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
15 | Serge Gaspers, Stefan Szeider |
Strong Backdoors to Bounded Treewidth SAT ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1204.6233, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
15 | Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai |
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1203.1940, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
15 | Hans L. Bodlaender, Marek Cygan, Stefan Kratsch, Jesper Nederlof |
Solving weighted and counting variants of connectivity problems parameterized by treewidth deterministically in single exponential time ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1211.1505, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
15 | Vibhav Gogate, Rina Dechter |
A Complete Anytime Algorithm for Treewidth ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1207.4109, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|