| Publication | Date of Publication | Type |
|---|
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Fast Algorithms for Join Operations on Tree Decompositions
Treewidth, Kernels, and Algorithms | 2022-10-19 | Paper |
| A generic convolution algorithm for join operations on tree decompositions | 2022-03-21 | Paper |
| Algorithms and complexity results for the capacitated vertex cover problem | 2020-10-22 | Paper |
| Cut and count and representative sets on branch decompositions | 2018-04-10 | Paper |
Exact algorithms for intervalizing coloured graphs
Theory of Computing Systems | 2016-03-09 | Paper |
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science | 2014-07-30 | Paper |
Inclusion/exclusion meets measure and conquer
Algorithmica | 2014-07-03 | Paper |
Partition into triangles on bounded degree graphs
Theory of Computing Systems | 2013-08-01 | Paper |
Exact algorithms for edge domination
Algorithmica | 2013-04-03 | Paper |
| Design by measure and conquer. A faster exact algorithm for dominating set | 2013-03-19 | Paper |
Exact algorithms for dominating set
Discrete Applied Mathematics | 2012-04-30 | Paper |
Fast algorithms for max independent set
Algorithmica | 2012-04-26 | Paper |
On partitioning a graph into two connected subgraphs
Theoretical Computer Science | 2011-12-07 | Paper |
Exact algorithms for intervalizing colored graphs
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Partition into triangles on bounded degree graphs
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
Parameterized and Exact Computation | 2010-12-07 | Paper |
Computing role assignments of chordal graphs
Theoretical Computer Science | 2010-10-11 | Paper |
Faster algorithms on branch and clique decompositions
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
A bottom-up method and fast algorithms for Max Independent Set
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Maximum Independent Set in graphs of average degree at most three in \({\mathcal O}(1.08537^n)\)
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Polynomial space algorithms for counting dominating sets and the domatic number
Lecture Notes in Computer Science | 2010-05-28 | Paper |
On partitioning a graph into two connected subgraphs
Algorithms and Computation | 2009-12-17 | Paper |
Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Inclusion/Exclusion Meets Measure and Conquer
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Computing Role Assignments of Chordal Graphs
Fundamentals of Computation Theory | 2009-10-20 | Paper |
Exact Algorithms for Edge Domination
Parameterized and Exact Computation | 2008-06-05 | Paper |
