Photo:

Det Norske Videnskaps-Akademi/Thomas B. Eckhoff

Fedor Fomin

Professor

E-mailfedor.fomin@uib.no
Phone+47 55 58 40 24
Visitor Address
HIB - Thormøhlens gate 55

5006 Bergen
Postal Address
Postboks 7803

5020 Bergen

Research
Publications

I am a professor in Algorithms at the University of Bergen. My research area is Theoretical Computer Science, and my current research interests are in Graph Algorithms, Parameterized Complexity, Algorithmic Fairness, Algorithmic Foundations of Machine Learning, and Combinatorial Games. I am a member of the Norwegian Academy of Science and Letters, the Norwegian Academy of Technological Sciences, the Academia Europaea, and a Fellow of the ACM and the EATCS.

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 from the Norwegian national database CRIStin.

Academic article

Show author(s) (2024). On coresets for fair clustering in metric and Euclidean spaces and their applications. Journal of computer and system sciences.
Show author(s) (2024). FPT approximation and subexponential algorithms for covering few or many edges. Information Processing Letters.

Show author(s) (2023). Two-sets cut-uncut on planar graphs. arXiv.org.

Show author(s) (2022). Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. SIAM journal on computing (Print). 1866-1930.
Show author(s) (2022). Present-biased optimization. Mathematical Social Sciences. 56-67.
Show author(s) (2022). Parameterized Complexity of Elimination Distance to First-Order Logic Properties. ACM Transactions on Computational Logic. 1-35.
Show author(s) (2022). On the optimality of pseudo-polynomial algorithms for integer programming. Mathematical programming.
Show author(s) (2022). On the Parameterized Complexity of the Expected Coverage Problem. Theory of Computing Systems. 432-453.
Show author(s) (2022). Lossy Kernelization of Same-Size Clustering. Lecture Notes in Computer Science (LNCS). 96-114.
Show author(s) (2022). Longest Cycle Above Erdös-Gallai Bound. Leibniz International Proceedings in Informatics. 1-15.
Show author(s) (2022). Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms. Leibniz International Proceedings in Informatics. 1-4.
Show author(s) (2022). How to Find a Good Explanation for Clustering? Proceedings of the AAAI Conference on Artificial Intelligence. 3904-3912.
Show author(s) (2022). Fast FPT-approximation of branchwidth. Proceedings of the Annual ACM Symposium on Theory of Computing. 886-899.
Show author(s) (2022). FPT Approximation for Fair Minimum-Load Clustering. Leibniz International Proceedings in Informatics. 1-14.
Show author(s) (2022). Exact Exponential Algorithms for Clustering Problems. Leibniz International Proceedings in Informatics. 1-14.
Show author(s) (2022). Detours in Directed Graphs. Leibniz International Proceedings in Informatics. 1-6.
Show author(s) (2022). Algorithmic Extensions of Dirac's Theorem. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 406-416.
Show author(s) (2022). (Re)packing Equal Disks into Rectangle. Leibniz International Proceedings in Informatics. 1-17.

Show author(s) (2021). ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs . Journal of Computational Geometry. 126-148.
Show author(s) (2021). Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds. ACM Transactions on Computation Theory. 10:1-10:25.

Show author(s) (2019). Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. ACM Transactions on Algorithms (TALG). 44 pages.
Show author(s) (2019). Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. SIAM Journal on Discrete Mathematics. 327-345.
Show author(s) (2019). On width measures and topological problems on semi-complete digraphs. Journal of combinatorial theory. Series B (Print). 78-165.
Show author(s) (2019). Modification to planarity is fixed parameter tractable. Leibniz International Proceedings in Informatics. 28:1-28:17.
Show author(s) (2019). Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Discrete & Computational Geometry. 879-911.
Show author(s) (2019). Exact algorithms via monotone local search. Journal of the ACM. 8:1-8:23.

Show author(s) (2018). Parameterized low-rank binary matrix approximation. Leibniz International Proceedings in Informatics. 1-16.
Show author(s) (2018). On the tractability of optimization problems on H-graphs. Leibniz International Proceedings in Informatics. 1-14.
Show author(s) (2018). On the optimality of pseudo-polynomial algorithms for integer programming. Leibniz International Proceedings in Informatics. 31:1-31:13.
Show author(s) (2018). A Fixed-Parameter Perspective on #BIS. Leibniz International Proceedings in Informatics. 13:1-13:13.

