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

I am a professor in computer science at the University of Bergen, doing research in Algorithms and Combinatorics. My Master (1992) and PhD (1997) degrees are from the  Faculty of Mathematics and Mechanics, St. Petersburg State University and my supervisor was Prof. Nikolay Petrov. Here is a link to my page at the Mathematics Genealogy Project. I was an assistant professor at St. Petersburg State University (chair of  Operations Research) till 1999. I did postdocs in Chile (CMM and Universidad de Chile), Czech Republic (ITI and Charles University), and Germany (University of Paderborn). Since 2002, I am at the  Department of InformaticsUniversity of Bergen.

 

 

 

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
  • 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. Searching for better fill-in. Journal of computer and system sciences. 1374-1383.
  • 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. Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Lecture Notes in Computer Science (LNCS). 182-193.
  • Show author(s) 2013. Tight bounds for parameterized complexity of Cluster Editing. Leibniz International Proceedings in Informatics. 32-43.
  • Show author(s) 2013. Three complexity results on coloring Pk-free graphs. European journal of combinatorics (Print). 609-619.
  • 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. Exact algorithms for finding longest cycles in claw-free graphs. Algorithmica. 129-145.
  • Show author(s) 2013. Computing tree-depth faster than 2^n. Lecture Notes in Computer Science (LNCS). 137-149.
  • Show author(s) 2013. Computing optimal Steiner trees in polynomial space. Algorithmica. 584-604.
  • Show author(s) 2013. Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Information and Computation. 60-70.
  • 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) 2013. A linear vertex kernel for maximum internal spanning tree. Journal of computer and system sciences. 1-6.
  • 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. Subexponential parameterized algorithm for minimum fill-in. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 1737-1746.
  • Show author(s) 2012. Sharp separation and applications to exact and parameterized algorithms. Algorithmica. 692-706.
  • 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. Planar F-deletion: Approximation, kernelization and optimal FPT algorithms (extended abstract). Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS). 470-479.
  • Show author(s) 2012. Parameterized complexity of the spanning tree congestion problem. Algorithmica. 85-111.
  • Show author(s) 2012. On exact algorithms for treewidth. ACM Transactions on Algorithms (TALG). 23 pages.
  • Show author(s) 2012. Minimizing Rosenthal potential in multicast games. Lecture Notes in Computer Science (LNCS).
  • Show author(s) 2012. Making Life Easier for Firefighters. Lecture Notes in Computer Science (LNCS). 177-188.
  • Show author(s) 2012. Local search: Is brute-force avoidable? Journal of computer and system sciences. 707-719.
  • Show author(s) 2012. Kernel(s) for Problems with no Kernel: On Out-Trees with Many Leaves. ACM Transactions on Algorithms (TALG). 19 pages.
  • Show author(s) 2012. Faster algorithms for finding and counting subgraphs. Journal of computer and system sciences. 698-706.
  • Show author(s) 2012. Fast minor testing in planar graphs. Algorithmica. 69-84.
  • Show author(s) 2012. Counting subgraphs via homomorphisms. SIAM Journal on Discrete Mathematics. 695-717.
  • Show author(s) 2012. Cops and robber with constraints. SIAM Journal on Discrete Mathematics. 571-590.
  • Show author(s) 2012. Cops and robber game without recharging. Theory of Computing Systems. 611-620.
  • Show author(s) 2012. Connected graph searching. Information and Computation. 1-16.
  • Show author(s) 2012. Catalan structures and dynamic programming in H-minor-free graphs. Journal of computer and system sciences. 1606-1622.
  • 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 of minimum weight spanners for sparse graphs. Theoretical Computer Science. 846-852.
  • 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. Iterative compression and exact algorithms. Theoretical Computer Science. 1045-1053.
  • 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 exact algorithms for Hamiltonicity in claw-free graphs. Lecture Notes in Computer Science (LNCS). 44-53.
  • Show author(s) 2010. Fast Minor Testing in Planar Graphs. Lecture Notes in Computer Science (LNCS). 97-109.
  • Show author(s) 2010. Efficient exact algorithms on planar graphs: exploiting sphere cut decompositions. Algorithmica. 790-810.
  • 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. Three Complexity Results on Coloring Pk-Free Graphs. Lecture Notes in Computer Science (LNCS). 95-104.
  • 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. Nondeterministic Graph Searching: From Pathwidth to Treewidth. Algorithmica. 358-373.
  • 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. Counting Subgraphs via Homomorphisms. Lecture Notes in Computer Science (LNCS). 71-82.
  • Show author(s) 2009. Contraction Bidimensionality: The Accurate Picture. Lecture Notes in Computer Science (LNCS). 706-717.
  • 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) 2009. A Linear Vertex Kernel for Maximum Internal Spanning Tree. Lecture Notes in Computer Science (LNCS). 275-282.
  • Show author(s) 2008. Treewidth Computation and Extremal Combinatorics. Lecture Notes in Computer Science (LNCS). 210-221.
  • Show author(s) 2008. Subexponential parameterized algorithms. Computer Science Review. 29-39.
  • Show author(s) 2008. Spanning directed trees with many leaves. SIAM Journal on Discrete Mathematics. 466-476.
  • Show author(s) 2008. Spanners in sparse graphs. Lecture Notes in Computer Science (LNCS). 597-608.
  • Show author(s) 2008. Solving connected dominating set faster than 2(n). Algorithmica. 153-166.
  • 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. Subexponential Parameterized Algorithms. Lecture Notes in Computer Science (LNCS). 15-27.
  • Show author(s) 2007. Parameterized Algorithms for Directed Maximum Leaf Problems. Lecture Notes in Computer Science (LNCS). 352-362.
  • 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. Improved Exact Algorithms for Counting 3- and 4-Colorings. Lecture Notes in Computer Science (LNCS). 65-74.
  • Show author(s) 2007. Improved Algorithms for the Feedback Vertex Set Problems. Lecture Notes in Computer Science (LNCS). 422-433.
  • Show author(s) 2007. Exact algorithms for graph homomorphisms. Theory of Computing Systems. 381-393.
  • Show author(s) 2007. Eliminating graphs by means of parallel knock-out schemes. Discrete Applied Mathematics. 92-102.
  • Show author(s) 2007. Branch and Recharge: Exact Algorithms for Generalized Domination. Lecture Notes in Computer Science (LNCS). 507-518.
  • Show author(s) 2007. Better Algorithms and Bounds for Directed Maximum Leaf Problems. Lecture Notes in Computer Science (LNCS). 316-327.
  • 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. Tree decompositions with small cost. Discrete Applied Mathematics. 143-154.
  • Show author(s) 2005. Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. Journal of the ACM. 866-893.
  • Show author(s) 2005. Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the European Association for Theoretical Computer Science. 47-77.
  • Show author(s) 2005. On maximum number of minimal dominating sets in graphs. Electronic Notes in Discrete Mathematics. 157-162.
  • Show author(s) 2005. Nondeterministic Graph Searching: From Pathwidth to Treewidth. Lecture Notes in Computer Science (LNCS). 364-375.
  • Show author(s) 2005. Measure and conquer: Domination - A case study. Lecture Notes in Computer Science (LNCS). 191-203.
  • Show author(s) 2005. Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs. ACM Transactions on Algorithms (TALG). 33-47.
  • Show author(s) 2005. Exact algorithms for graph homomorphisms. Lecture Notes in Computer Science (LNCS). 161-171.
  • Show author(s) 2005. Equitable colorings of bounded treewidth graphs. Theoretical Computer Science. 22-30.
  • Show author(s) 2005. Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. Lecture Notes in Computer Science (LNCS). 95-106.
  • Show author(s) 2005. Connected Graph Searching in Outerplanar Graphs. Electronic Notes in Discrete Mathematics. 157-162.
  • Show author(s) 2005. Computing branchwidth via efficient triangulations and blocks. Lecture Notes in Computer Science (LNCS). 374-384.
  • Show author(s) 2005. Bounding the number of minimal dominating sets: A measure and conquer approach. Lecture Notes in Computer Science (LNCS). 573-582.
  • Show author(s) 2005. Bidimensional parameters and local treewidth. SIAM Journal on Discrete Mathematics. 501-511.
  • Show author(s) 2004. The complexity of approximating the oriented diameter of chordal graphs. Journal of Graph Theory. 255-269.
  • Show author(s) 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.
  • Show author(s) 2004. Searching expenditure and interval graphs. Discrete Applied Mathematics. 97-104.
  • Show author(s) 2004. Radio labeling with preassigned frequencies. SIAM Journal on Optimization. 1-16.
  • Show author(s) 2004. Parallel knock-out schemes in networks,. Lecture Notes in Computer Science (LNCS). 204-214.
  • Show author(s) 2004. On distance constrained labeling of disk graphs. Theoretical Computer Science. 261-292.
  • Show author(s) 2004. On distance constrained labeling of disk graphs. Theoretical Computer Science. 261-292.
  • Show author(s) 2004. Graph searching, elimination trees, and a generalization of bandwidth. Algorithmica. 73-87.
  • Show author(s) 2004. Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up. Lecture Notes in Computer Science (LNCS). 581-592.
  • Show author(s) 2004. Exact (exponential) algorithms for treewidth and minimum fill-in. Lecture Notes in Computer Science (LNCS). 568-580.
  • Show author(s) 2004. Exact (exponential) algorithms for the dominating set problem. Lecture Notes in Computer Science (LNCS). 245-256.
  • Show author(s) 2004. Equitable colorings of bounded treewidth graphs. Lecture Notes in Computer Science (LNCS). 180-190.
  • Show author(s) 2004. Dominating sets and local treewidth. Lecture Notes in Computer Science (LNCS). 221-229.
  • Show author(s) 2004. Bidimensional parameters and local treewidth. Lecture Notes in Computer Science (LNCS). 109-118.
  • Show author(s) 2004. Backbone colorings for networks. Lecture Notes in Computer Science (LNCS). 131-142.
  • Show author(s) 2004. Algorithms for graphs with small octopus. Discrete Applied Mathematics. 105-128.
  • Show author(s) 2004. AT-free graphs: linear bounds for the oriented diameter. Discrete Applied Mathematics. 135-148.
  • Show author(s) 2004. A simple and fast approach for solving problems on planar graphs. Lecture Notes in Computer Science (LNCS). 56-67.
  • Show author(s) 2003. Pathwidth of planar and line graphs. Graphs and Combinatorics. 91-99.
  • Show author(s) 2003. On the domination search numbe. Discrete Applied Mathematics. 565-580.
  • Show author(s) 2003. On the Monotonicity of Games Generated by Symmetric Submodular Functions. Discrete Applied Mathematics. 323-335.
  • Show author(s) 2003. Interval degree and bandwidth of a graph. Discrete Applied Mathematics. 345-359.
  • Show author(s) 2002. More About Subcolorings. Computing. 187-203.
  • Show author(s) 2002. Approximation of pathwidth of outerplanar graphs. Journal of Algorithms. 190-200.
  • Show author(s) 2002. A generalization of the graph bandwidth. Vestnik St. Petersburg Univ. Math.. 15-19.
Academic lecture
  • 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) 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)