[WpBibTeX type=”inproceedings” title=”Parameterized k-Clustering: Tractability Island” author=”Fedor V. Fomin and Petr A. Golovach and Kirill Simonov” booktitle=”39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)” year=”2019″ volume=”150″ series=”Leibniz International Proceedings in Informatics (LIPIcs)” pages=”14:1–14:15″ publisher=”Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik” address=”Dagstuhl, Germany” url=”https://drops.dagstuhl.de/opus/volltexte/2019/11576″ ]
[WpBibTeX type=”article” title=”Matrix Rigidity from the Viewpoint of Parameterized Complexity” author=”Fedor V. Fomin and Daniel Lokshtanov and Syed Mohammad Meesum and Saket Saurabh and Meirav Zehavi” journal=”SIAM J. Discrete Math.” year=”2018″ volume=”32″ number=”2″ pages=”966–985″ url=”https://doi.org/10.1137/17M112258X” ]
[WpBibTeX type=”article” title=”(Meta) Kernelization” author=”Hans L. Bodlaender and Fedor V. Fomin and Daniel Lokshtanov and Eelko Penninkx and Saket Saurabh and Dimitrios M. Thilikos” journal=”J. ACM” year=”2016″ volume=”63″ number=”5″ pages=”44:1–44:69″ url=”https://doi.org/10.1145/2973749″ ]
[WpBibTeX type=”article” title=”A subexponential parameterized algorithm for Interval Completion” author=”Ivan Bliznets and Fedor V. Fomin and Marcin Pilipczuk and Michał Pilipczuk” journal=”CoRR” year=”2014″ volume=”abs/1402.3473″ ]
[WpBibTeX type=”article” title=”Faster Parameterized Algorithms Using Linear Programming” author=”Daniel Lokshtanov and N. S. Narayanaswamy and Venkatesh Raman and M. S. Ramanujan and Saket Saurabh” journal=”ACM Transactions on Algorithms” year=”2014″ volume=”11″ number=”2″ pages=”15″ ]
[WpBibTeX type=”article” title=”Counting Subgraphs via Homomorphisms” author=”Omid Amini and Fedor V. Fomin and Saket Saurabh” journal=”SIAM J. Discrete Math.” year=”2012″ volume=”26″ number=”2″ pages=”695-717″ ]
[WpBibTeX type=”inproceedings” title=”On Problems as Hard as CNF-SAT” author=”Marek Cygan and Holger Dell and Daniel Lokshtanov and Dániel Marx and Jesper Nederlof and Yoshio Okamoto and Ramamohan Paturi and Saket Saurabh and Magnus Wahlström” booktitle=”Proceedings of the 27th IEEE Conference on Computational Complexity (CCC)” year=”2012″ pages=”74-84″ publisher=”IEEE” ]
[WpBibTeX type=”article” title=”On the complexity of some colorful problems parameterized by treewidth” author=”Michael R. Fellows and Fedor V. Fomin and Daniel Lokshtanov and Frances A. Rosamond and Saket Saurabh and Stefan Szeider and Carsten Thomassen” journal=”Inf. Comput.” year=”2011″ volume=”209″ number=”2″ pages=”143–153″ ]
[WpBibTeX type=”article” title=”Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions” author=”Frederic Dorn and Eelko Penninkx and Hans L. Bodlaender and Fedor V. Fomin” journal=”Algorithmica” year=”2010″ volume=”58″ number=”3″ pages=”790-810″ ]
[WpBibTeX type=”book” title=”Exact Exponential Algorithms” author=”Fedor V. Fomin and Dieter Kratsch” publisher=”Springer” year=”2010″ note=”An EATCS Series: Texts in Theoretical Computer Science” ]
[WpBibTeX type=”inproceedings” title=”Subexponential Algorithms for Partial Cover Problems” author=”Fedor V. Fomin and Daniel Lokshtanov and Venkatesh Raman and Saket Saurabh” booktitle=”FSTTCS” year=”2009″ pages=”193-201″ ]
[WpBibTeX type=”article” title=”Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles” author=”Venkatesh Raman and Saket Saurabh” journal=”Algorithmica” year=”2008″ volume=”52″ number=”2″ pages=”203-225″ ]
[WpBibTeX type=”article” title=”Subexponential parameterized algorithms” author=”Frederic Dorn and Fedor V. Fomin and Dimitrios M. Thilikos” journal=”Computer Science Review” year=”2008″ volume=”2″ number=”1″ pages=”29-39″ ]
[WpBibTeX type=”article” title=”Exact algorithms for treewidth and minimum fill-in” author=”Fedor V. Fomin and Dieter Kratsch and Ioan Todinca and Yngve Villanger” journal=”SIAM J. Comput.” year=”2008″ ]
[WpBibTeX type=”article” title=”Faster fixed parameter tractable algorithms for finding feedback vertex sets” author=”Venkatesh Raman and Saket Saurabh and C. R. Subramanian” journal=”ACM Transactions on Algorithms” year=”2006″ volume=”2″ number=”3″ pages=”403-415″ ]
[WpBibTeX type=”inproceedings” title=”Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus.” author=”Frederic Dorn and Fedor V. Fomin and Dimitrios M. Thilikos” booktitle=”Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT)” year=”2006″ series=”Lecture Notes in Computer Science” pages=”172-183″ publisher=”Springer” address=”Berlin” ]
[WpBibTeX type=”unpublished” title=”Branching and Treewidth Based Exact Algorithms” author=”Fedor V. Fomin and Serge Gaspers and Saket Saurabh” year=”2006″ ]
[WpBibTeX type=”article” title=”Some new techniques in design and analysis of exact (exponential) algorithms” author=”Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch” journal=”Bulletin of the EATCS” year=”2005″ volume=”87″ pages=”47-77″ ]
[WpBibTeX type=”unpublished” title=”Bounding the Number of Minimal Dominating Sets: a Measure and Conquer Approach” author=”Fedor V. Fomin and Fabrizio Grandoni and Artem V. Pyatkin and Alexey Stepanov” year=”2005″ ]
[WpBibTeX type=”unpublished” title=”Finding minimum feedback vertex set in bipartite graph” author=”Fedor V. Fomin and Artem V. Pyatkin” year=”2005″ ]
[WpBibTeX type=”unpublished” title=”Computing branchwidth via efficient triangulations and blocks” author=”Fedor V. Fomin and Frédéric Mazoit and Ioan Todinca” year=”2005″ ]
[WpBibTeX type=”inproceedings” title=”Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems” author=”Venkatesh Raman and Saket Saurabh and Somnath Sikdar” booktitle=”Proceedings of the 9th Italian Conference on Theoretical Computer Science (ICTCS 2005)” year=”2005″ volume=”3701″ series=”Lecture Notes in Computer Science” pages=”375-389″ ]
[WpBibTeX type=”inproceedings” title=”New Tools and Simpler Algorithms for Branchwidth.” author=”Christophe Paul and Jan Arne Telle” booktitle=”Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005)” year=”2005″ pages=”379-390″ ]
[WpBibTeX type=”unpublished” title=”Exact (exponential) algorithms for the dominating set problem” author=”Fedor V. Fomin and Dieter Kratsch and Gerhard J. Woeginger” year=”2004″ ]