Search results for "H-minor-free graphs"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos	Catalan structures and dynamic programming in H-minor-free graphs.	SODA	2008	DBLP DOI BibTeX RDF
2	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs.	J. ACM	2005	DBLP DOI BibTeX RDF	(k, r)-center, planar graph, domination, fixed-parameter algorithms, map graph
2	Erik D. Demaine, Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs.	SODA	2004	DBLP DOI BibTeX RDF
1	Siamak Tazari	Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs.	Theor. Comput. Sci.	2012	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos	Linear kernels for (connected) dominating set on H-minor-free graphs.	SODA	2012	DBLP BibTeX RDF
1	Ken-ichi Kawarabayashi, Yusuke Kobayashi	Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid.	STACS	2012	DBLP DOI BibTeX RDF
1	Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi	Contraction decomposition in h-minor-free graphs and algorithmic applications.	STOC	2011	DBLP DOI BibTeX RDF
1	Raphael Yuster	Single source shortest paths in H-minor free graphs.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos	Rank-width and tree-width of H-minor-free graphs.	Eur. J. Comb.	2010	DBLP DOI BibTeX RDF
1	Christian Wulff-Nilsen	Faster Shortest Path Algorithm for H-Minor Free Graphs with Negative Edge Weights	CoRR	2010	DBLP BibTeX RDF
1	Ken-ichi Kawarabayashi, Bruce A. Reed	Odd cycle packing.	STOC	2010	DBLP DOI BibTeX RDF	odd cycle, packing
1	Shai Gutner	Polynomial Kernels and Faster Algorithms for the Dominating Set Problem on Graphs with an Excluded Minor.	IWPEC	2009	DBLP DOI BibTeX RDF	H-minor-free graphs, degenerated graphs, dominating set problem, fixed-parameter tractable algorithms, problem kernel
1	Noga Alon, Shai Gutner	Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.	Algorithmica	2009	DBLP DOI BibTeX RDF	H-minor-free graphs, Degenerated graphs, Dominating set problem, Finding an induced cycle, Fixed-parameter tractable algorithms
1	Ken-ichi Kawarabayashi, Erik D. Demaine, MohammadTaghi Hajiaghayi	Additive approximation algorithms for list-coloring minor-closed class of graphs.	SODA	2009	DBLP DOI BibTeX RDF
1	Erik D. Demaine, MohammadTaghi Hajiaghayi, Ken-ichi Kawarabayashi	Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs.	ICALP	2009	DBLP DOI BibTeX RDF
1	Michael Dom, Daniel Lokshtanov, Saket Saurabh	Incompressibility through Colors and IDs.	ICALP	2009	DBLP DOI BibTeX RDF
1	Raphael Yuster	Single source shortest paths in H-minor free graphs	CoRR	2008	DBLP BibTeX RDF
1	Erik D. Demaine, MohammadTaghi Hajiaghayi	Linearity of grid minors in treewidth with applications through bidimensionality.	Combinatorica	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C83, 68R10, 05C85
1	Noga Alon, Shai Gutner	Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.	COCOON	2007	DBLP DOI BibTeX RDF	H-minor-free graphs, degenerated graphs, dominating set problem, finding an induced cycle, fixed-parameter tractable algorithms
1	Erik D. Demaine, Mohammad Taghi Hajiaghayi, Bojan Mohar	Approximation algorithms via contraction decomposition.	SODA	2007	DBLP DOI BibTeX RDF
1	Raphael Yuster, Uri Zwick	Maximum matching in graphs with an excluded minor.	SODA	2007	DBLP DOI BibTeX RDF
1	Erik D. Demaine, Mohammad Taghi Hajiaghayi	Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality.	SODA	2005	DBLP DOI BibTeX RDF
1	Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos	-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor.	APPROX	2002	DBLP DOI BibTeX RDF