Home
  • E-mailFedor.Fomin@uib.no
  • Phone+47 55 58 40 24
  • Visitor Address
    HIB - Thormøhlensgt. 55
  • Postal Address
    Postboks 7803
    5020 Bergen

Fedor Fomin received his Master (1992) and PhD (1997) degrees from the  Faculty of Mathematics and Mechanics, St. Petersburg State University. Here is a link to his page at the Mathematics Genealogy Project. In 2002, after doing postdocs in Chile (Universidad de Chile), Czech Republic (Charles University), and in Germany (University of Paderborn),  he joined the Department of Informatics, University of Bergen, as the professor in Algorithms. 

 

His  current research interests are mainly in Algorithms and Combinatorics: Parameterized Algorithms and Kernelization +++ Exact (exponential time) Algorithms +++ Low-rank Matrix Approximation and Clustering +++ Algorithmic Foundations of Machine Learning+++ Graph Algorithms +++ Matroid Algorithms +++ Algorithmic Graph Minors +++ Sparse Graphs +++ Tournaments +++ Metric Embeddings +++ Graph Coloring +++ Graph Homomorphisms +++Treewidth +++ Pursuit-evasion and graph searching.

     

    Open acess publications in arXiv.

    Books (with links to free downloads)

    Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi, Kernelization. Theory of Parameterized Preprocessing, Cambridge University Press, 2019. Amazon link. Free downloadable version and errata are available from  here.

    Marek Cygan, Fedor V. Fomin, Lukasz Kowalik, Daniel Lokshtanov, Daniel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh, Parameterized Algorithms, Springer, 2015. Amazon link. Free downloadable version and errata are available from  here.

    Fedor V. Fomin and Dieter Kratsch, Exact Exponential Algorithms, Springer, 2010. Amazon link. Free downloadable version and errata are available from  here.

     

     

    The following list of publications is automatically generated (with some mistakes) from the national database CRIStin. 

     

    Books
    • Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav. 2019. Kernelization. Theory of Parameterized Preprocessing. Cambridge University Press. 490 pages. ISBN: 9781107415157.
    • Fomin, Fedor; Podolskii, Vladimir V. 2018. Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings. Springer. 333 pages. ISBN: 978-3-319-90529-7.
    • Cygan, Marek; Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket. 2015. Parameterized Algorithms. 600 pages. ISBN: 978-3-319-21275-3.
    • Fomin, Fedor; Kaski, Petteri. 2012. Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. Springer. 397 pages. ISBN: 978-3-642-31154-3.
    • Fomin, Fedor; Kratsch, Dieter. 2010. Exact exponential algorithms. Springer. 204 pages. ISBN: 978-3-642-16532-0.
    • Chen, Jianer; Fomin, Fedor. 2009. Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009. Springer. 210 pages. ISBN: 978-3-642-11268-3.
    Journal articles
    • Aaboud, Morad; Aad, Georges; Abbott, Brad; Abdinov, Ovsat Bahram oglu; Abeloos, Baptiste; Abhayasinghe, Deshan Kavishka; Abidi, Syed Haider; AbouZeid, Hass; Abraham, Nadine L.; Abramowicz, Halina; Buanes, Trygve; Djuvsland, Julia Isabell; Eigen, Gerald; Fomin, Fedor; Lipniacka, Anna; Martin dit Latour, Bertrand; Mæland, Steffen; Stugu, Bjarne; Yang, Zongchang; Zalieckas, Justas; Bugge, Magnar Kopangen; Cameron, David Gordon; Catmore, James Richard; Feigl, Simon; Franconi, Laura; Garonne, Vincent; Gramstad, Eirik; Hellesund, Simen; Morisbak, Vanja; Oppen, Henrik; Ould-Saada, Farid; Pedersen, Maiken; Read, Alexander Lincoln; Røhne, Ole Myren; Sandaker, Heidi; Serfon, Cédric; Stapnes, Steinar; Vadla, Knut Oddvar Høie; Abreu, Henso; Abulaiti, Yiming; Acharya, Bobby S.; Adachi, Shunsuke; Adamczyk, Leszek; Adelman, Jareed; Adersberger, Michael; Adigüzel, Aytül; Adye, Tim; Affolder, Anthony Allen; Afik, Yoav; Agheorghiesei, Catalin; ATLAS, Collaboration. 2019. Search for Higgs boson decays into a pair of light bosons in the bbμμ final state in pp collision at √s=13 TeV with the ATLAS detector. Nuclear Physics B. 790: 1-21. doi: 10.1016/j.physletb.2018.10.073
    • Curticapean, Radu; Dell, Holger; Fomin, Fedor; Goldberg, Leslie Ann; Lapinskas, John. 2019. A Fixed-Parameter Perspective on #BIS. Algorithmica. 81: 3844-3864. doi: 10.1007/s00453-019-00606-4
    • Fomin, Fedor; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket. 2019. Exact algorithms via monotone local search. Journal of the ACM. 66: 8:1-8:23. doi: 10.1145/3284176
    • Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav. 2019. Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. Leibniz International Proceedings in Informatics. 132: 59:1-59:13. doi: 10.4230/LIPIcs.ICALP.2019.59
    • Fomin, Fedor; Golovach, Petr; Panolan, Fahad; Saurabh, Saket. 2019. Editing to connected F-degree graph. SIAM Journal on Discrete Mathematics. 33: 795-836. doi: 10.1137/17M1129428
    • Fomin, Fedor; Kaski, Petteri; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket. 2019. Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. SIAM Journal on Discrete Mathematics. 33: 327-345. doi: 10.1137/17M1140030
    • Fomin, Fedor; Le, Tien-Nam; Lokshtanov, Daniel; Saurabh, Saket; Thomasse, Stephan; Zehavi, Meirav. 2019. Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. ACM Transactions on Algorithms (TALG). 15. 44 pages. doi: 10.1145/3293466
    • Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav. 2019. Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Discrete & Computational Geometry. 1-33. doi: 10.1007/s00454-018-00054-x
    • Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav. 2019. Decomposition of map graphs with applications. Leibniz International Proceedings in Informatics. 132: 60:1-60:15. doi: 10.4230/LIPIcs.ICALP.2019.60
    • Fomin, Fedor; Pilipczuk, Michal. 2019. On width measures and topological problems on semi-complete digraphs. Journal of combinatorial theory. Series B (Print). doi: 10.1016/j.jctb.2019.01.006
    • Ashok, Pradeesha; Fomin, Fedor; Kolay, Sudeshna; Saurabh, Saket; Zehavi, Meirav. 2018. Exact algorithms for terrain guarding. ACM Transactions on Algorithms (TALG). 14. 20 pages. doi: 10.1145/3186897
    • Bliznets, Ivan; Fomin, Fedor; Pilipczuk, Marcin; Pilipczuk, Michal. 2018. Subexponential parameterized algorithm for interval completion. ACM Transactions on Algorithms (TALG). 14. 62 pages. doi: 10.1145/3186896
    • Carpenter, Timothy; Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket; Sidiropoulos, Anastasios. 2018. Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. Leibniz International Proceedings in Informatics. 99: 21:1-21:14. doi: 10.4230/LIPIcs.SoCG.2018.21
    • Curticapean, Radu; Dell, Holger; Fomin, Fedor; Goldberg, Leslie Ann; Lapinskas, John. 2018. A Fixed-Parameter Perspective on #BIS. Leibniz International Proceedings in Informatics. 13:1-13:13. doi: 10.4230/LIPIcs.IPEC.2017.13
    • Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Saurabh, Saket. 2018. Covering Vectors by Spaces: Regular Matroids. SIAM Journal on Discrete Mathematics. 32: 2512-2565. doi: 10.1137/17M1151250
    • Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav. 2018. Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. ACM Transactions on Algorithms (TALG). 15. 27 pages. doi: 10.1145/3280824
    • Fomin, Fedor; Golovach, Petr; Panolan, Fahad. 2018. Parameterized low-rank binary matrix approximation. Leibniz International Proceedings in Informatics. 107: 1-16. doi: 10.4230/LIPIcs.ICALP.2018.53
    • Fomin, Fedor; Golovach, Petr; Raymond, Jean-Florent. 2018. On the tractability of optimization problems on H-graphs. Leibniz International Proceedings in Informatics. 112: 1-14. doi: 10.4230/LIPIcs.ESA.2018.30
    • Fomin, Fedor; Golovach, Petr; Strømme, Torstein J.; Thilikos, Dimitrios. 2018. Partial Complementation of Graphs. Leibniz International Proceedings in Informatics. 101: 21:1-21:13. doi: 10.4230/LIPIcs.SWAT.2018.21
    • Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. 2018. Structured connectivity augmentation. SIAM Journal on Discrete Mathematics. 32: 2612-2635. doi: 10.1137/17M1146233
    • Fomin, Fedor; Lokshtanov, Daniel; Meesum, Syed Mohammad; Saurabh, Saket; Zehavi, Meirav. 2018. Matrix rigidity from the viewpoint of parameterized complexity. SIAM Journal on Discrete Mathematics. 32: 966-985. doi: 10.1137/17M112258X
    • Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav. 2018. Long directed (s,t)-path: FPT algorithm. Information Processing Letters. 140: 8-12. doi: 10.1016/j.ipl.2018.04.018
    • Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket. 2018. Excluded grid minors and efficient polynomial-time approximation schemes. Journal of the ACM. 65: 1-44. doi: 10.1145/3154833
    • Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket; Pilipczuk, Michal; Wrochna, Marcin. 2018. Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. ACM Transactions on Algorithms (TALG). 14. doi: 10.1145/3186898
    • Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket; Thilikos, Dimitrios M. 2018. Kernels for (Connected) dominating set on graphs with excluded topological minors. ACM Transactions on Algorithms (TALG). 14. doi: 10.1145/3155298
    • Fomin, Fedor; Panolan, Fahad; Ramanujan, MS; Saurabh, Saket. 2018. On the optimality of pseudo-polynomial algorithms for integer programming. Leibniz International Proceedings in Informatics. 112: 31:1-31:13. doi: 10.4230/LIPIcs.ESA.2018.31
    • Fomin, Fedor; Podolskii, Vladimir V. 2018. Preface. Lecture Notes in Computer Science. 10846 LNCS: VI.
    • Fomin, Fedor; Saurabh, Saket. 2018. Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin. Algorithmica. 80: 2513-2515. doi: 10.1007/s00453-018-0416-7
    • Ashok, Pradeesha; Fomin, Fedor; Kolay, Sudeshna; Saurabh, Saket; Zehavi, Meirav. 2017. Exact algorithms for terrain guarding. Leibniz International Proceedings in Informatics. 77: 111-1115. doi: 10.4230/LIPIcs.SoCG.2017.11
    • Belmonte, Remy; Fomin, Fedor; Golovach, Petr; Ramanujan, M. S. 2017. Metric Dimension of Bounded Tree-length Graphs. SIAM Journal on Discrete Mathematics. 31: 1217-1243. doi: 10.1137/16M1057383
    • Bezakova, Ivona; Curticapean, Radu; Dell, Holger; Fomin, Fedor. 2017. Finding detours is fixed-parameter tractable. Leibniz International Proceedings in Informatics. 80: 1-14. doi: 10.4230/LIPIcs.ICALP.2017.54
    • Chitnis, Rajesh; Fomin, Fedor; Lokshtanov, Daniel; Misra, Pranabendu; Maadapuzhi Shridharan, Ramanujan; Saurabh, Saket. 2017. Faster exact algorithms for some terminal set problems. Journal of computer and system sciences (Print). 88: 195-207. doi: 10.1016/j.jcss.2017.04.003
    • Cygan, Marek; Fomin, Fedor; Golovnev, Alexander; Kulikov, Alexander S.; Mihajlin, Ivan; Pachocki, Jakub; Socala, Arkadiusz. 2017. Tight lower bounds on graph embedding problems. Journal of the ACM. 64:18: 1-22. doi: 10.1145/3051094
    • Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Saurabh, Saket. 2017. Spanning Circuits in Regular Matroids. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 1433-1441.
    • Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Saurabh, Saket. 2017. Covering vectors by spaces: Regular matroids. Leibniz International Proceedings in Informatics. 80: 1-15. doi: 10.4230/LIPIcs.ICALP.2017.56
    • Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. 2017. Structured Connectivity Augmentation. Leibniz International Proceedings in Informatics. 83. doi: 10.4230/LIPIcs.MFCS.2017.29
    • Fomin, Fedor; Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan. 2017. Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Algorithmica. 80: 1146-1169. Published 2017-02-27. doi: 10.1007/s00453-017-0297-1
    • Fomin, Fedor; Lokshtanov, Daniel; Meesum, Syed Mohammad; Saurabh, Saket; Zehavi, Meirav. 2017. Matrix rigidity from the viewpoint of parameterized complexity. Leibniz International Proceedings in Informatics. 66. doi: 10.4230/LIPIcs.STACS.2017.32
    • Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket. 2017. Representative families of product families. ACM Transactions on Algorithms (TALG). 13:36: 1-29. doi: 10.1145/3039243
    • Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav. 2017. Finding, hitting and packing cycles in subexponential time on unit disk graphs. Leibniz International Proceedings in Informatics. 80: 1-15. doi: 10.4230/LIPIcs.ICALP.2017.65
    • Abramovskaya, Tatjana V.; Fomin, Fedor; Golovach, Petr; Pilipczuk, Michal Pawel. 2016. How to hunt an invisible rabbit on a graph. European journal of combinatorics (Print). 52: 12-26. doi: 10.1016/j.ejc.2015.08.002
    • Bliznets, Ivan; Fomin, Fedor; Golovach, Petr; Karpov, Nikolay; Kulikov, Alexander S.; Saurabh, Saket. 2016. Parameterized Complexity of Superstring Problems. Algorithmica. Published ahead of print: 1-16. doi: 10.1007/s00453-016-0193-0
    • Bodlaender, Hans L.; Drange, Pål Grønås; Dregi, Markus Sortland; Fomin, Fedor; Lokshtanov, Daniel; Pilipczuk, Michal Pawel. 2016. A $c^k n$ 5-approximation algorithm for treewidth. SIAM journal on computing (Print). 45: 317-378. doi: 10.1137/130947374
    • Bodlaender, Hans L.; Fomin, Fedor; Lokshtanov, Daniel; Penninkx, Eelko; Saurabh, Saket; Thilikos, Dimitrios M. 2016. (Meta) Kernelization. Journal of the ACM. 63:44. doi: 10.1145/2973749
    • Chitnis, Rajesh; Fomin, Fedor; Golovach, Petr. 2016. Parameterized complexity of the anchored k-core problem for directed graphs. Information and Computation. 247: 11-22. doi: 10.1016/j.ic.2015.11.002
    • Drange, Pål Grønås; Dregi, Markus Sortland; Fomin, Fedor; Kreutzer, Stephan; Lokshtanov, Daniel; Pilipczuk, Marcin; Pilipczuk, Michal Pawel; Reidl, Felix; Villaamil, Fernando Sánchez; Saurabh, Saket; Siebertz, Sebastian; Sikdar, Somnath. 2016. Kernelization and sparseness: The case of dominating set. Leibniz International Proceedings in Informatics. 47:31. 14 pages. doi: 10.4230/LIPIcs.STACS.2016.31
    • Fomin, Fedor; Fraigniaud, Pierre; Nisse, Nicolas; Thilikos, Dimitrios M. 2016. Forewords: Special issue on Theory and Applications of Graph Searching Problems. Theoretical Computer Science. 655: 1-1. doi: 10.1016/j.tcs.2016.11.001
    • Fomin, Fedor; Gaspers, Serge; Lokshtanov, Daniel; Saurabh, Saket. 2016. Exact algorithms via monotone local search. Proceedings of the Annual ACM Symposium on Theory of Computing. 19-21-June-2016: 764-775. doi: 10.1145/2897518.2897551
    • Fomin, Fedor; Golovach, Petr; Karpov, Nikolay; Kulikov, Alexander S. 2016. Parameterized complexity of secluded connectivity problems. Theory of Computing Systems. Published ahead of print: 1-25. doi: 10.1007/s00224-016-9717-x
    • Fomin, Fedor; Golovach, Petr; Panolan, Fahad; Saurabh, Saket. 2016. Editing to connected f-degree graph. Leibniz International Proceedings in Informatics. 47:36: 1-15. doi: 10.4230/LIPIcs.STACS.2016.36
    • Fomin, Fedor; Heggernes, Pinar; van Leeuwen, Erik Jan. 2016. The Firefighter problem on graph classes. Theoretical Computer Science. 613: 38-50. doi: 10.1016/j.tcs.2015.11.024
    • Fomin, Fedor; Kolay, Sudeshna; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket. 2016. Subexponential algorithms for rectilinear Steiner tree and arborescence problems. Leibniz International Proceedings in Informatics. 51: 39.1-39.15. doi: 10.4230/LIPIcs.SoCG.2016.39
    • Fomin, Fedor; Lokshtanov, Daniel; Marx, Dániel; Pilipczuk, Marcin; Pilipczuk, Michal Pawel; Saurabh, Saket. 2016. Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. Proceedings ... annual Symposium on Foundations of Computer Science. 2016-December: 515-524. doi: 10.1109/FOCS.2016.62
    • Fomin, Fedor; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket. 2016. Hitting forbidden minors: Approximation and kernelization. SIAM Journal on Discrete Mathematics. 30: 383-410. doi: 10.1137/140997889
    • Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket. 2016. Efficient computation of representative families with applications in parameterized and exact algorithms. Journal of the ACM. 63:29. doi: 10.1145/2886094
    • Fomin, Fedor; Strømme, Torstein J. 2016. Vertex cover structural parameterization revisited. Lecture Notes in Computer Science. 9941 LNCS: 171-182. doi: 10.1007/978-3-662-53536-3_15
    • Belmonte, Remy; Fomin, Fedor; Golovach, Petr; Ramanujan, MS. 2015. Metric dimension of bounded width graphs. Lecture Notes in Computer Science. 9235: 115-126. doi: 10.1007/978-3-662-48054-0_10
    • Bliznets, Ivan; Fomin, Fedor; Golovach, Petr; Karpov, Nikolay; Kulikov, Alexander S; Saurabh, Saket. 2015. Parameterized complexity of superstring problems. Lecture Notes in Computer Science. 9133: 89-99. doi: 10.1007/978-3-319-19929-0_8
    • Bliznets, Ivan; Fomin, Fedor; Pilipczuk, Marcin; Pilipczuk, Michal Pawel. 2015. A subexponential parameterized algorithm for proper interval completion. SIAM Journal on Discrete Mathematics. 29: 1961-1987. doi: 10.1137/140988565
    • Bliznets, Ivan; Fomin, Fedor; Pilipczuk, Michal Pawel; Villanger, Yngve. 2015. Largest chordal and interval subgraphs faster than 2n. Algorithmica. Published ahead of print. 26 pages. doi: 10.1007/s00453-015-0054-2
    • Drange, Pål Grønås; Fomin, Fedor; Pilipczuk, Michal Pawel; Villanger, Yngve. 2015. Exploring the subexponential complexity of completion problems. ACM Transactions on Computation Theory. 7:14. doi: 10.1145/2799640
    • Fernau, Henning; Fomin, Fedor; Philip, Geevarghese; Saurabh, Saket. 2015. On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Theoretical Computer Science. 565: 1-15. doi: 10.1016/j.tcs.2014.10.035
    • Fomin, Fedor; Giannopoulou, Archontia; Pilipczuk, Michal Pawel. 2015. Computing tree-depth faster than 2n. Algorithmica. 73: 202-216. doi: 10.1007/s00453-014-9914-4
    • Fomin, Fedor; Golovach, Petr; Karpov, Nikolay; Kulikov, Alexander S. 2015. Parameterized complexity of secluded connectivity problems. Leibniz International Proceedings in Informatics. 45: 408-419. doi: 10.4230/LIPIcs.FSTTCS.2015.408
    • Fomin, Fedor; Golovach, Petr; Nederlof, Jesper; Pilipczuk, Michal Pawel. 2015. Minimizing Rosenthal potential in multicast games. Theory of Computing Systems. 57: 81-96. doi: 10.1007/s00224-014-9573-5
    • Fomin, Fedor; Golovnev, Alexander; Kulikov, Alexander S.; Mihajlin, Ivan. 2015. Lower bounds for the graph homomorphism problem. Lecture Notes in Computer Science. 9134: 481-493. doi: 10.1007/978-3-662-47672-7_39
    • Fomin, Fedor; Kaski, Petteri; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket. 2015. Parameterized single-exponential time polynomial space algorithm for steiner tree. Lecture Notes in Computer Science. 9134: 494-505. doi: 10.1007/978-3-662-47672-7_40
    • Fomin, Fedor; Saurabh, Saket; Misra, Neeldhara. 2015. Graph modification problems: A modern perspective. Lecture Notes in Computer Science. 9130: 3-6. doi: 10.1007/978-3-319-19647-3_1
    • Fomin, Fedor; Todinca, Ioan; Villanger, Yngve. 2015. Large induced subgraphs via triangulations and CMSO. SIAM journal on computing (Print). 44: 54-87. doi: 10.1137/140964801
    • Basavaraju, Manu; Fomin, Fedor; Golovach, Petr; Misra, Pranabendu; Maadapuzhi Shridharan, Ramanujan; Saurabh, Saket. 2014. Parameterized algorithms to preserve connectivity. Lecture Notes in Computer Science. 8572 LNCS: 800-811. doi: 10.1007/978-3-662-43948-7_66
    • Basavaraju, Manu; Fomin, Fedor; Golovach, Petr; Saurabh, Saket. 2014. Connecting vertices by independent trees. Leibniz International Proceedings in Informatics. 29: 73-84. doi: 10.4230/LIPIcs.FSTTCS.2014.73
    • Bazgan, Cristina; Chopin, Morgan; Cygan, Marek; Fellows, Michael R.; Fomin, Fedor; van Leeuwen, Erik Jan. 2014. Parameterized complexity of firefighting. Journal of computer and system sciences (Print). 80: 1285-1297. doi: 10.1016/j.jcss.2014.03.001
    • Bliznets, Ivan; Fomin, Fedor; Pilipczuk, Marcin; Pilipczuk, Michal Pawel. 2014. A subexponential parameterized algorithm for proper interval completion. Lecture Notes in Computer Science. 8737 LNCS: 173-184. doi: 10.1007/978-3-662-44777-2-15
    • Drange, Pål Grønås; Fomin, Fedor; Pilipczuk, Michal Pawel; Villanger, Yngve. 2014. Exploring subexponential parameterized complexity of completion problems. Leibniz International Proceedings in Informatics. 25: 288-299. Published 2014-03-05. doi: 10.4230/LIPIcs.STACS.2014.288
    • Fernau, Henning; Fomin, Fedor; Lokshtanov, Daniel; Mnich, Matthias; Philip, Geevarghese; Saurabh, Saket. 2014. Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems. Tsinghua Science and Technology. 19: 374-386. doi: 10.1109/TST.2014.6867519
    • Fomin, Fedor; Giroire, Frédéric; Jean-Marie, Alain; Mazauric, Dorian; Nisse, Nicolas. 2014. To satisfy impatient Web surfers is hard. Theoretical Computer Science. 526: 1-17. doi: 10.1016/j.tcs.2014.01.009
    • Fomin, Fedor; Golovach, Petr. 2014. Parameterized complexity of connected even/odd subgraph problems. Journal of computer and system sciences (Print). 80: 157-179. doi: 10.1016/j.jcss.2013.07.002
    • Fomin, Fedor; Golovach, Petr. 2014. Long circuits and large euler subgraphs. SIAM Journal on Discrete Mathematics. 28: 878-892. doi: 10.1137/130936816
    • Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Saurabh, Saket. 2014. Almost optimal lower bounds for problems parameterized by clique-width. SIAM journal on computing (Print). 43: 1541-1563. doi: 10.1137/130910932
    • Fomin, Fedor; Heggernes, Pinar; Kratsch, Dieter; Papadopoulos, Charis; Villanger, Yngve. 2014. Enumerating minimal subset feedback vertex sets. Algorithmica. 69: 216-231. doi: 10.1007/s00453-012-9731-6
    • Fomin, Fedor; Jansen, Bart Maarten Paul; Pilipczuk, Michal Pawel. 2014. Preprocessing subgraph and minor problems: When does a small vertex cover help? Journal of computer and system sciences (Print). 80: 468-495. doi: 10.1016/j.jcss.2013.09.004
    • Fomin, Fedor; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michal Pawel; Villanger, Yngve. 2014. Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters. Journal of computer and system sciences (Print). 80: 1430-1447. doi: 10.1016/j.jcss.2014.04.015
    • Fomin, Fedor; Liedloff, Mathieu; Montealegre, Pedro; Todinca, Ioan. 2014. Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Lecture Notes in Computer Science. 8503 LNCS: 182-193. doi: 10.1007/978-3-319-08404-6_16
    • Fomin, Fedor; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket. 2014. Representative sets of product families. Lecture Notes in Computer Science. 8737 LNCS: 443-454. doi: 10.1007/978-3-662-44777-2_37
    • Fomin, Fedor; Villanger, Yngve. 2014. Searching for better fill-in. Journal of computer and system sciences (Print). 80: 1374-1383. doi: 10.1016/j.jcss.2014.04.010
    • Blizniets, Ivan; Fomin, Fedor; Pilipczuk, Michal Pawel; Villanger, Yngve. 2013. Largest chordal and interval subgraphs faster than 2^n. Lecture Notes in Computer Science. 8125: 193-204.
    • Bodlaender, Hans L.; Drange, Pål Grønås; Dregi, Markus Sortland; Fomin, Fedor; Lokshtanov, Daniel; Pilipczuk, Michal Pawel. 2013. An O(c^k n) 5-approximation algorithm for treewidth. Proceedings ... annual Symposium on Foundations of Computer Science. 54: 499-508. doi: 10.1109/FOCS.2013.60
    • Broersma, Hajo; Fomin, Fedor; Golovach, Petr; Paulusma, Daniël. 2013. Three complexity results on coloring Pk-free graphs. European journal of combinatorics (Print). 34: 609-619. doi: 10.1016/j.ejc.2011.12.008
    • Broersma, Hajo; Fomin, Fedor; van 't Hof, Pim; Paulusma, Daniel. 2013. Exact algorithms for finding longest cycles in claw-free graphs. Algorithmica. 65: 129-145. doi: 10.1007/s00453-011-9576-4
    • Dorn, Frederic; Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket. 2013. Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Information and Computation. 233: 60-70. doi: 10.1016/j.ic.2013.11.006
    • Fomin, Fedor; Gaspers, Serge; Saurabh, Saket; Thomasse, Stephane. 2013. A linear vertex kernel for maximum internal spanning tree. Journal of computer and system sciences (Print). 79: 1-6. doi: 10.1016/j.jcss.2012.03.004
    • Fomin, Fedor; Giannopoulou, Archontia; Pilipczuk, Michal Pawel. 2013. Computing tree-depth faster than 2^n. Lecture Notes in Computer Science. 8246: 137-149.
    • Fomin, Fedor; Golovach, Petr. 2013. Long Circuits and Large Euler Subgraphs. Lecture Notes in Computer Science. 8125: 493-504.
    • Fomin, Fedor; Golovach, Petr; Korhonen, Janne. 2013. On the Parameterized Complexity of Cutting a Few Vertices from a Graph. Lecture Notes in Computer Science. 8087: 421-432.
    • Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter; Lokshtanov, Daniel; Saurabh, Saket. 2013. Computing optimal Steiner trees in polynomial space. Algorithmica. 65: 584-604. doi: 10.1007/s00453-012-9612-z
    • Fomin, Fedor; Kaski, Petteri. 2013. Exact exponential algorithms. Communications of the ACM. 56: 80-88. doi: 10.1145/2428556.2428575
    • Fomin, Fedor; Kratsch, Stefan; Pilipczuk, Marcin; Pilipczuk, Michal Pawel; Villanger, Yngve. 2013. Tight bounds for parameterized complexity of Cluster Editing. Leibniz International Proceedings in Informatics. 20: 32-43. doi: 10.4230/LIPIcs.STACS.2013.32
    • Fomin, Fedor; Lokshtanov, Daniel; Misra, Neeldhara; Philip, Geevarghese; Saurabh, Saket. 2013. Quadratic upper bounds on the Erdős–Pósa property for a generalization of packing and covering cycles. Journal of Graph Theory. 74: 417-424. doi: 10.1002/jgt.21720
    • Fomin, Fedor; Pilipczuk, Michal Pawel. 2013. Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph. Lecture Notes in Computer Science. 8125: 505-516.
    • Fomin, Fedor; Pilipczuk, Michal Pawel. 2013. Jungles, bundles, and fixed parameter tractability. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 396-413.
    • Fomin, Fedor; Saurabh, Saket; Villanger, Yngve. 2013. A polynomial kernel for proper interval vertex deletion. SIAM Journal on Discrete Mathematics. 27: 1964-1976. doi: 10.1137/12089051X
    • Fomin, Fedor; Villanger, Yngve. 2013. Subexponential parameterized algorithm for minimum fill-in. SIAM journal on computing (Print). 42: 2197-2216. doi: 10.1137/11085390X
    • Adler, Isolde Marianne; Dorn, Frederic; Fomin, Fedor; Sau, Ignasi; Thilikos, Dimitrios M. 2012. Fast minor testing in planar graphs. Algorithmica. 64: 69-84. doi: 10.1007/s00453-011-9563-9
    • Amini, Omid; Fomin, Fedor; Saurabh, Saket. 2012. Counting subgraphs via homomorphisms. SIAM Journal on Discrete Mathematics. 26: 695-717. doi: 10.1137/100789403
    • Barrière, Lali; Flocchini, Paola; Fomin, Fedor; Fraigniaud, Pierre; Nisse, Nicolas; Santoro, Nicola; Thilikos, Dimitrios M. 2012. Connected graph searching. Information and Computation. 219: 1-16. doi: 10.1016/j.ic.2012.08.004
    • Binkele-Raible, Daniel; Fernau, Henning; Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket; Villanger, Yngve. 2012. Kernel(s) for Problems with no Kernel: On Out-Trees with Many Leaves. ACM Transactions on Algorithms (TALG). 8. 19 pages. doi: 10.1145/2344422.2344428
    • Bodlaender, Hans L.; Fomin, Fedor; Golovach, Petr; Otachi, Yota; van Leeuwen, Erik Jan. 2012. Parameterized complexity of the spanning tree congestion problem. Algorithmica. 64: 85-111. doi: 10.1007/s00453-011-9565-7
    • Bodlaender, Hans L.; Fomin, Fedor; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M. 2012. A note on exact algorithms for vertex ordering problems on graphs. Theory of Computing Systems. 50: 420-432. doi: 10.1007/s00224-011-9312-0
    • Bodlaender, Hans L.; Fomin, Fedor; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios M. 2012. On exact algorithms for treewidth. ACM Transactions on Algorithms (TALG). 9. 23 pages. doi: 10.1145/2390176.2390188
    • Dorn, Frederic; Fomin, Fedor; Thilikos, Dimitrios M. 2012. Catalan structures and dynamic programming in H-minor-free graphs. Journal of computer and system sciences (Print). 78: 1606-1622. doi: 10.1016/j.jcss.2012.02.004
    • Fellows, Michael R.; Fomin, Fedor; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Villanger, Yngve. 2012. Local search: Is brute-force avoidable? Journal of computer and system sciences (Print). 78: 707-719. doi: 10.1016/j.jcss.2011.10.003
    • Fomin, Fedor. 2012. Kernelization algorithms (keynote speech). Smart Innovation, Systems and Technologies. 20: 1-7.
    • Fomin, Fedor; Fraigniaud, Pierre; Kreutzer, Stephan; Thilikos, Dimitrios. 2012. Foreword: Special Issue on Theory and Applications of Graph Searching Problems. Theoretical Computer Science. 463: 1-1. doi: 10.1016/j.tcs.2012.10.006
    • Fomin, Fedor; Gaspers, Serge; Golovach, Petr; Suchan, Karol; Szeider, Stefan; van Leeuwen, Erik Jan; Vatshelle, Martin; Villanger, Yngve. 2012. k-Gap Interval Graphs. Lecture Notes in Computer Science. 7256: 350-361.
    • Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel. 2012. Cops and robber game without recharging. Theory of Computing Systems. 50: 611-620. doi: 10.1007/s00224-011-9360-5
    • Fomin, Fedor; Golovach, Petr; Nederlof, Jesper; Pilipczuk, Michal Pawel. 2012. Minimizing Rosenthal potential in multicast games. Lecture Notes in Computer Science.
    • Fomin, Fedor; Golovach, Petr; Pralat, Pawel. 2012. Cops and robber with constraints. SIAM Journal on Discrete Mathematics. 26: 571-590. doi: 10.1137/110837759
    • Fomin, Fedor; Grandoni, Fabrizio; Lokshtanov, Daniel; Saurabh, Saket. 2012. Sharp separation and applications to exact and parameterized algorithms. Algorithmica. 63: 692-706. doi: 10.1007/s00453-011-9555-9
    • Fomin, Fedor; Heggernes, Pinar; van Leeuwen, Erik Jan. 2012. Making Life Easier for Firefighters. Lecture Notes in Computer Science. 7288: 177-188. doi: 10.1007/978-3-642-30347-0_19
    • Fomin, Fedor; Jansen, Bart M.P.; Pilipczuk, Michal Pawel. 2012. Preprocessing subgraph and minor problems: when does a small vertex cover help? Lecture Notes in Computer Science.
    • Fomin, Fedor; Lokshtanov, Daniel; Misra, Neeldhara; Saurabh, Saket. 2012. Planar F-deletion: Approximation, kernelization and optimal FPT algorithms (extended abstract). Proceedings ... annual Symposium on Foundations of Computer Science. 470-479. doi: 10.1109/FOCS.2012.62
    • Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket; Rao, B.V. Raghavendra. 2012. Faster algorithms for finding and counting subgraphs. Journal of computer and system sciences (Print). 78: 698-706. doi: 10.1016/j.jcss.2011.10.001
    • Fomin, Fedor; Saurabh, Saket; Villanger, Yngve. 2012. A Polynomial Kernel for Proper Interval Vertex Deletion. Lecture Notes in Computer Science. 7501: 467-478.
    • Fomin, Fedor; Villanger, Yngve. 2012. Treewidth computation and extremal combinatorics. Combinatorica. 32: 289-308. doi: 10.1007/s00493-012-2536-z
    • Fomin, Fedor; Villanger, Yngve. 2012. Subexponential parameterized algorithm for minimum fill-in. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 1737-1746.
    • Adler, Isolde Marianne; Dorn, Frederic; Fomin, Fedor; Sau, Ignasi; Thilikos, Dimitrios M. 2011. Faster parameterized algorithms for minor containment. Theoretical Computer Science. 412: 7018-7028. doi: 10.1016/j.tcs.2011.09.015
    • Amini, Omid; Fomin, Fedor; Saurabh, Saket. 2011. Implicit branching and parameterized partial cover problems. Journal of computer and system sciences (Print). 77: 1159-1171. doi: 10.1016/j.jcss.2010.12.002
    • Bessy, Stephane; Fomin, Fedor; Gaspers, Serge; Paul, Christophe; Perez, Anthony; Saurabh, Saket; Thomasse, Stephane. 2011. Kernels for feedback arc set in tournaments. Journal of computer and system sciences (Print). 77: 1071-1078. doi: 10.1016/j.jcss.2010.10.001
    • Dragan, Feodor F.; Fomin, Fedor; Golovach, Petr. 2011. Approximation of minimum weight spanners for sparse graphs. Theoretical Computer Science. 412: 846-852. doi: 10.1016/j.tcs.2010.11.034
    • Dragan, Feodor F.; Fomin, Fedor; Golovach, Petr. 2011. Spanners in sparse graphs. Journal of computer and system sciences (Print). 77: 1108-1119. doi: 10.1016/j.jcss.2010.10.002
    • Fellows, Michael R.; Fomin, Fedor; Gutin, Gregory. 2011. Special Issue on Parameterized Complexity of Discrete Optimization Preface. Discrete Optimization. 8: 1-1. doi: 10.1016/j.disopt.2011.02.001
    • Fellows, Michael R.; Fomin, Fedor; Lokshtanov, Daniel; Rosamond, Frances; Saurabh, Saket; Szeider, Stefan; Thomassen, Carsten. 2011. On the complexity of some colorful problems parameterized by treewidth. Information and Computation. 209: 143-153. doi: 10.1016/j.ic.2010.11.026
    • Fomin, Fedor; Geevarghese, Philip; Villanger, Yngve. 2011. Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. Leibniz International Proceedings in Informatics. 13: 164-175. doi: 10.4230/LIPIcs.FSTTCS.2011.164
    • Fomin, Fedor; Golovach, Petr A.; Thilikos, Dimitrios M. 2011. Approximation Algorithms for Domination Search. Lecture Notes in Computer Science. 6534: 130-141. doi: 10.1007/978-3-642-18318-8_12
    • Fomin, Fedor; Golovach, Petr; Hall, Alex; Mihalák, Matúš; Vicari, Elias; Widmayer, Peter. 2011. How to Guard a Graph? Algorithmica. 61: 839-856. doi: 10.1007/s00453-009-9382-4
    • Fomin, Fedor; Golovach, Petr; Kratochvil, Jan; Kratsch, Dieter; Liedloff, Mathieu. 2011. Branch and Recharge: Exact Algorithms for Generalized Domination. Algorithmica. 61: 252-273. doi: 10.1007/s00453-010-9418-9
    • Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel. 2011. Guard games on graphs: Keep the intruder out! Theoretical Computer Science. 412: 6484-6497. doi: 10.1016/j.tcs.2011.08.024
    • Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. 2011. Approximating width parameters of hypergraphs with excluded minors. SIAM Journal on Discrete Mathematics. 25: 1331-1348. doi: 10.1137/080743226
    • Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. 2011. Contraction obstructions for treewidth. Journal of combinatorial theory. Series B (Print). 101: 302-314. doi: 10.1016/j.jctb.2011.02.008
    • Fomin, Fedor; Golovach, Petr; van Leeuwen, Erik Jan. 2011. Spanners of bounded degree graphs. Information Processing Letters. 111: 142-144. doi: 10.1016/j.ipl.2010.10.021
    • Fomin, Fedor; Heggernes, Pinar; Kratsch, Dieter; Papadopoulos, Charis; Villanger, Yngve. 2011. Enumerating minimal subset feedback vertex sets. Lecture Notes in Computer Science. 6844: 399-410. doi: 10.1007/978-3-642-22300-6_34
    • Fomin, Fedor; Kratochvil, Jan; Lokshtanov, Daniel; Mancini, Federico; Telle, Jan Arne. 2011. On the Complexity of Reconstructing H-Free Graphs from Their Star Systems. Journal of Graph Theory. 68: 113-124. doi: 10.1002/jgt.20544
    • Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket. 2011. Subexponential algorithms for partial cover problems. Information Processing Letters. 111: 814-818. doi: 10.1016/j.ipl.2011.05.016
    • Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket. 2011. An exact algorithm for minimum distortion embedding. Theoretical Computer Science. 412: 3530-3536. doi: 10.1016/j.tcs.2011.02.043
    • Fomin, Fedor; Saurabh, Saket; Thilikos, Dimitrios M. 2011. Strengthening Erdos-Posa Property for Minor-Closed Graph Classes. Journal of Graph Theory. 66: 235-240. doi: 10.1002/jgt.20503
    • Fomin, Fedor; Todinca, Ioan; Villanger, Yngve. 2011. Exact Algorithm for the Maximum Induced Planar Subgraph Problem. Lecture Notes in Computer Science. 6942: 287-298. doi: 10.1007/978-3-642-23719-5_25
    • Adler, Isolde Marianne; Dorn, Frederic; Fomin, Fedor; Sau, Ignasi; Thilikos, Dimitrios. 2010. Faster Parameterized Algorithms for Minor Containment. Lecture Notes in Computer Science. 6139: 322-333.
    • Adler, Isolde Marianne; Dorn, Frederic; Fomin, Fedor; Sau, Ignasi; Thilikos, Dimitrios. 2010. Fast Minor Testing in Planar Graphs. Lecture Notes in Computer Science. 6346: 97-109.
    • Broersma, Hajo; Fomin, Fedor; van 't Hof, Pim; Paulusma, Daniel. 2010. Fast exact algorithms for Hamiltonicity in claw-free graphs. Lecture Notes in Computer Science. 5911: 44-53. doi: 10.1007/978-3-642-11409-0_4
    • Cohen, Nathann; Fomin, Fedor; Gutin, Gregory; Kim, Eun Jung; Saurabh, Saket; Yeo, Anders. 2010. Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. Journal of computer and system sciences (Print). 76: 650-662. doi: 10.1016/j.jcss.2010.01.001
    • Dorn, Frederic; Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket. 2010. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. Leibniz International Proceedings in Informatics. 5: 251-262.
    • Dorn, Frederic; Penninkx, Eelko; Bodlaender, Hans L.; Fomin, Fedor. 2010. Efficient exact algorithms on planar graphs: exploiting sphere cut decompositions. Algorithmica. 58: 790-810. doi: 10.1007/s00453-009-9296-1
    • Fomin, Fedor. 2010. Kernelization. Lecture Notes in Computer Science. 6072: 107-108. doi: 10.1007/978-3-642-13182-0_10
    • Fomin, Fedor. 2010. Protrusions in Graphs and Their Applications. Lecture Notes in Computer Science. 6478: 3-3. doi: 10.1007/978-3-642-17493-3_2
    • Fomin, Fedor; Gaspers, S; Golovach, PA; Kratsch, D; Saurabh, S. 2010. Parameterized algorithm for eternal vertex cover. Information Processing Letters. 110: 702-706. doi: 10.1016/j.ipl.2010.05.029
    • Fomin, Fedor; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket. 2010. Iterative compression and exact algorithms. Theoretical Computer Science. 411: 1045-1053. doi: 10.1016/j.tcs.2009.11.012
    • Fomin, Fedor; Golovach, Petr; Kratochvil, Jan; Nisse, Nicolas; Suchan, Karol. 2010. Pursuing a fast robber on a graph. Theoretical Computer Science. 411: 1167-1181. doi: 10.1016/j.tcs.2009.12.010
    • Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Saurabh, Saket. 2010. Intractability of clique-width parameterizations. SIAM journal on computing (Print). 39: 1941-1956. doi: 10.1137/080742270
    • Fomin, Fedor; Heggernes, Pinar; Mihai, Rodica. 2010. Mixed Search Number and Linear-Width of Interval and Split Graphs. Networks. 56: 207-214. doi: 10.1002/net.20373
    • Fomin, Fedor; Oum, SI; Thilikos, DM. 2010. Rank-width and tree-width of H-minor-free graphs. European journal of combinatorics (Print). 31: 1617-1628. doi: 10.1016/j.ejc.2010.05.003
    • Fomin, Fedor; Villanger, Yngve. 2010. Finding Induced Subgraphs via Minimal Triangulations. Leibniz International Proceedings in Informatics. 5: 383-394.
    • Amini, Omid; Fomin, Fedor; Saurabh, Saket. 2009. Counting Subgraphs via Homomorphisms. Lecture Notes in Computer Science. 5555: 71-82. doi: 10.1007/978-3-642-02927-1_8
    • Bessy, Stephane; Fomin, Fedor; Gaspers, Serge; Paul, Christophe; Perez, Anthony; Saurabh, Saket; Thomasse, Stephane. 2009. Kernels for Feedback Arc Set In Tournaments. Leibniz International Proceedings in Informatics. 4: 37-47.
    • Broersma, Hajo; Fomin, Fedor; Golovach, Petr; Paulusma, Daniel. 2009. Three Complexity Results on Coloring Pk-Free Graphs. Lecture Notes in Computer Science. 5874: 95-104. doi: 10.1007/978-3-642-10217-2_12
    • Cohen, Nathann; Fomin, Fedor; Gutin, Gregory; Kim, Eun Jung; Saurabh, Saket; Yeo, Anders. 2009. Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. Lecture Notes in Computer Science. 5609: 37-46. doi: 10.1007/978-3-642-02882-3_5
    • Fellows, Michael; Fomin, Fedor; Lokshtanov, Daniel; Losievskaja, Elena; Rosamond, Frances; Saurabh, Saket. 2009. Distortion Is Fixed Parameter Tractable. Lecture Notes in Computer Science. 5555: 463-474. doi: 10.1007/978-3-642-02927-1_39
    • Fernau, Henning; Fomin, Fedor; Lokshtanov, Daniel; Raible, Daniel; Saurabh, Saket; Villanger, Yngve. 2009. Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. Leibniz International Proceedings in Informatics. 3: 421-432.
    • Fomin, Fedor; Fraigniaud, Pierre; Nisse, Nicolas. 2009. Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica. 53: 358-373. doi: 10.1007/s00453-007-9041-6
    • Fomin, Fedor; Gaspers, Serge; Saurabh, Saket; Stepanov, Alexey. 2009. On two techniques of combining branching and treewidth. Algorithmica. 54: 181-207. doi: 10.1007/s00453-007-9133-3
    • Fomin, Fedor; Gaspers, Serge; Saurabh, Saket; Thomasse, Stephane. 2009. A Linear Vertex Kernel for Maximum Internal Spanning Tree. Lecture Notes in Computer Science. 5878: 275-282. doi: 10.1007/978-3-642-10631-6_29
    • Fomin, Fedor; Golovach, Petr; Kratochvil, Jan; Kratsch, Dieter; Liedloff, Mathieu. 2009. Sort and Search: Exact algorithms for generalized domination. Information Processing Letters. 109: 795-798. doi: 10.1016/j.ipl.2009.03.023
    • Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios. 2009. Approximating Acyclicity Parameters of Sparse Hypergraphs. Leibniz International Proceedings in Informatics. 3: 445-456. doi: 10.4230/LIPIcs.STACS.2009.1803
    • Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios. 2009. Contraction Bidimensionality: The Accurate Picture. Lecture Notes in Computer Science. 5757: 706-717. doi: 10.1007/978-3-642-04128-0
    • Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter. 2009. A measure & conquer approach for the analysis of exact algorithms. Journal of the ACM. 56. 32 pages. doi: 10.1145/1552285.1552286
    • Fomin, Fedor; Heggernes, Pinar; Mihai, Rodica. 2009. Mixed search number and linear-width of interval and split graphs. Networks. doi: 10.1002/net.20373
    • Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket. 2009. Subexponential Algorithms for Partial Cover Problems. Leibniz International Proceedings in Informatics. 4: 193-201.
    • Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket. 2009. An Exact Algorithm for Minimum Distortion Embedding. Lecture Notes in Computer Science. 5911: 112-121. doi: 10.1007/978-3-642-11409-0_10
    • Fomin, Fedor; Mazoit, Frederic; Todinca, Ioan. 2009. Computing branchwidth via efficient triangulations and blocks. Discrete Applied Mathematics. 157: 2726-2736. doi: 10.1016/j.dam.2008.08.009
    • Alon, Noga; Fomin, Fedor; Gutin, Gregory; Krivelevich, Michael; Saurabh, Saket. 2008. Spanning directed trees with many leaves. SIAM Journal on Discrete Mathematics. 23: 466-476. doi: 10.1137/070710494
    • Amini, Omid; Fomin, Fedor; Saurabh, Saket. 2008. Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). Dagstuhl Seminar Proceedings. 08004. 12 pages.
    • Chen, Jianer; Fomin, Fedor; Liu, Yang; Lu, Songjian; Villanger, Yngve. 2008. Improved algorithms for feedback vertex set problems. Journal of computer and system sciences (Print). 74: 1188-1198. doi: 10.1016/j.jcss.2008.05.002
    • Dorn, Frederic Bernard; Fomin, Fedor; Thilikos, Dimitrios. 2008. Subexponential parameterized algorithms. Computer Science Review. 2: 29-39. doi: 10.1016/j.cosrev.2008.02.004
    • Dragan, Feodor; Fomin, Fedor; Golovach, Petr. 2008. Spanners in sparse graphs. Lecture Notes in Computer Science. 5125: 597-608.
    • Dragan, Feodor; Fomin, Fedor; Golovach, Petr. 2008. A PTAS for the sparsest spanners problem on apex-minor-free graphs. Lecture Notes in Computer Science. 5162: 290-298.
    • Fomin, Fedor; Fraigniaud, Pierre; Thilikos, Dimitrios M. 2008. Forewords: Special issue on graph searching. Theoretical Computer Science. 399: 157-157. doi: 10.1016/j.tcs.2008.02.034
    • Fomin, Fedor; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket. 2008. Iterative Compression and Exact Algorithms. Lecture Notes in Computer Science. 5162: 335-346.
    • Fomin, Fedor; Gaspers, Serge; Pyatkin, Artem V; Razgon, Igor. 2008. On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. Algorithmica. 52: 293-307. doi: 10.1007/s00453-007-9152-0
    • Fomin, Fedor; Golovach, Petr; Hall, Alex; Mihalak, Matus; Vicari, Elias; Widmayer, Peter. 2008. How to guard a graph? Lecture Notes in Computer Science. 5369: 318-239.
    • Fomin, Fedor; Golovach, Petr; Kratochvil, Jan. 2008. On tractability cops and robbers game. IFIP International Federation for Information Processing. 237: 171-185.
    • Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter. 2008. Solving connected dominating set faster than 2(n). Algorithmica. 52: 153-166. doi: 10.1007/s00453-007-9145-z
    Book sections
    • Chitnis, Rajesh; Fomin, Fedor; Golovach, Petr. 2013. Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs. Extended abstract, pages 79-90. In:
      • Seth, Anil; Vishnoi, Nisheeth. 2013. IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2013, December 12-14, 2013, Guwahati, India. 539 pages. ISBN: 978-3-939897-64-4.
    • Chitnis, Rajesh; Fomin, Fedor; Golovach, Petr. 2013. Preventing unraveling in social networks gets harder. Extended abstract. In:
      • desJardins, Marie; Littman, Michael. 2013. Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence. AAAI Press. ISBN: 978-1-57735-615-8.
    • Fellows, Michael; Rosamond, Frances; Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket; Villanger, Yngve. 2009. Local Search: Is Brute-Force Avoidable? Raport, pages 486-491. In:
      • Boutilier, Craig. 2009. IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence. AAAI Press. 2106 pages. ISBN: 978-1-57735-426-0.
    • Dorn, Frederic; Fomin, Fedor; Thilikos, Dimitrios M. 2008. Catalan structures and dynamic programming in /H/-minor-free graphs. -, pages 631-640. In:
      • Teng, Shang-Hua. 2008. Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008. Society for Industrial and Applied Mathematics. 1279 pages. ISBN: 0-89871-585-7.

    More information in national current research information system (CRIStin)

    GraphModif 2019 +++ ALGORITHMIC TRACTABILITY VIA ​SPARSIFIERS +++ FraNorAC 2019 +++Worker +++ Escuela de Verano en Matematicas Discretas +++ New Horizons in Parameterized Complexity+++ SODA 2018 +++ CSR 2018 +++ IPEC 2018 +++ FAW 2018 +++ FUN 2018 +++ Recent Advances in Algorithms 2018 +++ WG 2018 +++ China-Norway FPT workshop 2018 +++ GRASTA 2018 +++ WEPA2018 +++MFCS 2019 +++ GRASTA 2017 +++BAIKAL 2017 +++ NET 2017 +++ Gutin60 Algorithmica special issue +++ Recent Advances in Algorithms +++ ESA 2017+++WADS 2017+++ WG 2017+++ Turing contest 2017 +++ Aspects of Computation +++ PCS School +++CS Club +++ Recent Advances in Parameterized Complexity +++Fine-Grained Complexity and Algorithm Design +++Counting Complexity and Phase Transitions +++ LATIN 2016 +++ CSR 2016 +++ FUN 2016 +++ DOOR 2016 +++ FSTTCS 2016+++ RANGOLI OF ALGORITHMS +++ Gutin60 +++ Randomization in Parameterized Complexity+++ School on Parameterized Algorithms +++STACS 2015 +++CIAC 2015 +++FAW 2015 +++NET 2015 +++TTCS 2015 +++WorKer 2015 +++EUROCOMB 2015 +++ SAT Lower Bounds +++FSTTCS 2015 +++GRASTA-MAC 2015 +++ ICALP 2012 +++ WG 2012 +++ Width-Minors-Matroids +++ IPEC 2012 +++ GRASTA 2012 +++ MFCS 2012 +++ ENUMEX +++ ICS 2012 +++ SOFSEM 2013 +++ LMNB conference 2013 +++ APEX 2013 +++ ICALP 2013 +++ Bidimensional Structures +++ CSR 2014 +++ WG 2014 +++GRASTA 2014 +++Exploiting Graph Structure in Algorithms +++FUN 2014 +++MFCS 2014 +++WorKer 2010 +++ GRASTA 2011 +++ ICALP 2011 +++ TW(BGO)-11 +++ WORKER 2011 +++ SWAT 2012 +++ WG 2003 +++ ESA 2004 +++ WG 2004 +++ WG 2005 +++ STACS 2006 +++ LATIN 2006 +++ SIROCCO 2006 +++ GRASTA 2006 +++ IWPEC 2006 +++ SODA 2007 +++ MFCS 2007 +++ LATIN 2008 +++ WG 2008 +++ IWPEC 2008 +++ SWAT 2008 +++ COCOA 2008 +++ SOFSEM 2009 +++ WorKer 2009 +++ TAMC 2009 +++ WG 2010 +++ TAMC 2010 +++ MFCS 2010 +++ FSTTCS 2010+++