Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
141 | Isolde Adler |
Tree-width and functional dependencies in databases. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODS ![In: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, June 9-11, 2008, Vancouver, BC, Canada, pp. 311-320, 2008, ACM, 978-1-60558-108-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
hypertree-width, databases, functional dependencies, conjunctive queries, tree-width |
82 | Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle |
Boolean-Width of Graphs. ![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. 61-74, 2009, Springer, 978-3-642-11268-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
81 | Feodor F. Dragan, Chenyu Yan |
Collective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 16th International Symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005, Proceedings, pp. 583-592, 2005, Springer, 3-540-30935-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
74 | Vadim V. Lozin |
From Tree-Width to Clique-Width: Excluding a Unit Interval Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 871-882, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Unit interval graphs, Fixed parameter tractability, Tree-width, Clique-width |
70 | Frank Gurski, Egon Wanke |
Minimizing NLC-Width is NP-Complete. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 69-80, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
69 | Isolde Adler, Mark Weyer |
Tree-Width for First Order Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings, pp. 71-85, 2009, Springer, 978-3-642-04026-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
68 | Mohammad Ali Safari |
D-Width: A More Natural Measure for Directed Tree Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2005, 30th International Symposium, MFCS 2005, Gdansk, Poland, August 29 - September 2, 2005, Proceedings, pp. 745-756, 2005, Springer, 3-540-28702-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
66 | Frank Gurski, Egon Wanke |
The Clique-Width of Tree-Power and Leaf-Power Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 76-85, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
tree powers, NLC-width, strictly chordal, tree-width, clique-width, leaf powers |
65 | Bruno Courcelle, Mamadou Moustapha Kanté |
Graph Operations Characterizing Rank-Width and Balanced Graph Expressions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 66-75, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
60 | Vadim V. Lozin, Martin Milanic |
Tree-Width and Optimization in Bounded Degree Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 33rd International Workshop, WG 2007, Dornburg, Germany, June 21-23, 2007. Revised Papers, pp. 45-54, 2007, Springer, 978-3-540-74838-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Hereditary class of graphs, Induced Matching, Dominating set, Tree-width |
55 | Johann A. Makowsky |
Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width. ![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. 487-495, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
54 | Elizabeth Broering, Satyanarayana V. Lokam |
Width-Based Algorithms for SAT and CIRCUIT-SAT: (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers, pp. 162-171, 2003, Springer, 3-540-20851-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
53 | Frank Gurski, Egon Wanke |
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 26th International Workshop, WG 2000, Konstanz, Germany, June 15-17, 2000, Proceedings, pp. 196-205, 2000, Springer, 3-540-41183-6. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
52 | Martin Grohe, Julian Mariño |
Definability and Descriptive Complexity on Databases of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT '99, 7th International Conference, Jerusalem, Israel, January 10-12, 1999, Proceedings., pp. 70-82, 1999, Springer, 3-540-65452-6. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
52 | Dániel Marx |
Approximating fractional hypertree width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009, pp. 902-911, 2009, SIAM, 978-0-89871-680-1. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
51 | Jörg Flum, Markus Frick, Martin Grohe |
Query evaluation via tree-decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 49(6), pp. 716-752, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Acyclic conjunctive queries, combined complexity, hypergraphs, monadic second-order logic, tree-width |
51 | Markus Frick, Martin Grohe |
Deciding first-order properties of locally tree-decomposable structures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 48(6), pp. 1184-1206, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
model-checking, locality, planar graphs, First-order logic, query evaluation, parameterized complexity, tree-width |
50 | Jan Obdrzálek |
Clique-Width and Parity Games. ![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. 54-68, 2007, Springer, 978-3-540-74914-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
49 | Per Bjesse, James H. Kukula, Robert F. Damiano, Ted Stanion, Yunshan Zhu |
Guiding SAT Diagnosis with Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers, pp. 315-329, 2003, Springer, 3-540-20851-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
49 | Christof Löding |
Ground Tree Rewriting Graphs of Bounded Tree Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings, pp. 559-570, 2002, Springer, 3-540-43283-3. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
47 | Renate Garbe |
Tree-width and Path-width of Comparability Graphs of interval Orders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 20th International Workshop, WG '94, Herrsching, Germany, June 16-18, 1994, Proceedings, pp. 26-37, 1994, Springer, 3-540-59071-4. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
47 | Jaroslav Nesetril, Patrice Ossona de Mendez |
Linear time low tree-width partitions and algorithmic consequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pp. 391-400, 2006, ACM, 1-59593-134-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
bounded expansion, fraternal augmentation, coloration, first order logic, subgraph isomorphism, tree-width, graph minor |
46 | Robert Ganian, Petr Hlinený, Joachim Kneis, Alexander Langer, Jan Obdrzálek, Peter Rossmanith |
On Digraph Width Measures in Parameterized Algorithmics. ![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. 185-197, 2009, Springer, 978-3-642-11268-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
45 | Jan Obdrzálek |
DAG-width: connectivity measure for directed graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 814-821, 2006, ACM Press, 0-89871-605-5. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
45 | Arvind Gupta, Naomi Nishimura |
Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 96, 13th Annual Symposium on Theoretical Aspects of Computer Science, Grenoble, France, February 22-24, 1996, Proceedings, pp. 453-464, 1996, Springer, 3-540-60922-9. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
45 | David R. Wood |
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings, pp. 348-359, 2002, Springer, 3-540-00225-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Pascal Koiran, Klaus Meer |
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers, pp. 252-263, 2008, 978-3-540-92247-6. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
44 | Andreas Jakoby, Till Tantau |
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings, pp. 216-227, 2007, Springer, 978-3-540-77049-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
logspace algorithms, distance problem, longest path problem, bounded tree-width, K 4-minor-free graphs, Series-parallel graphs |
44 | Bernd Burgstaller, Johann Blieberger, Bernhard Scholz |
On the Tree Width of Ada Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ada-Europe ![In: Reliable Software Technologies - Ada-Europe 2004, 9th Ada-Europe International Conference on Reliable Software Technologies, Palma de Mallorca, Spain, June 14-18, 2004, Proceedings, pp. 78-90, 2004, Springer, 3-540-22011-9. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
42 | Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer |
DAG-Width and Parity Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings, pp. 524-536, 2006, Springer, 978-3-540-32301-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
42 | Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman |
An exact almost optimal algorithm for target set selection in social networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
EC ![In: Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), Stanford, California, USA, July 6--10, 2009, pp. 355-362, 2009, ACM, 978-1-60558-458-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
bounded tree-width algorithm, bounded tree-width lower-bound, target set selection, social networks, viral marketing |
41 | Erich Grädel, Lukasz Kaiser, Roman Rabinovich 0001 |
Directed Graphs of Entanglement Two. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 17th International Symposium, FCT 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings, pp. 169-180, 2009, Springer, 978-3-642-03408-4. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
40 | Wolfgang Espelage, Frank Gurski, Egon Wanke |
Deciding Clique-Width for Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADS ![In: Algorithms and Data Structures, 7th International Workshop, WADS 2001, Providence, RI, USA, August 8-10, 2001, Proceedings, pp. 87-98, 2001, Springer, 3-540-42423-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
39 | Martin Grohe |
Local Tree-Width, Excluded Minors, and Approximation Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 23(4), pp. 613-632, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C83, 05C85, 68W25 |
39 | Jan Obdrzálek |
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CAV ![In: Computer Aided Verification, 15th International Conference, CAV 2003, Boulder, CO, USA, July 8-12, 2003, Proceedings, pp. 80-92, 2003, Springer, 3-540-40524-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
39 | Guoli Ding, Bogdan Oporowski, Daniel P. Sanders, Dirk Vertigan |
Partitioning Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 18(1), pp. 1-12, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05C15, 05C05, 05C55 |
39 | Denis Lapoire |
Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings, pp. 618-628, 1998, Springer, 3-540-64230-7. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
39 | Stephan Kreutzer |
On the Parameterised Intractability of Monadic Second-Order Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings, pp. 348-363, 2009, Springer, 978-3-642-04026-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
39 | Jens Lagergren, Stefan Arnborg |
Finding Minimal Forbidden Minors Using a Finite Congruence. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 18th International Colloquium, ICALP91, Madrid, Spain, July 8-12, 1991, Proceedings, pp. 532-543, 1991, Springer, 3-540-54233-7. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
38 | Robert Mateescu, Rina Dechter |
AND/OR Search Spaces and the Semantic Width of Constraint Networks. ![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. 860, 2005, Springer, 3-540-29238-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Frank Gurski, Egon Wanke |
The NLC-width and clique-width for powers of graphs of bounded tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 157(4), pp. 583-595, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
36 | Pierre Fraigniaud, Cyril Gavoille |
Lower Bounds for Oblivious Single-Packet End-to-End Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DISC ![In: Distributed Computing, 17th International Conference, DISC 2003, Sorrento, Italy, October 1-3, 2003, Proceedings, pp. 211-223, 2003, Springer, 3-540-20184-X. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Sequence Transmission, End-to-End, Tree-Width |
34 | Gruia Calinescu, Cristina G. Fernandes, Bruce A. Reed |
Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IPCO ![In: Integer Programming and Combinatorial Optimization, 6th International IPCO Conference, Houston, Texas, USA, June 22-24, 1998, Proceedings, pp. 137-152, 1998, Springer, 3-540-64590-X. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
32 | Omer Giménez, Petr Hlinený, Marc Noy |
Computing the Tutte Polynomial on Graphs of Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 31st International Workshop, WG 2005, Metz, France, June 23-25, 2005, Revised Selected Papers, pp. 59-68, 2005, Springer, 3-540-31000-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
subexponential algorithm, U polynomial, cographs, clique-width, Tutte polynomial |
32 | Georg Gottlob, Reinhard Pichler |
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Crete, Greece, July 8-12, 2001, Proceedings, pp. 708-719, 2001, Springer, 3-540-42287-0. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
31 | Frank Gurski, Carolin Rehs |
Forbidden Directed Minors, Directed Path-Width and Directed Tree-Width of Tree-Like Digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SOFSEM ![In: SOFSEM 2019: Theory and Practice of Computer Science - 45th International Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 27-30, 2019, Proceedings, pp. 234-246, 2019, Springer, 978-3-030-10800-7. The full citation details ...](Pics/full.jpeg) |
2019 |
DBLP DOI BibTeX RDF |
|
31 | Ken-ichi Kawarabayashi, Bojan Mohar, Bruce A. Reed |
A Simpler Linear Time Algorithm for Embedding Graphs into an Arbitrary Surface and the Genus of Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25-28, 2008, Philadelphia, PA, USA, pp. 771-780, 2008, IEEE Computer Society, 978-0-7695-3436-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Andrei Kotlov |
Spectral Characterization of Tree-Width-Two Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 20(1), pp. 147-152, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05 |
31 | Mikkel Thorup |
Structured Programs have Small Tree-Width and Good Register Allocation (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 318-332, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
31 | Egon Wanke |
Bounded Tree-Width and LOGCFL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 19th International Workshop, WG '93, Utrecht, The Netherlands, June 16-18, 1993, Proceedings, pp. 33-44, 1993, Springer, 3-540-57899-4. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
31 | Klaus Meer |
On Consistency and Width Notions for Constraint Programs with Algebraic Constraints. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FLOPS ![In: Functional and Logic Programming, 6th International Symposium, FLOPS 2002, Aizu, Japan, September 15-17, 2002, Proceedings, pp. 88-102, 2002, Springer, 3-540-44233-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
algebraic constraint satisfaction problems, backtrack-free algorithms, consistency, width |
31 | Martin Fürer |
Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ESA ![In: Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings, pp. 11-22, 2009, Springer, 978-3-642-04127-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
counting matchings, counting independent sets, bounded tree-width, efficient algorithms, characteristic polynomial |
30 | Michael Lampis, Georgia Kaouri, Valia Mitsou |
On the Algorithmic Effectiveness of Digraph Decompositions and Complexity Measures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings, pp. 220-231, 2008, Springer, 978-3-540-92181-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Digraph decompositions, Treewidth, Parameterized Complexity |
30 | Michael Alekhnovich, Alexander A. Razborov |
Satisfiability, Branch-Width and Tseitin Tautologies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 43rd Symposium on Foundations of Computer Science (FOCS 2002), 16-19 November 2002, Vancouver, BC, Canada, Proceedings, pp. 593-603, 2002, IEEE Computer Society, 0-7695-1822-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Dietmar Berwanger, Erich Grädel |
Entanglement - A Measure for the Complexity of Directed Graphs with Applications to Logic and Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic for Programming, Artificial Intelligence, and Reasoning, 11th International Conference, LPAR 2004, Montevideo, Uruguay, March 14-18, 2005, Proceedings, pp. 209-223, 2004, Springer, 3-540-25236-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
29 | Mizuhito Ogawa, Zhenjiang Hu, Isao Sasano |
Iterative-free program analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICFP ![In: Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming, ICFP 2003, Uppsala, Sweden, August 25-29, 2003, pp. 111-123, 2003, ACM, 1-58113-756-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
SP term, dynamic programming, program analysis, register allocation, control flow graph, tree width, catamorphism |
27 | Konstantinos Georgiou, Periklis A. Papakonstantinou |
Complexity and Algorithms for Well-Structured k-SAT Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing - SAT 2008, 11th International Conference, SAT 2008, Guangzhou, China, May 12-15, 2008. Proceedings, pp. 105-118, 2008, Springer, 978-3-540-79718-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
27 | Petr Hlinený |
Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003, Proceedings, pp. 319-330, 2003, Springer, 3-540-00623-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
representable matroid, fixed-parameter complexity, Classification: parametrized complexity and logic in computer science. (Math subjects 05B35, 68R05, 03D05.), monadic second-order logic, branch-width |
26 | Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski 0001 |
Sparse Graphs of Twin-width 2 Have Bounded Tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2307.01732, 2023. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Benjamin Bergougnoux, Jakub Gajarský, Grzegorz Guspiel, Petr Hlinený, Filip Pokrývka, Marek Sokolowski 0001 |
Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: 34th International Symposium on Algorithms and Computation, ISAAC 2023, December 3-6, 2023, Kyoto, Japan, pp. 11:1-11:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-289-1. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
26 | Benjamin Merlin Bumpus, Kitty Meeks, William Pettersson |
Directed branch-width: A directed analogue of tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/2009.08903, 2020. The full citation details ...](Pics/full.jpeg) |
2020 |
DBLP BibTeX RDF |
|
26 | Frank Gurski, Carolin Rehs |
Computing directed path-width and directed tree-width of recursively defined digraphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1806.04457, 2018. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP BibTeX RDF |
|
26 | Frank Gurski, Carolin Rehs |
Directed Path-Width and Directed Tree-Width of Directed Co-graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics - 24th International Conference, COCOON 2018, Qing Dao, China, July 2-4, 2018, Proceedings, pp. 255-267, 2018, Springer, 978-3-319-94775-4. The full citation details ...](Pics/full.jpeg) |
2018 |
DBLP DOI BibTeX RDF |
|
26 | Martin Fürer |
A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1402.1810, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP BibTeX RDF |
|
26 | O-joung Kwon, Sang-il Oum |
Graphs of small rank-width are pivot-minors of graphs of small tree-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 168, pp. 108-118, 2014. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
26 | Martin Fürer |
A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31 - April 4, 2014. Proceedings, pp. 72-83, 2014, Springer, 978-3-642-54422-4. The full citation details ...](Pics/full.jpeg) |
2014 |
DBLP DOI BibTeX RDF |
|
26 | O-joung Kwon, Sang-il Oum |
Graphs of Small Rank-width are Pivot-minors of Graphs of Small Tree-width ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/1203.3606, 2012. The full citation details ...](Pics/full.jpeg) |
2012 |
DBLP BibTeX RDF |
|
26 | Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos |
Rank-width and tree-width of H-minor-free graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Eur. J. Comb. ![In: Eur. J. Comb. 31(7), pp. 1617-1628, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
|
26 | Hans Adler, Isolde Adler |
A note on clique-width and tree-width for structures ![Search on Bibsonomy](Pics/bibsonomy.png) |
CoRR ![In: CoRR abs/0806.0103, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP BibTeX RDF |
|
26 | Eldar Fischer, Johann A. Makowsky, Elena V. Ravve |
Counting truth assignments of formulas of bounded tree-width or clique-width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Appl. Math. ![In: Discret. Appl. Math. 156(4), pp. 511-529, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Petr Hlinený, Sang-il Oum, Detlef Seese, Georg Gottlob |
Width Parameters Beyond Tree-width and their Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. J. ![In: Comput. J. 51(3), pp. 326-362, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
26 | Wolfgang Espelage, Frank Gurski, Egon Wanke |
Deciding Clique-Width for Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Graph Algorithms Appl. ![In: J. Graph Algorithms Appl. 7(2), pp. 141-180, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
26 | Jinjiang Yuan |
Path-width and tree-width of the join of graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ars Comb. ![In: Ars Comb. 43, 1996. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP BibTeX RDF |
|
26 | Daniel Bienstock |
Graph Searching, Path-Width, Tree-Width and Related Problems (A Survey). ![Search on Bibsonomy](Pics/bibsonomy.png) |
Reliability Of Computer And Communication Networks ![In: Reliability Of Computer And Communication Networks, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, December 2-4, 1989, pp. 33-50, 1989, DIMACS/AMS, 978-0-8218-6592-7. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
26 | Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal |
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CPAIOR ![In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings, pp. 275-287, 2007, Springer, 978-3-540-72396-7. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
integer programming, constraint programming, cutting planes, polyhedral combinatorics |
25 | Vida Dujmovic, David R. Wood |
Tree-Partitions of k-Trees with Applications in Graph Layout. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 29th International Workshop, WG 2003, Elspeet, The Netherlands, June 19-21, 2003, Revised Papers, pp. 205-217, 2003, Springer, 3-540-20452-0. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Bruno Courcelle, Andrew Twigg |
Compact Forbidden-Set Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STACS ![In: STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings, pp. 37-48, 2007, Springer, 978-3-540-70917-6. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Algorithms, compact routing, labelling schemes |
24 | Frank Gurski, Egon Wanke |
Vertex Disjoint Paths on Clique-Width Bounded Graphs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LATIN ![In: LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings, pp. 119-128, 2004, Springer, 3-540-21258-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
24 | Martin Grohe |
Definable Tree Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LICS ![In: Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, LICS 2008, 24-27 June 2008, Pittsburgh, PA, USA, pp. 406-417, 2008, IEEE Computer Society, 978-0-7695-3183-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
fixed point logic, descriptive complexity, tree decomposition |
24 | Jinbo Xu, Feng Jiao, Bonnie Berger |
A Tree-Decomposition Approach to Protein Structure Prediction. ![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. 247-256, 2005, IEEE Computer Society, 0-7695-2344-7. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Tommy Färnqvist, Peter Jonsson |
Bounded Tree-Width and CSP-Related Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007, Proceedings, pp. 632-643, 2007, Springer, 978-3-540-77118-0. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Computational complexity, constraint satisfaction, homomorphism, inapproximability, relational structure |
24 | Hein van der Holst |
Two Tree-Width-Like Graph Invariants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 23(4), pp. 633-651, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C83, 05C50, 15A18 |
24 | Konstantin Yu. Gorbunov |
An Estimate of the Tree-Width of a Planar Graph Which Has Not a Given Planar Grid as a Minor. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings, pp. 372-383, 1998, Springer, 3-540-65195-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
24 | Konstantin Skodinis |
The Bounded Tree-Width Problem of Context-Free Graph Languages. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 23rd International Workshop, WG '97, Berlin, Germany, June 18-20, 1997, Proceedings, pp. 303-317, 1997, Springer, 3-540-63757-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
|
24 | David Fernández-Baca, Giora Slutzki |
Optimal Parametric Search on Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '94, 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994, Proceedings, pp. 155-166, 1994, Springer, 3-540-58218-5. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
|
24 | David Fernández-Baca, Giora Slutzki |
Parametric Problems on Graphs of Bounded Tree-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SWAT ![In: Algorithm Theory - SWAT '92, Third Scandinavian Workshop on Algorithm Theory, Helsinki, Finland, July 8-10, 1992, Proceedings, pp. 304-316, 1992, Springer, 3-540-55706-7. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
23 | Aurélie Favier, Simon de Givry, Philippe Jégou |
Exploiting Problem Structure for Solution Counting. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CP ![In: Principles and Practice of Constraint Programming - CP 2009, 15th International Conference, CP 2009, Lisbon, Portugal, September 20-24, 2009, Proceedings, pp. 335-343, 2009, Springer, 978-3-642-04243-0. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
23 | Stefan Arnborg, Jens Lagergren, Detlef Seese |
Problems Easy for Tree-Decomposable Graphs (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALP ![In: Automata, Languages and Programming, 15th International Colloquium, ICALP88, Tampere, Finland, July 11-15, 1988, Proceedings, pp. 38-51, 1988, Springer, 3-540-19488-6. The full citation details ...](Pics/full.jpeg) |
1988 |
DBLP DOI BibTeX RDF |
|
22 | Jörg Flum, Markus Frick, Martin Grohe |
Query Evaluation via Tree-Decompositions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDT ![In: Database Theory - ICDT 2001, 8th International Conference, London, UK, January 4-6, 2001, Proceedings., pp. 22-38, 2001, Springer, 3-540-41456-8. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
21 | Petr Skoda 0001 |
Computability of Width of Submodular Partition Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pp. 450-459, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
21 | Akio Fujiyoshi |
A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Found. Comput. Sci. ![In: Int. J. Found. Comput. Sci. 28(5), pp. 563-582, 2017. The full citation details ...](Pics/full.jpeg) |
2017 |
DBLP DOI BibTeX RDF |
|
21 | Akio Fujiyoshi |
A Practical Algorithm for the Uniform Membership Problem of Labeled Multidigraphs of Tree-Width 2 for Spanning Tree Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIAA ![In: Implementation and Application of Automata - 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings, pp. 101-112, 2016, Springer, 978-3-319-40945-0. The full citation details ...](Pics/full.jpeg) |
2016 |
DBLP DOI BibTeX RDF |
|
21 | Nicholas Korpelainen, Vadim V. Lozin |
Bipartite Graphs of Large Clique-Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWOCA ![In: Combinatorial Algorithms, 20th International Workshop, IWOCA 2009, Hradec nad Moravicí, Czech Republic, June 28-July 2, 2009, Revised Selected Papers, pp. 385-395, 2009, Springer, 978-3-642-10216-5. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hereditary class, Tree-width, Clique-width |
21 | Mohamed Amine Boutiche |
Control of Some Graph Invariants in Dynamic Routing. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MCO ![In: Modelling, Computation and Optimization in Information Systems and Management Sciences, Second International Conference, MCO 2008, Metz, France - Luxembourg, September 8-10, 2008. Proceedings, pp. 52-58, 2008, Springer, 978-3-540-87476-8. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Tree length, Routing, Graphs, Topology Control, Tree Decomposition, Tree width |
21 | Ken-ichi Kawarabayashi, Bruce A. Reed |
Computing crossing number in linear time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007, pp. 382-390, 2007, ACM, 978-1-59593-631-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
linear time algorithm, crossing number, tree-width |
21 | Foto N. Afrati, Stavros S. Cosmadakis, Eugénie Foustoucos |
Datalog programs and their persistency numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Comput. Log. ![In: ACM Trans. Comput. Log. 6(3), pp. 481-518, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
bounded-tree width hypergraphs, persistency numbers, persistent variables, program transformations, Datalog, finite automata, Boundedness |
21 | Fedor V. Fomin, Dimitrios M. Thilikos |
Dominating sets in planar graphs: branch-width and exponential speed-up. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 12-14, 2003, Baltimore, Maryland, USA., pp. 168-177, 2003, ACM/SIAM, 0-89871-538-5. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP BibTeX RDF |
Planar Graph, Dominating Set, Tree-width, Fixed Parameter Algorithm, Branch-width |
21 | Xiao Zhou 0001, Syurei Tamura, Takao Nishizeki |
Finding Edge-Disjoint Paths in Partial k-Trees (Extended Abstract). ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISAAC ![In: Algorithms and Computation, 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996, Proceedings, pp. 203-212, 1996, Springer, 3-540-62048-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
bounded tree-width, polynomial-time algorithm, edge-coloring, edge-disjoint paths, partial k-tree |
21 | Jens Lagergren |
Efficient Parallel Algorithms for Tree-Decomposition and Related Problems ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, pp. 173-182, 1990, IEEE Computer Society, 0-8186-2082-X. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
sequential time complexity, monadic second order properties, linear extended monadic second order extremum problems, concurrent-read, concurrent-write parallel random access machine, enumeration problems, parallel algorithms, graphs, tree-decomposition, tree width, CRCW PRAM |
19 | Stefan Szeider |
On Fixed-Parameter Tractable Parameterizations of SAT. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAT ![In: Theory and Applications of Satisfiability Testing, 6th International Conference, SAT 2003. Santa Margherita Ligure, Italy, May 5-8, 2003 Selected Revised Papers, pp. 188-202, 2003, Springer, 3-540-20851-8. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|