| 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 | 2019-09-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967170 | 2019-07-03 | Paper |
| The parameterized complexity of the rainbow subgraph problem | 2019-03-26 | Paper |
| Parameterized complexity of team formation in social networks | 2018-03-13 | Paper |
| Fixed-parameter algorithms for DAG partitioning | 2017-02-06 | Paper |
| Parameterized Complexity of Team Formation in Social Networks | 2016-11-09 | Paper |
| Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes | 2015-10-30 | Paper |
| The Parameterized Complexity of the Rainbow Subgraph Problem | 2015-09-09 | Paper |
| Approximability and parameterized complexity of multicover by \(c\)-intervals | 2015-06-15 | Paper |
| Finding Highly Connected Subgraphs | 2015-02-20 | Paper |
| Data reduction and exact algorithms for clique cover | 2014-04-01 | Paper |
| Confluence in data reduction: bridging graph transformation and kernelization | 2013-10-10 | Paper |
| Parameterized Complexity of DAG Partitioning | 2013-06-07 | Paper |
| Partitioning into Colorful Components by Minimum Edge Deletions | 2012-08-14 | Paper |
| Confluence in Data Reduction: Bridging Graph Transformation and Kernelization | 2012-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3113717 | 2012-01-23 | Paper |
| Exploiting Bounded Signal Flow for Graph Orientation Based on Cause–Effect Pairs | 2011-05-12 | Paper |
| Separator-based data reduction for signed graph balancing | 2010-12-21 | Paper |
| Fixed-parameter algorithms for cluster vertex deletion | 2010-08-13 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Fixed-parameter tractability results for feedback set problems in tournaments | 2010-02-26 | Paper |
| Feedback arc set in bipartite tournaments is NP-complete | 2010-01-29 | Paper |
| A Faster Fixed-Parameter Approach to Drawing Binary Tanglegrams | 2010-01-14 | Paper |
| Isolation concepts for clique enumeration: comparison and computational experiments | 2009-11-25 | Paper |
| Isolation concepts for efficiently enumerating dense subgraphs | 2009-09-10 | Paper |
| Algorithms for compact letter displays: comparison and evaluation | 2009-06-02 | Paper |
| Algorithm Engineering for Optimal Graph Bipartization | 2009-05-19 | Paper |
| Isolation Concepts for Enumerating Dense Subgraphs | 2009-03-06 | Paper |
| Closest 4-leaf power is fixed-parameter tractable | 2009-03-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3600916 | 2009-02-06 | Paper |
| Enumerating Isolated Cliques in Synthetic and Financial Networks | 2009-01-27 | Paper |
| Algorithm engineering for color-coding with applications to signaling pathway detection | 2008-12-02 | Paper |
| Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems | 2008-05-27 | Paper |
| Improved Algorithms for Bicluster Editing | 2008-05-27 | Paper |
| Fixed-Parameter Algorithms for Cluster Vertex Deletion | 2008-04-15 | Paper |
| Optimal Edge Deletions for Signed Graph Balancing | 2008-01-02 | Paper |
| Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs | 2007-11-23 | Paper |
| Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments | 2007-05-02 | Paper |
| Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization | 2006-12-07 | Paper |
| SOFSEM 2006: Theory and Practice of Computer Science | 2006-11-14 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Algorithms and Data Structures | 2006-10-25 | Paper |
| Error compensation in leaf power problems | 2006-08-16 | Paper |
| Graph-modeled data clustering: Exact algorithms for clique generation | 2006-02-08 | Paper |
| Algorithms and Computation | 2005-12-22 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| Parameterized and Exact Computation | 2005-08-23 | Paper |
| Automated generation of search tree algorithms for hard graphs modification problems | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437501 | 2003-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4797430 | 2003-03-13 | Paper |
