The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for treewidth with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1988-1993 (25) 1994-1995 (25) 1996-1997 (23) 1998 (18) 1999-2000 (20) 2001 (21) 2002 (19) 2003 (18) 2004 (26) 2005 (41) 2006 (43) 2007 (52) 2008 (52) 2009 (50) 2010 (37) 2011 (38) 2012 (35) 2013 (40) 2014 (47) 2015 (40) 2016 (46) 2017 (66) 2018 (48) 2019 (60) 2020 (94) 2021 (68) 2022 (80) 2023 (77) 2024 (16)
Publication types (Num. hits)
article(598) book(2) incollection(8) inproceedings(609) phdthesis(7) proceedings(1)
Venues (Conferences, Journals, ...)
CoRR(259) WG(61) Algorithmica(43) ESA(38) SODA(37) Discret. Appl. Math.(29) ICALP(27) ISAAC(23) MFCS(22) Theor. Comput. Sci.(22) IPEC(20) Treewidth, Kernels, and Algori...(19) STACS(18) SIAM J. Discret. Math.(16) FOCS(15) SWAT(14) More (+10 of total 227)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 303 occurrences of 153 keywords

Results
Found 1225 publication records. Showing 1225 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
152Andrea Ferrara, Guoqiang Pan, Moshe Y. Vardi Treewidth in Verification: Local vs. Global. Search on Bibsonomy LPAR The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
120Pierre Fraigniaud, Nicolas Nisse Connected Treewidth and Connected Graph Searching. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
103Erik D. Demaine, Mohammad Taghi Hajiaghayi Equivalence of local treewidth and linear local treewidth and its algorithmic applications. Search on Bibsonomy SODA The full citation details ... 2004 DBLP  BibTeX  RDF
99Víctor Dalmau, Phokion G. Kolaitis, Moshe Y. Vardi Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics. Search on Bibsonomy CP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
89Jens Gustedt, Ole A. Mæhle, Jan Arne Telle The Treewidth of Java Programs. Search on Bibsonomy ALENEX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
89Derek G. Corneil, Udi Rotics On the Relationship between Clique-Width and Treewidth. Search on Bibsonomy WG The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
89Ton Kloks, Hans L. Bodlaender Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. Search on Bibsonomy ISAAC The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
86MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. Search on Bibsonomy STOC The full citation details ... 2010 DBLP  DOI  BibTeX  RDF Steiner forest, bounded-genus graphs, bounded-treewidth graphs, planar graphs, PTAS, series-parallel graphs
86Hans L. Bodlaender Dynamic Programming on Graphs with Bounded Treewidth. Search on Bibsonomy ICALP The full citation details ... 1988 DBLP  DOI  BibTeX  RDF graph decision problems, restrictions of NP-complete problems, local condition compositions, dynamic programming, polynomial time algorithms, Treewidth, partial k-trees
78Yuliya Zabiyaka, Adnan Darwiche Functional Treewidth: Bounding Complexity in the Presence of Functional Dependencies. Search on Bibsonomy SAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
78Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos Bidimensional Parameters and Local Treewidth. Search on Bibsonomy LATIN The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
76Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse Nondeterministic Graph Searching: From Pathwidth to Treewidth. Search on Bibsonomy MFCS The full citation details ... 2005 DBLP  DOI  BibTeX  RDF treewidth, graph searching, pathwidth
76Hans L. Bodlaender, Udi Rotics Computing the Treewidth and the Minimum Fill-in with the Modular Decomposition. Search on Bibsonomy SWAT The full citation details ... 2002 DBLP  DOI  BibTeX  RDF minimum fill-in, minimal separators, graph algorithms, treewidth, Algorithms and data structures, modular decomposition
67Marko Samer, Helmut Veith Encoding Treewidth into SAT. Search on Bibsonomy SAT The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
67Emgad H. Bachoore, Hans L. Bodlaender Weighted Treewidth Algorithmic Techniques and Results. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
67Dániel Marx Can you beat treewidth? Search on Bibsonomy FOCS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
67Fedor V. Fomin, Dimitrios M. Thilikos Dominating Sets and Local Treewidth. Search on Bibsonomy ESA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
67Yong Gao 0001, Joseph C. Culberson On the Treewidth of NK Landscapes. Search on Bibsonomy GECCO The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
67Hans L. Bodlaender On Reduction Algorithms for Graphs with Small Treewidth. Search on Bibsonomy WG The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
67Hans L. Bodlaender NC-Algorithms for Graphs with Small Treewidth. Search on Bibsonomy WG The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
65Fedor V. Fomin, Serge Gaspers, Saket Saurabh 0001, Alexey A. Stepanov On Two Techniques of Combining Branching and Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Exact exponential time algorithms, #3-Coloring, #Minimum dominating set, Minimum maximal matching, k-Weighted vertex cover, NP hard problems, Treewidth, Parameterized algorithms
65Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse Nondeterministic Graph Searching: From Pathwidth to Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Treewidth, Graph searching, Pathwidth
65Georg Gottlob, Stephanie Tien Lee, Gregory Valiant Size and treewidth bounds for conjunctive queries. Search on Bibsonomy PODS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF size bounds, database theory, conjunctive queries, treewidth
65Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster Treewidth Lower Bounds with Brambles. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Bramble, Grid minor, Approximation algorithm, Lower bound, Planar graph, Treewidth
65Georg Gottlob, Reinhard Pichler, Fang Wei 0001 Tractable database design through bounded treewidth. Search on Bibsonomy PODS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF database design, normal forms, fixed-parameter tractability, tree decomposition, bounded treewidth
65Hans L. Bodlaender, Udi Rotics Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Minimum fill-in, Minimal separators, Graph algorithms, Treewidth, Polynomial algorithms, Modular decomposition
63Hans L. Bodlaender, Joost Engelfriet Domino Treewith (Extended Abstract). Search on Bibsonomy WG The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
61Hans L. Bodlaender Necessary Edges in k-Chordalisations of Graphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF triangulated graphs, graph algorithms, interval graphs, treewidth, chordal graphs, pathwidth
61Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos Isomorphism for Graphs of Bounded Distance Width. Search on Bibsonomy Algorithmica The full citation details ... 1999 DBLP  DOI  BibTeX  RDF Distance pathwidth, Distance treewidth, Graph isomorphism, Fixed parameter tractability
60Dániel Marx Four Shorts Stories on Surprising Algorithmic Uses of Treewidth. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
60Till Fluschnik, Hendrik Molter, Rolf Niedermeier, Malte Renken, Philipp Zschoche As Time Goes By: Reflections on Treewidth for Temporal Graphs. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
60Tom C. van der Zanden Games, Puzzles and Treewidth. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
60Hisao Tamaki Experimental Analysis of Treewidth. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
60Alexander Grigoriev Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
60Marcin Pilipczuk Surprising Applications of Treewidth Bounds for Planar Graphs. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
57Erik D. Demaine, MohammadTaghi Hajiaghayi Linearity of grid minors in treewidth with applications through bidimensionality. Search on Bibsonomy Comb. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 05C83, 68R10, 05C85
57Frank van den Eijkhof, Hans L. Bodlaender, Arie M. C. A. Koster Safe Reduction Rules for Weighted Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
57Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos On Exact Algorithms for Treewidth. Search on Bibsonomy ESA The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
57Marko Samer, Stefan Szeider Constraint Satisfaction with Bounded Treewidth Revisited. Search on Bibsonomy CP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
57Erik D. Demaine, Mohammad Taghi Hajiaghayi Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality. Search on Bibsonomy SODA The full citation details ... 2005 DBLP  BibTeX  RDF
57Arie M. C. A. Koster, Thomas Wolle, Hans L. Bodlaender Degree-Based Treewidth Lower Bounds. Search on Bibsonomy WEA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
57Hans L. Bodlaender, Alexander Grigoriev, Arie M. C. A. Koster Treewidth Lower Bounds with Brambles. Search on Bibsonomy ESA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
57François Clautiaux, Jacques Carlier, Aziz Moukrim, Stéphane Nègre New Lower and Upper Bounds for Graph Treewidth. Search on Bibsonomy WEA The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
57Frank van den Eijkhof, Hans L. Bodlaender Safe Reduction Rules for Weighted Treewidth. Search on Bibsonomy WG The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
57Hans L. Bodlaender, Richard B. Tan, Dimitrios M. Thilikos, Jan van Leeuwen On Interval Routing Schemes and Treewidth. Search on Bibsonomy WG The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
57Hans L. Bodlaender, Ton Kloks, Dieter Kratsch Treewidth and Pathwidth of Permutation Graphs. Search on Bibsonomy ICALP The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
55Georg Gottlob, Reinhard Pichler, Fang Wei 0001 Monadic datalog over finite structures with bounded treewidth. Search on Bibsonomy PODS The full citation details ... 2007 DBLP  DOI  BibTeX  RDF datalog, treewidth, fixed-parameter tractability, monadic second order logic, tree decomposition
55Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh 0001, Stefan Szeider, Carsten Thomassen On the Complexity of Some Colorful Problems Parameterized by Treewidth. Search on Bibsonomy COCOA The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Topics Parameterized Complexity, Graph Coloring, Bounded Treewidth
55Erik D. Demaine, Mohammad Taghi Hajiaghayi Diameter and Treewidth in Minor-Closed Graph Families, Revisited. Search on Bibsonomy Algorithmica The full citation details ... 2004 DBLP  DOI  BibTeX  RDF Apex graphs, Bounded local treewidth, Approximation algorithms, Graph algorithms, Graph minors
53Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 Clique-width: on the price of generality. Search on Bibsonomy SODA The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
53Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, Ilan Newman An exact almost optimal algorithm for target set selection in social networks. Search on Bibsonomy EC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF bounded tree-width algorithm, bounded tree-width lower-bound, target set selection, social networks, viral marketing
53Guoqiang Pan, Moshe Y. Vardi Fixed-Parameter Hierarchies inside PSPACE. Search on Bibsonomy LICS The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
51Uriel Feige, Mohammad Taghi Hajiaghayi, James R. Lee Improved approximation algorithms for minimum-weight vertex separators. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF vertex separators, approximation algorithms, semidefinite programming, treewidth, metric embeddings
51Hans L. Bodlaender Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. Search on Bibsonomy SWAT The full citation details ... 1988 DBLP  DOI  BibTeX  RDF Chromatic Index, graphs with small treewidth, polynomial time algorithms, NP-complete problems, Graph Isomorphism, tree-decompositions, partial k-trees
46Luca Pulina, Armando Tacchella Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings. Search on Bibsonomy LPAR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
46K. Nunez, Jianhua Chen 0003, Peter P. Chen, Guoli Ding, Robert F. Lax, Brian D. Marx Empirical Comparison of Greedy Strategies for Learning Markov Networks of Treewidth k. Search on Bibsonomy ICMLA The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
46Vida Dujmovic, David R. Wood Graph Treewidth and Geometric Thickness Parameters. Search on Bibsonomy Discret. Comput. Geom. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
46Federico Mancini 0001 Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs. Search on Bibsonomy ISAAC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
46Jirí Fiala 0001, Petr A. Golovach, Jan Kratochvíl Distance Constrained Labelings of Graphs of Bounded Treewidth. Search on Bibsonomy ICALP The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
46Hans L. Bodlaender, Arie M. C. A. Koster, Thomas Wolle Contraction and Treewidth Lower Bounds. Search on Bibsonomy ESA The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
46Thomas Wolle A Framework for Network Reliability Problems on Graphs of Bounded Treewidth. Search on Bibsonomy ISAAC The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
46Mohammad Taghi Hajiaghayi, Naomi Nishimura Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. Search on Bibsonomy MFCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
46Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos -Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor. Search on Bibsonomy APPROX The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
46Volker Heun, Ernst W. Mayr Embedding Graphs with Bounded Treewidth into Optimal Hypercubes. Search on Bibsonomy STACS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
46Shiva Chaudhuri, Christos D. Zaroliagis Optimal Parallel Shortest Paths in Small Treewidth Digraphs. Search on Bibsonomy ESA The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
46Hans L. Bodlaender, Torben Hagerup Parallel Algorithms with Optimal Speedup for Bounded Treewidth. Search on Bibsonomy ICALP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
46Siddharthan Ramachandramurthi A Lower Bound for Treewidth and Its Consequences. Search on Bibsonomy WG The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
46Ton Kloks Treewidth of Circle Graphs. Search on Bibsonomy ISAAC The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
46Hans L. Bodlaender, Ton Kloks Better Algorithms for the Pathwidth and Treewidth of Graphs. Search on Bibsonomy ICALP The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
45Fedor V. Fomin, Stefan Kratsch, Erik Jan van Leeuwen (eds.) Treewidth, Kernels, and Algorithms - Essays Dedicated to Hans L. Bodlaender on the Occasion of His 60th Birthday Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
45Danny Hermelin Hans Bodlaender and the Theory of Kernelization Lower Bounds. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
45Michal Pilipczuk Computing Tree Decompositions. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
45Jan van Leeuwen Algorithms, Complexity, and Hans. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
45Jesper Nederlof Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
45Yota Otachi A Survey on Spanning Tree Congestion. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
45Bart M. P. Jansen Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
45Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
45Stefan Arnborg, Andrzej Proskurowski Seeing Arboretum for the (partial k-) Trees. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
45Dimitrios M. Thilikos A Retrospective on (Meta) Kernelization. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
45Mark de Berg, Sándor Kisfaludi-Bak Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
45Johan M. M. van Rooij Fast Algorithms for Join Operations on Tree Decompositions. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
45Michael R. Fellows, Frances A. Rosamond Collaborating with Hans: Some Remaining Wonderments. Search on Bibsonomy Treewidth, Kernels, and Algorithms The full citation details ... 2020 DBLP  DOI  BibTeX  RDF
44Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd A Note on Multiflows and Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Product multicommodity flow, Treewidth, Edge-disjoint paths
44Anil Maheshwari, Norbert Zeh I/O-Efficient Algorithms for Graphs of Bounded Treewidth. Search on Bibsonomy Algorithmica The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Algorithms, Graph algorithms, External memory algorithms, Bounded treewidth
44Elisabeth Gassner, Johannes Hatzl A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs. Search on Bibsonomy Computing The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Neighbourhood domination, Parity constraints, Distance-hereditary graphs, Bounded treewidth
42Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh 0001 Graph Layout Problems Parameterized by Vertex Cover. Search on Bibsonomy ISAAC The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
42Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach Spanners in Sparse Graphs. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
42Daniele Pretolani Hypergraph Reductions and Satisfiability Problems. Search on Bibsonomy SAT The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
42David R. Karger, Nathan Srebro Learning Markov networks: maximum bounded tree-width graphs. Search on Bibsonomy SODA The full citation details ... 2001 DBLP  BibTeX  RDF
40Jiong Guo, Rolf Niedermeier, Daniel Raible 0001 Improved Algorithms and Complexity Results for Power Domination in Graphs. Search on Bibsonomy Algorithmica The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Graphs of bounded treewidth, (Power) domination in graphs, Computational complexity, Graph algorithms, Parameterized complexity, Design and analysis of algorithms, Fixed-parameter algorithms
40Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks The Valve Location Problem in Simple Network Topologies. Search on Bibsonomy WG The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Valve location problem, computational complexity, dynamic programming, binary search, bounded treewidth
40Pierre Fraigniaud, Nicolas Nisse Monotony Properties of Connected Visible Graph Searching. Search on Bibsonomy WG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Treewidth, Graph Searching, Pathwidth
40Guillaume Fertin, André Raspaud, Bruce A. Reed On Star Coloring of Graphs. Search on Bibsonomy WG The full citation details ... 2001 DBLP  DOI  BibTeX  RDF proper coloring, star coloring, acyclic coloring, graphs, treewidth, vertex coloring
36Tamás Horváth 0001, Jan Ramon Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth. Search on Bibsonomy ECML/PKDD (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
36Michael Jakl, Reinhard Pichler, Stefan Rümmele, Stefan Woltran Fast Counting with Bounded Treewidth. Search on Bibsonomy LPAR The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
36Fedor V. Fomin, Yngve Villanger Treewidth Computation and Extremal Combinatorics. Search on Bibsonomy ICALP (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
36Tong Yi, Guoli Ding, Bogdan Oporowski A Low Bound for Broadcast in Optical Networks of Bounded Treewidth Using Fewest Converters. Search on Bibsonomy IPCCC The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
36Hans L. Bodlaender Treewidth: Characterizations, Applications, and Computations. Search on Bibsonomy WG The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
36Yngve Villanger Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In. Search on Bibsonomy LATIN The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
36Emgad H. Bachoore, Hans L. Bodlaender A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth. Search on Bibsonomy AAIM The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 1225 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license