| Publication | Date of Publication | Type |
|---|
A strategic routing framework and algorithms for computing alternative paths
| 2024-08-13 | Paper |
Data reduction, exact, and heuristic algorithms for clique cover
2006 Proceedings of the Eighth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Multivariate algorithmics for NP-hard string problems
| 2019-07-03 | Paper |
The parameterized complexity of the rainbow subgraph problem
Algorithms | 2019-03-26 | Paper |
Parameterized complexity of team formation in social networks
Theoretical Computer Science | 2018-03-13 | Paper |
Fixed-parameter algorithms for DAG partitioning
Discrete Applied Mathematics | 2017-02-06 | Paper |
Parameterized complexity of team formation in social networks
Algorithmic Aspects in Information and Management | 2016-11-09 | Paper |
Editing graphs into few cliques: complexity, approximation, and kernelization schemes
Lecture Notes in Computer Science | 2015-10-30 | Paper |
The parameterized complexity of the rainbow subgraph problem
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
Approximability and parameterized complexity of multicover by \(c\)-intervals
Information Processing Letters | 2015-06-15 | Paper |
Finding highly connected subgraphs
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Data reduction and exact algorithms for clique cover
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Confluence in data reduction: bridging graph transformation and kernelization
Computability | 2013-10-10 | Paper |
Parameterized complexity of DAG partitioning
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Partitioning into colorful components by minimum edge deletions
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Confluence in data reduction: bridging graph transformation and kernelization
Lecture Notes in Computer Science | 2012-08-14 | Paper |
Balanced interval coloring
| 2012-01-23 | Paper |
Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs
Theory and Practice of Algorithms in (Computer) Systems | 2011-05-12 | Paper |
Separator-based data reduction for signed graph balancing
Journal of Combinatorial Optimization | 2010-12-21 | Paper |
Fixed-parameter algorithms for cluster vertex deletion
Theory of Computing Systems | 2010-08-13 | Paper |
Automated generation of search tree algorithms for graph modification problems
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Fixed-parameter tractability results for feedback set problems in tournaments
Journal of Discrete Algorithms | 2010-02-26 | Paper |
Feedback arc set in bipartite tournaments is NP-complete
Information Processing Letters | 2010-01-29 | Paper |
A faster fixed-parameter approach to drawing binary tanglegrams
Parameterized and Exact Computation | 2010-01-14 | Paper |
Isolation concepts for clique enumeration: comparison and computational experiments
Theoretical Computer Science | 2009-11-25 | Paper |
Isolation concepts for efficiently enumerating dense subgraphs
Theoretical Computer Science | 2009-09-10 | Paper |
Algorithms for compact letter displays: comparison and evaluation
Computational Statistics and Data Analysis | 2009-06-02 | Paper |
Algorithm Engineering for Optimal Graph Bipartization
Journal of Graph Algorithms and Applications | 2009-05-19 | Paper |
Isolation Concepts for Enumerating Dense Subgraphs
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Closest 4-leaf power is fixed-parameter tractable
Discrete Applied Mathematics | 2009-03-04 | Paper |
Algorithms and experiments for parameterized approaches to hard graph problems
| 2009-02-06 | Paper |
Enumerating Isolated Cliques in Synthetic and Financial Networks
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Algorithm engineering for color-coding with applications to signaling pathway detection
Algorithmica | 2008-12-02 | Paper |
Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Improved Algorithms for Bicluster Editing
Lecture Notes in Computer Science | 2008-05-27 | Paper |
Fixed-Parameter Algorithms for Cluster Vertex Deletion
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Optimal Edge Deletions for Signed Graph Balancing
Experimental Algorithms | 2008-01-02 | Paper |
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
European Journal of Operational Research | 2007-11-23 | Paper |
Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
Journal of Computer and System Sciences | 2006-12-07 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Error compensation in leaf power problems
Algorithmica | 2006-08-16 | Paper |
Graph-modeled data clustering: Exact algorithms for clique generation
Theory of Computing Systems | 2006-02-08 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2005-12-22 | Paper |
Experimental and Efficient Algorithms
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Parameterized and Exact Computation
Lecture Notes in Computer Science | 2005-08-23 | Paper |
Automated generation of search tree algorithms for hard graphs modification problems
Algorithmica | 2004-10-01 | Paper |
scientific article; zbMATH DE number 2011849 (Why is no real title available?)
| 2003-12-02 | Paper |
scientific article; zbMATH DE number 1882054 (Why is no real title available?)
| 2003-03-13 | Paper |
