Search results for "tree-width"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
10	Angela Bonifati, Alfredo Cuzzocrea	Efficient Fragmentation of Large XML Documents.	DEXA	2007	DBLP DOI BibTeX RDF
10	Tibério S. Caetano, Terry Caelli	A Unified Formulation of Invariant Point Pattern Matching.	ICPR (3)	2006	DBLP DOI BibTeX RDF
10	Philippe Jégou, Samba Ndiaye, Cyril Terrioux	An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP.	CP	2006	DBLP DOI BibTeX RDF
10	Takehiro Ito, Akira Kato, Xiao Zhou 0001, Takao Nishizeki	Algorithms for Finding Distance-Edge-Colorings of Graphs.	COCOON	2005	DBLP DOI BibTeX RDF
10	Olivier Ly	Compositional Verification: Decidability Issues Using Graph Substitutions.	MFCS	2004	DBLP DOI BibTeX RDF	Tree Automata, Compositional Verification, Monadic Second-Order Logic
10	Shuji Isobe, Xiao Zhou 0001, Takao Nishizeki	Total Colorings of Degenerated Graphs.	ICALP	2001	DBLP DOI BibTeX RDF
10	Konstantin Skodinis	Efficient Analysis of Graphs with Small Minimal Separators.	WG	1999	DBLP DOI BibTeX RDF
10	Kenneth L. McMillan	Hierarchical Representations of Discrete Functions, with Application to Model Checking.	CAV	1994	DBLP DOI BibTeX RDF
10	Robert F. Cohen, Roberto Tamassia	Combine and Conquer: a General Technique for Dynamic Algorithms (Extended Abstract).	ESA	1993	DBLP DOI BibTeX RDF
8	Arnab Bhattacharyya 0001, Elena Grigorescu, Kyomin Jung, Sofya Raskhodnikova, David P. Woodruff	Transitive-closure spanners.	SODA	2009	DBLP DOI BibTeX RDF
8	Cédric Bentz	Exact and approximate resolution of integral multiflow and multicut problems: algorithms and complexity.	4OR	2008	DBLP DOI BibTeX RDF	MSC Classification 05C85, 90C27, 68Q17
8	Christos H. Papadimitriou, Tim Roughgarden	Computing correlated equilibria in multi-player games.	J. ACM	2008	DBLP DOI BibTeX RDF	Correlated equilibria, complexity of equilibria, Nash equilibria
8	Martin Grohe	Algorithmic Meta Theorems.	WG	2008	DBLP DOI BibTeX RDF
8	Itai Benjamini, Oded Schramm, Asaf Shapira	Every minor-closed property of sparse graphs is testable.	STOC	2008	DBLP DOI BibTeX RDF	minor closed properties, graph algorithms, property testing
8	Stephan Kreutzer	Algorithmic Meta-theorems.	IWPEC	2008	DBLP DOI BibTeX RDF
8	Etienne Birmelé, J. Adrian Bondy, Bruce A. Reed	The Erdös-Pósa Property For Long Circuits.	Comb.	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35, 05C83, 05C38
8	Martin Grohe	The complexity of homomorphism and constraint satisfaction problems seen from the other side.	J. ACM	2007	DBLP DOI BibTeX RDF	Complexity, constraint satisfaction, conjunctive queries, homomorphisms, parameterized complexity
8	Anuj Dawar, Martin Grohe, Stephan Kreutzer, Nicole Schweikardt	Model Theory Makes Formulas Large.	ICALP	2007	DBLP DOI BibTeX RDF
8	Stefan Göller, Markus Lohrey, Carsten Lutz	PDL with Intersection and Converse Is 2 EXP-Complete.	FoSSaCS	2007	DBLP DOI BibTeX RDF
8	Hajo Broersma, Matthew Johnson 0002, Daniël Paulusma, Iain A. Stewart	The Computational Complexity of the Parallel Knock-Out Problem.	LATIN	2006	DBLP DOI BibTeX RDF	Parallel knock-out, computational complexity, graphs
8	Takehiro Ito, Kazuya Goto, Xiao Zhou 0001, Takao Nishizeki	Partitioning a Multi-weighted Graph to Connected Subgraphs of Almost Uniform Size.	COCOON	2006	DBLP DOI BibTeX RDF
8	Klaus Meer, Dieter Rautenbach	On the OBDD Size for Graphs of Bounded Tree- and Clique-Width.	IWPEC	2006	DBLP DOI BibTeX RDF
8	Leizhen Cai, Siu Man Chan, Siu On Chan	Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems.	IWPEC	2006	DBLP DOI BibTeX RDF
8	Takehiro Ito, Xiao Zhou 0001, Takao Nishizeki	Partitioning graphs of supply and demand.	ISCAS (1)	2005	DBLP DOI BibTeX RDF
8	Georg Gottlob, Phokion G. Kolaitis, Thomas Schwentick	Existential second-order logic over graphs: Charting the tractability frontier.	J. ACM	2004	DBLP DOI BibTeX RDF	Existential second-order logic, graph constraints, prefix classes, graph coloring, NP-complete problems, finite model theory
8	Hajo Broersma, Fedor V. Fomin, Gerhard J. Woeginger	Parallel Knock-Out Schemes in Networks.	MFCS	2004	DBLP DOI BibTeX RDF
8	Takehiro Ito, Xiao Zhou 0001, Takao Nishizeki	Partitioning a Weighted Graph to Connected Subgraphs of Almost Uniform Size.	WG	2004	DBLP DOI BibTeX RDF
8	Mizuhito Ogawa	Complete Axiomatization of an Algebraic Construction of Graphs.	FLOPS	2004	DBLP DOI BibTeX RDF
8	Dániel Marx	Parameterized Complexity of Constraint Satisfaction Problems.	CCC	2004	DBLP DOI BibTeX RDF
8	Martin Grohe	The Complexity of Homomorphism and Constraint Satisfaction Problems Seen from the Other Side.	FOCS	2003	DBLP DOI BibTeX RDF
8	Lukasz Kowalik, Maciej Kurowski	Short path queries in planar graphs in constant time.	STOC	2003	DBLP DOI BibTeX RDF	shortest path, queries, planar graph
8	Stefan Szeider	Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable.	COCOON	2003	DBLP DOI BibTeX RDF
8	Mikkel Thorup	On Distance Oracles and Routing in Graphs.	ESA	2002	DBLP DOI BibTeX RDF
8	Thomas Colcombet	On Families of Graphs Having a Decidable First Order Theory with Reachability.	ICALP	2002	DBLP DOI BibTeX RDF
8	Andrew Beaumont-Smith, Cheng-Chew Lim	Parallel Prefix Adder Design.	IEEE Symposium on Computer Arithmetic	2001	DBLP DOI BibTeX RDF
8	Xiao Zhou 0001, Takao Nishizeki	Finding Independent Spanning Trees in Partial k-Trees.	ISAAC	2000	DBLP DOI BibTeX RDF
8	Hristo N. Djidjev	Computing the Girth of a Planar Graph.	ICALP	2000	DBLP DOI BibTeX RDF
8	Shuji Isobe, Xiao Zhou 0001, Takao Nishizeki	A Linear Algorithm for Finding Total Colorings of Partial k-Trees.	ISAAC	1999	DBLP DOI BibTeX RDF
8	Klaus Barthelmann	When Can an Equational Simple Graph Be Generated by Hyperedge Replacement?	MFCS	1998	DBLP DOI BibTeX RDF
8	Jürgen Plehn, Bernd Voigt	Finding Minimally Weighted Subgraphs.	WG	1990	DBLP DOI BibTeX RDF
8	Stefan Arnborg, Andrzej Proskurowski, Detlef Seese	Monadic Second Order Logic, Tree Automata and Forbidden Minors.	CSL	1990	DBLP DOI BibTeX RDF
8	Jan Kratochvíl, Mirko Krivánek	On the Computational Complexity of Codes in Graphs.	MFCS	1988	DBLP DOI BibTeX RDF
8	Bruno Courcelle	The Monadic Second-Order Logic of Graphs: Definable Sets of Finite Graphs.	WG	1988	DBLP DOI BibTeX RDF