| Publication | Date of Publication | Type |
|---|
Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs
Journal of Combinatorial Optimization | 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
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
The role of twins in computing planar supports of hypergraphs
Journal of Graph Algorithms and Applications | 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
Discrete Mathematics & Theoretical Computer Science | 2024-04-18 | Paper |
Essentially tight kernels for (weakly) closed graphs
| 2024-01-15 | Paper |
scientific article; zbMATH DE number 7765378 (Why is no real title available?)
| 2023-11-14 | Paper |
scientific article; zbMATH DE number 7759294 (Why is no real title available?)
| 2023-11-02 | Paper |
The parameterized complexity of \(s\)-club with triangle and seed constraints
Theory of Computing Systems | 2023-10-30 | Paper |
Computing dense and sparse subgraphs of weakly closed graphs
Algorithmica | 2023-06-28 | Paper |
Essentially tight kernels for (weakly) closed graphs
Algorithmica | 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
Data Mining and Knowledge Discovery | 2023-02-28 | Paper |
scientific article; zbMATH DE number 7651108 (Why is no real title available?)
| 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
SIAM Journal on Discrete Mathematics | 2022-11-15 | Paper |
Colored cut games
Theoretical Computer Science | 2022-10-21 | Paper |
Refined parameterizations for computing colored cuts in edge-colored graphs
Theory of Computing Systems | 2022-10-04 | Paper |
Destroying Bicolored $P_3$s by Deleting Few Edges
Discrete Mathematics & Theoretical Computer Science | 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
Journal of Artificial Intelligence Research | 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
Journal of Computer and System Sciences | 2021-10-28 | Paper |
Enumerating connected induced subgraphs: improved delay and experimental comparison
Discrete Applied Mathematics | 2021-09-15 | Paper |
scientific article; zbMATH DE number 7378721 (Why is no real title available?)
| 2021-08-04 | Paper |
scientific article; zbMATH DE number 7378605 (Why is no real title available?)
| 2021-08-04 | Paper |
Your rugby mates don't need to know your colleagues: triadic closure with edge colors
Journal of Computer and System Sciences | 2021-06-30 | Paper |
FixCon: A Generic Solver for Fixed-Cardinality Subgraph Problems
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
On the maximum colorful arborescence problem and color hierarchy graph structure
| 2020-12-16 | Paper |
Revisiting the parameterized complexity of maximum-duo preservation string mapping
Theoretical Computer Science | 2020-11-06 | Paper |
Enumerating connected induced subgraphs: improved delay and experimental comparison
SOFSEM 2019: Theory and Practice of Computer Science | 2020-10-22 | Paper |
Graph motif problems parameterized by dual
Journal of Graph Algorithms and Applications | 2020-09-04 | Paper |
Refined parameterizations for computing colored cuts in edge-colored graphs
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms
Discrete Applied Mathematics | 2020-06-29 | Paper |
Parameterized algorithms for module map problems
Discrete Applied Mathematics | 2020-06-29 | Paper |
The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
| 2020-05-27 | Paper |
scientific article; zbMATH DE number 7203332 (Why is no real title available?)
| 2020-05-25 | Paper |
Revisiting the parameterized complexity of maximum-duo preservation string mapping
| 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
SIAM Journal on Discrete Mathematics | 2020-03-11 | Paper |
On the relation of strong triadic closure and cluster deletion
Algorithmica | 2020-02-28 | Paper |
Your rugby mates don't need to know your colleagues: triadic closure with edge colors
Lecture Notes in Computer Science | 2020-02-06 | Paper |
Tight running time lower bounds for vertex deletion problems
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems
| 2019-10-24 | Paper |
Multivariate algorithmics for NP-hard string problems
| 2019-07-03 | Paper |
Minimum Common String Partition Parameterized by Partition Size Is Fixed-Parameter Tractable
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
When can graph hyperbolicity be computed in linear time?
Algorithmica | 2019-05-07 | Paper |
The parameterized complexity of the rainbow subgraph problem
Algorithms | 2019-03-26 | Paper |
Multivariate algorithmics for finding cohesive subnetworks
Algorithms | 2019-03-26 | Paper |
Finding supported paths in heterogeneous networks
Algorithms | 2019-03-26 | Paper |
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments
European Journal of Operational Research | 2019-02-11 | Paper |
On the relation of strong triadic closure and cluster deletion
Lecture Notes in Computer Science | 2018-11-22 | Paper |
Parameterized algorithms for module map problems
Lecture Notes in Computer Science | 2018-08-17 | Paper |
Parameterizing edge modification problems above lower bounds
Theory of Computing Systems | 2018-06-01 | Paper |
Precedence-Constrained Scheduling Problems Parameterized by Partial Order Width
Discrete Optimization and Operations Research | 2018-02-13 | Paper |
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
Journal of Computer and System Sciences | 2017-11-14 | Paper |
Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs
| 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?
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Assessing the computational complexity of multi-layer subgraph detection
Lecture Notes in Computer Science | 2017-07-21 | Paper |
Parameterized complexity of critical node cuts
Theoretical Computer Science | 2017-03-16 | Paper |
Twins in Subdivision Drawings of Hypergraphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
\(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments
Artificial Intelligence | 2016-10-21 | Paper |
Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Parameterizing edge modification problems above lower bounds
Lecture Notes in Computer Science | 2016-07-25 | Paper |
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets
Journal of Discrete Algorithms | 2016-07-15 | Paper |
Polynomial-time data reduction for the subset interconnection design problem
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
On the Sound Covering Cycle Problem in Paired de Bruijn Graphs
Frontiers in Algorithmics | 2015-11-12 | 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 |
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems
Discrete Applied Mathematics | 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
Theoretical Computer Science | 2015-05-26 | Paper |
On structural parameterizations for the 2-club problem
Discrete Applied Mathematics | 2015-04-28 | Paper |
Parameterized algorithmics and computational experiments for finding 2-clubs
Journal of Graph Algorithms and Applications | 2015-04-22 | Paper |
Finding highly connected subgraphs
Lecture Notes in Computer Science | 2015-02-20 | Paper |
On explaining integer vectors by few homogeneous segments
Journal of Computer and System Sciences | 2015-02-20 | Paper |
On structural parameterizations for the 2-club problem
Lecture Notes in Computer Science | 2014-11-04 | Paper |
Reversal distances for strings with few blocks or small alphabets
Combinatorial Pattern Matching | 2014-06-30 | Paper |
On the parameterized complexity of consensus clustering
Theoretical Computer Science | 2014-06-23 | Paper |
A cubic-vertex kernel for flip consensus tree
Algorithmica | 2014-03-25 | Paper |
Local search for string problems: brute-force is essentially optimal
Theoretical Computer Science | 2014-03-13 | Paper |
Effective and efficient data reduction for the subset interconnection design problem
Algorithms and Computation | 2014-01-14 | Paper |
On explaining integer vectors by few homogenous segments
Lecture Notes in Computer Science | 2013-08-12 | Paper |
On generating triangle-free graphs
Electronic Notes in Discrete Mathematics | 2013-07-04 | Paper |
Local search for string problems: brute force is essentially optimal
Combinatorial Pattern Matching | 2013-06-14 | Paper |
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
Parameterized and Exact Computation | 2013-01-07 | Paper |
Finding dense subgraphs of sparse graphs
Parameterized and Exact Computation | 2013-01-07 | Paper |
Parameterized computational complexity of finding small-diameter subgraphs
Optimization Letters | 2012-11-07 | Paper |
Cluster editing with locally bounded modifications
Discrete Applied Mathematics | 2012-10-26 | Paper |
A cubic-vertex kernel for flip consensus tree
| 2012-10-19 | Paper |
Graph-based data clustering with overlaps
Discrete Optimization | 2012-10-16 | Paper |
New races in parameterized algorithmics
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
Partitioning into colorful components by minimum edge deletions
Combinatorial Pattern Matching | 2012-08-14 | Paper |
An analytical approach to network motif detection in samples of networks with pairwise different vertex labels
Computational & Mathematical Methods in Medicine | 2012-06-19 | Paper |
On making directed graphs transitive
Journal of Computer and System Sciences | 2012-05-11 | Paper |
On the parameterized complexity of consensus clustering
Algorithms and Computation | 2011-12-16 | Paper |
Editing graphs into disjoint unions of dense clusters
Algorithmica | 2011-12-14 | Paper |
A more relaxed model for graph-based data clustering: \(s\)-plex cluster editing
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
Journal of Discrete Algorithms | 2011-05-03 | Paper |
Average parameterization and partial kernelization for computing medians
Journal of Computer and System Sciences | 2011-04-28 | Paper |
Alternative parameterizations for cluster editing
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | 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 |
Average parameterization and partial kernelization for computing medians
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Editing graphs into disjoint unions of dense clusters
Algorithms and Computation | 2009-12-17 | Paper |
Isolation concepts for clique enumeration: comparison and computational experiments
Theoretical Computer Science | 2009-11-25 | Paper |
On Making Directed Graphs Transitive
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Isolation concepts for efficiently enumerating dense subgraphs
Theoretical Computer Science | 2009-09-10 | Paper |
Graph-Based Data Clustering with Overlaps
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
Combinatorial Pattern Matching | 2009-07-07 | Paper |
A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
Isolation Concepts for Enumerating Dense Subgraphs
Lecture Notes in Computer Science | 2009-03-06 | Paper |
Enumerating Isolated Cliques in Synthetic and Financial Networks
Combinatorial Optimization and Applications | 2009-01-27 | Paper |
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
Combinatorial Pattern Matching | 2008-06-17 | 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 |
