Fedor V. Fomin, Petr A. Golovach, Kirill Simonov. Parameterized k-Clustering: Tractability Island. 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Vol. 150, pages 14:1-14:15, Dagstuhl, Germany, 2019. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
@inproceedings{fedor v. fomin 2019parameterized,
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}
} Fedor V. Fomin, Daniel Lokshtanov, Syed Mohammad Meesum, Saket Saurabh, Meirav Zehavi. Matrix Rigidity from the Viewpoint of Parameterized Complexity. SIAM J. Discrete Math., 32(2): 966-985, 2018.
@article{fedor v. fomin 2018matrix,
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}
} Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos. (Meta) Kernelization. J. ACM, 63(5): 44:1-44:69, 2016.
@article{hans l. bodlaender 2016(meta),
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}
} Ivan Bliznets, Fedor V. Fomin, Marcin Pilipczuk, Michał Pilipczuk. A subexponential parameterized algorithm for Interval Completion. CoRR, abs/1402.3473, 2014.
@article{ivan bliznets 2014subexponential,
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}
} Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman, M. S. Ramanujan, Saket Saurabh. Faster Parameterized Algorithms Using Linear Programming. ACM Transactions on Algorithms, 11(2): 15, 2014.
@article{daniel lokshtanov 2014faster,
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}
} Omid Amini, Fedor V. Fomin, Saket Saurabh. Counting Subgraphs via Homomorphisms. SIAM J. Discrete Math., 26(2): 695-717, 2012.
@article{omid amini 2012counting,
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}
} Marek Cygan, Holger Dell, Daniel Lokshtanov, Dániel Marx, Jesper Nederlof, Yoshio Okamoto, Ramamohan Paturi, Saket Saurabh, Magnus Wahlström. On Problems as Hard as CNF-SAT. Proceedings of the 27th IEEE Conference on Computational Complexity (CCC), pages 74-84, 2012. IEEE.
@inproceedings{marek cygan 2012problems,
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}
} 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., 209(2): 143-153, 2011.
@article{michael r. fellows 2011complexity,
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}
} Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin. Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions. Algorithmica, 58(3): 790-810, 2010.
@article{frederic dorn 2010efficient,
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}
} Fedor V. Fomin, Dieter Kratsch. Exact Exponential Algorithms. Springer, 2010. An EATCS Series: Texts in Theoretical Computer Science
@book{fedor v. fomin 2010exact,
title={Exact Exponential Algorithms},
author={Fedor V. Fomin and Dieter Kratsch},
publisher={Springer},
year={2010}
} Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman, Saket Saurabh. Subexponential Algorithms for Partial Cover Problems. FSTTCS, pages 193-201, 2009.
@inproceedings{fedor v. fomin 2009subexponential,
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}
} Venkatesh Raman, Saket Saurabh. Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles. Algorithmica, 52(2): 203-225, 2008.
@article{venkatesh raman 2008short,
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}
} Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos. Subexponential parameterized algorithms. Computer Science Review, 2(1): 29-39, 2008.
@article{frederic dorn 2008subexponential,
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}
} Fedor V. Fomin, Dieter Kratsch, Ioan Todinca, Yngve Villanger. Exact algorithms for treewidth and minimum fill-in. SIAM J. Comput., 2008.
@article{fedor v. fomin 2008exact,
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}
} Venkatesh Raman, Saket Saurabh, C. R. Subramanian. Faster fixed parameter tractable algorithms for finding feedback vertex sets. ACM Transactions on Algorithms, 2(3): 403-415, 2006.
@article{venkatesh raman 2006faster,
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}
} Frederic Dorn, Fedor V. Fomin, Dimitrios M. Thilikos. Fast Subexponential Algorithm for Non-local Problems on Graphs of Bounded Genus.. Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT), pages 172-183, Berlin, 2006. Springer.
@inproceedings{frederic dorn 2006fast,
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}
} Fedor V. Fomin, Serge Gaspers, Saket Saurabh. Branching and Treewidth Based Exact Algorithms. 2006.
@unpublished{fedor v. fomin 2006branching,
title={Branching and Treewidth Based Exact Algorithms},
author={Fedor V. Fomin and Serge Gaspers and Saket Saurabh},
year={2006}
} Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch. Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the EATCS, 87: 47-77, 2005.
@article{fedor v. fomin 2005new,
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}
} Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatkin, Alexey Stepanov. Bounding the Number of Minimal Dominating Sets: a Measure and Conquer Approach. 2005.
@unpublished{fedor v. fomin 2005bounding,
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}
} Fedor V. Fomin, Artem V. Pyatkin. Finding minimum feedback vertex set in bipartite graph. 2005.
@unpublished{fedor v. fomin 2005finding,
title={Finding minimum feedback vertex set in bipartite graph},
author={Fedor V. Fomin and Artem V. Pyatkin},
year={2005}
} Fedor V. Fomin, Frédéric Mazoit, Ioan Todinca. Computing branchwidth via efficient triangulations and blocks. 2005.
@unpublished{fedor v. fomin 2005computing,
title={Computing branchwidth via efficient triangulations and blocks},
author={Fedor V. Fomin and Frédéric Mazoit and Ioan Todinca},
year={2005}
} Venkatesh Raman, Saket Saurabh, Somnath Sikdar. Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. Proceedings of the 9th Italian Conference on Theoretical Computer Science (ICTCS 2005), Vol. 3701, pages 375-389, 2005.
@inproceedings{venkatesh raman 2005improved,
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}
} Christophe Paul, Jan Arne Telle. New Tools and Simpler Algorithms for Branchwidth.. Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005), pages 379-390, 2005.
@inproceedings{christophe paul 2005new,
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}
} Fedor V. Fomin, Dieter Kratsch, Gerhard J. Woeginger. Exact (exponential) algorithms for the dominating set problem. 2004.
@unpublished{fedor v. fomin 2004exact,
title={Exact (exponential) algorithms for the dominating set problem},
author={Fedor V. Fomin and Dieter Kratsch and Gerhard J. Woeginger},
year={2004}
}