| Publication | Date of Publication | Type |
|---|
A complexity dichotomy for finding disjoint solutions of vertex deletion problems
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Exploiting a hypergraph model for finding Golomb rulers
Acta Informatica | 2014-11-14 | Paper |
The parameterized complexity of unique coverage and its variants
Algorithmica | 2013-08-05 | Paper |
On generating triangle-free graphs
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
Efficient algorithms for Eulerian extension and rural Postman
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Exact combinatorial algorithms and experiments for finding maximum \(k\)-plexes
Journal of Combinatorial Optimization | 2013-01-03 | Paper |
Parameterized computational complexity of finding small-diameter subgraphs
Optimization Letters | 2012-11-07 | Paper |
Exploiting a Hypergraph Model for Finding Golomb Rulers
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion
Algorithmica | 2012-04-26 | Paper |
A generalization of Nemhauser and Trotter's local optimization theorem
| 2012-04-24 | Paper |
A generalization of Nemhauser and Trotter's local optimization theorem
Journal of Computer and System Sciences | 2012-01-11 | Paper |
Efficient algorithms for Eulerian extension
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Measuring indifference: unit interval vertex deletion
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Fixed-parameter algorithms for cluster vertex deletion
Theory of Computing Systems | 2010-08-13 | Paper |
Kernelization through Tidying
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Feedback arc set in bipartite tournaments is NP-complete
Information Processing Letters | 2010-01-29 | Paper |
Isolation concepts for clique enumeration: comparison and computational experiments
Theoretical Computer Science | 2009-11-25 | Paper |
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Isolation concepts for efficiently enumerating dense subgraphs
Theoretical Computer Science | 2009-09-10 | Paper |
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Algorithmics of Large and Complex Networks | 2009-07-09 | Paper |
The parameterized complexity of the induced matching problem
Discrete Applied Mathematics | 2009-06-30 | Paper |
Parameterized complexity of finding regular induced subgraphs
Journal of Discrete Algorithms | 2009-06-24 | Paper |
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Frontiers in Algorithmics | 2009-03-10 | Paper |
Isolation Concepts for Enumerating Dense Subgraphs
Lecture Notes in Computer Science | 2009-03-06 | Paper |
A Problem Kernelization for Graph Packing
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Enumerating Isolated Cliques in Synthetic and Financial Networks
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
The Parameterized Complexity of the Unique Coverage Problem
Algorithms and Computation | 2008-05-27 | Paper |
Fixed-Parameter Algorithms for Cluster Vertex Deletion
Lecture Notes in Computer Science | 2008-04-15 | Paper |
