Hjem
Saket Saurabhs bilde

Saket Saurabh

Professor
  • E-postsaket.saurabh@uib.no
  • Besøksadresse
    HIB - Thormøhlens gate 55
    5006 Bergen
  • Postadresse
    Postboks 7803
    5020 Bergen
Vitenskapelig artikkel
  • Vis forfatter(e) (2021). Strong Connectivity Augmentation is FPT. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 219-234.
  • Vis forfatter(e) (2021). Simultaneous Feedback Edge Set: A Parameterized Perspective. Algorithmica. 753-774.
  • Vis forfatter(e) (2021). Paths to trees and cacti. Theoretical Computer Science. 98-116.
  • Vis forfatter(e) (2021). Parameterized complexity of fair feedback vertex set problem. Theoretical Computer Science. 1-12.
  • Vis forfatter(e) (2021). Parameterized and exact algorithms for class domination coloring. Discrete Applied Mathematics. 286-299.
  • Vis forfatter(e) (2021). Parameterized Complexity of Directed Spanner Problems. Algorithmica. 17 sider.
  • Vis forfatter(e) (2021). On the Parameterized Approximability of Contraction to Classes of Chordal Graphs. ACM Transactions on Computation Theory. 1-40.
  • Vis forfatter(e) (2021). FPT-approximation for FPT Problems. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 199-218.
  • Vis forfatter(e) (2021). Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version). Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 179-198.
  • Vis forfatter(e) (2021). ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. Leibniz International Proceedings in Informatics. 21:1-21:16.
  • Vis forfatter(e) (2021). Diverse Collections in Matroids and Graphs. Leibniz International Proceedings in Informatics. 31:1-31:14.
  • Vis forfatter(e) (2021). Balanced stable marriage: How close is close enough? Theoretical Computer Science. 19-43.
  • Vis forfatter(e) (2021). Approximation in (Poly-) Logarithmic Space. Algorithmica. 2303-2331.
  • Vis forfatter(e) (2021). A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 822-839.
  • Vis forfatter(e) (2021). 2-Approximating Feedback Vertex Set in Tournaments. ACM Transactions on Algorithms (TALG). 11:1-11:14.
  • Vis forfatter(e) (2020). The Parameterized Complexity of Guarding Almost Convex Polygons. Leibniz International Proceedings in Informatics. 3:1-3:16.
  • Vis forfatter(e) (2020). Subexponential algorithm for d-cluster edge deletion: Exception or rule? Journal of computer and system sciences. 150-162.
  • Vis forfatter(e) (2020). Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems. ACM Transactions on Algorithms (TALG). 37 sider.
  • Vis forfatter(e) (2020). Quick separation in chordal and split graphs. Leibniz International Proceedings in Informatics. 70:1-70:14.
  • Vis forfatter(e) (2020). Polylogarithmic Approximation Algorithms for Weighted-F-deletion Problems. ACM Transactions on Algorithms (TALG). 1-38.
  • Vis forfatter(e) (2020). Path contraction faster than $2^n$. SIAM Journal on Discrete Mathematics. 1302-1325.
  • Vis forfatter(e) (2020). Parameterized complexity of fair feedback vertex set problem. Lecture Notes in Computer Science (LNCS). 250-262.
  • Vis forfatter(e) (2020). Parameterized Complexity of Maximum Edge Colorable Subgraph. Lecture Notes in Computer Science (LNCS). 615-626.
  • Vis forfatter(e) (2020). Parameterized Complexity of Directed Spanner Problems. Leibniz International Proceedings in Informatics. 12:1-12:11.
  • Vis forfatter(e) (2020). Parameterized Complexity of Conflict-Free Matchings and Paths. Algorithmica. 1939-1965.
  • Vis forfatter(e) (2020). Parameterized Complexity and Approximability of Directed Odd Cycle Transversal. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 20 sider.
  • Vis forfatter(e) (2020). Parameterization Above a Multiplicative Guarantee . Leibniz International Proceedings in Informatics. 39:1-39:13.
  • Vis forfatter(e) (2020). On the parameterized complexity of deletion to H-free strong components. Leibniz International Proceedings in Informatics. 75:1-75:13.
  • Vis forfatter(e) (2020). On the parameterized approximability of contraction to classes of chordal graphs. Leibniz International Proceedings in Informatics.
  • Vis forfatter(e) (2020). On the Complexity of Singly Connected Vertex Deletion. Lecture Notes in Computer Science (LNCS). 237-250.
  • Vis forfatter(e) (2020). Linear representation of transversal matroids and gammoids parameterized by rank. Theoretical Computer Science. 51-59.
  • Vis forfatter(e) (2020). Kernelization of arc disjoint cycle packing in α-Bounded Digraphs. Lecture Notes in Computer Science (LNCS). 367-378.
  • Vis forfatter(e) (2020). Hitting Topological Minors Is FPT. Proceedings of the Annual ACM Symposium on Theory of Computing. 1317-1326.
  • Vis forfatter(e) (2020). Graph Hamiltonicity Parameterized by Proper Interval Deletion Set. Lecture Notes in Computer Science (LNCS). 104-115.
  • Vis forfatter(e) (2020). Going Far from Degeneracy. SIAM Journal on Discrete Mathematics. 1578-1601.
  • Vis forfatter(e) (2020). Gehrlein stability in committee selection: parameterized hardness and algorithms. Autonomous Agents and Multi-Agent Systems. 21 sider.
  • Vis forfatter(e) (2020). Fixed-parameter tractable algorithms for Tracking Shortest Paths. Theoretical Computer Science. 1-13.
  • Vis forfatter(e) (2020). Fault tolerant subgraphs with applications in kernelization. Leibniz International Proceedings in Informatics. 47:1-47:22.
  • Vis forfatter(e) (2020). Faster Graph bipartization. Journal of computer and system sciences. 45-55.
  • Vis forfatter(e) (2020). ETH-tight algorithms for long path and cycle on unit disk graphs. Leibniz International Proceedings in Informatics. 44:1-44:18.
  • Vis forfatter(e) (2020). Bidimensionality and Kernels. SIAM journal on computing (Print). 1397-1422.
  • Vis forfatter(e) (2020). Approximation in (poly-) logarithmic space. Leibniz International Proceedings in Informatics. 16:1-16:15.
  • Vis forfatter(e) (2020). Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 2299-2318.
  • Vis forfatter(e) (2020). A characterization of König-Egerváry graphs with extendable vertex covers. Information Processing Letters. 10 sider.
  • Vis forfatter(e) (2020). A Polynomial Kernel for Paw-Free Editing. Leibniz International Proceedings in Informatics. 10:1-10:15.
  • Vis forfatter(e) (2020). A (2 + ε)-Factor Approximation Algorithm for Split Vertex Deletion. Leibniz International Proceedings in Informatics. 80:1-80:16.
  • Vis forfatter(e) (2020). 2-Approximating Feedback Vertex Set in Tournaments. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 1010-1018.
  • Vis forfatter(e) (2019). Stability in barter exchange markets. Autonomous Agents and Multi-Agent Systems. 518-539.
  • Vis forfatter(e) (2019). Split contraction: The untold story. ACM Transactions on Computation Theory.
  • Vis forfatter(e) (2019). Popular matching in roommates setting is NP-hard. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 2810-2822.
  • Vis forfatter(e) (2019). Parameterized complexity of multi-node hubs. Leibniz International Proceedings in Informatics.
  • Vis forfatter(e) (2019). On the parameterized complexity of edge-linked paths. Lecture Notes in Computer Science (LNCS). 286-298.
  • Vis forfatter(e) (2019). On the complexity of mixed dominating SET. Lecture Notes in Computer Science (LNCS). 262-274.
  • Vis forfatter(e) (2019). On succinct encodings for the tournament fixing problem. IJCAI International Joint Conference on Artificial Intelligence. 322-328.
  • Vis forfatter(e) (2019). Interval vertex deletion admits a polynomial kernel. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms.
  • Vis forfatter(e) (2019). Going Far From Degeneracy. Leibniz International Proceedings in Informatics. 47:1-47:14.
  • Vis forfatter(e) (2019). Gehrlein stability in committee selection: Parameterized hardness and algorithms. Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS. 511-519.
  • Vis forfatter(e) (2019). Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree. Theory of Computing Systems. 62-100.
  • Vis forfatter(e) (2019). Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. ACM Transactions on Algorithms (TALG).
  • Vis forfatter(e) (2019). Exploring the kernelization borders for hitting cycles. Leibniz International Proceedings in Informatics.
  • Vis forfatter(e) (2019). Contraction decomposition in unit disk graphs and algorithmic applications in parameterized complexity. Proceedings of the annual ACM-SIAM Symposium on Discrete Algorithms. 1035-1054.
  • Vis forfatter(e) (2019). Balanced judicious bipartition is fixed-parameter tractable. SIAM Journal on Discrete Mathematics. 1878-1911.
  • Vis forfatter(e) (2019). Balanced Stable Marriage: How Close Is Close Enough? Lecture Notes in Computer Science (LNCS). 423-437.
  • Vis forfatter(e) (2019). A strongly-uniform slicewise polynomial-time algorithm for the embedded planar diameter improvement problem. Leibniz International Proceedings in Informatics.
  • Vis forfatter(e) (2018). Parameterized algorithms for stable matching with ties and incomplete lists. Theoretical Computer Science. 1-10.
  • Vis forfatter(e) (2018). Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Algorithmica. 1-21.
  • Vis forfatter(e) (2018). Finding even subgraphs even faster. Journal of computer and system sciences. 1-13.
  • 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). Balanced judicious bipartition is fixed-paramater tractable. Leibniz International Proceedings in Informatics. 40:1-40:15.
  • Vis forfatter(e) (2018). A polynomial sized kernel for tracking paths problem. Lecture Notes in Computer Science (LNCS). 94-107.
  • Vis forfatter(e) (2017). Uniform kernelization complexity of hitting forbidden minors. ACM Transactions on Algorithms (TALG). 1-35.
  • Vis forfatter(e) (2017). Split contraction: The untold story. Leibniz International Proceedings in Informatics. 1-14.
  • Vis forfatter(e) (2017). Representative families of product families. ACM Transactions on Algorithms (TALG). 1-29.
  • Vis forfatter(e) (2017). Rank Reduction of Oriented Graphs by Vertex and Edge Deletions. Algorithmica. 1-20.
  • Vis forfatter(e) (2017). Quick but Odd Growth of Cacti. Algorithmica. 271-290.
  • Vis forfatter(e) (2017). Paths to trees and cacti. Lecture Notes in Computer Science (LNCS). 31-42.
  • Vis forfatter(e) (2017). Parameterized complexity of strip packing and minimum volume packing. Theoretical Computer Science. 56-64.
  • Vis forfatter(e) (2017). Parameterized complexity of geometric covering problems having conflicts. Lecture Notes in Computer Science (LNCS). 61-72.
  • Vis forfatter(e) (2017). Parameterized complexity of directed Steiner tree on sparse graphs. SIAM Journal on Discrete Mathematics. 1294-1327.
  • Vis forfatter(e) (2017). Parameterized and exact algorithms for class domination coloring. Lecture Notes in Computer Science (LNCS). 336-349.
  • Vis forfatter(e) (2017). Parameterized algorithms and kernels for rainbow matching. Leibniz International Proceedings in Informatics. 1-13.
  • Vis forfatter(e) (2017). Packing cycles faster than Erdös-Pósa. Leibniz International Proceedings in Informatics. 1-15.
  • Vis forfatter(e) (2017). On the parameterized complexity of b-CHROMATIC NUMBER. Journal of computer and system sciences. 120-131.
  • Vis forfatter(e) (2017). Matrix rigidity from the viewpoint of parameterized complexity. Leibniz International Proceedings in Informatics.
  • Vis forfatter(e) (2017). Lossy kernelization. Proceedings of the Annual ACM Symposium on Theory of Computing. 224-237.
  • Vis forfatter(e) (2017). Linear-time parameterized algorithms via skew-symmetric multicuts. ACM Transactions on Algorithms (TALG).
  • Vis forfatter(e) (2017). Linear representation of transversal matroids and gammoids parameterized by rank. Lecture Notes in Computer Science (LNCS). 420-432.
  • Vis forfatter(e) (2017). Irrelevant vertices for the planar Disjoint Paths Problem. Journal of combinatorial theory. Series B (Print). 815-843.
  • Vis forfatter(e) (2017). Improved algorithms and combinatorial bounds for independent Feedback Vertex Set. Leibniz International Proceedings in Informatics. 1-14.
  • Vis forfatter(e) (2017). Group activity selection on graphs: Parameterized analysis. Lecture Notes in Computer Science (LNCS). 106-118.
  • Vis forfatter(e) (2017). Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. SIAM journal on computing (Print). 161-189.
  • 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). Faster exact algorithms for some terminal set problems. Journal of computer and system sciences. 195-207.
  • Vis forfatter(e) (2017). Fast exact algorithms for survivable network design with uniform requirements. Lecture Notes in Computer Science (LNCS). 25-36.
  • 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). A linear-Time parameterized algorithm for node unique label cover. Leibniz International Proceedings in Informatics.
  • Vis forfatter(e) (2016). Tree deletion set has a polynomial kernel (but No OPTο(1) Approximation). SIAM Journal on Discrete Mathematics. 1371-1384.
  • 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). Simultaneous feedback edge set: A parameterized perspective. Leibniz International Proceedings in Informatics. 5.1-5.13.
  • Vis forfatter(e) (2016). SIMULTANEOUS Feedback Vertex set: A parameterized perspective. Leibniz International Proceedings in Informatics. 7:1-7:15.
  • Vis forfatter(e) (2016). Rank reduction of directed graphs by vertex and edge deletions. Lecture Notes in Computer Science (LNCS). 619-633.
  • Vis forfatter(e) (2016). Parameterized complexity of red blue set cover for lines. Lecture Notes in Computer Science (LNCS). 96-109.
  • Vis forfatter(e) (2016). Parameterized algorithms on perfect graphs for deletion to (r,l)-Graphs. Leibniz International Proceedings in Informatics. 1-13.
  • Vis forfatter(e) (2016). Parameterized Complexity of Superstring Problems. Algorithmica. 1-16.
  • Vis forfatter(e) (2016). On problems as hard as CNF-SAT. ACM Transactions on Algorithms (TALG).
  • Vis forfatter(e) (2016). Lower bounds for approximation schemes for closest string. Leibniz International Proceedings in Informatics. 12.1-12.10.
  • Vis forfatter(e) (2016). Kernelization of cycle packing with relaxed disjointness constraints. Leibniz International Proceedings in Informatics. 1-14.
  • Vis forfatter(e) (2016). Kernelization and sparseness: The case of dominating set. Leibniz International Proceedings in Informatics. 14 sider.
  • 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 parameterized algorithm for mixed-cut. Lecture Notes in Computer Science (LNCS). 672-685.
  • Vis forfatter(e) (2016). A faster FPT algorithm and a smaller kernel for block graph vertex deletion. Lecture Notes in Computer Science (LNCS). 1-13.
  • Vis forfatter(e) (2016). (k,n−k) -Max-Cut: An O∗(2p) - time algorithm and a polynomial kernel. Lecture Notes in Computer Science (LNCS). 686-699.
  • Vis forfatter(e) (2016). (Meta) Kernelization. Journal of the ACM.
  • Vis forfatter(e) (2015). Uniform kernelization complexity of hitting forbidden minors. Lecture Notes in Computer Science (LNCS). 629-641.
  • Vis forfatter(e) (2015). Reducing rank of the adjacency matrix by graph modification. Lecture Notes in Computer Science (LNCS). 361-373.
  • Vis forfatter(e) (2015). Reconfiguration on sparse graphs. Lecture Notes in Computer Science (LNCS). 506-517.
  • Vis forfatter(e) (2015). Quick but odd growth of cacti. Leibniz International Proceedings in Informatics. 258-269.
  • 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). On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Theoretical Computer Science. 1-15.
  • Vis forfatter(e) (2015). On the parameterized complexity of GIRTH and CONNECTIVITY problems on linear matroids. Lecture Notes in Computer Science (LNCS). 566-577.
  • Vis forfatter(e) (2015). Linear time parameterized algorithms for subset feedback vertex set. Lecture Notes in Computer Science (LNCS). 935-946.
  • Vis forfatter(e) (2015). Graph modification problems: A modern perspective. Lecture Notes in Computer Science (LNCS). 3-6.
  • Vis forfatter(e) (2015). Finding even subgraphs even faster. Leibniz International Proceedings in Informatics. 434-447.
  • Vis forfatter(e) (2015). Deterministic truncation of linear matroids. Lecture Notes in Computer Science (LNCS). 922-934.
  • Vis forfatter(e) (2015). B-chromatic number: Beyond NP-hardness. Leibniz International Proceedings in Informatics. 389-401.
  • Vis forfatter(e) (2014). Tree deletion set has a polynomial kernel (but no OPTO(1) approximation). Leibniz International Proceedings in Informatics. 85-96.
  • Vis forfatter(e) (2014). Solving Multicut faster than 2n. Lecture Notes in Computer Science (LNCS). 666-676.
  • 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). Representative sets of product families. Lecture Notes in Computer Science (LNCS). 443-454.
  • Vis forfatter(e) (2014). Parameterized algorithms to preserve connectivity. Lecture Notes in Computer Science (LNCS). 800-811.
  • Vis forfatter(e) (2014). On cutwidth parameterized by vertex cover. Algorithmica. 940-953.
  • Vis forfatter(e) (2014). Kernelization lower bounds through colors and IDs. ACM Transactions on Algorithms (TALG).
  • Vis forfatter(e) (2014). Faster parameterized algorithms using linear programming. ACM Transactions on Algorithms (TALG).
  • 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) (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). Imbalance is fixed parameter tractable. Information Processing Letters.
  • Vis forfatter(e) (2013). Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. Information and Computation. 109-116.
  • Vis forfatter(e) (2013). Computing optimal Steiner trees in polynomial space. Algorithmica. 584-604.
  • Vis forfatter(e) (2013). Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Information and Computation. 60-70.
  • 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). Sharp separation and applications to exact and parameterized algorithms. Algorithmica. 692-706.
  • 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). On Cutwidth Parameterized by Vertex Cover. Algorithmica.
  • 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). Counting subgraphs via homomorphisms. SIAM Journal on Discrete Mathematics. 695-717.
  • 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). On the directed Full Degree Spanning Tree problem. Discrete Optimization. 97-109.
  • Vis forfatter(e) (2011). On the complexity of some colorful problems parameterized by treewidth. Information and Computation. 143-153.
  • 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). Bandwidth on AT-free graphs. Theoretical Computer Science. 7001-7008.
  • Vis forfatter(e) (2011). An exact algorithm for minimum distortion embedding. Theoretical Computer Science. 3530-3536.
  • Vis forfatter(e) (2011). A linear kernel for a planar connected dominating set. Theoretical Computer Science. 2536-2543.
  • Vis forfatter(e) (2010). Iterative compression and exact algorithms. Theoretical Computer Science. 1045-1053.
  • Vis forfatter(e) (2010). Intractability of clique-width parameterizations. SIAM journal on computing (Print). 1941-1956.
  • Vis forfatter(e) (2010). Imbalance is fixed parameter tractable. Lecture Notes in Computer Science (LNCS). 199-208.
  • Vis forfatter(e) (2010). Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. Lecture Notes in Computer Science (LNCS). 334-345.
  • 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). The complexity ecology of parameters: An illustration using bounded max leaf number. Theory of Computing Systems. 822-848.
  • Vis forfatter(e) (2009). The Budgeted Unique Coverage Problem and Color-Coding. Lecture Notes in Computer Science (LNCS). 310-321.
  • Vis forfatter(e) (2009). Subexponential Algorithms for Partial Cover Problems. Leibniz International Proceedings in Informatics. 193-201.
  • Vis forfatter(e) (2009). Simpler Parameterized Algorithm for OCT. Lecture Notes in Computer Science (LNCS). 380-384.
  • Vis forfatter(e) (2009). On two techniques of combining branching and treewidth. Algorithmica. 181-207.
  • Vis forfatter(e) (2009). On the Directed Degree-Preserving Spanning Tree Problem. Lecture Notes in Computer Science (LNCS). 276-287.
  • Vis forfatter(e) (2009). Linear Kernel for Planar Connected Dominating Set. Lecture Notes in Computer Science (LNCS). 281-290.
  • 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). Incompressibility through Colors and IDs. Lecture Notes in Computer Science (LNCS). 378-389.
  • Vis forfatter(e) (2009). Fast FAST. Lecture Notes in Computer Science (LNCS). 49-58.
  • Vis forfatter(e) (2009). Even Faster Algorithm for Set Splitting! Lecture Notes in Computer Science (LNCS). 288-299.
  • Vis forfatter(e) (2009). Distortion Is Fixed Parameter Tractable. Lecture Notes in Computer Science (LNCS). 463-474.
  • Vis forfatter(e) (2009). Counting Subgraphs via Homomorphisms. Lecture Notes in Computer Science (LNCS). 71-82.
  • Vis forfatter(e) (2009). Bandwidth on AT-Free Graphs. Lecture Notes in Computer Science (LNCS). 573-582.
  • 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 Linear Vertex Kernel for Maximum Internal Spanning Tree. Lecture Notes in Computer Science (LNCS). 275-282.
  • Vis forfatter(e) (2008). Spanning directed trees with many leaves. SIAM Journal on Discrete Mathematics. 466-476.
  • Vis forfatter(e) (2008). Short Cycles Make W -hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles. Algorithmica. 203-225.
  • Vis forfatter(e) (2008). Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. Lecture Notes in Computer Science (LNCS). 13-29.
  • Vis forfatter(e) (2008). Parameterized Algorithms for Generalized Domination. Lecture Notes in Computer Science (LNCS). 116-126.
  • Vis forfatter(e) (2008). König Deletion Sets and Vertex Covers above the Matching Size. Lecture Notes in Computer Science (LNCS). 836-847.
  • 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). Graph Layout problems Parameterized by Vertex Cover. Lecture Notes in Computer Science (LNCS). 294-305.
  • Vis forfatter(e) (2008). Degree-Constrained Subgraph Problems: Hardness and Approximation Results. Lecture Notes in Computer Science (LNCS). 29-42.
  • Vis forfatter(e) (2008). Capacitated Domination and Covering: A Parameterized Perspective. Lecture Notes in Computer Science (LNCS). 78-90.
  • Vis forfatter(e) (2008). A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. Lecture Notes in Computer Science (LNCS). 479-489.
  • Vis forfatter(e) (2007). Parameterized Algorithms for Directed Maximum Leaf Problems. Lecture Notes in Computer Science (LNCS). 352-362.
  • 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). Better Algorithms and Bounds for Directed Maximum Leaf Problems. Lecture Notes in Computer Science (LNCS). 316-327.

Se fullstendig oversikt over publikasjoner i CRIStin.