Hjem
Fedor Fomins bilde
Foto:
Det Norske Videnskaps-Akademi/Thomas B. Eckhoff
  • E-postfedor.fomin@uib.no
  • Telefon+47 55 58 40 24
  • Besøksadresse
    HIB - Thormøhlens gate 55
    5006 Bergen
  • Postadresse
    Postboks 7803
    5020 Bergen

Theoretical Computer Science, Algorithms

Vitenskapelig artikkel
  • Vis forfatter(e) (2018). Parameterized low-rank binary matrix approximation. Leibniz International Proceedings in Informatics. 1-16.
  • Vis forfatter(e) (2018). On the tractability of optimization problems on H-graphs. Leibniz International Proceedings in Informatics. 1-14.
  • Vis forfatter(e) (2018). A Fixed-Parameter Perspective on #BIS. Leibniz International Proceedings in Informatics. 13:1-13:13.
  • Vis forfatter(e) (2017). Tight lower bounds on graph embedding problems. Journal of the ACM. 1-22.
  • Vis forfatter(e) (2017). Representative families of product families. ACM Transactions on Algorithms (TALG). 1-29.
  • Vis forfatter(e) (2017). Metric Dimension of Bounded Tree-length Graphs. SIAM Journal on Discrete Mathematics. 1217-1243.
  • Vis forfatter(e) (2017). Matrix rigidity from the viewpoint of parameterized complexity. Leibniz International Proceedings in Informatics.
  • Vis forfatter(e) (2017). Finding, hitting and packing cycles in subexponential time on unit disk graphs. Leibniz International Proceedings in Informatics. 1-15.
  • Vis forfatter(e) (2017). Finding detours is fixed-parameter tractable. Leibniz International Proceedings in Informatics. 2326-2345.
  • Vis forfatter(e) (2017). Faster exact algorithms for some terminal set problems. Journal of computer and system sciences. 195-207.
  • Vis forfatter(e) (2017). Exact algorithms for terrain guarding. Leibniz International Proceedings in Informatics. 111-1115.
  • Vis forfatter(e) (2017). Covering vectors by spaces: Regular matroids. Leibniz International Proceedings in Informatics. 1-15.
  • Vis forfatter(e) (2017). Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Algorithmica. 1146-1169.
  • Vis forfatter(e) (2016). Vertex cover structural parameterization revisited. Lecture Notes in Computer Science (LNCS). 171-182.
  • Vis forfatter(e) (2016). The Firefighter problem on graph classes. Theoretical Computer Science. 38-50.
  • Vis forfatter(e) (2016). Subexponential algorithms for rectilinear Steiner tree and arborescence problems. Leibniz International Proceedings in Informatics. 39.1-39.15.
  • Vis forfatter(e) (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.
  • Vis forfatter(e) (2016). Parameterized complexity of the anchored k-core problem for directed graphs. Information and Computation. 11-22.
  • Vis forfatter(e) (2016). Parameterized complexity of secluded connectivity problems. Theory of Computing Systems. 1-25.
  • Vis forfatter(e) (2016). Parameterized Complexity of Superstring Problems. Algorithmica. 1-16.
  • Vis forfatter(e) (2016). Kernelization and sparseness: The case of dominating set. Leibniz International Proceedings in Informatics. 14 sider.
  • Vis forfatter(e) (2016). How to hunt an invisible rabbit on a graph. European journal of combinatorics (Print). 12-26.
  • Vis forfatter(e) (2016). Hitting forbidden minors: Approximation and kernelization. SIAM Journal on Discrete Mathematics. 383-410.
  • Vis forfatter(e) (2016). Exact algorithms via monotone local search. Proceedings of the Annual ACM Symposium on Theory of Computing. 764-775.
  • Vis forfatter(e) (2016). Efficient computation of representative families with applications in parameterized and exact algorithms. Journal of the ACM.
  • Vis forfatter(e) (2016). Editing to connected f-degree graph. Leibniz International Proceedings in Informatics. 1-15.
  • Vis forfatter(e) (2016). A $c^k n$ 5-approximation algorithm for treewidth. SIAM journal on computing (Print). 317-378.
  • Vis forfatter(e) (2016). (Meta) Kernelization. Journal of the ACM.
  • Vis forfatter(e) (2015). Parameterized single-exponential time polynomial space algorithm for steiner tree. Lecture Notes in Computer Science (LNCS). 494-505.
  • Vis forfatter(e) (2015). Parameterized complexity of superstring problems. Lecture Notes in Computer Science (LNCS). 89-99.
  • Vis forfatter(e) (2015). Parameterized complexity of secluded connectivity problems. Leibniz International Proceedings in Informatics. 408-419.
  • Vis forfatter(e) (2015). On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Theoretical Computer Science. 1-15.
  • Vis forfatter(e) (2015). Minimizing Rosenthal potential in multicast games. Theory of Computing Systems. 81-96.
  • Vis forfatter(e) (2015). Metric dimension of bounded width graphs. Lecture Notes in Computer Science (LNCS). 115-126.
  • Vis forfatter(e) (2015). Lower bounds for the graph homomorphism problem. Lecture Notes in Computer Science (LNCS). 481-493.
  • Vis forfatter(e) (2015). Largest chordal and interval subgraphs faster than 2n. Algorithmica. 26 sider.
  • Vis forfatter(e) (2015). Large induced subgraphs via triangulations and CMSO. SIAM journal on computing (Print). 54-87.
  • Vis forfatter(e) (2015). Graph modification problems: A modern perspective. Lecture Notes in Computer Science (LNCS). 3-6.
  • Vis forfatter(e) (2015). Exploring the subexponential complexity of completion problems. ACM Transactions on Computation Theory.
  • Vis forfatter(e) (2015). Computing tree-depth faster than 2n. Algorithmica. 202-216.
  • Vis forfatter(e) (2015). A subexponential parameterized algorithm for proper interval completion. SIAM Journal on Discrete Mathematics. 1961-1987.
  • Vis forfatter(e) (2014). To satisfy impatient Web surfers is hard. Theoretical Computer Science. 1-17.
  • Vis forfatter(e) (2014). Tight bounds for parameterized complexity of Cluster Editing with a small number of clusters. Journal of computer and system sciences. 1430-1447.
  • Vis forfatter(e) (2014). Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems. Tsinghua Science and Technology. 374-386.
  • Vis forfatter(e) (2014). Searching for better fill-in. Journal of computer and system sciences. 1374-1383.
  • Vis forfatter(e) (2014). Representative sets of product families. Lecture Notes in Computer Science (LNCS). 443-454.
  • Vis forfatter(e) (2014). Preprocessing subgraph and minor problems: When does a small vertex cover help? Journal of computer and system sciences. 468-495.
  • Vis forfatter(e) (2014). Parameterized complexity of firefighting. Journal of computer and system sciences. 1285-1297.
  • Vis forfatter(e) (2014). Parameterized complexity of connected even/odd subgraph problems. Journal of computer and system sciences. 157-179.
  • Vis forfatter(e) (2014). Parameterized algorithms to preserve connectivity. Lecture Notes in Computer Science (LNCS). 800-811.
  • Vis forfatter(e) (2014). Long circuits and large euler subgraphs. SIAM Journal on Discrete Mathematics. 878-892.
  • Vis forfatter(e) (2014). Exploring subexponential parameterized complexity of completion problems. Leibniz International Proceedings in Informatics. 288-299.
  • Vis forfatter(e) (2014). Enumerating minimal subset feedback vertex sets. Algorithmica. 216-231.
  • Vis forfatter(e) (2014). Connecting vertices by independent trees. Leibniz International Proceedings in Informatics. 73-84.
  • Vis forfatter(e) (2014). Almost optimal lower bounds for problems parameterized by clique-width. SIAM journal on computing (Print). 1541-1563.
  • Vis forfatter(e) (2014). Algorithms parameterized by vertex cover and modular width, through potential maximal cliques. Lecture Notes in Computer Science (LNCS). 182-193.
  • Vis forfatter(e) (2014). A subexponential parameterized algorithm for proper interval completion. Lecture Notes in Computer Science (LNCS). 173-184.
  • Vis forfatter(e) (2013). Tight bounds for parameterized complexity of Cluster Editing. Leibniz International Proceedings in Informatics. 32-43.
  • Vis forfatter(e) (2013). Subexponential parameterized algorithm for minimum fill-in. SIAM journal on computing (Print). 2197-2216.
  • Vis forfatter(e) (2013). Subexponential parameterized algorithm for computing the cutwidth of a semi-complete digraph. Lecture Notes in Computer Science (LNCS). 505-516.
  • Vis forfatter(e) (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.
  • Vis forfatter(e) (2013). Largest chordal and interval subgraphs faster than 2^n. Lecture Notes in Computer Science (LNCS). 193-204.
  • Vis forfatter(e) (2013). Jungles, bundles, and fixed parameter tractability. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 396-413.
  • Vis forfatter(e) (2013). Exact algorithms for finding longest cycles in claw-free graphs. Algorithmica. 129-145.
  • Vis forfatter(e) (2013). Computing tree-depth faster than 2^n. Lecture Notes in Computer Science (LNCS). 137-149.
  • Vis forfatter(e) (2013). Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Information and Computation. 60-70.
  • Vis forfatter(e) (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.
  • Vis forfatter(e) (2013). A polynomial kernel for proper interval vertex deletion. SIAM Journal on Discrete Mathematics. 1964-1976.
  • Vis forfatter(e) (2012). k-Gap Interval Graphs. Lecture Notes in Computer Science (LNCS). 350-361.
  • Vis forfatter(e) (2012). Treewidth computation and extremal combinatorics. Combinatorica. 289-308.
  • Vis forfatter(e) (2012). Subexponential parameterized algorithm for minimum fill-in. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 1737-1746.
  • Vis forfatter(e) (2012). Sharp separation and applications to exact and parameterized algorithms. Algorithmica. 692-706.
  • Vis forfatter(e) (2012). Preprocessing subgraph and minor problems: when does a small vertex cover help? Lecture Notes in Computer Science (LNCS).
  • Vis forfatter(e) (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.
  • Vis forfatter(e) (2012). Parameterized complexity of the spanning tree congestion problem. Algorithmica. 85-111.
  • Vis forfatter(e) (2012). On exact algorithms for treewidth. ACM Transactions on Algorithms (TALG). 23 sider.
  • Vis forfatter(e) (2012). Making Life Easier for Firefighters. Lecture Notes in Computer Science (LNCS). 177-188.
  • Vis forfatter(e) (2012). Local search: Is brute-force avoidable? Journal of computer and system sciences. 707-719.
  • Vis forfatter(e) (2012). Kernel(s) for Problems with no Kernel: On Out-Trees with Many Leaves. ACM Transactions on Algorithms (TALG). 19 sider.
  • Vis forfatter(e) (2012). Faster algorithms for finding and counting subgraphs. Journal of computer and system sciences. 698-706.
  • Vis forfatter(e) (2012). Counting subgraphs via homomorphisms. SIAM Journal on Discrete Mathematics. 695-717.
  • Vis forfatter(e) (2012). Cops and robber with constraints. SIAM Journal on Discrete Mathematics. 571-590.
  • Vis forfatter(e) (2012). Cops and robber game without recharging. Theory of Computing Systems. 611-620.
  • Vis forfatter(e) (2012). Connected graph searching. Information and Computation. 1-16.
  • Vis forfatter(e) (2012). Catalan structures and dynamic programming in H-minor-free graphs. Journal of computer and system sciences. 1606-1622.
  • Vis forfatter(e) (2012). A note on exact algorithms for vertex ordering problems on graphs. Theory of Computing Systems. 420-432.
  • Vis forfatter(e) (2012). A Polynomial Kernel for Proper Interval Vertex Deletion. Lecture Notes in Computer Science (LNCS). 467-478.
  • Vis forfatter(e) (2011). Subexponential algorithms for partial cover problems. Information Processing Letters. 814-818.
  • Vis forfatter(e) (2011). Strengthening Erdos-Posa Property for Minor-Closed Graph Classes. Journal of Graph Theory. 235-240.
  • Vis forfatter(e) (2011). Spanners of bounded degree graphs. Information Processing Letters. 142-144.
  • Vis forfatter(e) (2011). Spanners in sparse graphs. Journal of computer and system sciences. 1108-1119.
  • Vis forfatter(e) (2011). On the complexity of some colorful problems parameterized by treewidth. Information and Computation. 143-153.
  • Vis forfatter(e) (2011). On the Complexity of Reconstructing H-Free Graphs from Their Star Systems. Journal of Graph Theory. 113-124.
  • Vis forfatter(e) (2011). Minimum Fill-in of Sparse Graphs: Kernelization and Approximation. Leibniz International Proceedings in Informatics. 164-175.
  • Vis forfatter(e) (2011). Kernels for feedback arc set in tournaments. Journal of computer and system sciences. 1071-1078.
  • Vis forfatter(e) (2011). Implicit branching and parameterized partial cover problems. Journal of computer and system sciences. 1159-1171.
  • Vis forfatter(e) (2011). How to Guard a Graph? Algorithmica. 839-856.
  • Vis forfatter(e) (2011). Guard games on graphs: Keep the intruder out! Theoretical Computer Science. 6484-6497.
  • Vis forfatter(e) (2011). Faster parameterized algorithms for minor containment. Theoretical Computer Science. 7018-7028.
  • Vis forfatter(e) (2011). Exact Algorithm for the Maximum Induced Planar Subgraph Problem. Lecture Notes in Computer Science (LNCS). 287-298.
  • Vis forfatter(e) (2011). Enumerating minimal subset feedback vertex sets. Lecture Notes in Computer Science (LNCS). 399-410.
  • Vis forfatter(e) (2011). Contraction obstructions for treewidth. Journal of combinatorial theory. Series B (Print). 302-314.
  • Vis forfatter(e) (2011). Branch and Recharge: Exact Algorithms for Generalized Domination. Algorithmica. 252-273.
  • Vis forfatter(e) (2011). Approximation Algorithms for Domination Search. Lecture Notes in Computer Science (LNCS). 130-141.
  • Vis forfatter(e) (2011). Approximating width parameters of hypergraphs with excluded minors. SIAM Journal on Discrete Mathematics. 1331-1348.
  • Vis forfatter(e) (2011). An exact algorithm for minimum distortion embedding. Theoretical Computer Science. 3530-3536.
  • Vis forfatter(e) (2010). Rank-width and tree-width of H-minor-free graphs. European journal of combinatorics (Print). 1617-1628.
  • Vis forfatter(e) (2010). Pursuing a fast robber on a graph. Theoretical Computer Science. 1167-1181.
  • Vis forfatter(e) (2010). Protrusions in Graphs and Their Applications. Lecture Notes in Computer Science (LNCS). 3-3.
  • Vis forfatter(e) (2010). Parameterized algorithm for eternal vertex cover. Information Processing Letters. 702-706.
  • Vis forfatter(e) (2010). Intractability of clique-width parameterizations. SIAM journal on computing (Print). 1941-1956.
  • Vis forfatter(e) (2010). Faster Parameterized Algorithms for Minor Containment. Lecture Notes in Computer Science (LNCS). 322-333.
  • Vis forfatter(e) (2010). Fast Minor Testing in Planar Graphs. Lecture Notes in Computer Science (LNCS). 97-109.
  • Vis forfatter(e) (2010). Efficient exact algorithms on planar graphs: exploiting sphere cut decompositions. Algorithmica. 790-810.
  • Vis forfatter(e) (2010). Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. Leibniz International Proceedings in Informatics. 251-262.
  • Vis forfatter(e) (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.
  • Vis forfatter(e) (2009). Subexponential Algorithms for Partial Cover Problems. Leibniz International Proceedings in Informatics. 193-201.
  • Vis forfatter(e) (2009). Sort and Search: Exact algorithms for generalized domination. Information Processing Letters. 795-798.
  • Vis forfatter(e) (2009). On two techniques of combining branching and treewidth. Algorithmica. 181-207.
  • Vis forfatter(e) (2009). Mixed search number and linear-width of interval and split graphs. Networks.
  • Vis forfatter(e) (2009). Kernels for Feedback Arc Set In Tournaments. Leibniz International Proceedings in Informatics. 37-47.
  • Vis forfatter(e) (2009). Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. Leibniz International Proceedings in Informatics. 421-432.
  • Vis forfatter(e) (2009). Distortion Is Fixed Parameter Tractable. Lecture Notes in Computer Science (LNCS). 463-474.
  • Vis forfatter(e) (2009). Computing branchwidth via efficient triangulations and blocks. Discrete Applied Mathematics. 2726-2736.
  • Vis forfatter(e) (2009). Approximating Acyclicity Parameters of Sparse Hypergraphs. Leibniz International Proceedings in Informatics. 445-456.
  • Vis forfatter(e) (2009). An Exact Algorithm for Minimum Distortion Embedding. Lecture Notes in Computer Science (LNCS). 112-121.
  • Vis forfatter(e) (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.
  • Vis forfatter(e) (2009). A measure & conquer approach for the analysis of exact algorithms. Journal of the ACM. 32 sider.
  • Vis forfatter(e) (2008). Treewidth Computation and Extremal Combinatorics. Lecture Notes in Computer Science (LNCS). 210-221.
  • Vis forfatter(e) (2008). Spanners in sparse graphs. Lecture Notes in Computer Science (LNCS). 597-608.
  • Vis forfatter(e) (2008). On tractability cops and robbers game. IFIP International Federation for Information Processing. 171-185.
  • Vis forfatter(e) (2008). On the complexity of reconstructing H-free graphs from their Star Systems. Lecture Notes in Computer Science (LNCS). 194-205.
  • Vis forfatter(e) (2008). On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms. Algorithmica. 293-307.
  • Vis forfatter(e) (2008). Iterative Compression and Exact Algorithms. Lecture Notes in Computer Science (LNCS). 335-346.
  • Vis forfatter(e) (2008). Improved algorithms for feedback vertex set problems. Journal of computer and system sciences. 1188-1198.
  • Vis forfatter(e) (2008). How to guard a graph? Lecture Notes in Computer Science (LNCS). 318-239.
  • Vis forfatter(e) (2008). Faster Steiner Tree Computation in Polynomial-Space. Lecture Notes in Computer Science (LNCS). 430-441.
  • Vis forfatter(e) (2008). Exact algorithms for treewidth and minimum fill-in. SIAM journal on computing (Print). 1058-1079.
  • Vis forfatter(e) (2008). Combinatorial Bounds via Measure and Conquer: Bounding Minimal Dominating Sets and Applications. ACM Transactions on Algorithms (TALG). 17 sider.
  • Vis forfatter(e) (2008). An annotated bibliography on guaranteed graph searching. Theoretical Computer Science. 236-245.
  • Vis forfatter(e) (2008). A PTAS for the sparsest spanners problem on apex-minor-free graphs. Lecture Notes in Computer Science (LNCS). 290-298.
  • Vis forfatter(e) (2007). On self duality of pathwidth in polyhedral graph embeddings. Journal of Graph Theory. 42-54.
  • Vis forfatter(e) (2007). Mixed search number and linear-width of interval and split graphs. Lecture Notes in Computer Science (LNCS). 304-315.
  • Vis forfatter(e) (2007). Exact algorithms for graph homomorphisms. Theory of Computing Systems. 381-393.
  • Vis forfatter(e) (2007). Branch and Recharge: Exact Algorithms for Generalized Domination. Lecture Notes in Computer Science (LNCS). 507-518.
  • Vis forfatter(e) (2007). Backbone colorings for graphs: Tree and path backbones. Journal of Graph Theory. 137-152.
  • Vis forfatter(e) (2006). Solving Connected Dominating Set Faster than O(2n). Lecture Notes in Computer Science (LNCS). 152-163.
  • Vis forfatter(e) (2006). Planar graph coloring avoiding monochromatic subgraphs: Trees and paths make it difficult. Algorithmica. 343-361.
  • Vis forfatter(e) (2006). Pathwidth of cubic graphs and exact algorithms. Information Processing Letters. 191-196.
  • Vis forfatter(e) (2006). Optimal linear arrangement of interval graphs. Lecture Notes in Computer Science (LNCS). 267-279.
  • Vis forfatter(e) (2006). On exact algorithms for treewidth. Lecture Notes in Computer Science (LNCS). 672-683.
  • Vis forfatter(e) (2006). New upper bounds on the decomposability of planar graphs. Journal of Graph Theory. 53-81.
  • Vis forfatter(e) (2006). Finding a Minimum Feedback Vertex Set in time O(1.7548n). Lecture Notes in Computer Science (LNCS). 184-191.
  • Vis forfatter(e) (2006). Fast subexponential algorithm for non-local problems on graphs of bounded genus. Lecture Notes in Computer Science (LNCS). 172-183.
  • Vis forfatter(e) (2006). Dominating sets in planar graphs: Branch-width and exponential speed-up. SIAM journal on computing (Print). 281-309.
  • Vis forfatter(e) (2006). Branching and treewidth based exact algorithms. Lecture Notes in Computer Science (LNCS). 16-25.
  • Vis forfatter(e) (2006). A 3-approximation for the pathwidth of Halin graphs. Journal of Discrete Algorithms. 499-510.
  • Vis forfatter(e) (2005). Tree decompositions with small cost. Discrete Applied Mathematics. 143-154.
  • Vis forfatter(e) (2005). Nondeterministic Graph Searching: From Pathwidth to Treewidth. Lecture Notes in Computer Science (LNCS). 364-375.
  • Vis forfatter(e) (2005). Measure and conquer: Domination - A case study. Lecture Notes in Computer Science (LNCS). 191-203.
  • Vis forfatter(e) (2005). Fixed-parameter algorithms for (k,r)-center in planar graphs and map graphs. ACM Transactions on Algorithms (TALG). 33-47.
  • Vis forfatter(e) (2005). Bidimensional parameters and local treewidth. SIAM Journal on Discrete Mathematics. 501-511.
  • Vis forfatter(e) (2004). Radio labeling with preassigned frequencies. SIAM Journal on Optimization. 1-16.
  • Vis forfatter(e) (2004). Parallel knock-out schemes in networks,. Lecture Notes in Computer Science (LNCS). 204-214.
  • Vis forfatter(e) (2004). On distance constrained labeling of disk graphs. Theoretical Computer Science. 261-292.
  • Vis forfatter(e) (2004). Graph searching, elimination trees, and a generalization of bandwidth. Algorithmica. 73-87.
  • Vis forfatter(e) (2004). Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up. Lecture Notes in Computer Science (LNCS). 581-592.
  • Vis forfatter(e) (2004). Exact (exponential) algorithms for treewidth and minimum fill-in. Lecture Notes in Computer Science (LNCS). 568-580.
  • Vis forfatter(e) (2004). Equitable colorings of bounded treewidth graphs. Lecture Notes in Computer Science (LNCS). 180-190.
  • Vis forfatter(e) (2004). Dominating sets and local treewidth. Lecture Notes in Computer Science (LNCS). 221-229.
  • Vis forfatter(e) (2004). Backbone colorings for networks. Lecture Notes in Computer Science (LNCS). 131-142.
  • Vis forfatter(e) (2004). A simple and fast approach for solving problems on planar graphs. Lecture Notes in Computer Science (LNCS). 56-67.
  • Vis forfatter(e) (2003). Interval degree and bandwidth of a graph. Discrete Applied Mathematics. 345-359.
  • Vis forfatter(e) (2002). More About Subcolorings. Computing. 187-203.
  • Vis forfatter(e) (2002). Approximation of pathwidth of outerplanar graphs. Journal of Algorithms. 190-200.
  • Vis forfatter(e) (2002). A generalization of the graph bandwidth. Vestnik St. Petersburg Univ. Math.. 15-19.
Vitenskapelig foredrag
  • Vis forfatter(e) (2008). Catalan structures and dynamic programming in H-minor-free graphs.
  • Vis forfatter(e) (2004). Parallel knock-out schemes in networks.
  • Vis forfatter(e) (2004). Exact (exponential) algorithms for treewidth and minimum fill-in.
  • Vis forfatter(e) (2004). Equitable colorings of bounded treewidth graphs.
  • Vis forfatter(e) (2004). Dominating sets in planar graphs: branch-width and exponential speed-up.
  • Vis forfatter(e) (2004). Bidimensional Parameters and Local Treewidth.
  • Vis forfatter(e) (2004). A Simple and Fast Approach for Solving Problems on Planar Graphs.
  • Vis forfatter(e) (2003). Graph searching, elimination trees, and a generalization of bandwidth.
  • Vis forfatter(e) (2003). Fixed-Parameter Algorithms for the (k, r)-Center in Planar Graphs and Map Graphs.
  • Vis forfatter(e) (2003). Dominating sets and local treewidth.
  • Vis forfatter(e) (2003). Backbone colorings for networks.
  • Vis forfatter(e) (2002). Tree Decompositions with Small Cost.
  • Vis forfatter(e) (2002). Radio Labeling with Pre-assigned Frequencies.
  • Vis forfatter(e) (2001). Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous.
Vitenskapelig antologi/Konferanseserie
  • Vis forfatter(e) (2018). Computer Science - Theory and Applications - 13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6-10, 2018, Proceedings. Springer.
  • Vis forfatter(e) (2012). Algorithm Theory - SWAT 2012 - 13th Scandinavian Symposium and Workshops, Helsinki, Finland, July 4-6, 2012. Proceedings. Springer.
  • Vis forfatter(e) (2009). Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009. Springer.
  • Vis forfatter(e) (2007). Counting Minimum Weighted Dominating Sets. Springer.
  • Vis forfatter(e) (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.
Sammendrag/abstract
  • Vis forfatter(e) (2013). On the Parameterized Complexity of Cutting a Few Vertices from a Graph. Lecture Notes in Computer Science (LNCS). 421-432.
  • Vis forfatter(e) (2013). Long Circuits and Large Euler Subgraphs. Lecture Notes in Computer Science (LNCS). 493-504.
  • Vis forfatter(e) (2008). 08431 Executive Summary -- Moderately Exponential Time Algorithms. Dagstuhl Seminar Proceedings. 3 sider.
Vitenskapelig oversiktsartikkel/review
  • Vis forfatter(e) (2013). Exact exponential algorithms. Communications of the ACM. 80-88.
  • Vis forfatter(e) (2012). Kernelization algorithms (keynote speech). Smart Innovation, Systems and Technologies. 1-7.

Se fullstendig oversikt over publikasjoner i CRIStin.