Show author(s) (2017). Tight lower bounds on graph embedding problems. Journal of the ACM. 1-22.
Show author(s) (2017). Representative families of product families. ACM Transactions on Algorithms (TALG). 1-29.
Show author(s) (2017). Metric Dimension of Bounded Tree-length Graphs. SIAM Journal on Discrete Mathematics. 1217-1243.
Show author(s) (2017). Matrix rigidity from the viewpoint of parameterized complexity. Leibniz International Proceedings in Informatics.
Show author(s) (2017). Finding, hitting and packing cycles in subexponential time on unit disk graphs. Leibniz International Proceedings in Informatics. 1-15.
Show author(s) (2017). Finding detours is fixed-parameter tractable. Leibniz International Proceedings in Informatics. 2326-2345.
Show author(s) (2017). Faster exact algorithms for some terminal set problems. Journal of computer and system sciences. 195-207.
Show author(s) (2017). Exact algorithms for terrain guarding. Leibniz International Proceedings in Informatics. 111-1115.
Show author(s) (2017). Covering vectors by spaces: Regular matroids. Leibniz International Proceedings in Informatics. 1-15.
Show author(s) (2017). Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Algorithmica. 1146-1169.

Show author(s) (2016). Vertex cover structural parameterization revisited. Lecture Notes in Computer Science (LNCS). 171-182.
Show author(s) (2016). The Firefighter problem on graph classes. Theoretical Computer Science. 38-50.
Show author(s) (2016). Subexponential algorithms for rectilinear Steiner tree and arborescence problems. Leibniz International Proceedings in Informatics. 39.1-39.15.
Show author(s) (2016). Subexponential Parameterized Algorithms for Planar and Apex-Minor-Free Graphs via Low Treewidth Pattern Covering. Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS). 515-524.
Show author(s) (2016). Parameterized complexity of the anchored k-core problem for directed graphs. Information and Computation. 11-22.
Show author(s) (2016). Parameterized complexity of secluded connectivity problems. Theory of Computing Systems. 1-25.
Show author(s) (2016). Parameterized Complexity of Superstring Problems. Algorithmica. 1-16.
Show author(s) (2016). Kernelization and sparseness: The case of dominating set. Leibniz International Proceedings in Informatics. 14 pages.
Show author(s) (2016). How to hunt an invisible rabbit on a graph. European journal of combinatorics (Print). 12-26.
Show author(s) (2016). Hitting forbidden minors: Approximation and kernelization. SIAM Journal on Discrete Mathematics. 383-410.
Show author(s) (2016). Exact algorithms via monotone local search. Proceedings of the Annual ACM Symposium on Theory of Computing. 764-775.
Show author(s) (2016). Efficient computation of representative families with applications in parameterized and exact algorithms. Journal of the ACM.
Show author(s) (2016). Editing to connected f-degree graph. Leibniz International Proceedings in Informatics. 1-15.
Show author(s) (2016). A $c^k n$ 5-approximation algorithm for treewidth. SIAM journal on computing (Print). 317-378.
Show author(s) (2016). (Meta) Kernelization. Journal of the ACM.

Show author(s) (2015). Parameterized single-exponential time polynomial space algorithm for steiner tree. Lecture Notes in Computer Science (LNCS). 494-505.
Show author(s) (2015). Parameterized complexity of superstring problems. Lecture Notes in Computer Science (LNCS). 89-99.
Show author(s) (2015). Parameterized complexity of secluded connectivity problems. Leibniz International Proceedings in Informatics. 408-419.
Show author(s) (2015). On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Theoretical Computer Science. 1-15.
Show author(s) (2015). Minimizing Rosenthal potential in multicast games. Theory of Computing Systems. 81-96.
Show author(s) (2015). Metric dimension of bounded width graphs. Lecture Notes in Computer Science (LNCS). 115-126.
Show author(s) (2015). Lower bounds for the graph homomorphism problem. Lecture Notes in Computer Science (LNCS). 481-493.
Show author(s) (2015). Largest chordal and interval subgraphs faster than 2n. Algorithmica. 26 pages.
Show author(s) (2015). Large induced subgraphs via triangulations and CMSO. SIAM journal on computing (Print). 54-87.
Show author(s) (2015). Graph modification problems: A modern perspective. Lecture Notes in Computer Science (LNCS). 3-6.
Show author(s) (2015). Exploring the subexponential complexity of completion problems. ACM Transactions on Computation Theory.
Show author(s) (2015). Computing tree-depth faster than 2n. Algorithmica. 202-216.
Show author(s) (2015). A subexponential parameterized algorithm for proper interval completion. SIAM Journal on Discrete Mathematics. 1961-1987.

