Search results for "Fedor V. Fomin"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos	Fast Minor Testing in Planar Graphs.	Algorithmica	2012	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Fedor V. Fomin, Petr A. Golovach, Yota Otachi, Erik Jan van Leeuwen	Parameterized Complexity of the Spanning Tree Congestion Problem.	Algorithmica	2012	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Fabrizio Grandoni, Daniel Lokshtanov, Saket Saurabh	Sharp Separation and Applications to Exact and Parameterized Algorithms.	Algorithmica	2012	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Saket Saurabh, Yngve Villanger	A Polynomial kernel for Proper Interval Vertex Deletion	CoRR	2012	DBLP BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Saket Saurabh	Planar F-Deletion: Approximation and Optimal FPT Algorithms	CoRR	2012	DBLP BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov	Cops and Robber Game Without Recharging.	Theory Comput. Syst.	2012	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Fedor V. Fomin, Arie M. C. A. Koster, Dieter Kratsch, Dimitrios M. Thilikos	A Note on Exact Algorithms for Vertex Ordering Problems on Graphs.	Theory Comput. Syst.	2012	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh, B. V. Raghavendra Rao	Faster algorithms for finding and counting subgraphs.	J. Comput. Syst. Sci.	2012	DBLP DOI BibTeX RDF
1	Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Yngve Villanger	Local search: Is brute-force avoidable?	J. Comput. Syst. 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	Fedor V. Fomin, Yngve Villanger	Subexponential parameterized algorithm for minimum fill-in.	SODA	2012	DBLP BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh	Bidimensionality and geometric graphs.	SODA	2012	DBLP BibTeX RDF
1	Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger	k-Gap Interval Graphs.	LATIN	2012	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach	Parameterized Complexity of Connected Even/Odd Subgraph Problems.	STACS	2012	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos	Contraction obstructions for treewidth.	J. Comb. Theory, Ser. B	2011	DBLP DOI BibTeX RDF
1	Michael R. Fellows, Fedor V. Fomin, Gregory Gutin	Special Issue on Parameterized Complexity of Discrete Optimization.	Discrete Optimization	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Erik Jan van Leeuwen	Spanners of bounded degree graphs.	Inf. Process. Lett.	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh	Subexponential algorithms for partial cover problems.	Inf. Process. Lett.	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos	Special Issue on "Theory and Applications of Graph Searching Problems".	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos	Faster parameterized algorithms for minor containment.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov	Guard games on graphs: Keep the intruder out!	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh	An exact algorithm for minimum distortion embedding.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach	Approximation of minimum weight spanners for sparse graphs.	Theor. Comput. Sci.	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff	Branch and Recharge: Exact Algorithms for Generalized Domination.	Algorithmica	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Matús Mihalák, Elias Vicari, Peter Widmayer	How to Guard a Graph?	Algorithmica	2011	DBLP DOI BibTeX RDF
1	Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Frances A. Rosamond, Saket Saurabh, Stefan Szeider, Carsten Thomassen	On the complexity of some colorful problems parameterized by treewidth.	Inf. Comput.	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Yngve Villanger	Subexponential Parameterized Algorithm for Minimum Fill-in	CoRR	2011	DBLP BibTeX RDF
1	Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Karol Suchan, Stefan Szeider, Erik Jan van Leeuwen, Martin Vatshelle, Yngve Villanger	k-Gap Interval Graphs	CoRR	2011	DBLP BibTeX RDF
1	Fedor V. Fomin, Michal Pilipczuk	Jungles, bundles, and fixed parameter tractability	CoRR	2011	DBLP BibTeX RDF
1	Fedor V. Fomin, Stefan Kratsch, Marcin Pilipczuk, Michal Pilipczuk, Yngve Villanger	Subexponential fixed-parameter tractability of cluster editing	CoRR	2011	DBLP BibTeX RDF
1	Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen	Parameterized Complexity of Firefighting Revisited	CoRR	2011	DBLP BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh	Bidimensionality and Geometric Graphs	CoRR	2011	DBLP BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos	Approximating Width Parameters of Hypergraphs with Excluded Minors.	SIAM J. Discrete Math.	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Jan Kratochvíl, Daniel Lokshtanov, Federico Mancini, Jan Arne Telle	On the complexity of reconstructing H-free graphs from their Star Systems.	Journal of Graph Theory	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Saket Saurabh, Dimitrios M. Thilikos	Strengthening Erdös-Pósa property for minor-closed graph classes.	Journal of Graph Theory	2011	DBLP DOI BibTeX RDF
1	Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé	Kernels for feedback arc set in tournaments.	J. Comput. Syst. Sci.	2011	DBLP DOI BibTeX RDF
1	Omid Amini, Fedor V. Fomin, Saket Saurabh	Implicit branching and parameterized partial cover problems.	J. Comput. Syst. Sci.	2011	DBLP DOI BibTeX RDF
1	Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach	Spanners in sparse graphs.	J. Comput. Syst. Sci.	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer, Dimitrios M. Thilikos	Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071).	Dagstuhl Reports	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Ioan Todinca, Yngve Villanger	Exact Algorithm for the Maximum Induced Planar Subgraph Problem.	ESA	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh	Bidimensionality and EPTAS.	SODA	2011	DBLP BibTeX RDF
1	Marek Cygan, Fedor V. Fomin, Erik Jan van Leeuwen	Parameterized Complexity of Firefighting Revisited.	IPEC	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh	Hitting forbidden minors: Approximation and Kernelization.	STACS	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger	Enumerating Minimal Subset Feedback Vertex Sets.	WADS	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Geevarghese Philip, Yngve Villanger	Minimum Fill-in of Sparse Graphs: Kernelization and Approximation.	FSTTCS	2011	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Serge Gaspers, Petr A. Golovach, Dieter Kratsch, Saket Saurabh	Parameterized algorithm for eternal vertex cover.	Inf. Process. Lett.	2010	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Saket Saurabh	Iterative compression and exact algorithms.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Nicolas Nisse, Karol Suchan	Pursuing a fast robber on a graph.	Theor. Comput. Sci.	2010	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Pinar Heggernes, Rodica Mihai	Mixed search number and linear-width of interval and split graphs.	Networks	2010	DBLP DOI BibTeX RDF
1	Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin	Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions.	Algorithmica	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	Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh	Hitting forbidden minors: Approximation and Kernelization	CoRR	2010	DBLP BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh	Bidimensionality and EPTAS	CoRR	2010	DBLP BibTeX RDF
1	Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh	Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs	CoRR	2010	DBLP BibTeX RDF
1	Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo	Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem.	J. Comput. Syst. Sci.	2010	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh	Intractability of Clique-Width Parameterizations.	SIAM J. Comput.	2010	DBLP DOI BibTeX RDF
1	Fedor V. Fomin	Kernelization.	CSR	2010	DBLP DOI BibTeX RDF
1	Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos	Fast Minor Testing in Planar Graphs.	ESA	2010	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh	Algorithmic Lower Bounds for Problems Parameterized with Clique-Width.	SODA	2010	DBLP BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Dimitrios M. Thilikos	Bidimensionality and Kernels.	SODA	2010	DBLP BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Fabrizio Grandoni, Saket Saurabh	Sharp Separation and Applications to Exact and Parameterized Algorithms.	LATIN	2010	DBLP DOI BibTeX RDF
1	Fedor V. Fomin	Protrusions in Graphs and Their Applications.	IPEC	2010	DBLP DOI BibTeX RDF
1	Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh	Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs.	STACS	2010	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Yngve Villanger	Finding Induced Subgraphs via Minimal Triangulations.	STACS	2010	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov	Cops and Robber Game without Recharging.	SWAT	2010	DBLP DOI BibTeX RDF
1	Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignasi Sau, Dimitrios M. Thilikos	Faster Parameterized Algorithms for Minor Containment.	SWAT	2010	DBLP DOI BibTeX RDF
1	Henning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh	The Curse of Connectivity: t-Total Vertex (Edge) Cover.	COCOON	2010	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos	Approximation Algorithms for Domination Search.	WAOA	2010	DBLP DOI BibTeX RDF
1	Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Matthias Mnich, Geevarghese Philip, Saket Saurabh	Ranking and Drawing in Subexponential Time.	IWOCA	2010	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh	Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments.	AAAI	2010	DBLP BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff	Sort and Search: Exact algorithms for generalized domination.	Inf. Process. Lett.	2009	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse	Nondeterministic Graph Searching: From Pathwidth to Treewidth.	Algorithmica	2009	DBLP DOI BibTeX RDF	Treewidth, Graph searching, Pathwidth
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	Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch	A measure & conquer approach for the analysis of exact algorithms.	J. ACM	2009	DBLP DOI BibTeX RDF	Dominating set, exact algorithm, independent set
1	Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé	A Linear Vertex Kernel for Maximum Internal Spanning Tree	CoRR	2009	DBLP BibTeX RDF
1	Fedor V. Fomin, Yngve Villanger	Finding Induced Subgraphs via Minimal Triangulations	CoRR	2009	DBLP BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, B. V. Raghavendra Rao, Saket Saurabh	Faster Algorithms for Finding and Counting Subgraphs	CoRR	2009	DBLP BibTeX RDF
1	Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo	Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem	CoRR	2009	DBLP BibTeX RDF
1	Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé	Kernels for Feedback Arc Set In Tournaments	CoRR	2009	DBLP BibTeX RDF
1	Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos	(Meta) Kernelization	CoRR	2009	DBLP BibTeX RDF
1	Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael Krivelevich, Saket Saurabh	Spanning Directed Trees with Many Leaves.	SIAM J. Discrete Math.	2009	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca	Computing branchwidth via efficient triangulations and blocks.	Discrete Applied Mathematics	2009	DBLP DOI BibTeX RDF
1	Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma	Fast Exact Algorithms for Hamiltonicity in Claw-Free Graphs.	WG	2009	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh	An Exact Algorithm for Minimum Distortion Embedding.	WG	2009	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos	Contraction Bidimensionality: The Accurate Picture.	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	Michael R. Fellows, Frances A. Rosamond, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Yngve Villanger	Local Search: Is Brute-Force Avoidable?	IJCAI	2009	DBLP BibTeX RDF
1	Michael R. Fellows, Fedor V. Fomin, Daniel Lokshtanov, Elena Losievskaja, Frances A. Rosamond, Saket Saurabh	Distortion Is Fixed Parameter Tractable.	ICALP	2009	DBLP DOI BibTeX RDF
1	Omid Amini, Fedor V. Fomin, Saket Saurabh	Counting Subgraphs via Homomorphisms.	ICALP	2009	DBLP DOI BibTeX RDF
1	Jianer Chen, Fedor V. Fomin (eds.)	Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Copenhagen, Denmark, September 10-11, 2009, Revised Selected Papers	IWPEC	2009	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos	Approximating Acyclicity Parameters of Sparse Hypergraphs.	STACS	2009	DBLP DOI BibTeX RDF
1	Henning Fernau, Fedor V. Fomin, Daniel Lokshtanov, Daniel Raible, Saket Saurabh, Yngve Villanger	Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves.	STACS	2009	DBLP DOI BibTeX RDF
1	Nathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo	Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem.	COCOON	2009	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov	Guard Games on Graphs: Keep the Intruder Out!	WAOA	2009	DBLP DOI BibTeX RDF
1	Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos	(Meta) Kernelization.	FOCS	2009	DBLP DOI BibTeX RDF	Polynonial Time Preprocessing, Counting Monadic Second Order Logic, Finite Integer Index, Graphs of Bounded Genus, Planar Graphs, Kernelization, Parameterized Algorithms, Finite State
1	Fedor V. Fomin, Serge Gaspers, Saket Saurabh, Stéphan Thomassé	A Linear Vertex Kernel for Maximum Internal Spanning Tree.	ISAAC	2009	DBLP DOI BibTeX RDF
1	Hajo Broersma, Fedor V. Fomin, Petr A. Golovach, Daniël Paulusma	Three Complexity Results on Coloring Pk-Free Graphs.	IWOCA	2009	DBLP DOI BibTeX RDF	P k -free graph, computational complexity, graph coloring
1	Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, Saket Saurabh, Stéphan Thomassé	Kernels for Feedback Arc Set In Tournaments.	FSTTCS	2009	DBLP DOI BibTeX RDF
1	Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh	Subexponential Algorithms for Partial Cover Problems.	FSTTCS	2009	DBLP DOI BibTeX RDF
1	Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos	Subexponential parameterized algorithms.	Computer Science Review	2008	DBLP DOI BibTeX RDF

Publications of "Fedor V. Fomin" ( http://dblp.L3S.de/Authors/Fedor_V._Fomin )