The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

URL (Homepage):  http://www.ii.uib.no/~fomin/  Author page on DBLP  Author page in RDF  Community of Fedor V. Fomin in ASPL-2

Publication years (Num. hits)
1998-2002 (20) 2003-2004 (26) 2005-2006 (27) 2007 (15) 2008 (31) 2009 (30) 2010 (26) 2011 (31) 2012 (33) 2013 (38) 2014 (23) 2015 (25) 2016 (30) 2017 (23) 2018 (22) 2019 (25)
Publication types (Num. hits)
article(238) book(2) incollection(6) inproceedings(171) proceedings(8)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 71 occurrences of 39 keywords

Results
Found 426 publication records. Showing 425 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Fedor V. Fomin, Dániel Marx, Saket Saurabh 0001, Meirav Zehavi New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh 0001, Stéphan Thomassé, Meirav Zehavi Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 Spanning Circuits in Regular Matroids. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh 0001 Editing to Connected F-Degree Graph. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petteri Kaski, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001 Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas A Fixed-Parameter Perspective on #BIS. Search on Bibsonomy Algorithmica The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh 0001 Exact Algorithms via Monotone Local Search. Search on Bibsonomy J. ACM The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov Low-rank binary matrix approximation in column-sum norm. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Going Far From Degeneracy. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Hans L. Bodlaender, Benjamin Burton, Fedor V. Fomin, Alexander Grigoriev Knot Diagrams of Treewidth Two. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Kirill Simonov Refined Complexity of PCA with Outliers. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Reducing Topological Minor Containment to the Unique Linkage Theorem. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Kirill Simonov Parameterized k-Clustering: The distance matters! Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Decomposition of Map Graphs with Applications. Search on Bibsonomy CoRR The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Michal Pilipczuk On width measures and topological problems on semi-complete digraphs. Search on Bibsonomy J. Comb. Theory, Ser. B The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Going Far From Degeneracy. Search on Bibsonomy ESA The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Decomposition of Map Graphs with Applications. Search on Bibsonomy ICALP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. Search on Bibsonomy ICALP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Akanksha Agrawal, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Prafullkumar Tale Path Contraction Faster Than 2n. Search on Bibsonomy ICALP The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Steven Chaplick, Fedor V. Fomin, Petr A. Golovach, Dusan Knop, Peter Zeman 0001 Kernelization of Graph Hamiltonicity: Proper H-Graphs. Search on Bibsonomy WADS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos Modification to Planarity is Fixed Parameter Tractable. Search on Bibsonomy STACS The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Kirill Simonov, Fedor V. Fomin, Petr A. Golovach, Fahad Panolan Refined Complexity of PCA with Outliers. Search on Bibsonomy ICML The full citation details ... 2019 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Long directed (s, t)-path: FPT algorithm. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk Subexponential Parameterized Algorithm for Interval Completion. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Michal Pilipczuk, Marcin Wrochna Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Dimitrios M. Thilikos Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh 0001, Meirav Zehavi Exact Algorithms for Terrain Guarding. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos Structured Connectivity Augmentation. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 Covering Vectors by Spaces: Regular Matroids. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh 0001, Meirav Zehavi Matrix Rigidity from the Viewpoint of Parameterized Complexity. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Mathieu Liedloff, Pedro Montealegre, Ioan Todinca Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal Cliques. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Saket Saurabh 0001 Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001 Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes. Search on Bibsonomy J. ACM The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Fahad Panolan Parameterized Low-Rank Binary Matrix Approximation. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001 Approximation Schemes for Low-Rank Binary Matrix Approximation Problems. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos On the Parameterized Complexity of Graph Modification to First-Order Logic Properties. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos Partial complementation of graphs. Search on Bibsonomy CoRR The full citation details ... 2018 DBLP  BibTeX  RDF
1Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh 0001 On the Optimality of Pseudo-polynomial Algorithms for Integer Programming. Search on Bibsonomy ESA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond On the Tractability of Optimization Problems on H-Graphs. Search on Bibsonomy ESA The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Fahad Panolan Parameterized Low-Rank Binary Matrix Approximation. Search on Bibsonomy ICALP The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Anastasios Sidiropoulos Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Vladimir V. Podolskii (eds.) Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings Search on Bibsonomy CSR The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Torstein J. F. Strømme, Dimitrios M. Thilikos Partial Complementation of Graphs. Search on Bibsonomy SWAT The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan On the Parameterized Complexity of [1, j]-Domination Problems. Search on Bibsonomy FSTTCS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Fedor V. Fomin, Danny Hermelin, Magnus Wahlström Randomization in Parameterized Complexity (Dagstuhl Seminar 17041). Search on Bibsonomy Dagstuhl Reports The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001 Representative Families of Product Families. Search on Bibsonomy ACM Trans. Algorithms The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan Metric Dimension of Bounded Tree-length Graphs. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh 0001 Parameterized Complexity of Superstring Problems. Search on Bibsonomy Algorithmica The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Rajesh Chitnis, Fedor V. Fomin, Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh 0001 Faster exact algorithms for some terminal set problems. Search on Bibsonomy J. Comput. Syst. Sci. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala Tight Lower Bounds on Graph Embedding Problems. Search on Bibsonomy J. ACM The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov Parameterized Complexity of Secluded Connectivity Problems. Search on Bibsonomy Theory Comput. Syst. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos Structured Connectivity Augmentation. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Anastasios Sidiropoulos Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Jean-Florent Raymond On the tractability of optimization problems on H-graphs. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas A Fixed-Parameter Perspective on #BIS. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 Covering vectors by spaces: Regular matroids. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Fedor V. Fomin, Christos H. Papadimitriou, Jean-Eric Pin The EATCS Award 2017 - Laudatio for Eva Tardos. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2017 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 Spanning Circuits in Regular Matroids. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk, Saket Saurabh 0001, Marcin Wrochna Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. Search on Bibsonomy SODA The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Search on Bibsonomy ICALP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin Finding Detours is Fixed-Parameter Tractable. Search on Bibsonomy ICALP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 Covering Vectors by Spaces: Regular Matroids. Search on Bibsonomy ICALP The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pradeesha Ashok, Fedor V. Fomin, Sudeshna Kolay, Saket Saurabh 0001, Meirav Zehavi Exact Algorithms for Terrain Guarding. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos Structured Connectivity Augmentation. Search on Bibsonomy MFCS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh 0001, Meirav Zehavi Matrix Rigidity from the Viewpoint of Parameterized Complexity. Search on Bibsonomy STACS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, John Lapinskas A Fixed-Parameter Perspective on #BIS. Search on Bibsonomy IPEC The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos Bidimensionality. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Dimitrios M. Thilikos Branchwidth of Graphs. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin Subexponential Parameterized Algorithms. Search on Bibsonomy Encyclopedia of Algorithms The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra, Geevarghese Philip, Saket Saurabh 0001 Hitting Forbidden Minors: Approximation and Kernelization. Search on Bibsonomy SIAM J. Discrete Math. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ivan Bliznets, Fedor V. Fomin, Michal Pilipczuk, Yngve Villanger Largest Chordal and Interval Subgraphs Faster than $$2^n$$ 2 n. Search on Bibsonomy Algorithmica The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Tatjana V. Abramovskaya, Fedor V. Fomin, Petr A. Golovach, Michal Pilipczuk How to hunt an invisible rabbit on a graph. Search on Bibsonomy Eur. J. Comb. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos Forewords: Special issue on Theory and Applications of Graph Searching Problems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Pinar Heggernes, Erik Jan van Leeuwen The Firefighter problem on graph classes. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh 0001, Dimitrios M. Thilikos (Meta) Kernelization. Search on Bibsonomy J. ACM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001 Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms. Search on Bibsonomy J. ACM The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub W. Pachocki, Arkadiusz Socala Tight Lower Bounds on Graph Embedding Problems. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Ivona Bezáková, Radu Curticapean, Holger Dell, Fedor V. Fomin Finding Detours is Fixed-parameter Tractable. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Fedor V. Fomin, Fahad Panolan, M. S. Ramanujan, Saket Saurabh 0001 Fine-grained complexity of integer programming: The case of bounded branch-width and rank. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Fedor V. Fomin, Torstein J. F. Strømme Vertex Cover Structural Parameterization Revisited. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 Subexponential parameterized algorithms for planar and apex-minor-free graphs via low treewidth pattern covering. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh 0001, Dimitrios M. Thilikos Bidimensionality and Kernels. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Rémy Belmonte, Fedor V. Fomin, Petr A. Golovach, M. S. Ramanujan Metric Dimension of Bounded Tree-length Graphs. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh 0001 Spanning Circuits in Regular Matroids. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Fedor V. Fomin The EATCS Award 2017 - Call for Nominations. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 2016 DBLP  BibTeX  RDF
1Rajesh Chitnis, Fedor V. Fomin, Petr A. Golovach Parameterized complexity of the anchored k-core problem for directed graphs. Search on Bibsonomy Inf. Comput. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Hans L. Bodlaender, Pål Grønås Drange, Markus S. Dregi, Fedor V. Fomin, Daniel Lokshtanov, Michal Pilipczuk A ck n 5-Approximation Algorithm for Treewidth. Search on Bibsonomy SIAM J. Comput. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Marek Cygan, Fedor V. Fomin, Alexander Golovnev, Alexander S. Kulikov, Ivan Mihajlin, Jakub Pachocki, Arkadiusz Socala Tight Bounds for Graph Homomorphism and Subgraph Isomorphism. Search on Bibsonomy SODA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michal Pilipczuk Subexponential parameterized algorithm for Interval Completion. Search on Bibsonomy SODA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, Saket Saurabh 0001 Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. Search on Bibsonomy FOCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Sudeshna Kolay, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001 Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. Search on Bibsonomy Symposium on Computational Geometry The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Torstein J. F. Strømme Vertex Cover Structural Parameterization Revisited. Search on Bibsonomy WG The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Petr A. Golovach, Fahad Panolan, Saket Saurabh 0001 Editing to Connected f-Degree Graph. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Pål Grønås Drange, Markus Sortland Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh 0001, Sebastian Siebertz, Somnath Sikdar Kernelization and Sparseness: the Case of Dominating Set. Search on Bibsonomy STACS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin, Serge Gaspers, Daniel Lokshtanov, Saket Saurabh 0001 Exact algorithms via monotone local search. Search on Bibsonomy STOC The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Fedor V. Fomin Graph Decompositions and Algorithms (Invited Talk). Search on Bibsonomy FSTTCS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #100 of 425 (100 per page; Change: )
Pages: [1][2][3][4][5][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license