Hjem
  • E-postFedor.Fomin@uib.no
  • Telefon+47 55 58 40 24
  • Besøksadresse
    HIB - Thormøhlens gate 55
  • Postadresse
    Postboks 7803
    5020 Bergen

Theoretical Computer Science, Algorithms

Vitenskapelig artikkel
  • Vis forfatter(e) 2019. Spanning circuits in regular matroids. ACM Transactions on Algorithms (TALG).
  • Vis forfatter(e) 2019. Path Contraction Faster Than 2n. Leibniz International Proceedings in Informatics. 11:1-11:13.
  • Vis forfatter(e) 2019. Parameterized k-Clustering: Tractability Island. Leibniz International Proceedings in Informatics. 14:1-14:15.
  • Vis forfatter(e) 2019. Modification to planarity is fixed parameter tractable. Leibniz International Proceedings in Informatics. 28:1-28:17.
  • Vis forfatter(e) 2019. Kernelization of graph hamiltonicity: Proper H-graphs. Lecture Notes in Computer Science (LNCS). 296-310.
  • Vis forfatter(e) 2019. Going Far From Degeneracy. Leibniz International Proceedings in Informatics. 47:1-47:14.
  • Vis forfatter(e) 2019. Decomposition of map graphs with applications. Leibniz International Proceedings in Informatics. 60:1-60:15.
  • Vis forfatter(e) 2019. Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. Leibniz International Proceedings in Informatics. 59:1-59:13.
  • Vis forfatter(e) 2019. Approximation Schemes for Low-rank Binary Matrix Approximation Problems. ACM Transactions on Algorithms (TALG). 12:1-12:39.
  • Vis forfatter(e) 2018. Subexponential parameterized algorithm for interval completion. ACM Transactions on Algorithms (TALG). 62 sider.
  • Vis forfatter(e) 2018. Structured connectivity augmentation. SIAM Journal on Discrete Mathematics. 2612-2635.
  • Vis forfatter(e) 2018. Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin. Algorithmica. 2513-2515.
  • Vis forfatter(e) 2018. Partial Complementation of Graphs. Leibniz International Proceedings in Informatics. 21:1-21:13.
  • 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. On the optimality of pseudo-polynomial algorithms for integer programming. Leibniz International Proceedings in Informatics. 31:1-31:13.
  • Vis forfatter(e) 2018. Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. ACM Transactions on Algorithms (TALG).
  • Vis forfatter(e) 2018. Excluded grid minors and efficient polynomial-time approximation schemes. Journal of the ACM. 1-44.
  • Vis forfatter(e) 2018. Exact algorithms for terrain guarding. ACM Transactions on Algorithms (TALG). 20 sider.
  • Vis forfatter(e) 2018. Covering Vectors by Spaces: Regular Matroids. SIAM Journal on Discrete Mathematics. 2512-2565.
  • Vis forfatter(e) 2018. Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. ACM Transactions on Algorithms (TALG). 27 sider.
  • Vis forfatter(e) 2018. Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. Leibniz International Proceedings in Informatics. 21:1-21: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. Structured Connectivity Augmentation. Leibniz International Proceedings in Informatics.
  • Vis forfatter(e) 2017. Spanning Circuits in Regular Matroids. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 1433-1441.
  • 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. 1-14.
  • 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. 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. 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) 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. 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. Connecting vertices by independent trees. Leibniz International Proceedings in Informatics. 73-84.
  • 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) 2013. A linear vertex kernel for maximum internal spanning tree. Journal of computer and system sciences. 1-6.
  • 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. 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. Minimizing Rosenthal potential in multicast games. Lecture Notes in Computer Science (LNCS).
  • 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. Faster algorithms for finding and counting subgraphs. Journal of computer and system sciences. 698-706.
  • Vis forfatter(e) 2012. Fast minor testing in planar graphs. Algorithmica. 69-84.
  • 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) 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. 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. Branch and Recharge: Exact Algorithms for Generalized Domination. Algorithmica. 252-273.
  • Vis forfatter(e) 2011. Approximation of minimum weight spanners for sparse graphs. Theoretical Computer Science. 846-852.
  • Vis forfatter(e) 2011. Approximating width parameters of hypergraphs with excluded minors. SIAM Journal on Discrete Mathematics. 1331-1348.
  • Vis forfatter(e) 2010. Protrusions in Graphs and Their Applications. Lecture Notes in Computer Science (LNCS). 3-3.
  • Vis forfatter(e) 2010. Kernelization. Lecture Notes in Computer Science (LNCS). 107-108.
  • Vis forfatter(e) 2010. Finding Induced Subgraphs via Minimal Triangulations. Leibniz International Proceedings in Informatics. 383-394.
  • Vis forfatter(e) 2010. Faster Parameterized Algorithms for Minor Containment. Lecture Notes in Computer Science (LNCS). 322-333.
  • Vis forfatter(e) 2010. Fast exact algorithms for Hamiltonicity in claw-free graphs. Lecture Notes in Computer Science (LNCS). 44-53.
  • Vis forfatter(e) 2010. Fast Minor Testing in Planar Graphs. Lecture Notes in Computer Science (LNCS). 97-109.
  • Vis forfatter(e) 2010. Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs. Leibniz International Proceedings in Informatics. 251-262.
  • Vis forfatter(e) 2009. Subexponential Algorithms for Partial Cover Problems. Leibniz International Proceedings in Informatics. 193-201.
  • 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. Contraction Bidimensionality: The Accurate Picture. Lecture Notes in Computer Science (LNCS). 706-717.
  • 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) 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. Iterative Compression and Exact Algorithms. Lecture Notes in Computer Science (LNCS). 335-346.
  • Vis forfatter(e) 2008. Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). Dagstuhl Seminar Proceedings. 12 sider.
  • 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. A PTAS for the sparsest spanners problem on apex-minor-free graphs. Lecture Notes in Computer Science (LNCS). 290-298.
  • Vis forfatter(e) 2007. Subexponential Parameterized Algorithms. Lecture Notes in Computer Science (LNCS). 15-27.
  • Vis forfatter(e) 2007. Parameterized Algorithms for Directed Maximum Leaf Problems. Lecture Notes in Computer Science (LNCS). 352-362.
  • 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. Improved Exact Algorithms for Counting 3- and 4-Colorings. Lecture Notes in Computer Science (LNCS). 65-74.
  • Vis forfatter(e) 2007. Improved Algorithms for the Feedback Vertex Set Problems. Lecture Notes in Computer Science (LNCS). 422-433.
  • Vis forfatter(e) 2007. Branch and Recharge: Exact Algorithms for Generalized Domination. Lecture Notes in Computer Science (LNCS). 507-518.
  • Vis forfatter(e) 2007. Better Algorithms and Bounds for Directed Maximum Leaf Problems. Lecture Notes in Computer Science (LNCS). 316-327.
  • Vis forfatter(e) 2006. Solving Connected Dominating Set Faster than O(2n). Lecture Notes in Computer Science (LNCS). 152-163.
  • Vis forfatter(e) 2006. On exact algorithms for treewidth. Lecture Notes in Computer Science (LNCS). 672-683.
  • 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. 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. Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. Journal of the ACM. 866-893.
  • Vis forfatter(e) 2005. Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the European Association for Theoretical Computer Science. 47-77.
  • 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. Exact algorithms for graph homomorphisms. Lecture Notes in Computer Science (LNCS). 161-171.
  • Vis forfatter(e) 2005. Efficient exact algorithms on planar graphs: Exploiting sphere cut branch decompositions. Lecture Notes in Computer Science (LNCS). 95-106.
  • Vis forfatter(e) 2005. Computing branchwidth via efficient triangulations and blocks. Lecture Notes in Computer Science (LNCS). 374-384.
  • Vis forfatter(e) 2005. Bounding the number of minimal dominating sets: A measure and conquer approach. Lecture Notes in Computer Science (LNCS). 573-582.
  • Vis forfatter(e) 2005. Bidimensional parameters and local treewidth. SIAM Journal on Discrete Mathematics. 501-511.
  • Vis forfatter(e) 2004. The complexity of approximating the oriented diameter of chordal graphs. Journal of Graph Theory. 255-269.
  • Vis forfatter(e) 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.
  • Vis forfatter(e) 2004. Searching expenditure and interval graphs. Discrete Applied Mathematics. 97-104.
  • 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. On distance constrained labeling of disk graphs. Theoretical Computer Science. 261-292.
  • 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. Exact (exponential) algorithms for the dominating set problem. Lecture Notes in Computer Science (LNCS). 245-256.
  • 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. Bidimensional parameters and local treewidth. Lecture Notes in Computer Science (LNCS). 109-118.
  • Vis forfatter(e) 2004. Backbone colorings for networks. Lecture Notes in Computer Science (LNCS). 131-142.
  • Vis forfatter(e) 2004. Algorithms for graphs with small octopus. Discrete Applied Mathematics. 105-128.
  • Vis forfatter(e) 2004. AT-free graphs: linear bounds for the oriented diameter. Discrete Applied Mathematics. 135-148.
  • 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. Pathwidth of planar and line graphs. Graphs and Combinatorics. 91-99.
  • Vis forfatter(e) 2003. On the domination search numbe. Discrete Applied Mathematics. 565-580.
  • Vis forfatter(e) 2003. On the Monotonicity of Games Generated by Symmetric Submodular Functions. Discrete Applied Mathematics. 323-335.
  • 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.