Show author(s) (2014). To satisfy impatient Web surfers is hard. Theoretical Computer Science. 1-17.
Show author(s) (2014). Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters. Journal of computer and system sciences. 1430-1447.
Show author(s) (2014). Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems. Tsinghua Science and Technology. 374-386.
Show author(s) (2014). Searching for better fill-in. Journal of computer and system sciences. 1374-1383.
Show author(s) (2014). Representative sets of product families. Lecture Notes in Computer Science (LNCS). 443-454.
Show author(s) (2014). Preprocessing subgraph and minor problems: When does a small vertex cover help? Journal of computer and system sciences. 468-495.
Show author(s) (2014). Parameterized complexity of firefighting. Journal of computer and system sciences. 1285-1297.
Show author(s) (2014). Parameterized complexity of connected even/odd subgraph problems. Journal of computer and system sciences. 157-179.
Show author(s) (2014). Parameterized algorithms to preserve connectivity. Lecture Notes in Computer Science (LNCS). 800-811.
Show author(s) (2014). Long circuits and large euler subgraphs. SIAM Journal on Discrete Mathematics. 878-892.
Show author(s) (2014). Exploring subexponential parameterized complexity of completion problems. Leibniz International Proceedings in Informatics. 288-299.
Show author(s) (2014). Enumerating minimal subset feedback vertex sets. Algorithmica. 216-231.
Show author(s) (2014). Connecting vertices by independent trees. Leibniz International Proceedings in Informatics. 73-84.
Show author(s) (2014). Almost optimal lower bounds for problems parameterized by clique-width. SIAM journal on computing (Print). 1541-1563.
Show author(s) (2014). Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Lecture Notes in Computer Science (LNCS). 182-193.
Show author(s) (2014). A subexponential parameterized algorithm for proper interval completion. Lecture Notes in Computer Science (LNCS). 173-184.

Show author(s) (2013). Tight bounds for parameterized complexity of Cluster Editing. Leibniz International Proceedings in Informatics. 32-43.
Show author(s) (2013). Subexponential parameterized algorithm for minimum fill-in. SIAM journal on computing (Print). 2197-2216.
Show author(s) (2013). Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph. Lecture Notes in Computer Science (LNCS). 505-516.
Show author(s) (2013). Quadratic upper bounds on the Erdős–Pósa property for a generalization of packing and covering cycles. Journal of Graph Theory. 417-424.
Show author(s) (2013). Largest chordal and interval subgraphs faster than 2^n. Lecture Notes in Computer Science (LNCS). 193-204.
Show author(s) (2013). Jungles, bundles, and fixed parameter tractability. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 396-413.
Show author(s) (2013). Computing tree-depth faster than 2^n. Lecture Notes in Computer Science (LNCS). 137-149.
Show author(s) (2013). An O(c^k n) 5-approximation algorithm for treewidth. Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS). 499-508.
Show author(s) (2013). A polynomial kernel for proper interval vertex deletion. SIAM Journal on Discrete Mathematics. 1964-1976.

