| Publication | Date of Publication | Type |
|---|
| Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs | 2024-12-03 | Paper |
| On the complexity of computing time series medians under the move-split-merge metric | 2024-12-03 | Paper |
| On the complexity of parameterized local search for the maximum parsimony problem | 2024-10-21 | Paper |
| On critical node problems with vulnerable vertices | 2024-10-08 | Paper |
| The role of twins in computing planar supports of hypergraphs | 2024-10-08 | Paper |
| Finding 3-swap-optimal independent sets and dominating sets is hard | 2024-08-06 | Paper |
| Covering many (or few) edges with \(k\) vertices in sparse graphs | 2024-04-23 | Paper |
| Destroying Multicolored Paths and Cycles in Edge-Colored Graphs | 2024-04-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147537 | 2024-01-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6065417 | 2023-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6059192 | 2023-11-02 | Paper |
| The parameterized complexity of \(s\)-club with triangle and seed constraints | 2023-10-30 | Paper |
| Computing dense and sparse subgraphs of weakly closed graphs | 2023-06-28 | Paper |
| Essentially tight kernels for (weakly) closed graphs | 2023-06-05 | Paper |
| Can local optimality be used for efficient data reduction? | 2023-03-22 | Paper |
| On computing exact means of time series using the move-split-merge metric | 2023-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874445 | 2023-02-07 | Paper |
| Exploiting c-Closure in Kernelization Algorithms for Graph Problems | 2023-02-07 | Paper |
| Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems | 2022-11-15 | Paper |
| Colored cut games | 2022-10-21 | Paper |
| Refined parameterizations for computing colored cuts in edge-colored graphs | 2022-10-04 | Paper |
| Destroying Bicolored $P_3$s by Deleting Few Edges | 2022-09-30 | Paper |
| On critical node problems with vulnerable vertices | 2022-08-30 | Paper |
| The parameterized complexity of \(s\)-club with triangle and seed constraints | 2022-08-30 | Paper |
| Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis | 2022-08-02 | Paper |
| Preventing small \(\mathbf{(s,t)} \)-cuts by protecting edges | 2022-06-08 | Paper |
| Sorting by multi-cut rearrangements | 2022-03-24 | Paper |
| Refined notions of parameterized enumeration kernels with applications to matching cut enumeration | 2021-10-28 | Paper |
| Enumerating connected induced subgraphs: improved delay and experimental comparison | 2021-09-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009615 | 2021-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009482 | 2021-08-04 | Paper |
| Your rugby mates don't need to know your colleagues: triadic closure with edge colors | 2021-06-30 | Paper |
| FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems | 2021-01-27 | Paper |
| The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph | 2020-12-16 | Paper |
| Revisiting the parameterized complexity of maximum-duo preservation string mapping | 2020-11-06 | Paper |
| Enumerating connected induced subgraphs: improved delay and experimental comparison | 2020-10-22 | Paper |
| Graph Motif Problems Parameterized by Dual | 2020-09-04 | Paper |
| Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs | 2020-07-20 | Paper |
| Parameterized algorithms for module map problems | 2020-06-29 | Paper |
| Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms | 2020-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111890 | 2020-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110875 | 2020-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110893 | 2020-05-25 | Paper |
| Destroying bicolored \(P_3\)s by deleting few edges | 2020-05-12 | Paper |
| Solving Partition Problems Almost Always Requires Pushing Many Vertices Around | 2020-03-11 | Paper |
| On the relation of strong triadic closure and cluster deletion | 2020-02-28 | Paper |
| Your rugby mates don't need to know your colleagues: triadic closure with edge colors | 2020-02-06 | Paper |
| Tight Running Time Lower Bounds for Vertex Deletion Problems | 2019-12-06 | Paper |
| Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems | 2019-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4967170 | 2019-07-03 | Paper |
| Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable | 2019-06-20 | Paper |
| When can graph hyperbolicity be computed in linear time? | 2019-05-07 | Paper |
| The parameterized complexity of the rainbow subgraph problem | 2019-03-26 | Paper |
| Multivariate algorithmics for finding cohesive subnetworks | 2019-03-26 | Paper |
| Finding supported paths in heterogeneous networks | 2019-03-26 | Paper |
| Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments | 2019-02-11 | Paper |
| On the relation of strong triadic closure and cluster deletion | 2018-11-22 | Paper |
| Parameterized algorithms for module map problems | 2018-08-17 | Paper |
| Parameterizing edge modification problems above lower bounds | 2018-06-01 | Paper |
| Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width | 2018-02-13 | Paper |
| Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs | 2017-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5369516 | 2017-10-17 | Paper |
| Graph Motif Problems Parameterized by Dual | 2017-10-17 | Paper |
| Parameterized Complexity of Critical Node Cuts | 2017-09-29 | Paper |
| When can graph hyperbolicity be computed in linear time? | 2017-09-22 | Paper |
| Assessing the Computational Complexity of Multi-layer Subgraph Detection | 2017-07-21 | Paper |
| Parameterized complexity of critical node cuts | 2017-03-16 | Paper |
| Twins in Subdivision Drawings of Hypergraphs | 2017-02-21 | Paper |
| \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments | 2016-10-21 | Paper |
| Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics | 2016-10-21 | Paper |
| Parameterizing edge modification problems above lower bounds | 2016-07-25 | Paper |
| (Prefix) reversal distance for (signed) strings with few blocks or small alphabets | 2016-07-15 | Paper |
| Polynomial-Time Data Reduction for the Subset Interconnection Design Problem | 2015-11-27 | Paper |
| On the Sound Covering Cycle Problem in Paired de Bruijn Graphs | 2015-11-12 | 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 |
| An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems | 2015-07-24 | Paper |
| Well-Formed Separator Sequences, with an Application to Hypergraph Drawing | 2015-07-08 | Paper |
| A parameterized approximation algorithm for the mixed and windy Capacitated Arc Routing Problem: theory and experiments | 2015-06-18 | Paper |
| Towards an algorithmic guide to Spiral Galaxies | 2015-05-26 | Paper |
| On structural parameterizations for the 2-club problem | 2015-04-28 | Paper |
| Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs | 2015-04-22 | Paper |
| Finding Highly Connected Subgraphs | 2015-02-20 | Paper |
| On explaining integer vectors by few homogeneous segments | 2015-02-20 | Paper |
| On structural parameterizations for the 2-club problem | 2014-11-04 | Paper |
| Reversal Distances for Strings with Few Blocks or Small Alphabets | 2014-06-30 | Paper |
| On the parameterized complexity of consensus clustering | 2014-06-23 | Paper |
| A cubic-vertex kernel for flip consensus tree | 2014-03-25 | Paper |
| Local search for string problems: brute-force is essentially optimal | 2014-03-13 | Paper |
| Effective and Efficient Data Reduction for the Subset Interconnection Design Problem | 2014-01-14 | Paper |
| On Explaining Integer Vectors by Few Homogenous Segments | 2013-08-12 | Paper |
| On generating triangle-free graphs | 2013-07-04 | Paper |
| Local Search for String Problems: Brute Force Is Essentially Optimal | 2013-06-14 | Paper |
| Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs | 2013-01-07 | Paper |
| Finding Dense Subgraphs of Sparse Graphs | 2013-01-07 | Paper |
| Parameterized computational complexity of finding small-diameter subgraphs | 2012-11-07 | Paper |
| Cluster editing with locally bounded modifications | 2012-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3165966 | 2012-10-19 | Paper |
| Graph-based data clustering with overlaps | 2012-10-16 | Paper |
| New Races in Parameterized Algorithmics | 2012-09-25 | Paper |
| Partitioning into Colorful Components by Minimum Edge Deletions | 2012-08-14 | Paper |
| An analytical approach to network motif detection in samples of networks with pairwise different vertex labels | 2012-06-19 | Paper |
| On making directed graphs transitive | 2012-05-11 | Paper |
| On the Parameterized Complexity of Consensus Clustering | 2011-12-16 | Paper |
| Editing graphs into disjoint unions of dense clusters | 2011-12-14 | Paper |
| A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing | 2011-07-18 | Paper |
| Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring | 2011-05-03 | Paper |
| Average parameterization and partial kernelization for computing medians | 2011-04-28 | Paper |
| Alternative Parameterizations for Cluster Editing | 2011-02-15 | Paper |
| Measuring Indifference: Unit Interval Vertex Deletion | 2010-11-16 | Paper |
| Fixed-parameter algorithms for cluster vertex deletion | 2010-08-13 | Paper |
| Average Parameterization and Partial Kernelization for Computing Medians | 2010-04-27 | Paper |
| Editing Graphs into Disjoint Unions of Dense Clusters | 2009-12-17 | Paper |
| Isolation concepts for clique enumeration: comparison and computational experiments | 2009-11-25 | Paper |
| On Making Directed Graphs Transitive | 2009-10-20 | Paper |
| Isolation concepts for efficiently enumerating dense subgraphs | 2009-09-10 | Paper |
| Graph-Based Data Clustering with Overlaps | 2009-07-23 | Paper |
| Deconstructing Intractability: A Case Study for Interval Constrained Coloring | 2009-07-07 | Paper |
| A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing | 2009-07-02 | Paper |
| Isolation Concepts for Enumerating Dense Subgraphs | 2009-03-06 | Paper |
| Enumerating Isolated Cliques in Synthetic and Financial Networks | 2009-01-27 | Paper |
| Parameterized Algorithms and Hardness Results for Some Graph Motif Problems | 2008-06-17 | Paper |
| Improved Algorithms for Bicluster Editing | 2008-05-27 | Paper |
| Fixed-Parameter Algorithms for Cluster Vertex Deletion | 2008-04-15 | Paper |
