Search results for "Fixed-parameter tractable algorithms"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
2	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
2	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
2	Patrick Healy, Karol Lynch	Fixed-Parameter Tractable Algorithms for Testing Upward Planarity.	SOFSEM	2005	DBLP DOI BibTeX RDF
1	Wolfgang Dvorák, Reinhard Pichler, Stefan Woltran	Towards fixed-parameter tractable algorithms for abstract argumentation.	Artif. Intell.	2012	DBLP DOI BibTeX RDF
1	Wolfgang Dvorák, Reinhard Pichler, Stefan Woltran	Towards Fixed-Parameter Tractable Algorithms for Argumentation.	KR	2010	DBLP BibTeX RDF
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	Stefan Kratsch, Frank Neumann	Fixed-parameter evolutionary algorithms and the vertex cover problem.	GECCO	2009	DBLP DOI BibTeX RDF	evolutionary algorithms, combinatorial optimization, multi-objective optimization, runtime analysis
1	David Eppstein, Elena Mumford	Self-overlapping curves revisited.	SODA	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	Neeldhara Misra, Venkatesh Raman, Saket Saurabh, Somnath Sikdar	The Budgeted Unique Coverage Problem and Color-Coding.	CSR	2009	DBLP DOI BibTeX RDF
1	Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides	Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.	Algorithmica	2008	DBLP DOI BibTeX RDF	Graph matching, Fixed parameter tractable, Parameterized complexity, Color coding, Set packing
1	Paul S. Bonsma, Frederic Dorn	Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree.	ESA	2008	DBLP DOI BibTeX RDF
1	Bruno Courcelle	Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects.	ICALP	2008	DBLP DOI BibTeX RDF
1	Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh	Graph Layout Problems Parameterized by Vertex Cover.	ISAAC	2008	DBLP DOI BibTeX RDF
1	Omid Amini, Ignasi Sau, Saket Saurabh	Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem.	IWPEC	2008	DBLP DOI BibTeX RDF
1	Venkatesh Raman, Saket Saurabh	Short Cycles Make W -hard Problems Hard: FPT Algorithms for W -hard Problems in Graphs with no Short Cycles.	Algorithmica	2008	DBLP DOI BibTeX RDF	t-vertex cover, Dominating set, Set cover, Independent set, Parameterized complexity
1	Venkatesh Raman, Saket Saurabh	Improved fixed parameter tractable algorithms for two "edge" problems: MAXCUT and MAXDAG.	Inf. Process. Lett.	2007	DBLP DOI BibTeX RDF
1	Peter J. Taillon	Distributed Memorization for the k -Vertex CoverProblem.	ISPA	2007	DBLP DOI BibTeX RDF
1	Andreas Alexander Albrecht	Complexity Aspects of Image Classification.	MIMI	2007	DBLP DOI BibTeX RDF
1	Bruno Courcelle, Mamadou Moustapha Kanté	Graph Operations Characterizing Rank-Width and Balanced Graph Expressions.	WG	2007	DBLP DOI BibTeX RDF
1	Patrick Healy, Karol Lynch	Two Fixed-parameter Tractable Algorithms for Testing Upward Planarity.	Int. J. Found. Comput. Sci.	2006	DBLP DOI BibTeX RDF
1	Venkatesh Raman, Saket Saurabh, C. R. Subramanian	Faster fixed parameter tractable algorithms for finding feedback vertex sets.	ACM Transactions on Algorithms	2006	DBLP DOI BibTeX RDF	parameterized complexity, Feedback vertex set, girth
1	Vincent Berry, François Nicolas	Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems.	IEEE/ACM Trans. Comput. Biology Bioinform.	2006	DBLP DOI BibTeX RDF	algorithms, pattern matching, trees, consensus, compatibility, fixed-parameter tractability, Phylogenetics
1	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos	Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover.	Discrete Applied Mathematics	2005	DBLP DOI BibTeX RDF
1	Stefan Langerman, Pat Morin	Covering Things with Things.	Discrete & Computational Geometry	2005	DBLP DOI BibTeX RDF
1	Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides	Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems.	ESA	2004	DBLP DOI BibTeX RDF
1	Michael T. Hallett, Jens Lagergren, Ali Tofigh	Simultaneous identification of duplications and lateral transfers.	RECOMB	2004	DBLP DOI BibTeX RDF	gene loss, lateral gene transfer, gene duplication
1	Jörg Flum, Martin Grohe, Mark Weyer	Bounded Fixed-Parameter Tractability and log2n Nondeterministic Bits.	ICALP	2004	DBLP DOI BibTeX RDF
1	Venkatesh Raman, Saket Saurabh, C. R. Subramanian	Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set.	ISAAC	2002	DBLP DOI BibTeX RDF
1	Stefan Langerman, Pat Morin	Covering Things with Things.	ESA	2002	DBLP DOI BibTeX RDF
1	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos	Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover.	WADS	2001	DBLP DOI BibTeX RDF
1	Rolf Niedermeier, Peter Rossmanith	A general method to speed up fixed-parameter-tractable algorithms.	Inf. Process. Lett.	2000	DBLP DOI BibTeX RDF