Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
16 | Ken-ichi Kawarabayashi, Serguei Norine, Robin Thomas 0001, Paul Wollan |
K_6 minors in 6-connected graphs of bounded tree-width ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1203.2171, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
16 | Giovanna D'Agostino, Giacomo Lenzi |
On Modal μ-Calculus over Finite Graphs with Small Components or Small Tree Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 23(3), pp. 627-647, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Reinhard Diestel, Ken-ichi Kawarabayashi, Theodor Müller, Paul Wollan |
On the excluded minor structure theorem for graphs of large tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 102(6), pp. 1189-1210, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Frédéric Mazoit |
Tree-width of hypergraphs and surface duality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 102(3), pp. 671-687, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Tommy Färnqvist |
Constraint Optimization Problems and Bounded Tree-Width Revisited. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems - 9th International Conference, CPAIOR 2012, Nantes, France, May 28 - June1, 2012. Proceedings, pp. 163-179, 2012, Springer, 978-3-642-29827-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Martin Fürer |
Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings, pp. 387-398, 2012, Springer, 978-3-642-29343-6. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Salvatore La Torre, Gennaro Parlato |
Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2012, December 15-17, 2012, Hyderabad, India, pp. 173-184, 2012, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-47-7. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Takuya Akiba, Christian Sommer 0001, Ken-ichi Kawarabayashi |
Shortest-path queries for complex networks: exploiting low tree-width outside the core. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EDBT ![In: 15th International Conference on Extending Database Technology, EDBT '12, Berlin, Germany, March 27-30, 2012, Proceedings, pp. 144-155, 2012, ACM, 978-1-4503-0790-1. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP DOI BibTeX RDF |
|
16 | Alexander Grigoriev |
Tree-width and large grid minors in planar graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. Theor. Comput. Sci. ![In: Discret. Math. Theor. Comput. Sci. 13(1), pp. 13-20, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Magnus Bordewich, Ross J. Kang |
Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1102.3635, 2011. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP BibTeX RDF |
|
16 | P. Madhusudan, Gennaro Parlato |
The tree width of auxiliary storage. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26-28, 2011, pp. 283-294, 2011, ACM, 978-1-4503-0490-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Magnus Bordewich, Ross J. Kang |
Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part I, pp. 533-544, 2011, Springer, 978-3-642-22005-0. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | John Fearnley, Oded Lachish |
Parity Games on Graphs with Medium Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings, pp. 303-314, 2011, Springer, 978-3-642-22992-3. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Klaus Meer |
An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSR ![In: Computer Science - Theory and Applications - 6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. Proceedings, pp. 247-260, 2011, Springer, 978-3-642-20711-2. The full citation details ...](Pics/full.jpeg) |
2011 |
DBLP DOI BibTeX RDF |
|
16 | Klaus Meer |
Tree-width in Algebraic Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Fundam. Informaticae ![In: Fundam. Informaticae 98(4), pp. 391-409, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Tamás Horváth 0001, Jan Ramon |
Efficient frequent connected subgraph mining in graphs of bounded tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 411(31-33), pp. 2784-2797, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Isolde Adler, Philipp Klaus Krause |
A lower bound for the tree-width of planar graphs with vital linkages ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1011.2136, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Frédéric Mazoit |
Tree-width of hypergraphs and surface duality ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1006.3167, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Mathieu Chapelle |
Parameterized Complexity of Generalized Domination Problems on Bounded Tree-Width Graphs ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1004.2642, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Alexandr V. Kostochka, Daniel Král', Jean-Sébastien Sereni, Michael Stiebitz |
Graphs with bounded tree-width and large odd-girth are almost bipartite. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 100(6), pp. 554-559, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Tamás Horváth 0001, Jan Ramon |
Efficient frequent connected subgraph mining in graphs of bounded tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LWA ![In: LWA 2010 - Lernen, Wissen & Adaptivität, Workshop Proceedings, Kassel, 4.-6. Oktober 2010, pp. 75, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP BibTeX RDF |
|
16 | Martin Fürer |
Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, pp. 49-59, 2010, Springer, 978-3-642-12199-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Bruno Courcelle |
Special tree-width and the verification of monadic second-order graph pr operties. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, December 15-18, 2010, Chennai, India, pp. 13-29, 2010, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-939897-23-1. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
16 | Alexander Grigoriev, Bert Marchal, Natalya Usotskaya |
On planar graphs with large tree-width and small grid minors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 32, pp. 35-42, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Youssou Dieng, Cyril Gavoille |
On the Tree-Width of Planar Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 34, pp. 593-596, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Frédéric Mazoit |
Tree-width of graphs and surface duality. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 32, pp. 93-97, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Steven D. Noble |
Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. J. Comb. ![In: Electron. J. Comb. 16(1), 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Petr Hlinený, Geoff Whittle |
Addendum to matroid tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 30(4), pp. 1036-1044, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Cristina G. Fernandes, Orlando Lee, Yoshiko Wakabayashi |
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 157(2), pp. 272-279, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed |
Tree-width of graphs without a 3×3 grid minor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 157(12), pp. 2577-2596, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Martin Grohe, Dániel Marx |
On tree width, bramble size, and expansion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 99(1), pp. 218-228, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Matthew Kitching, Fahiem Bacchus |
Exploiting Decomposition on Constraint Problems with High Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IJCAI ![In: IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009, pp. 525-531, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP BibTeX RDF |
|
16 | Frédéric Mazoit |
Tree-width of hypergraphs and surface duality ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0812.2990, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
16 | Cédric Bentz |
On the complexity of the multicut problem in bounded tree-width graphs and digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 156(10), pp. 1908-1917, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | André Kündgen, Michael J. Pelsmajer |
Nonrepetitive colorings of graphs of bounded tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 308(19), pp. 4473-4478, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
16 | Isolde Adler |
Directed tree-width examples. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 97(5), pp. 718-725, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Petr Hlinený, Geoff Whittle |
Matroid tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 27(7), pp. 1117-1128, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Takehiro Ito, Xiao Zhou 0001, Takao Nishizeki |
Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Discrete Algorithms ![In: J. Discrete Algorithms 4(1), pp. 142-154, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
16 | Johann A. Makowsky |
Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 145(2), pp. 276-290, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Vida Dujmovic, Pat Morin, David R. Wood |
Layout of Graphs with Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Comput. ![In: SIAM J. Comput. 34(3), pp. 553-579, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Vida Dujmovic, Pat Morin, David R. Wood |
Layout of Graphs with Bounded Tree-Width ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR cs.DM/0406024, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
16 | Daniel Bienstock, Nuri Özbay |
Tree-width and the Sherali-Adams operator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Optim. ![In: Discret. Optim. 1(1), pp. 13-21, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Yuan Hong |
Tree-width, clique-minors, and eigenvalues. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 274(1-3), pp. 281-287, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Matt DeVos, Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Bruce A. Reed, Paul D. Seymour, Dirk Vertigan |
Excluding any graph as a minor allows a low tree-width 2-coloring. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 91(1), pp. 25-41, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
16 | Mukund Narasimhan, Jeff A. Bilmes |
PAC-learning Bounded Tree-width Graphical Models. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UAI ![In: UAI '04, Proceedings of the 20th Conference in Uncertainty in Artificial Intelligence, Banff, Canada, July 7-11, 2004, pp. 410-417, 2004, AUAI Press, 0-9749039-0-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP BibTeX RDF |
|
16 | Johann A. Makowsky, Julian Mariño |
Farrell polynomials on graphs of bounded tree width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Adv. Appl. Math. ![In: Adv. Appl. Math. 30(1-2), pp. 160-176, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
16 | Brian Lucena |
A New Lower Bound for Tree-Width Using Maximum Cardinality Search. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 16(3), pp. 345-353, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
16 | Nathan Srebro |
Maximum likelihood bounded tree-width Markov networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Artif. Intell. ![In: Artif. Intell. 143(1), pp. 123-138, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
16 | Johann A. Makowsky, Julian Mariño |
Tree-width and the monadic quantifier hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 303(1), pp. 157-170, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
16 | Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed |
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 48(2), pp. 333-359, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
16 | Etienne Birmelé |
Tree-width and circumference of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Theory ![In: J. Graph Theory 43(1), pp. 24-25, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
16 | Thomas Böhme 0001, John Maharry, Bojan Mohar |
Ka, k Minors in Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 86(1), pp. 133-147, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
16 | Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano, Masato Takeichi |
Algebraic construction of graphs with bounded tree width and its applications - Catamorphic Approach to Program Analyses. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APLAS ![In: The Third Asian Workshop on Programming Languages and Systems, APLAS'02, Shanghai Jiao Tong University, Shanghai, China, November 29 - December 1, 2002, Proceedings, pp. 58-73, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP BibTeX RDF |
|
16 | Gruia Calinescu, Cristina G. Fernandes |
Multicuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 7, pp. 194-197, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
16 | Andrei Kotlov |
Tree width and regular triangulations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Math. ![In: Discret. Math. 237(1-3), pp. 187-191, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
16 | Thor Johnson, Neil Robertson 0001, Paul D. Seymour, Robin Thomas 0001 |
Directed Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 82(1), pp. 138-154, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
16 | David R. Karger, Nathan Srebro |
Learning Markov networks: maximum bounded tree-width graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 392-401, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
16 | Nathan Srebro |
Maximum Likelihood Bounded Tree-Width Markov Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
UAI ![In: UAI '01: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, University of Washington, Seattle, Washington, USA, August 2-5, 2001, pp. 504-511, 2001, Morgan Kaufmann, 1-55860-800-1. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
16 | Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk L. Vertigan |
Surfaces, Tree-Width, Clique-Minors, and Partitions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 79(2), pp. 221-246, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
16 | Bruce A. Reed |
Introducing Directed Tree Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Electron. Notes Discret. Math. ![In: Electron. Notes Discret. Math. 3, pp. 222-229, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
16 | Steven D. Noble |
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. Probab. Comput. ![In: Comb. Probab. Comput. 7(3), pp. 307-321, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP BibTeX RDF |
|
16 | Mikkel Thorup |
All Structured Programs have Small Tree-Width and Good Register Allocation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Inf. Comput. ![In: Inf. Comput. 142(2), pp. 159-181, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
16 | Yves Colin de Verdière |
Multiplicities of Eigenvalues and Tree-Width of Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 74(2), pp. 121-146, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
16 | David Fernández-Baca, Giora Slutzki |
Optimal Parametric Search on Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 22(2), pp. 212-240, 1997. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
16 | Bruno Courcelle, Jens Lagergren |
Equivalent Definitions of Recognizability for Sets of Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Math. Struct. Comput. Sci. ![In: Math. Struct. Comput. Sci. 6(2), pp. 141-165, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Daniel P. Sanders |
On Linear Recognition of Tree-Width at Most Four. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIAM J. Discret. Math. ![In: SIAM J. Discret. Math. 9(1), pp. 101-117, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Jens Lagergren |
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 20(1), pp. 20-44, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
16 | Egon Wanke |
Bounded Tree-Width and LOGCFL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 16(3), pp. 470-491, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
16 | David Fernández-Baca, Giora Slutzki |
Parametric Problems on Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 16(3), pp. 408-430, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
16 | Ephraim Korach, Nir Solel |
Tree-Width, Path-Widt, and Cutwidth. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 43(1), pp. 97-101, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
16 | Paul D. Seymour, Robin Thomas 0001 |
Graph Searching and a Min-Max Theorem for Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 58(1), pp. 22-33, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
16 | Bruno Courcelle, Jens Lagergren |
Recognizable Sets of Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Dagstuhl Seminar on Graph Transformations in Computer Science ![In: Graph Transformations in Computer Science, International Workshop, Dagstuhl Castle, Germany, January 1993, Proceedings, pp. 138-152, 1993, Springer, 3-540-57787-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
16 | Robert F. Cohen, Sairam Sairam, Roberto Tamassia, Jeffrey Scott Vitter |
Dynamic algorithms for optimization problems in bounded tree-width graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29 - May 1, 1993, pp. 99-112, 1993, CIACO. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP BibTeX RDF |
|
16 | Bruce A. Reed |
Finding Approximate Separators and Computing Tree Width Quickly ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada, pp. 221-228, 1992, ACM, 0-89791-511-9. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
16 | Igor Kríz, Robin Thomas 0001 |
The menger-like property of the tree-width of infinite graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 52(1), pp. 86-91, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
16 | Robin Thomas 0001 |
A menger-like property of tree-width: The finite case. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 48(1), pp. 67-76, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
16 | Neil Robertson 0001, Paul D. Seymour |
Graph minors. IV. Tree-width and well-quasi-ordering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 48(2), pp. 227-254, 1990. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
|
16 | Neil Robertson 0001, Paul D. Seymour |
Graph Minors. II. Algorithmic Aspects of Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Algorithms ![In: J. Algorithms 7(3), pp. 309-322, 1986. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
16 | Neil Robertson 0001, Paul D. Seymour |
Graph minors. III. Planar tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comb. Theory, Ser. B ![In: J. Comb. Theory, Ser. B 36(1), pp. 49-64, 1984. The full citation details ...](Pics/full.jpeg) |
1984 |
DBLP DOI BibTeX RDF |
|
16 | Zdenek Dvorák 0001, Daniel Král |
Algorithms for Classes of Graphs with Bounded Expansion. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers, pp. 17-32, 2009, 978-3-642-11408-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
16 | Noga Alon, Shai Gutner |
Balanced Hashing, Color Coding and Approximate Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers, pp. 1-16, 2009, Springer, 978-3-642-11268-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Approximate counting of subgraphs, derandomization, expanders, perfect hashing, color-coding, k-wise independence |
16 | Anuj Dawar, Martin Grohe, Stephan Kreutzer |
Locally Excluding a Minor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 10-12 July 2007, Wroclaw, Poland, Proceedings, pp. 270-279, 2007, IEEE Computer Society, 0-7695-2908-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Anuj Dawar, David Richerby |
The Power of Counting Logics on Restricted Classes of Finite Structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 21st International Workshop, CSL 2007, 16th Annual Conference of the EACSL, Lausanne, Switzerland, September 11-15, 2007, Proceedings, pp. 84-98, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
16 | Yinglei Song, Chunmei Liu, Xiuzhen Huang, Russell L. Malmberg, Ying Xu, Liming Cai |
Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE ACM Trans. Comput. Biol. Bioinform. ![In: IEEE ACM Trans. Comput. Biol. Bioinform. 3(4), pp. 423-432, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Structure-sequence alignment, RNA structure homology search, dynamic programming, tree decomposition, parameterized algorithm, protein threading |
16 | Yinglei Song, Chunmei Liu, Xiuzhen Huang, Russell L. Malmberg, Ying Xu, Liming Cai |
Efficient Parameterized Algorithm for Biopolymer Structure-Sequence Alignment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WABI ![In: Algorithms in Bioinformatics, 5th International Workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings, pp. 376-388, 2005, Springer, 3-540-29008-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
16 | Martin Grohe, Thomas Schwentick, Luc Segoufin |
When is the evaluation of conjunctive queries tractable? ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 657-666, 2001, ACM, 1-58113-349-9. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
16 | Srinivasa Rao Arikati, Shiva Chaudhuri, Christos D. Zaroliagis |
All-Pairs Min-Cut in Sparse Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, 15th Conference, Bangalore, India, December 18-20, 1995, Proceedings, pp. 363-376, 1995, Springer, 3-540-60692-0. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
15 | Jinbo Xu |
Rapid Protein Side-Chain Packing via Tree Decomposition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RECOMB ![In: Research in Computational Molecular Biology, 9th Annual International Conference, RECOMB 2005, Cambridge, MA, USA, May 14-18, 2005, Proceedings, pp. 423-439, 2005, Springer, 3-540-25866-3. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Yinglei Song, Chunmei Liu, Russell L. Malmberg, Fangfang Pan, Liming Cai |
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSB ![In: Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference, CSB 2005, Stanford, CA, USA, August 8-11, 2005, pp. 223-234, 2005, IEEE Computer Society, 0-7695-2344-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
RNA secondary structure profiling, Pseudo-knot search, Covariance model, Tree decomposition |
15 | Radu Marinescu 0002, Rina Dechter |
AND/OR Branch-and-Bound for Solving Mixed Integer Linear Programming Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2005, 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005, Proceedings, pp. 857, 2005, Springer, 3-540-29238-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
15 | Jens Gustedt, Ole A. Mæhle, Jan Arne Telle |
The Treewidth of Java Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ALENEX ![In: Algorithm Engineering and Experiments, 4th International Workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5, 2002, Revised Papers, pp. 86-97, 2002, Springer, 3-540-43977-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
15 | Markus Frick, Martin Grohe |
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings, pp. 331-340, 1999, Springer, 3-540-66224-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
13 | Ilya Averbouch, Johann A. Makowsky, Peter Tittmann 0001 |
A Graph Polynomial Arising from Community Structure (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers, pp. 33-43, 2009, 978-3-642-11408-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
13 | Isolde Adler, Martin Grohe, Stephan Kreutzer |
Computing excluded minors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pp. 641-650, 2008, SIAM. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
13 | Bruno Courcelle |
Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP (1) ![In: Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I: Tack A: Algorithms, Automata, Complexity, and Games, pp. 1-13, 2008, Springer, 978-3-540-70574-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
12 | Cyril Terrioux, Philippe Jégou |
Bounded Backtracking for the Valued Constraint Satisfaction Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2003, 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003, Proceedings, pp. 709-723, 2003, Springer, 3-540-20202-1. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
12 | Takehiro Ito, Takao Nishizeki, Xiao Zhou 0001 |
Algorithms for the Multicolorings of Partial k-Trees. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 8th Annual International Conference, COCOON 2002, Singapore, August 15-17, 2002, Proceedings, pp. 430-439, 2002, Springer, 3-540-43996-X. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
12 | Erich Grädel |
Invited Talk: Decision procedures for guarded logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-16, 16th International Conference on Automated Deduction, Trento, Italy, July 7-10, 1999, Proceedings, pp. 31-51, 1999, Springer, 3-540-66222-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
10 | Omid Amini, Ignasi Sau, Saket Saurabh 0001 |
Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWPEC ![In: Parameterized and Exact Computation, Third International Workshop, IWPEC 2008, Victoria, Canada, May 14-16, 2008. Proceedings, pp. 13-29, 2008, Springer, 978-3-540-79722-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
10 | Shuji Isobe, Xiao Zhou 0001, Takao Nishizeki |
Total Colorings Of Degenerate Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 27(2), pp. 167-182, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C15, 05C85, 90C39 |