Search results for "Graphs of bounded treewidth"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx	Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth.	STOC	2010	DBLP DOI BibTeX RDF	Steiner forest, bounded-genus graphs, bounded-treewidth graphs, planar graphs, PTAS, series-parallel graphs
2	Tamás Horváth, Jan Ramon	Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth.	ECML/PKDD	2008	DBLP DOI BibTeX RDF
2	Thomas Wolle	A Framework for Network Reliability Problems on Graphs of Bounded Treewidth.	ISAAC	2002	DBLP DOI BibTeX RDF
2	Anil Maheshwari, Norbert Zeh	I/O-efficient algorithms for graphs of bounded treewidth.	SODA	2001	DBLP DOI BibTeX RDF
2	Torben Hagerup	Dynamic Algorithms for Graphs of Bounded Treewidth.	Algorithmica	2000	DBLP DOI BibTeX RDF
2	Torben Hagerup	Dynamic Algorithms for Graphs of Bounded Treewidth.	ICALP	1997	DBLP DOI BibTeX RDF
1	David Knipe	Trimming weighted graphs of bounded treewidth.	Discrete Applied Mathematics	2012	DBLP DOI BibTeX RDF
1	Fabian Wagner	Graphs of Bounded Treewidth can be Canonized in AC1.	Electronic Colloquium on Computational Complexity (ECCC)	2011	DBLP BibTeX RDF
1	Markus Bläser, Christian Hoffmann	Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth.	Algorithmica	2011	DBLP DOI BibTeX RDF
1	MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Dániel Marx	Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth.	J. ACM	2011	DBLP DOI BibTeX RDF
1	Kitty Meeks, Alexander Scott	The Parameterised Complexity of List Problems on Graphs of Bounded Treewidth	CoRR	2011	DBLP BibTeX RDF
1	Fabian Wagner	Graphs of Bounded Treewidth Can Be Canonized in $\mbox{{\sf AC}$\mbox{{\sf AC}.	CSR	2011	DBLP DOI BibTeX RDF
1	Eden Chlamtac, Robert Krauthgamer, Prasad Raghavendra	Approximating Sparsest Cut in Graphs of Bounded Treewidth	CoRR	2010	DBLP BibTeX RDF
1	Daniel Lokshtanov, Dániel Marx, Saket Saurabh	Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal	CoRR	2010	DBLP BibTeX RDF
1	Eden Chlamtac, Robert Krauthgamer, Prasad Raghavendra	Approximating Sparsest Cut in Graphs of Bounded Treewidth.	APPROX-RANDOM	2010	DBLP DOI BibTeX RDF
1	Sergio Cabello, Éric Colin de Verdière, Francis Lazarus	Finding shortest non-trivial cycles in directed graphs on surfaces.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	embedded graph, non-contractible cycle, non-separating cycle, directed graph, surface, computational topology, topological graph theory
1	Anil Maheshwari, Norbert Zeh	I/O-Efficient Algorithms for Graphs of Bounded Treewidth.	Algorithmica	2009	DBLP DOI BibTeX RDF	Algorithms, Graph algorithms, External memory algorithms, Bounded treewidth
1	MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Dániel Marx	Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth	CoRR	2009	DBLP BibTeX RDF
1	Markus Bläser, Christian Hoffmann	Fast computation of interlace polynomials on graphs of bounded treewidth	CoRR	2009	DBLP BibTeX RDF
1	Sergio Cabello, Christian Knauer	Algorithms for graphs of bounded treewidth via orthogonal range searching.	Comput. Geom.	2009	DBLP DOI BibTeX RDF
1	Markus Bläser, Christian Hoffmann	Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth.	ESA	2009	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh	Clique-width: on the price of generality.	SODA	2009	DBLP DOI BibTeX RDF
1	Frank Kammer, Torsten Tholey	The k-Disjoint Paths Problem on Chordal Graphs.	WG	2009	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Alexey A. Stepanov	On Two Techniques of Combining Branching and Treewidth.	Algorithmica	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
1	Hans L. Bodlaender, Arie M. C. A. Koster	Combinatorial Optimization on Graphs of Bounded Treewidth.	Comput. J.	2008	DBLP DOI BibTeX RDF
1	Jiong Guo, Rolf Niedermeier, Daniel Raible	Improved Algorithms and Complexity Results for Power Domination in Graphs.	Algorithmica	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
1	Amit Chakrabarti, Alexander Jaffe, James R. Lee, Justin Vincent	Embeddings of Topological Graphs: Lossy Invariants, Linearization, and 2-Sums.	FOCS	2008	DBLP DOI BibTeX RDF
1	Johannes Köbler, Oleg Verbitsky	From Invariants to Canonization in Parallel.	CSR	2008	DBLP DOI BibTeX RDF
1	Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach	Spanners in Sparse Graphs.	ICALP	2008	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl	On tractability of Cops and Robbers game.	IFIP TCS	2008	DBLP DOI BibTeX RDF	Pursuit-evasion games on graphs, cliquewidth, algorithms, complexity, parameterized complexity
1	Frank Kammer, Torsten Tholey	The Complexity of Minimum Convex Coloring.	ISAAC	2008	DBLP DOI BibTeX RDF	Convex Coloring, Maximum Disjoint Paths Problem
1	Stefan Szeider	Monadic Second Order Logic on Graphs with Local Cardinality Constraints.	MFCS	2008	DBLP DOI BibTeX RDF
1	Adrian Kosowski, Alfredo Navarra, Maria Cristina Pinotti	Connectivity in Multi-interface Networks.	TGC	2008	DBLP DOI BibTeX RDF	multi-interface network, approximation algorithm, wireless network, Energy saving
1	Michaël Rao	MSOL partitioning problems on graphs of bounded treewidth and clique-width.	Theor. Comput. Sci.	2007	DBLP DOI BibTeX RDF
1	Sergio Cabello, Günter Rote	Obnoxious centers in graphs.	SODA	2007	DBLP DOI BibTeX RDF
1	Hannes Moser, Somnath Sikdar	The Parameterized Complexity of the Induced Matching Problem in Planar Graphs.	FAW	2007	DBLP DOI BibTeX RDF
1	Banu Dost, Tomer Shlomi, Nitin Gupta 0002, Eytan Ruppin, Vineet Bafna, Roded Sharan	QNet: A Tool for Querying Protein Interaction Networks.	RECOMB	2007	DBLP DOI BibTeX RDF
1	Dániel Marx, Ildikó Schlotter	Obtaining a Planar Graph by Vertex Deletion.	WG	2007	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch	Exact Algorithms for Graph Homomorphisms.	Theory Comput. Syst.	2007	DBLP DOI BibTeX RDF
1	Arthur Brady, Lenore Cowen	Compact routing with additive stretch using distance labelings.	SPAA	2006	DBLP DOI BibTeX RDF	compact routing
1	Martin Grohe, Oleg Verbitsky	Testing Graph Isomorphism in Parallel by Playing a Game.	ICALP	2006	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Serge Gaspers, Saket Saurabh	Branching and Treewidth Based Exact Algorithms.	ISAAC	2006	DBLP DOI BibTeX RDF
1	Henning Fernau	ROMAN DOMINATION: A Parameterized Perspective.	SOFSEM	2006	DBLP DOI BibTeX RDF
1	Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Niedermeier, Johannes Uhlmann	Complexity and Exact Algorithms for Multicut.	SOFSEM	2006	DBLP DOI BibTeX RDF
1	Arthur Brady, Lenore Cowen	Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes.	DISC	2006	DBLP DOI BibTeX RDF
1	Gaurav Goel, Jens Gustedt	Bounded Arboricity to Determine the Local Structure of Sparse Graphs.	WG	2006	DBLP DOI BibTeX RDF
1	Jirí Fiala, Petr A. Golovach, Jan Kratochvíl	Distance Constrained Labelings of Graphs of Bounded Treewidth.	ICALP	2005	DBLP DOI BibTeX RDF
1	Ara Hayrapetyan, David Kempe, Martin Pál, Zoya Svitkina	Unbalanced Graph Cuts.	ESA	2005	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch	Exact Algorithms for Graph Homomorphisms.	FCT	2005	DBLP DOI BibTeX RDF
1	Tamás Horváth	Cyclic Pattern Kernels Revisited.	PAKDD	2005	DBLP DOI BibTeX RDF
1	Konstantin Andreev, Charles Garrod, Bruce M. Maggs, Adam Meyerson	Simultaneous Source Location.	APPROX-RANDOM	2004	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Fedor V. Fomin	Equitable Colorings of Bounded Treewidth Graphs.	MFCS	2004	DBLP DOI BibTeX RDF
1	Colin McDiarmid, Bruce A. Reed	Channel assignment on graphs of bounded treewidth.	Discrete Mathematics	2003	DBLP DOI BibTeX RDF
1	Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel	Graph Subcolorings: Complexity and Algorithms.	WG	2001	DBLP DOI BibTeX RDF
1	Gerth Stølting Brodal, Rolf Fagerberg	Dynamic Representation of Sparse Graphs.	WADS	1999	DBLP DOI BibTeX RDF
1	Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos	Isomorphism for Graphs of Bounded Distance Width.	Algorithmica	1999	DBLP DOI BibTeX RDF	Distance pathwidth, Distance treewidth, Graph isomorphism, Fixed parameter tractability
1	Artur Andrzejak	An algorithm for the Tutte polynomials of graphs of bounded treewidth.	Discrete Mathematics	1998	DBLP DOI BibTeX RDF
1	Hajo Broersma, Andreas Huck, Ton Kloks, Otto R. Koppius, Dieter Kratsch, Haiko Müller, Hilde Tuinstra	Degree-Preserving Forests.	MFCS	1998	DBLP DOI BibTeX RDF
1	Bengt Aspvall, Andrzej Proskurowski, Jan Arne Telle	Memory Requirements for Table Computations in Partial k-tree Algorithms.	SWAT	1998	DBLP DOI BibTeX RDF
1	Koichi Yamazaki, Hans L. Bodlaender, Babette de Fluiter, Dimitrios M. Thilikos	Isomorphism for Graphs of Bounded Distance Width.	CIAC	1997	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Torben Hagerup	Parallel Algorithms with Optimal Speedup for Bounded Treewidth.	ICALP	1995	DBLP DOI BibTeX RDF
1	Damon Kaller, Arvind Gupta, Thomas C. Shermer	The Chi-t-Coloring Problem.	STACS	1995	DBLP DOI BibTeX RDF
1	Stefan Arnborg, Andrzej Proskurowski	A Technique for Recognizing Graphs of Bounded Treewidth with Application to Subclasses of Partial 2-Paths.	TAGT	1994	DBLP DOI BibTeX RDF
1	Andreas Jakoby, Rüdiger Reischuk, Christian Schindelhauer	The Complexity of Broadcasting in Planar and Decomposable Graphs.	WG	1994	DBLP DOI BibTeX RDF	Classification graph algorithms, computational complexity, graph decomposition