Home
Saket Saurabh's picture

Saket Saurabh

Professor
  • E-mailSaket.Saurabh@uib.no
  • Visitor Address
    HIB - Thormøhlensgt. 55
  • Postal Address
    Postboks 7803
    5020 Bergen
Academic article
  • 2019. Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems. ACM Transactions on Algorithms (TALG). 44 pages.
  • 2019. Stability in barter exchange markets. Autonomous Agents and Multi-Agent Systems. 518-539.
  • 2019. Solving GROUP INTERVAL SCHEDULING efficiently. Lecture Notes in Computer Science (LNCS). 97-107.
  • 2019. Rank vertex cover as a natural problem for algebraic compression. SIAM Journal on Discrete Mathematics. 1277-1296.
  • 2019. Quadratic Vertex Kernel for Rainbow Matching. Algorithmica. 881-897.
  • 2019. Path Contraction Faster Than 2n. Leibniz International Proceedings in Informatics. 11:1-11:13.
  • 2019. Parameterized streaming algorithms for min-ones d-SAT. Leibniz International Proceedings in Informatics. 8:1-8:20.
  • 2019. Parameterized complexity of conflict-free matchings and paths. Leibniz International Proceedings in Informatics. 35:1-35:15.
  • 2019. Parameterized complexity classification of deletion to list matrix-partition for low-order matrices. Leibniz International Proceedings in Informatics. 41:1-41:14.
  • 2019. Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree. SIAM Journal on Discrete Mathematics. 327-345.
  • 2019. Parameterized Complexity of Geometric Covering Problems Having Conflicts. Algorithmica. 1-19.
  • 2019. Packing cycles faster than Erdos-Posa. SIAM Journal on Discrete Mathematics. 1194-1215.
  • 2019. Packing arc-disjoint cycles in tournaments. Leibniz International Proceedings in Informatics. 27:1-27:14.
  • 2019. On the parameterized complexity of edge-linked paths. Lecture Notes in Computer Science (LNCS). 286-298.
  • 2019. On succinct encodings for the tournament fixing problem. IJCAI International Joint Conference on Artificial Intelligence. 322-328.
  • 2019. Minimum Bisection Is Fixed-Parameter Tractable. SIAM journal on computing (Print). 417-450.
  • 2019. Going Far From Degeneracy. Leibniz International Proceedings in Informatics. 47:1-47:14.
  • 2019. Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree. Theory of Computing Systems. 62-100.
  • 2019. Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs. Discrete & Computational Geometry. 879-911.
  • 2019. Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. ACM Transactions on Algorithms (TALG).
  • 2019. Exact algorithms via monotone local search. Journal of the ACM. 8:1-8:23.
  • 2019. Editing to connected F-degree graph. SIAM Journal on Discrete Mathematics. 795-836.
  • 2019. Connecting the Dots (with Minimum Crossings). Leibniz International Proceedings in Informatics. 7:1-7:17.
  • 2019. Communication complexity and graph families. ACM Transactions on Computation Theory. 28 pages.
  • 2019. Balanced judicious bipartition is fixed-parameter tractable. SIAM Journal on Discrete Mathematics. 1878-1911.
  • 2019. Balanced Stable Marriage: How Close Is Close Enough? Lecture Notes in Computer Science (LNCS). 423-437.
  • 2019. An Erdős–Pósa Theorem on Neighborhoods and Domination Number. Lecture Notes in Computer Science (LNCS). 437-444.
  • 2018. When rigging a tournament, let greediness blind you. IJCAI International Joint Conference on Artificial Intelligence. 275-281.
  • 2018. The parameterized complexity of cycle packing: Indifference is not an issue. Lecture Notes in Computer Science (LNCS). 712-726.
  • 2018. Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number. Leibniz International Proceedings in Informatics. 1-19.
  • 2018. Slightly superexponential parameterized problems. SIAM journal on computing (Print). 675-702.
  • 2018. Simultaneous feedback vertex set: A parameterized perspective. ACM Transactions on Computation Theory.
  • 2018. Reducing CMSO model checking to highly connected graphs. Leibniz International Proceedings in Informatics. 135:1-135:14.
  • 2018. Reconfiguration on sparse graphs. Journal of computer and system sciences (Print). 122-131.
  • 2018. Quasipolynomial representation of transversal matroids with applications in parameterized complexity. Leibniz International Proceedings in Informatics. 1-13.
  • 2018. Preface to Special Issue Dedicated to the 60th Birthday of Gregory Gutin. Algorithmica. 2513-2515.
  • 2018. Polylogarithmic approximation algorithms for weighted-F-Deletion problems. Leibniz International Proceedings in Informatics. 1:1-1:15.
  • 2018. Parameterized algorithms for stable matching with ties and incomplete lists. Theoretical Computer Science. 1-10.
  • 2018. Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs. Algorithmica. 1-21.
  • 2018. Parameterized Algorithms for List K-Cycle. Algorithmica. 1267-1287.
  • 2018. Parameterized Algorithms and Kernels for Rainbow Matching. Algorithmica. 15 pages.
  • 2018. Parameterised Algorithms for Deletion to Classes of DAGs. Theory of Computing Systems. 1880-1909.
  • 2018. On the optimality of pseudo-polynomial algorithms for integer programming. Leibniz International Proceedings in Informatics. 31:1-31:13.
  • 2018. On the kernelization complexity of string problems. Theoretical Computer Science. 21-31.
  • 2018. On the Parameterized Complexity of Contraction to generalization of trees. Leibniz International Proceedings in Informatics. 1:1-1:12.
  • 2018. On the Parameterized Complexity of Contraction to Generalization of Trees. Theory of Computing Systems. 1-28.
  • 2018. Max-cut above spanning tree is fixed-parameter tractable. Lecture Notes in Computer Science (LNCS). 244-256.
  • 2018. Matrix rigidity from the viewpoint of parameterized complexity . SIAM Journal on Discrete Mathematics. 966-985.
  • 2018. Long directed (s,t)-path: FPT algorithm. Information Processing Letters. 8-12.
  • 2018. Linear time parameterized algorithms for subset feedback vertex set. ACM Transactions on Algorithms (TALG). 37 pages.
  • 2018. Known algorithms on graphs of bounded treewidth are probably optimal. ACM Transactions on Algorithms (TALG). 1-30.
  • 2018. Kernels for deletion to classes of acyclic digraphs. Journal of computer and system sciences (Print). 9-21.
  • 2018. Kernels for (Connected) dominating set on graphs with excluded topological minors. ACM Transactions on Algorithms (TALG).
  • 2018. Generalized pseudoforest deletion: Algorithms and uniform kernel. SIAM Journal on Discrete Mathematics. 882-901.
  • 2018. Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. ACM Transactions on Algorithms (TALG).
  • 2018. Finding even subgraphs even faster. Journal of computer and system sciences (Print). 1-13.
  • 2018. Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion. ACM Transactions on Algorithms (TALG). 28 pages.
  • 2018. Excluded grid minors and efficient polynomial-time approximation schemes. Journal of the ACM. 1-44.
  • 2018. Exact and fixed parameter tractable algorithms for max-conflict-free coloring in hypergraphs . SIAM Journal on Discrete Mathematics. 1189-1208.
  • 2018. Exact algorithms for terrain guarding. ACM Transactions on Algorithms (TALG). 20 pages.
  • 2018. Erdos-Posa property of obstructions to interval graphs. Leibniz International Proceedings in Informatics. 1-15.
  • 2018. Covering Vectors by Spaces: Regular Matroids. SIAM Journal on Discrete Mathematics. 2512-2565.
  • 2018. Conflict Free Feedback Vertex Set: A Parameterized Dichotomy. Leibniz International Proceedings in Informatics. 53:1-53:15.
  • 2018. Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring. ACM Transactions on Algorithms (TALG). 27 pages.
  • 2018. Bivariate complexity analysis of ALMOST FOREST DELETION. Theoretical Computer Science. 18-33.
  • 2018. Below all subsets for minimal connected dominating set. SIAM Journal on Discrete Mathematics. 2332-2345.
  • 2018. Balanced judicious bipartition is fixed-paramater tractable. Leibniz International Proceedings in Informatics. 40:1-40:15.
  • 2018. Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces. Leibniz International Proceedings in Informatics. 21:1-21:14.
  • 2018. A polynomial sized kernel for tracking paths problem. Lecture Notes in Computer Science (LNCS). 94-107.
  • 2018. (k,n−k) -max-cut: an O∗(2p)-time algorithm and a polynomial kernel. Algorithmica. 1-17.
  • 2017. Uniform kernelization complexity of hitting forbidden minors. ACM Transactions on Algorithms (TALG). 1-35.
  • 2017. Split contraction: The untold story. Leibniz International Proceedings in Informatics. 1-14.
  • 2017. Representative families of product families. ACM Transactions on Algorithms (TALG). 1-29.
  • 2017. Rank Reduction of Oriented Graphs by Vertex and Edge Deletions. Algorithmica. 1-20.
  • 2017. Quick but Odd Growth of Cacti. Algorithmica. 271-290.
  • 2017. Paths to trees and cacti. Lecture Notes in Computer Science (LNCS). 31-42.
  • 2017. Parameterized complexity of strip packing and minimum volume packing. Theoretical Computer Science. 56-64.
  • 2017. Parameterized complexity of geometric covering problems having conflicts. Lecture Notes in Computer Science (LNCS). 61-72.
  • 2017. Parameterized complexity of directed Steiner tree on sparse graphs. SIAM Journal on Discrete Mathematics. 1294-1327.
  • 2017. Parameterized and exact algorithms for class domination coloring. Lecture Notes in Computer Science (LNCS). 336-349.
  • 2017. Parameterized algorithms and kernels for rainbow matching. Leibniz International Proceedings in Informatics. 1-13.
  • 2017. Packing cycles faster than Erdös-Pósa. Leibniz International Proceedings in Informatics. 1-15.
  • 2017. On the parameterized complexity of b-CHROMATIC NUMBER. Journal of computer and system sciences (Print). 120-131.
  • 2017. Matrix rigidity from the viewpoint of parameterized complexity. Leibniz International Proceedings in Informatics.
  • 2017. Lossy kernelization. Proceedings of the Annual ACM Symposium on Theory of Computing. 224-237.
  • 2017. Linear-time parameterized algorithms via skew-symmetric multicuts. ACM Transactions on Algorithms (TALG).
  • 2017. Linear representation of transversal matroids and gammoids parameterized by rank. Lecture Notes in Computer Science (LNCS). 420-432.
  • 2017. Irrelevant vertices for the planar Disjoint Paths Problem. Journal of combinatorial theory. Series B (Print). 815-843.
  • 2017. Improved algorithms and combinatorial bounds for independent Feedback Vertex Set. Leibniz International Proceedings in Informatics. 1-14.
  • 2017. Group activity selection on graphs: Parameterized analysis. Lecture Notes in Computer Science (LNCS). 106-118.
  • 2017. Fixed-parameter tractable canonization and isomorphism test for graphs of bounded treewidth. SIAM journal on computing (Print). 161-189.
  • 2017. Finding, hitting and packing cycles in subexponential time on unit disk graphs. Leibniz International Proceedings in Informatics. 1-15.
  • 2017. Faster exact algorithms for some terminal set problems. Journal of computer and system sciences (Print). 195-207.
  • 2017. Fast exact algorithms for survivable network design with uniform requirements. Lecture Notes in Computer Science (LNCS). 25-36.
  • 2017. Exact algorithms for terrain guarding. Leibniz International Proceedings in Informatics. 111-1115.
  • 2017. Covering vectors by spaces: Regular matroids. Leibniz International Proceedings in Informatics. 1-15.
  • 2017. Communication complexity of pairs of graph families with applications. Leibniz International Proceedings in Informatics. 1-13.
  • 2017. A linear-Time parameterized algorithm for node unique label cover. Leibniz International Proceedings in Informatics.
  • 2016. Tree deletion set has a polynomial kernel (but No OPTο(1) Approximation). SIAM Journal on Discrete Mathematics. 1371-1384.
  • 2016. Subexponential algorithms for rectilinear Steiner tree and arborescence problems. Leibniz International Proceedings in Informatics. 39.1-39.15.
  • 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.
  • 2016. Simultaneous feedback edge set: A parameterized perspective. Leibniz International Proceedings in Informatics. 5.1-5.13.
  • 2016. SIMULTANEOUS Feedback Vertex set: A parameterized perspective. Leibniz International Proceedings in Informatics. 7:1-7:15.
  • 2016. Reducing rank of the adjacency matrix by graph modification. Theoretical Computer Science. 70-79.
  • 2016. Rank reduction of directed graphs by vertex and edge deletions. Lecture Notes in Computer Science (LNCS). 619-633.
  • 2016. Parameterized complexity of red blue set cover for lines. Lecture Notes in Computer Science (LNCS). 96-109.
  • 2016. Parameterized algorithms on perfect graphs for deletion to (r,l)-Graphs. Leibniz International Proceedings in Informatics. 1-13.
  • 2016. Parameterized Complexity of Superstring Problems. Algorithmica. 1-16.
  • 2016. On problems as hard as CNF-SAT. ACM Transactions on Algorithms (TALG).
  • 2016. Lower bounds for approximation schemes for closest string. Leibniz International Proceedings in Informatics. 12.1-12.10.
  • 2016. Kernelization of cycle packing with relaxed disjointness constraints. Leibniz International Proceedings in Informatics. 1-14.
  • 2016. Kernelization and sparseness: The case of dominating set. Leibniz International Proceedings in Informatics. 14 pages.
  • 2016. Hitting forbidden minors: Approximation and kernelization. SIAM Journal on Discrete Mathematics. 383-410.
  • 2016. Exact algorithms via monotone local search. Proceedings of the Annual ACM Symposium on Theory of Computing. 764-775.
  • 2016. Efficient computation of representative families with applications in parameterized and exact algorithms. Journal of the ACM.
  • 2016. Editing to connected f-degree graph. Leibniz International Proceedings in Informatics. 1-15.
  • 2016. A parameterized algorithm for mixed-cut. Lecture Notes in Computer Science (LNCS). 672-685.
  • 2016. A faster FPT algorithm and a smaller kernel for block graph vertex deletion. Lecture Notes in Computer Science (LNCS). 1-13.
  • 2016. (k,n−k) -Max-Cut: An O∗(2p) - time algorithm and a polynomial kernel. Lecture Notes in Computer Science (LNCS). 686-699.
  • 2016. (Meta) Kernelization. Journal of the ACM.
  • 2015. Uniform kernelization complexity of hitting forbidden minors. Lecture Notes in Computer Science (LNCS). 629-641.
  • 2015. Reducing rank of the adjacency matrix by graph modification. Lecture Notes in Computer Science (LNCS). 361-373.
  • 2015. Reconfiguration on sparse graphs. Lecture Notes in Computer Science (LNCS). 506-517.
  • 2015. Quick but odd growth of cacti. Leibniz International Proceedings in Informatics. 258-269.
  • 2015. Parameterized single-exponential time polynomial space algorithm for steiner tree. Lecture Notes in Computer Science (LNCS). 494-505.
  • 2015. Parameterized complexity of superstring problems. Lecture Notes in Computer Science (LNCS). 89-99.
  • 2015. On the parameterized complexity of vertex cover and edge cover with connectivity constraints. Theoretical Computer Science. 1-15.
  • 2015. On the parameterized complexity of GIRTH and CONNECTIVITY problems on linear matroids. Lecture Notes in Computer Science (LNCS). 566-577.
  • 2015. Linear time parameterized algorithms for subset feedback vertex set. Lecture Notes in Computer Science (LNCS). 935-946.
  • 2015. Graph modification problems: A modern perspective. Lecture Notes in Computer Science (LNCS). 3-6.
  • 2015. Finding even subgraphs even faster. Leibniz International Proceedings in Informatics. 434-447.
  • 2015. Deterministic truncation of linear matroids. Lecture Notes in Computer Science (LNCS). 922-934.
  • 2015. B-chromatic number: Beyond NP-hardness. Leibniz International Proceedings in Informatics. 389-401.
  • 2014. Tree deletion set has a polynomial kernel (but no OPTO(1) approximation). Leibniz International Proceedings in Informatics. 85-96.
  • 2014. Solving Multicut faster than 2n. Lecture Notes in Computer Science (LNCS). 666-676.
  • 2014. Social choice meets graph drawing: How to get subexponential time algorithms for ranking and drawing problems. Tsinghua Science and Technology. 374-386.
  • 2014. Representative sets of product families. Lecture Notes in Computer Science (LNCS). 443-454.
  • 2014. Parameterized algorithms to preserve connectivity. Lecture Notes in Computer Science (LNCS). 800-811.
  • 2014. On cutwidth parameterized by vertex cover. Algorithmica. 940-953.
  • 2014. Kernelization lower bounds through colors and IDs. ACM Transactions on Algorithms (TALG).
  • 2014. Faster parameterized algorithms using linear programming. ACM Transactions on Algorithms (TALG).
  • 2014. Connecting vertices by independent trees. Leibniz International Proceedings in Informatics. 73-84.
  • 2014. Almost optimal lower bounds for problems parameterized by clique-width. SIAM journal on computing (Print). 1541-1563.
  • 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.
  • 2013. Imbalance is fixed parameter tractable. Information Processing Letters.
  • 2013. Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization. Information and Computation. 109-116.
  • 2013. Computing optimal Steiner trees in polynomial space. Algorithmica. 584-604.
  • 2013. Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs. Information and Computation. 60-70.
  • 2013. A polynomial kernel for proper interval vertex deletion. SIAM Journal on Discrete Mathematics. 1964-1976.
  • 2013. A linear vertex kernel for maximum internal spanning tree. Journal of computer and system sciences (Print). 1-6.
  • 2012. Sharp separation and applications to exact and parameterized algorithms. Algorithmica. 692-706.
  • 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.
  • 2012. Kernel(s) for Problems with no Kernel: On Out-Trees with Many Leaves. ACM Transactions on Algorithms (TALG). 19 pages.
  • 2012. Counting subgraphs via homomorphisms. SIAM Journal on Discrete Mathematics. 695-717.
  • 2011. Subexponential algorithms for partial cover problems. Information Processing Letters. 814-818.
  • 2011. Strengthening Erdos-Posa Property for Minor-Closed Graph Classes. Journal of Graph Theory. 235-240.
  • 2011. On the directed Full Degree Spanning Tree problem. Discrete Optimization. 97-109.
  • 2011. On the complexity of some colorful problems parameterized by treewidth. Information and Computation. 143-153.
  • 2011. Kernels for feedback arc set in tournaments. Journal of computer and system sciences (Print). 1071-1078.
  • 2011. Implicit branching and parameterized partial cover problems. Journal of computer and system sciences (Print). 1159-1171.
  • 2011. Bandwidth on AT-free graphs. Theoretical Computer Science. 7001-7008.
  • 2011. An exact algorithm for minimum distortion embedding. Theoretical Computer Science. 3530-3536.
  • 2011. A linear kernel for a planar connected dominating set. Theoretical Computer Science. 2536-2543.
  • 2010. Iterative compression and exact algorithms. Theoretical Computer Science. 1045-1053.
  • 2010. Intractability of clique-width parameterizations. SIAM journal on computing (Print). 1941-1956.
  • 2010. Imbalance is fixed parameter tractable. Lecture Notes in Computer Science (LNCS). 199-208.
  • 2010. Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing. Lecture Notes in Computer Science (LNCS). 334-345.
  • 2010. Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. Journal of computer and system sciences (Print). 650-662.
  • 2009. The complexity ecology of parameters: An illustration using bounded max leaf number. Theory of Computing Systems. 822-848.
  • 2009. The Budgeted Unique Coverage Problem and Color-Coding. Lecture Notes in Computer Science (LNCS). 310-321.
  • 2009. Subexponential Algorithms for Partial Cover Problems. Leibniz International Proceedings in Informatics. 193-201.
  • 2009. Simpler Parameterized Algorithm for OCT. Lecture Notes in Computer Science (LNCS). 380-384.
  • 2009. On two techniques of combining branching and treewidth. Algorithmica. 181-207.
  • 2009. On the Directed Degree-Preserving Spanning Tree Problem. Lecture Notes in Computer Science (LNCS). 276-287.
  • 2009. Linear Kernel for Planar Connected Dominating Set. Lecture Notes in Computer Science (LNCS). 281-290.
  • 2009. Kernels for Feedback Arc Set In Tournaments. Leibniz International Proceedings in Informatics. 37-47.
  • 2009. Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves. Leibniz International Proceedings in Informatics. 421-432.
  • 2009. Incompressibility through Colors and IDs. Lecture Notes in Computer Science (LNCS). 378-389.
  • 2009. Fast FAST. Lecture Notes in Computer Science (LNCS). 49-58.
  • 2009. Even Faster Algorithm for Set Splitting! Lecture Notes in Computer Science (LNCS). 288-299.
  • 2009. Distortion Is Fixed Parameter Tractable. Lecture Notes in Computer Science (LNCS). 463-474.
  • 2009. Counting Subgraphs via Homomorphisms. Lecture Notes in Computer Science (LNCS). 71-82.
  • 2009. Bandwidth on AT-Free Graphs. Lecture Notes in Computer Science (LNCS). 573-582.
  • 2009. An Exact Algorithm for Minimum Distortion Embedding. Lecture Notes in Computer Science (LNCS). 112-121.
  • 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.
  • 2009. A Linear Vertex Kernel for Maximum Internal Spanning Tree. Lecture Notes in Computer Science (LNCS). 275-282.
  • 2008. Spanning directed trees with many leaves. SIAM Journal on Discrete Mathematics. 466-476.
  • 2008. Short Cycles Make W -hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles. Algorithmica. 203-225.
  • 2008. Parameterized Complexity of the Smallest Degree-Constrained Subgraph Problem. Lecture Notes in Computer Science (LNCS). 13-29.
  • 2008. Parameterized Algorithms for Generalized Domination. Lecture Notes in Computer Science (LNCS). 116-126.
  • 2008. König Deletion Sets and Vertex Covers above the Matching Size. Lecture Notes in Computer Science (LNCS). 836-847.
  • 2008. Iterative Compression and Exact Algorithms. Lecture Notes in Computer Science (LNCS). 335-346.
  • 2008. Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract). Dagstuhl Seminar Proceedings. 12 pages.
  • 2008. Graph Layout problems Parameterized by Vertex Cover. Lecture Notes in Computer Science (LNCS). 294-305.
  • 2008. Degree-Constrained Subgraph Problems: Hardness and Approximation Results. Lecture Notes in Computer Science (LNCS). 29-42.
  • 2008. Capacitated Domination and Covering: A Parameterized Perspective. Lecture Notes in Computer Science (LNCS). 78-90.
  • 2008. A Moderately Exponential Time Algorithm for Full Degree Spanning Tree. Lecture Notes in Computer Science (LNCS). 479-489.
  • 2007. Parameterized Algorithms for Directed Maximum Leaf Problems. Lecture Notes in Computer Science (LNCS). 352-362.
  • 2007. Improved Exact Algorithms for Counting 3- and 4-Colorings. Lecture Notes in Computer Science (LNCS). 65-74.
  • 2007. Better Algorithms and Bounds for Directed Maximum Leaf Problems. Lecture Notes in Computer Science (LNCS). 316-327.

More information in national current research information system (CRIStin)