| Publication | Date of Publication | Type |
|---|
Embedding phylogenetic trees in networks of low treewidth
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2024-09-06 | Paper |
| Treewidth-Based Algorithms for the Small Parsimony Problem on Networks | 2023-07-24 | Paper |
What Is Known About Vertex Cover Kernelization?
Adventures Between Lower Bounds and Higher Altitudes | 2023-06-30 | Paper |
Fast exact dynamic time warping on run-length encoded time series
Algorithmica | 2023-02-16 | Paper |
| Quantifying hierarchical conflicts in homology statements | 2022-08-11 | Paper |
| scientific article; zbMATH DE number 7559442 (Why is no real title available?) | 2022-07-18 | Paper |
Tree containment with soft polytomies
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
Producing genomic sequences after genome scaffolding with ambiguous paths: complexity, approximation and lower bounds
Algorithmica | 2021-06-30 | Paper |
| scientific article; zbMATH DE number 7238964 (Why is no real title available?) | 2020-08-25 | Paper |
Linearizing genomes: exact methods and local search
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
Scanning phylogenetic networks is NP-hard
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
| The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration | 2020-05-27 | Paper |
| Power Edge Set and Zero Forcing Set remain difficult in cubic graphs | 2020-02-25 | Paper |
| New results about the linearization of scaffolds sharing repeated contigs | 2019-10-11 | Paper |
| New polynomial-time algorithm around the scaffolding problem | 2019-07-25 | Paper |
Complexity and lowers bounds for power edge set problem
Journal of Discrete Algorithms | 2019-01-18 | Paper |
On residual approximation in solution extension problems
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases
Algorithmica | 2018-06-01 | Paper |
| On the linearization of scaffolds sharing repeated contigs | 2018-03-26 | Paper |
| New insights for power edge set problem | 2018-02-26 | Paper |
A polynomial-time algorithm for outerplanar diameter improvement
Journal of Computer and System Sciences | 2017-09-07 | Paper |
| The complexity of arc routing problems | 2017-07-11 | Paper |
On Residual Approximation in Solution Extension Problems
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
Instance guaranteed ratio on greedy heuristic for genome scaffolding
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
On the fixed parameter tractability of agreement-based phylogenetic distances
Journal of Mathematical Biology | 2017-01-25 | Paper |
Phylogenetic incongruence through the lens of monadic second order logic
Journal of Graph Algorithms and Applications | 2016-03-03 | Paper |
Parameterized certificate dispersal and its variants
Theoretical Computer Science | 2016-02-26 | Paper |
On the complexity of scaffolding problems: from cliques to sparse graphs
Combinatorial Optimization and Applications | 2016-02-05 | Paper |
Polynomial-time data reduction for the subset interconnection design problem
SIAM Journal on Discrete Mathematics | 2015-11-27 | Paper |
Interval scheduling and colorful independent sets
Journal of Scheduling | 2015-11-12 | Paper |
A polynomial-time algorithm for outerplanar diameter improvement
Lecture Notes in Computer Science | 2015-10-20 | Paper |
On the complexity of hub labeling (extended abstract)
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Constant thresholds can make target set selection tractable
Theory of Computing Systems | 2015-02-05 | Paper |
Exploiting a hypergraph model for finding Golomb rulers
Acta Informatica | 2014-11-14 | Paper |
On the parameterized complexity of consensus clustering
Theoretical Computer Science | 2014-06-23 | Paper |
Effective and efficient data reduction for the subset interconnection design problem
Algorithms and Computation | 2014-01-14 | Paper |
Two-layer planarization parameterized by feedback edge set
Theoretical Computer Science | 2014-01-10 | Paper |
Efficient algorithms for Eulerian extension and rural Postman
SIAM Journal on Discrete Mathematics | 2013-06-27 | Paper |
Constant thresholds can make target set selection tractable
Lecture Notes in Computer Science | 2013-04-19 | Paper |
Interval scheduling and colorful independent sets
Lecture Notes in Computer Science | 2013-03-21 | Paper |
A new view on rural postman based on Eulerian extension and matching
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Exploiting a Hypergraph Model for Finding Golomb Rulers
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Linear-time computation of a linear problem kernel for dominating set on planar graphs
Parameterized and Exact Computation | 2012-06-15 | Paper |
On making directed graphs transitive
Journal of Computer and System Sciences | 2012-05-11 | Paper |
A new view on rural postman based on Eulerian extension and matching
Lecture Notes in Computer Science | 2012-01-13 | Paper |
From few components to an Eulerian graph by adding ARCS
Graph-Theoretic Concepts in Computer Science | 2011-12-16 | Paper |
On the parameterized complexity of consensus clustering
Algorithms and Computation | 2011-12-16 | Paper |
On tractable cases of target set selection
Algorithms and Computation | 2010-12-09 | Paper |
Efficient algorithms for Eulerian extension
Graph Theoretic Concepts in Computer Science | 2010-11-16 | Paper |
Extended islands of tractability for parsimony haplotyping
Combinatorial Pattern Matching | 2010-07-26 | Paper |
Two-layer planarization parameterized by feedback edge set
Lecture Notes in Computer Science | 2010-06-17 | Paper |
On Making Directed Graphs Transitive
Lecture Notes in Computer Science | 2009-10-20 | Paper |