Show author(s) (2012). k-Gap Interval Graphs. Lecture Notes in Computer Science (LNCS). 350-361.
Show author(s) (2012). Treewidth computation and extremal combinatorics. Combinatorica. 289-308.
Show author(s) (2012). Preprocessing subgraph and minor problems: when does a small vertex cover help? Lecture Notes in Computer Science (LNCS).
Show author(s) (2012). Minimizing Rosenthal potential in multicast games. Lecture Notes in Computer Science (LNCS).
Show author(s) (2012). Connected graph searching. Information and Computation. 1-16.
Show author(s) (2012). A note on exact algorithms for vertex ordering problems on graphs. Theory of Computing Systems. 420-432.
Show author(s) (2012). A Polynomial Kernel for Proper Interval Vertex Deletion. Lecture Notes in Computer Science (LNCS). 467-478.

Show author(s) (2011). Subexponential algorithms for partial cover problems. Information Processing Letters. 814-818.
Show author(s) (2011). Strengthening Erdos-Posa Property for Minor-Closed Graph Classes. Journal of Graph Theory. 235-240.
Show author(s) (2011). Spanners of bounded degree graphs. Information Processing Letters. 142-144.
Show author(s) (2011). Spanners in sparse graphs. Journal of computer and system sciences. 1108-1119.
Show author(s) (2011). On the complexity of some colorful problems parameterized by treewidth. Information and Computation. 143-153.
Show author(s) (2011). On the Complexity of Reconstructing H-Free Graphs from Their Star Systems. Journal of Graph Theory. 113-124.
Show author(s) (2011). Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. Leibniz International Proceedings in Informatics. 164-175.
Show author(s) (2011). Kernels for feedback arc set in tournaments. Journal of computer and system sciences. 1071-1078.
Show author(s) (2011). Implicit branching and parameterized partial cover problems. Journal of computer and system sciences. 1159-1171.
Show author(s) (2011). How to Guard a Graph? Algorithmica. 839-856.
Show author(s) (2011). Guard games on graphs: Keep the intruder out! Theoretical Computer Science. 6484-6497.
Show author(s) (2011). Faster parameterized algorithms for minor containment. Theoretical Computer Science. 7018-7028.
Show author(s) (2011). Exact Algorithm for the Maximum Induced Planar Subgraph Problem. Lecture Notes in Computer Science (LNCS). 287-298.
Show author(s) (2011). Enumerating minimal subset feedback vertex sets. Lecture Notes in Computer Science (LNCS). 399-410.
Show author(s) (2011). Contraction obstructions for treewidth. Journal of combinatorial theory. Series B (Print). 302-314.
Show author(s) (2011). Branch and Recharge: Exact Algorithms for Generalized Domination. Algorithmica. 252-273.
Show author(s) (2011). Approximation Algorithms for Domination Search. Lecture Notes in Computer Science (LNCS). 130-141.
Show author(s) (2011). Approximating width parameters of hypergraphs with excluded minors. SIAM Journal on Discrete Mathematics. 1331-1348.
Show author(s) (2011). An exact algorithm for minimum distortion embedding. Theoretical Computer Science. 3530-3536.

Show author(s) (2010). Rank-width and tree-width of H-minor-free graphs. European journal of combinatorics (Print). 1617-1628.
Show author(s) (2010). Pursuing a fast robber on a graph. Theoretical Computer Science. 1167-1181.
Show author(s) (2010). Protrusions in Graphs and Their Applications. Lecture Notes in Computer Science (LNCS). 3-3.
Show author(s) (2010). Parameterized algorithm for eternal vertex cover. Information Processing Letters. 702-706.
Show author(s) (2010). Mixed Search Number and Linear-Width of Interval and Split Graphs. Networks. 207-214.
Show author(s) (2010). Kernelization. Lecture Notes in Computer Science (LNCS). 107-108.
Show author(s) (2010). Intractability of clique-width parameterizations. SIAM journal on computing (Print). 1941-1956.
Show author(s) (2010). Finding Induced Subgraphs via Minimal Triangulations. Leibniz International Proceedings in Informatics. 383-394.
Show author(s) (2010). Faster Parameterized Algorithms for Minor Containment. Lecture Notes in Computer Science (LNCS). 322-333.
Show author(s) (2010). Fast Minor Testing in Planar Graphs. Lecture Notes in Computer Science (LNCS). 97-109.
Show author(s) (2010). Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. Leibniz International Proceedings in Informatics. 251-262.
Show author(s) (2010). Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. Journal of computer and system sciences. 650-662.

