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. 

     

    Academic article
    • 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 (LNCS). 494-505.
    • 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. 1-15.
    • Fomin, Fedor; Golovach, Petr; Nederlof, Jesper; Pilipczuk, Michal Pawel. 2015. Minimizing Rosenthal potential in multicast games. Theory of Computing Systems. 81-96.
    • Fomin, Fedor; Golovnev, Alexander; Kulikov, Alexander S.; Mihajlin, Ivan. 2015. Lower bounds for the graph homomorphism problem. Lecture Notes in Computer Science (LNCS). 481-493.
    • Bliznets, Ivan; Fomin, Fedor; Pilipczuk, Michal Pawel; Villanger, Yngve. 2015. Largest chordal and interval subgraphs faster than 2n. Algorithmica. 26 pages.
    • Fomin, Fedor; Todinca, Ioan; Villanger, Yngve. 2015. Large induced subgraphs via triangulations and CMSO. SIAM journal on computing (Print). 54-87.
    • Fomin, Fedor; Saurabh, Saket; Misra, Neeldhara. 2015. Graph modification problems: A modern perspective. Lecture Notes in Computer Science (LNCS). 3-6.
    • 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.
    • Fomin, Fedor; Giannopoulou, Archontia; Pilipczuk, Michal Pawel. 2015. Computing tree-depth faster than 2n. Algorithmica. 202-216.
    • Bliznets, Ivan; Fomin, Fedor; Pilipczuk, Marcin; Pilipczuk, Michal Pawel. 2015. A subexponential parameterized algorithm for proper interval completion. SIAM Journal on Discrete Mathematics. 1961-1987.
    • 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. 374-386.
    • 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). 468-495.
    • Basavaraju, Manu; Fomin, Fedor; Golovach, Petr; Misra, Pranabendu; Maadapuzhi Shridharan, Ramanujan; Saurabh, Saket. 2014. Parameterized algorithms to preserve connectivity. Lecture Notes in Computer Science (LNCS). 800-811.
    • Basavaraju, Manu; Fomin, Fedor; Golovach, Petr; Saurabh, Saket. 2014. Connecting vertices by independent trees. Leibniz International Proceedings in Informatics. 73-84.
    • 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. 32-43.
    • Broersma, Hajo; Fomin, Fedor; Golovach, Petr; Paulusma, Daniël. 2013. Three complexity results on coloring Pk-free graphs. European journal of combinatorics (Print). 609-619.
    • Fomin, Fedor; Pilipczuk, Michal Pawel. 2013. Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph. Lecture Notes in Computer Science (LNCS). 505-516.
    • Blizniets, Ivan; Fomin, Fedor; Pilipczuk, Michal Pawel; Villanger, Yngve. 2013. Largest chordal and interval subgraphs faster than 2^n. Lecture Notes in Computer Science (LNCS). 193-204.
    • Fomin, Fedor; Pilipczuk, Michal Pawel. 2013. Jungles, bundles, and fixed parameter tractability. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 396-413.
    • Broersma, Hajo; Fomin, Fedor; van 't Hof, Pim; Paulusma, Daniel. 2013. Exact algorithms for finding longest cycles in claw-free graphs. Algorithmica. 129-145.
    • Fomin, Fedor; Giannopoulou, Archontia; Pilipczuk, Michal Pawel. 2013. Computing tree-depth faster than 2^n. Lecture Notes in Computer Science (LNCS). 137-149.
    • Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter; Lokshtanov, Daniel; Saurabh, Saket. 2013. Computing optimal Steiner trees in polynomial space. Algorithmica. 584-604.
    • Dorn, Frederic ; Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket. 2013. Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Information and Computation. 60-70.
    • 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. 499-508.
    • 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). 1-6.
    • 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 (LNCS). 350-361.
    • Fomin, Fedor; Villanger, Yngve. 2012. Treewidth computation and extremal combinatorics. Combinatorica. 289-308.
    • Fomin, Fedor; Villanger, Yngve. 2012. Subexponential parameterized algorithm for minimum fill-in. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 1737-1746.
    • Fomin, Fedor; Grandoni, Fabrizio; Lokshtanov, Daniel; Saurabh, Saket. 2012. Sharp separation and applications to exact and parameterized algorithms. Algorithmica. 692-706.
    • 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 (LNCS).
    • 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.
    • Bodlaender, Hans L.; Fomin, Fedor; Golovach, Petr; Otachi, Yota; van Leeuwen, Erik Jan. 2012. Parameterized complexity of the spanning tree congestion problem. Algorithmica. 85-111.
    • 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). 23 pages.
    • Fomin, Fedor; Golovach, Petr; Nederlof, Jesper; Pilipczuk, Michal Pawel. 2012. Minimizing Rosenthal potential in multicast games. Lecture Notes in Computer Science (LNCS).
    • Fomin, Fedor; Heggernes, Pinar; van Leeuwen, Erik Jan. 2012. Making Life Easier for Firefighters. Lecture Notes in Computer Science (LNCS). 177-188.
    • 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). 707-719.
    • 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). 19 pages.
    • 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). 698-706.
    • Adler, Isolde Marianne; Dorn, Frederic ; Fomin, Fedor; Sau, Ignasi; Thilikos, Dimitrios M. 2012. Fast minor testing in planar graphs. Algorithmica. 69-84.
    • Amini, Omid; Fomin, Fedor; Saurabh, Saket. 2012. Counting subgraphs via homomorphisms. SIAM Journal on Discrete Mathematics. 695-717.
    • Fomin, Fedor; Golovach, Petr; Pralat, Pawel. 2012. Cops and robber with constraints. SIAM Journal on Discrete Mathematics. 571-590.
    • Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel. 2012. Cops and robber game without recharging. Theory of Computing Systems. 611-620.
    • Barrière, Lali; Flocchini, Paola; Fomin, Fedor; Fraigniaud, Pierre; Nisse, Nicolas; Santoro, Nicola; Thilikos, Dimitrios M. 2012. Connected graph searching. Information and Computation. 1-16.
    • 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). 1606-1622.
    • 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. 420-432.
    • Fomin, Fedor; Saurabh, Saket; Villanger, Yngve. 2012. A Polynomial Kernel for Proper Interval Vertex Deletion. Lecture Notes in Computer Science (LNCS). 467-478.
    • Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket. 2011. Subexponential algorithms for partial cover problems. Information Processing Letters. 814-818.
    • Fomin, Fedor; Saurabh, Saket; Thilikos, Dimitrios M. 2011. Strengthening Erdos-Posa Property for Minor-Closed Graph Classes. Journal of Graph Theory. 235-240.
    • Fomin, Fedor; Golovach, Petr; van Leeuwen, Erik Jan. 2011. Spanners of bounded degree graphs. Information Processing Letters. 142-144.
    • Dragan, Feodor F.; Fomin, Fedor; Golovach, Petr. 2011. Spanners in sparse graphs. Journal of computer and system sciences (Print). 1108-1119.
    • 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. 143-153.
    • 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. 113-124.
    • Fomin, Fedor; Geevarghese, Philip; Villanger, Yngve. 2011. Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. Leibniz International Proceedings in Informatics. 164-175.
    • 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). 1071-1078.
    • Amini, Omid; Fomin, Fedor; Saurabh, Saket. 2011. Implicit branching and parameterized partial cover problems. Journal of computer and system sciences (Print). 1159-1171.
    • Fomin, Fedor; Golovach, Petr; Hall, Alex; Mihalák, Matúš; Vicari, Elias; Widmayer, Peter. 2011. How to Guard a Graph? Algorithmica. 839-856.
    • Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel. 2011. Guard games on graphs: Keep the intruder out! Theoretical Computer Science. 6484-6497.
    • Adler, Isolde Marianne; Dorn, Frederic ; Fomin, Fedor; Sau, Ignasi; Thilikos, Dimitrios M. 2011. Faster parameterized algorithms for minor containment. Theoretical Computer Science. 7018-7028.
    • Fomin, Fedor; Todinca, Ioan; Villanger, Yngve. 2011. Exact Algorithm for the Maximum Induced Planar Subgraph Problem. Lecture Notes in Computer Science (LNCS). 287-298.
    • Fomin, Fedor; Heggernes, Pinar; Kratsch, Dieter; Papadopoulos, Charis; Villanger, Yngve. 2011. Enumerating minimal subset feedback vertex sets. Lecture Notes in Computer Science (LNCS). 399-410.
    • Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. 2011. Contraction obstructions for treewidth. Journal of combinatorial theory. Series B (Print). 302-314.
    • Fomin, Fedor; Golovach, Petr; Kratochvil, Jan; Kratsch, Dieter; Liedloff, Mathieu. 2011. Branch and Recharge: Exact Algorithms for Generalized Domination. Algorithmica. 252-273.
    • Dragan, Feodor F.; Fomin, Fedor; Golovach, Petr. 2011. Approximation of minimum weight spanners for sparse graphs. Theoretical Computer Science. 846-852.
    • Fomin, Fedor; Golovach, Petr A.; Thilikos, Dimitrios M. 2011. Approximation Algorithms for Domination Search. Lecture Notes in Computer Science (LNCS). 130-141.
    • Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios M. 2011. Approximating width parameters of hypergraphs with excluded minors. SIAM Journal on Discrete Mathematics. 1331-1348.
    • Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket. 2011. An exact algorithm for minimum distortion embedding. Theoretical Computer Science. 3530-3536.
    • Fomin, Fedor; Oum, SI; Thilikos, DM. 2010. Rank-width and tree-width of H-minor-free graphs. European journal of combinatorics (Print). 1617-1628.
    • Fomin, Fedor; Golovach, Petr; Kratochvil, Jan; Nisse, Nicolas; Suchan, Karol. 2010. Pursuing a fast robber on a graph. Theoretical Computer Science. 1167-1181.
    • Fomin, Fedor. 2010. Protrusions in Graphs and Their Applications. Lecture Notes in Computer Science (LNCS). 3-3.
    • Fomin, Fedor; Gaspers, S; Golovach, PA; Kratsch, D; Saurabh, S. 2010. Parameterized algorithm for eternal vertex cover. Information Processing Letters. 702-706.
    • Fomin, Fedor; Heggernes, Pinar; Mihai, Rodica. 2010. Mixed Search Number and Linear-Width of Interval and Split Graphs. Networks. 207-214.
    • Fomin, Fedor. 2010. Kernelization. Lecture Notes in Computer Science (LNCS). 107-108.
    • Fomin, Fedor; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket. 2010. Iterative compression and exact algorithms. Theoretical Computer Science. 1045-1053.
    • Fomin, Fedor; Golovach, Petr; Lokshtanov, Daniel; Saurabh, Saket. 2010. Intractability of clique-width parameterizations. SIAM journal on computing (Print). 1941-1956.
    • Fomin, Fedor; Villanger, Yngve. 2010. Finding Induced Subgraphs via Minimal Triangulations. Leibniz International Proceedings in Informatics. 383-394.
    • Adler, Isolde Marianne; Dorn, Frederic ; Fomin, Fedor; Sau, Ignasi; Thilikos, Dimitrios. 2010. Faster Parameterized Algorithms for Minor Containment. Lecture Notes in Computer Science (LNCS). 322-333.
    • 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 (LNCS). 44-53.
    • Adler, Isolde Marianne; Dorn, Frederic ; Fomin, Fedor; Sau, Ignasi; Thilikos, Dimitrios. 2010. Fast Minor Testing in Planar Graphs. Lecture Notes in Computer Science (LNCS). 97-109.
    • Dorn, Frederic ; Penninkx, Eelko; Bodlaender, Hans L.; Fomin, Fedor. 2010. Efficient exact algorithms on planar graphs: exploiting sphere cut decompositions. Algorithmica. 790-810.
    • Dorn, Frederic ; Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket. 2010. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. Leibniz International Proceedings in Informatics. 251-262.
    • 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). 650-662.
    • Broersma, Hajo; Fomin, Fedor; Golovach, Petr; Paulusma, Daniel. 2009. Three Complexity Results on Coloring Pk-Free Graphs. Lecture Notes in Computer Science (LNCS). 95-104.
    • Fomin, Fedor; Lokshtanov, Daniel; Raman, Venkatesh; Saurabh, Saket. 2009. Subexponential Algorithms for Partial Cover Problems. Leibniz International Proceedings in Informatics. 193-201.
    • Fomin, Fedor; Golovach, Petr; Kratochvil, Jan; Kratsch, Dieter; Liedloff, Mathieu. 2009. Sort and Search: Exact algorithms for generalized domination. Information Processing Letters. 795-798.
    • Fomin, Fedor; Gaspers, Serge; Saurabh, Saket; Stepanov, Alexey. 2009. On two techniques of combining branching and treewidth. Algorithmica. 181-207.
    • Fomin, Fedor; Fraigniaud, Pierre; Nisse, Nicolas. 2009. Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica. 358-373.
    • Fomin, Fedor; Heggernes, Pinar; Mihai, Rodica. 2009. Mixed search number and linear-width of interval and split graphs. Networks.
    • 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. 37-47.
    • 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. 421-432.
    • Fellows, Michael; Fomin, Fedor; Lokshtanov, Daniel; Losievskaja, Elena; Rosamond, Frances; Saurabh, Saket. 2009. Distortion Is Fixed Parameter Tractable. Lecture Notes in Computer Science (LNCS). 463-474.
    • Amini, Omid; Fomin, Fedor; Saurabh, Saket. 2009. Counting Subgraphs via Homomorphisms. Lecture Notes in Computer Science (LNCS). 71-82.
    • Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios. 2009. Contraction Bidimensionality: The Accurate Picture. Lecture Notes in Computer Science (LNCS). 706-717.
    • Fomin, Fedor; Mazoit, Frederic; Todinca, Ioan. 2009. Computing branchwidth via efficient triangulations and blocks. Discrete Applied Mathematics. 2726-2736.
    • Fomin, Fedor; Golovach, Petr; Thilikos, Dimitrios. 2009. Approximating Acyclicity Parameters of Sparse Hypergraphs. Leibniz International Proceedings in Informatics. 445-456.
    • Fomin, Fedor; Lokshtanov, Daniel; Saurabh, Saket. 2009. An Exact Algorithm for Minimum Distortion Embedding. Lecture Notes in Computer Science (LNCS). 112-121.
    • 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 (LNCS). 37-46.
    • Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter. 2009. A measure & conquer approach for the analysis of exact algorithms. Journal of the ACM. 32 pages.
    • Fomin, Fedor; Gaspers, Serge; Saurabh, Saket; Thomasse, Stephane. 2009. A Linear Vertex Kernel for Maximum Internal Spanning Tree. Lecture Notes in Computer Science (LNCS). 275-282.
    • Fomin, Fedor; Villanger, Yngve. 2008. Treewidth Computation and Extremal Combinatorics. Lecture Notes in Computer Science (LNCS). 210-221.
    • Dorn, Frederic Bernard; Fomin, Fedor; Thilikos, Dimitrios. 2008. Subexponential parameterized algorithms. Computer Science Review. 29-39.
    • Alon, Noga; Fomin, Fedor; Gutin, Gregory; Krivelevich, Michael; Saurabh, Saket. 2008. Spanning directed trees with many leaves. SIAM Journal on Discrete Mathematics. 466-476.
    • Dragan, Feodor; Fomin, Fedor; Golovach, Petr. 2008. Spanners in sparse graphs. Lecture Notes in Computer Science (LNCS). 597-608.
    • Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter. 2008. Solving connected dominating set faster than 2(n). Algorithmica. 153-166.
    • Fomin, Fedor; Golovach, Petr; Kratochvil, Jan. 2008. On tractability cops and robbers game. IFIP International Federation for Information Processing. 171-185.
    • Fomin, Fedor; Kratochvil, Jan; Lokshtanov, Daniel; Mancini, Federico; Telle, Jan Arne. 2008. On the complexity of reconstructing H-free graphs from their Star Systems. Lecture Notes in Computer Science (LNCS). 194-205.
    • Fomin, Fedor; Gaspers, Serge; Pyatkin, Artem V; Razgon, Igor. 2008. On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. Algorithmica. 293-307.
    • Fomin, Fedor; Gaspers, Serge; Kratsch, Dieter; Liedloff, Mathieu; Saurabh, Saket. 2008. Iterative Compression and Exact Algorithms. Lecture Notes in Computer Science (LNCS). 335-346.
    • 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). 1188-1198.
    • Amini, Omid; Fomin, Fedor; Saurabh, Saket. 2008. Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). Dagstuhl Seminar Proceedings. 12 pages.
    • Fomin, Fedor; Golovach, Petr; Hall, Alex; Mihalak, Matus; Vicari, Elias; Widmayer, Peter. 2008. How to guard a graph? Lecture Notes in Computer Science (LNCS). 318-239.
    • Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter. 2008. Faster Steiner Tree Computation in Polynomial-Space. Lecture Notes in Computer Science (LNCS). 430-441.
    • Fomin, Fedor; Kratsch, Dieter; Todinca, Ioan; Villanger, Yngve. 2008. Exact algorithms for treewidth and minimum fill-in. SIAM journal on computing (Print). 1058-1079.
    • Fomin, Fedor; Grandoni, Fabrizio; Pyatkin, Artem V; Stepanov, Alexey. 2008. Combinatorial Bounds via Measure and Conquer: Bounding Minimal Dominating Sets and Applications. ACM Transactions on Algorithms (TALG). 17 pages.
    • Fomin, Fedor; Thilikos, Dimitrios M. 2008. An annotated bibliography on guaranteed graph searching. Theoretical Computer Science. 236-245.
    • Dragan, Feodor; Fomin, Fedor; Golovach, Petr. 2008. A PTAS for the sparsest spanners problem on apex-minor-free graphs. Lecture Notes in Computer Science (LNCS). 290-298.
    • Dorn, Frederic Bernard; Fomin, Fedor; Thilikos, Dimitrios. 2007. Subexponential Parameterized Algorithms. Lecture Notes in Computer Science (LNCS). 15-27.
    • Alon, Noga; Fomin, Fedor; Gutin, Gregory; Krivelevich, Michael; Saurabh, Saket. 2007. Parameterized Algorithms for Directed Maximum Leaf Problems. Lecture Notes in Computer Science (LNCS). 352-362.
    • Fomin, Fedor; Thilikos, Dimitrios M. 2007. On self duality of pathwidth in polyhedral graph embeddings. Journal of Graph Theory. 42-54.
    • Fomin, Fedor; Heggernes, Pinar; Mihai, Rodica Georgeta. 2007. Mixed search number and linear-width of interval and split graphs. Lecture Notes in Computer Science (LNCS). 304-315.
    • Fomin, Fedor; Gaspers, Serge; Saurabh, Saket. 2007. Improved Exact Algorithms for Counting 3- and 4-Colorings. Lecture Notes in Computer Science (LNCS). 65-74.
    • Chen, Jianer; Fomin, Fedor; Liu, Yang; Lu, Songjian; Villanger, Yngve. 2007. Improved Algorithms for the Feedback Vertex Set Problems. Lecture Notes in Computer Science (LNCS). 422-433.
    • Fomin, Fedor; Heggernes, Pinar; Kratschz, Dieter. 2007. Exact algorithms for graph homomorphisms. Theory of Computing Systems. 381-393.
    • Broersma, Hajo; Fomin, Fedor; Kralovic, Rastislav; Woeginger, Gerhard J. 2007. Eliminating graphs by means of parallel knock-out schemes. Discrete Applied Mathematics. 92-102.
    • Golovach, Petr; Fomin, Fedor; Kratochvil, Jan; Kratsch, Dieter; Liedloff, Mathieu. 2007. Branch and Recharge: Exact Algorithms for Generalized Domination. Lecture Notes in Computer Science (LNCS). 507-518.
    • Alon, Noga; Fomin, Fedor; Gutin, Gregory; Krivelevich, Michael; Saurabh, Saket. 2007. Better Algorithms and Bounds for Directed Maximum Leaf Problems. Lecture Notes in Computer Science (LNCS). 316-327.
    • Broersma, Hajo; Fomin, Fedor; Golovach, Petr; Woeginger, Gerhard J. 2007. Backbone colorings for graphs: Tree and path backbones. Journal of Graph Theory. 137-152.
    • Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter. 2006. Solving Connected Dominating Set Faster than O(2n). Lecture Notes in Computer Science (LNCS). 152-163.
    • Broersma, Hajo; Fomin, Fedor; Kratochvil, Jan; Woeginger, Gerhard J. 2006. Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult. Algorithmica. 343-361.
    • Fomin, Fedor; Høie, Kjartan. 2006. Pathwidth of cubic graphs and exact algorithms. Information Processing Letters. 191-196.
    • Cohen, Johanne; Fomin, Fedor; Heggernes, Pinar; Kratsch, Dieter; Kucherov, Gregory. 2006. Optimal linear arrangement of interval graphs. Lecture Notes in Computer Science (LNCS). 267-279.
    • Bodlaender, Hans; Fomin, Fedor; Koster, Arie M. C. A.; Kratsch, Dieter; Thilikos, Dimitrios. 2006. On exact algorithms for treewidth. Lecture Notes in Computer Science (LNCS). 672-683.
    • Fomin, Fedor; Thilikos, Dimitrios M. 2006. New upper bounds on the decomposability of planar graphs. Journal of Graph Theory. 53-81.
    • Fomin, Fedor; Gaspers, Serge; Pyatkin, Artem V. 2006. Finding a Minimum Feedback Vertex Set in time O(1.7548n). Lecture Notes in Computer Science (LNCS). 184-191.
    • Dorn, Frederic Bernard; Fomin, Fedor; Thilikos, Dimitrios M. 2006. Fast subexponential algorithm for non-local problems on graphs of bounded genus. Lecture Notes in Computer Science (LNCS). 172-183.
    • Fomin, Fedor; Thilikos, Dimitrios. 2006. Dominating sets in planar graphs: Branch-width and exponential speed-up. SIAM journal on computing (Print). 281-309.
    • Fomin, Fedor; Gaspers, Serge; Saurabh, Saket. 2006. Branching and treewidth based exact algorithms. Lecture Notes in Computer Science (LNCS). 16-25.
    • Fomin, Fedor; Thilikos, Dimitrios. 2006. A 3-approximation for the pathwidth of Halin graphs. Journal of Discrete Algorithms. 499-510.
    • Bodlaender, Hans; Fomin, Fedor. 2005. Tree decompositions with small cost. Discrete Applied Mathematics. 143-154.
    • Demaine, Eric; Fomin, Fedor; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios. 2005. Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. Journal of the ACM. 866-893.
    • Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter. 2005. Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the European Association for Theoretical Computer Science. 47-77.
    • Fomin, Fedor; Grandoni, Fabrizio; Pyatkin, Artem V; Stepanov, Alexey. 2005. On maximum number of minimal dominating sets in graphs. Electronic Notes in Discrete Mathematics. 157-162.
    • Fomin, Fedor; Fraigniaud, Pierre; Nisse, Nicolas. 2005. Nondeterministic Graph Searching: From Pathwidth to Treewidth. Lecture Notes in Computer Science (LNCS). 364-375.
    • Fomin, Fedor; Grandoni, Fabrizio; Kratsch, Dieter. 2005. Measure and conquer: Domination - A case study. Lecture Notes in Computer Science (LNCS). 191-203.
    • Demaine, Erik D.; Fomin, Fedor; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios M. 2005. Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs. ACM Transactions on Algorithms (TALG). 33-47.
    • Fomin, Fedor; Heggernes, Pinar; Kratsch, Dieter. 2005. Exact algorithms for graph homomorphisms. Lecture Notes in Computer Science (LNCS). 161-171.
    • Bodlaender, Hans; Fomin, Fedor. 2005. Equitable colorings of bounded treewidth graphs. Theoretical Computer Science. 22-30.
    • Dorn, Frederic Bernard; Penninkx, Elko; Bodlaender, Hans; Fomin, Fedor. 2005. Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. Lecture Notes in Computer Science (LNCS). 95-106.
    • Fomin, Fedor; Thilikos, Dimitrios; Todinca, Ioan. 2005. Connected Graph Searching in Outerplanar Graphs. Electronic Notes in Discrete Mathematics. 157-162.
    • Fomin, Fedor; Mazoit, Frederic; Todinca, Ioan. 2005. Computing branchwidth via efficient triangulations and blocks. Lecture Notes in Computer Science (LNCS). 374-384.
    • Fomin, Fedor; Grandoni, Fabrizio; Pyatkin, Artem V; Stepanov, Alexey. 2005. Bounding the number of minimal dominating sets: A measure and conquer approach. Lecture Notes in Computer Science (LNCS). 573-582.
    • Demaine, Erik D.; Fomin, Fedor; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios. 2005. Bidimensional parameters and local treewidth. SIAM Journal on Discrete Mathematics. 501-511.
    • Fomin, Fedor; Matamala, Martin; Rapaport, Ivan. 2004. The complexity of approximating the oriented diameter of chordal graphs. Journal of Graph Theory. 255-269.
    • Demaine, Eric; Fomin, Fedor; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios. 2004. Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs. Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms. 823-832.
    • Fomin, Fedor. 2004. Searching expenditure and interval graphs. Discrete Applied Mathematics. 97-104.
    • Bodlaender, Hans L.; Broersma, Hajo; Fomin, Fedor; Pyatkin, Artem V; Woeginger, Gerhard J. 2004. Radio labeling with preassigned frequencies. SIAM Journal on Optimization. 1-16.
    • Broersma, Hajo; Fomin, Fedor; Woeginger, Gerhard J. 2004. Parallel knock-out schemes in networks,. Lecture Notes in Computer Science (LNCS). 204-214.
    • Fomin, Fedor; Fiala, Jiri; Fishkin, Alexei. 2004. On distance constrained labeling of disk graphs. Theoretical Computer Science. 261-292.
    • Fiala, Jiri; Fishkin, Alexey; Fomin, Fedor. 2004. On distance constrained labeling of disk graphs. Theoretical Computer Science. 261-292.
    • Fomin, Fedor; Heggernes, Pinar; Telle, Jan Arne. 2004. Graph searching, elimination trees, and a generalization of bandwidth. Algorithmica. 73-87.
    • Fomin, Fedor; Thilikos, Dimitrios. 2004. Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up. Lecture Notes in Computer Science (LNCS). 581-592.
    • Fomin, Fedor; Kratsch, Dieter; Todinca, Ioan. 2004. Exact (exponential) algorithms for treewidth and minimum fill-in. Lecture Notes in Computer Science (LNCS). 568-580.
    • Fomin, Fedor; Kratsch, Dieter; Woeginger, Gerhard. 2004. Exact (exponential) algorithms for the dominating set problem. Lecture Notes in Computer Science (LNCS). 245-256.
    • Bodlaender, Hans; Fomin, Fedor. 2004. Equitable colorings of bounded treewidth graphs. Lecture Notes in Computer Science (LNCS). 180-190.
    • Fomin, Fedor; Thilikos, Dimitrios. 2004. Dominating sets and local treewidth. Lecture Notes in Computer Science (LNCS). 221-229.
    • Demaine, Eric; Fomin, Fedor; Hajiaghayi, MohammadTaghi; Thilikos, Dimitrios. 2004. Bidimensional parameters and local treewidth. Lecture Notes in Computer Science (LNCS). 109-118.
    • Broersma, Hajo; Fomin, Fedor; Golovach, PA; Woeginger, GJ. 2004. Backbone colorings for networks. Lecture Notes in Computer Science (LNCS). 131-142.
    • Fomin, Fedor; Kratsch, Dieter; Müller, Haiko. 2004. Algorithms for graphs with small octopus. Discrete Applied Mathematics. 105-128.
    • Fomin, Fedor; Matamala, Martin; Prisner, Erich; Rapaport, Ivan. 2004. AT-free graphs: linear bounds for the oriented diameter. Discrete Applied Mathematics. 135-148.
    • Fomin, Fedor; Thilikos, Dimitrios. 2004. A simple and fast approach for solving problems on planar graphs. Lecture Notes in Computer Science (LNCS). 56-67.
    • Fomin, Fedor. 2003. Pathwidth of planar and line graphs. Graphs and Combinatorics. 91-99.
    • Kratsch, Dieter; Müller, Haiko, Haiko; Fomin, Fedor. 2003. On the domination search numbe. Discrete Applied Mathematics. 565-580.
    • Thilikos, Dimitrios; Fomin, Fedor. 2003. On the Monotonicity of Games Generated by Symmetric Submodular Functions. Discrete Applied Mathematics. 323-335.
    • Golovach, Petr; Fomin, Fedor. 2003. Interval degree and bandwidth of a graph. Discrete Applied Mathematics. 345-359.
    • Fomin, Fedor; Broersma, Hajo; Woeginger, Gerhard; Nesetril, Jaroslav. 2002. More About Subcolorings. Computing. 187-203.
    • Fomin, Fedor; Bodlaender, Hans. 2002. Approximation of pathwidth of outerplanar graphs. Journal of Algorithms. 190-200.
    • Fomin, Fedor. 2002. A generalization of the graph bandwidth. Vestnik St. Petersburg Univ. Math.. 15-19.
    Academic lecture
    • Dorn, Frederic ; Fomin, Fedor; Thilikos, Dimitrios M. 2008. Catalan structures and dynamic programming in H-minor-free graphs.
    • Broersma, Hajo; Fomin, Fedor; Woeginger, Gerhard. 2004. Parallel knock-out schemes in networks.
    • Fomin, Fedor; Kratsch, Dieter; Todinca, Ioan. 2004. Exact (exponential) algorithms for treewidth and minimum fill-in.
    • Bodlaender, Hans; Fomin, Fedor. 2004. Equitable colorings of bounded treewidth graphs.
    • Fomin, Fedor; Thilikos, Dimitrios. 2004. Dominating sets in planar graphs: branch-width and exponential speed-up.
    • Demaine, Erik D.; Fomin, Fedor; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios. 2004. Bidimensional Parameters and Local Treewidth.
    • Fomin, Fedor; Thilikos, Dimitrios. 2004. A Simple and Fast Approach for Solving Problems on Planar Graphs.
    • Fomin, Fedor; Heggernes, Pinar; Telle, Jan Arne. 2003. Graph searching, elimination trees, and a generalization of bandwidth.
    • Demaine, Erik D.; Hajiaghayi, Mohammad Taghi; Thilikos, Dimitrios; Fomin, Fedor. 2003. Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs.
    • Fomin, Fedor; Thilikos, Dimitrios. 2003. Dominating sets and local treewidth.
    • Broersma, Hajo; Fomin, Fedor; Woeginger, Gerhard. 2003. Backbone colorings for networks.
    • Bodlaender, Hans; Fomin, Fedor. 2002. Tree Decompositions with Small Cost.
    • Bodlaender, Hans; Fomin, Fedor; Broersma, Hajo; Woeginger, Gerhard; Pyatkin, Artem. 2002. Radio Labeling with Pre-assigned Frequencies.
    • Fomin, Fedor; Broersma, Hajo; Woeginger, Gerhard; Kratochvil, Jan. 2001. Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.
    Academic anthology/Conference proceedings
    • 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.
    • Fomin, Fedor; Kaski, Petteri. 2012. Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. Springer.
    • Chen, Jianer; Fomin, Fedor. 2009. Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009. Springer.
    • Fomin, Fedor; Stepanov, Alexey. 2007. Counting Minimum Weighted Dominating Sets. Springer.
    • Fomin, Fedor. 2006. Graph-Theoretic Concepts in Computer Science, 32nd International Workshop, WG 2006 Bergen, Norway, June 22-23, 2006 Revised Papers, Lecture Notes in Computer Science, vol. 4271. Springer.
    Abstract
    • Fomin, Fedor; Golovach, Petr; Korhonen, Janne. 2013. On the Parameterized Complexity of Cutting a Few Vertices from a Graph. Lecture Notes in Computer Science (LNCS). 421-432.
    • Fomin, Fedor; Golovach, Petr. 2013. Long Circuits and Large Euler Subgraphs. Lecture Notes in Computer Science (LNCS). 493-504.
    • Fomin, Fedor; Iwama, Kazuo; Kratsch, Dieter. 2008. 08431 Executive Summary -- Moderately Exponential Time Algorithms. Dagstuhl Seminar Proceedings. 3 pages.
    Academic literature review
    • Fomin, Fedor; Kaski, Petteri. 2013. Exact exponential algorithms. 80-88.
    • Fomin, Fedor. 2012. Kernelization algorithms (keynote speech). 1-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+++