Show author(s) (2009). Subexponential Algorithms for Partial Cover Problems. Leibniz International Proceedings in Informatics. 193-201.
Show author(s) (2009). Sort and Search: Exact algorithms for generalized domination. Information Processing Letters. 795-798.
Show author(s) (2009). On two techniques of combining branching and treewidth. Algorithmica. 181-207.
Show author(s) (2009). Mixed search number and linear-width of interval and split graphs. Networks.
Show author(s) (2009). Kernels for Feedback Arc Set In Tournaments. Leibniz International Proceedings in Informatics. 37-47.
Show author(s) (2009). Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. Leibniz International Proceedings in Informatics. 421-432.
Show author(s) (2009). Distortion Is Fixed Parameter Tractable. Lecture Notes in Computer Science (LNCS). 463-474.
Show author(s) (2009). Computing branchwidth via efficient triangulations and blocks. Discrete Applied Mathematics. 2726-2736.
Show author(s) (2009). Approximating Acyclicity Parameters of Sparse Hypergraphs. Leibniz International Proceedings in Informatics. 445-456.
Show author(s) (2009). An Exact Algorithm for Minimum Distortion Embedding. Lecture Notes in Computer Science (LNCS). 112-121.
Show author(s) (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.
Show author(s) (2009). A measure & conquer approach for the analysis of exact algorithms. Journal of the ACM. 32 pages.

Show author(s) (2008). Treewidth Computation and Extremal Combinatorics. Lecture Notes in Computer Science (LNCS). 210-221.
Show author(s) (2008). Spanners in sparse graphs. Lecture Notes in Computer Science (LNCS). 597-608.
Show author(s) (2008). On tractability cops and robbers game. IFIP International Federation for Information Processing. 171-185.
Show author(s) (2008). On the complexity of reconstructing H-free graphs from their Star Systems. Lecture Notes in Computer Science (LNCS). 194-205.
Show author(s) (2008). On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. Algorithmica. 293-307.
Show author(s) (2008). Iterative Compression and Exact Algorithms. Lecture Notes in Computer Science (LNCS). 335-346.
Show author(s) (2008). Improved algorithms for feedback vertex set problems. Journal of computer and system sciences. 1188-1198.
Show author(s) (2008). Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). Dagstuhl Seminar Proceedings. 12 pages.
Show author(s) (2008). How to guard a graph? Lecture Notes in Computer Science (LNCS). 318-239.
Show author(s) (2008). Faster Steiner Tree Computation in Polynomial-Space. Lecture Notes in Computer Science (LNCS). 430-441.
Show author(s) (2008). Exact algorithms for treewidth and minimum fill-in. SIAM journal on computing (Print). 1058-1079.
Show author(s) (2008). Combinatorial Bounds via Measure and Conquer: Bounding Minimal Dominating Sets and Applications. ACM Transactions on Algorithms (TALG). 17 pages.
Show author(s) (2008). An annotated bibliography on guaranteed graph searching. Theoretical Computer Science. 236-245.
Show author(s) (2008). A PTAS for the sparsest spanners problem on apex-minor-free graphs. Lecture Notes in Computer Science (LNCS). 290-298.

Show author(s) (2007). On self duality of pathwidth in polyhedral graph embeddings. Journal of Graph Theory. 42-54.
Show author(s) (2007). Mixed search number and linear-width of interval and split graphs. Lecture Notes in Computer Science (LNCS). 304-315.
Show author(s) (2007). Exact algorithms for graph homomorphisms. Theory of Computing Systems. 381-393.
Show author(s) (2007). Branch and Recharge: Exact Algorithms for Generalized Domination. Lecture Notes in Computer Science (LNCS). 507-518.
Show author(s) (2007). Backbone colorings for graphs: Tree and path backbones. Journal of Graph Theory. 137-152.

Show author(s) (2006). Solving Connected Dominating Set Faster than O(2n). Lecture Notes in Computer Science (LNCS). 152-163.
Show author(s) (2006). Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult. Algorithmica. 343-361.
Show author(s) (2006). Pathwidth of cubic graphs and exact algorithms. Information Processing Letters. 191-196.
Show author(s) (2006). Optimal linear arrangement of interval graphs. Lecture Notes in Computer Science (LNCS). 267-279.
Show author(s) (2006). On exact algorithms for treewidth. Lecture Notes in Computer Science (LNCS). 672-683.
Show author(s) (2006). New upper bounds on the decomposability of planar graphs. Journal of Graph Theory. 53-81.
Show author(s) (2006). Finding a Minimum Feedback Vertex Set in time O(1.7548n). Lecture Notes in Computer Science (LNCS). 184-191.
Show author(s) (2006). Fast subexponential algorithm for non-local problems on graphs of bounded genus. Lecture Notes in Computer Science (LNCS). 172-183.
Show author(s) (2006). Dominating sets in planar graphs: Branch-width and exponential speed-up. SIAM journal on computing (Print). 281-309.
Show author(s) (2006). Branching and treewidth based exact algorithms. Lecture Notes in Computer Science (LNCS). 16-25.
Show author(s) (2006). A 3-approximation for the pathwidth of Halin graphs. Journal of Discrete Algorithms. 499-510.

Show author(s) (2005). Bidimensional parameters and local treewidth. SIAM Journal on Discrete Mathematics. 501-511.

Academic lecture

Show author(s) (2022). Lossy Kernelization of Same-Size Clustering.

Show author(s) (2008). Catalan structures and dynamic programming in H-minor-free graphs.

Show author(s) (2004). Parallel knock-out schemes in networks.
Show author(s) (2004). Exact (exponential) algorithms for treewidth and minimum fill-in.
Show author(s) (2004). Equitable colorings of bounded treewidth graphs.
Show author(s) (2004). Dominating sets in planar graphs: branch-width and exponential speed-up.
Show author(s) (2004). Bidimensional Parameters and Local Treewidth.
Show author(s) (2004). A Simple and Fast Approach for Solving Problems on Planar Graphs.

Show author(s) (2003). Graph searching, elimination trees, and a generalization of bandwidth.
Show author(s) (2003). Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs.
Show author(s) (2003). Dominating sets and local treewidth.
Show author(s) (2003). Backbone colorings for networks.

Show author(s) (2002). Tree Decompositions with Small Cost.
Show author(s) (2002). Radio Labeling with Pre-assigned Frequencies.

Show author(s) (2001). Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.

Academic anthology/Conference proceedings

Show author(s) (2018). Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings. Springer.

Show author(s) (2012). Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. Springer.

Show author(s) (2009). Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009. Springer.

Show author(s) (2007). Counting Minimum Weighted Dominating Sets. Springer.

Show author(s) (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

Show author(s) (2013). On the Parameterized Complexity of Cutting a Few Vertices from a Graph. Lecture Notes in Computer Science (LNCS). 421-432.
Show author(s) (2013). Long Circuits and Large Euler Subgraphs. Lecture Notes in Computer Science (LNCS). 493-504.

Show author(s) (2008). 08431 Executive Summary -- Moderately Exponential Time Algorithms. Dagstuhl Seminar Proceedings. 3 pages.

Academic literature review

Show author(s) (2023). A survey of parameterized algorithms and the complexity of edge modification. Computer Science Review. 31 pages.

Show author(s) (2013). Exact exponential algorithms. Communications of the ACM. 80-88.

Show author(s) (2012). Kernelization algorithms (keynote speech). Smart Innovation, Systems and Technologies. 1-7.

More information in national current research information system (CRIStin)

Fields of competence

Algorithms

Artificial Intelligence

Parameterized Complexity

Algorithms

Fedor Fomin gets ERC Advanced Grant

Fedor Fomin from the Department of informatics receives 2.2 million Euros from ERC.

Photo showing two boards full of mathematical riddles, the picture is from the Bergen Algorithms Research Group's offices.

Travelling at the speed of algorithms

Young researcher Michał Pilipczuk has solved a 20 year-old mathematical riddle. His work can help computers make better choices. It also brought him the 2013 Meltzer Award for young researchers.

Image of blackboard with algorithms written all over it.

OK Computer: a world of algorithms

The world is full of problems, but not every problem has a good algorithm that can solve it. Meet the researchers who make the computer think.