| Publication | Date of Publication | Type |
|---|
Covering a graph with densest subgraphs
La Matematica | 2025-01-09 | Paper |
Untangling temporal graphs of bounded degree
Theoretical Computer Science | 2023-08-01 | Paper |
scientific article; zbMATH DE number 7696000 (Why is no real title available?)
(available as arXiv preprint) | 2023-06-14 | Paper |
On the tractability of covering a graph with 2-clubs
Algorithmica | 2023-04-11 | Paper |
Computing the \(k\) densest subgraphs of a graph
Information Processing Letters | 2022-10-28 | Paper |
Finding colorful paths in temporal graphs
(available as arXiv preprint) | 2022-10-25 | Paper |
MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms
Theoretical Computer Science | 2022-10-24 | Paper |
On the complexity of approximately matching a string to a directed graph
Information and Computation | 2022-10-13 | Paper |
Reconciling multiple genes trees via segmental duplications and losses
(available as arXiv preprint) | 2022-07-18 | Paper |
| Complexity and algorithms for MUL-tree pruning | 2022-03-22 | Paper |
Hardness and tractability of the \(\gamma\)-complete subgraph problem
Information Processing Letters | 2021-06-16 | Paper |
Top-\(k\) overlapping densest subgraphs: approximation algorithms and computational complexity
Journal of Combinatorial Optimization | 2021-05-11 | Paper |
Complexity issues of string to graph approximate matching
(available as arXiv preprint) | 2020-07-27 | Paper |
| The longest filled common subsequence problem | 2020-05-25 | Paper |
On the tractability of covering a graph with 2-clubs
Fundamentals of Computation Theory | 2020-01-30 | Paper |
Comparing incomplete sequences via longest common subsequence
Theoretical Computer Science | 2019-11-13 | Paper |
On the tractability of finding disjoint clubs in a network
Theoretical Computer Science | 2019-06-18 | Paper |
Covering a graph with clubs
Journal of Graph Algorithms and Applications | 2019-05-24 | Paper |
Maximum disjoint paths on edge-colored graphs: approximability and tractability
Algorithms | 2019-03-26 | Paper |
Finding disjoint paths on edge-colored graphs: more tractability results
Journal of Combinatorial Optimization | 2018-12-06 | Paper |
Covering with clubs: complexity and approximability
(available as arXiv preprint) | 2018-09-06 | Paper |
Parameterized complexity and approximation issues for the colorful components problems
Theoretical Computer Science | 2018-06-18 | Paper |
| Correction of weighted orthology and paralogy relations -- complexity and algorithmic results | 2018-03-23 | Paper |
Finding disjoint paths on edge-colored graphs: a multivariate complexity analysis
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Corrigendum to: ``Parameterized tractability of the maximum-duo preservation string mapping problem.
Theoretical Computer Science | 2016-10-21 | Paper |
Parameterized tractability of the maximum-duo preservation string mapping problem
Theoretical Computer Science | 2016-08-31 | Paper |
Parameterized complexity and approximation issues for the colorful components problems
Lecture Notes in Computer Science | 2016-08-17 | Paper |
| Correcting gene trees by leaf insertions: complexity and approximation | 2016-08-05 | Paper |
Fixed-parameter algorithms for scaffold filling
Lecture Notes in Computer Science | 2015-10-16 | Paper |
Restricted and swap common superstring: a multivariate algorithmic perspective
Algorithmica | 2015-09-02 | Paper |
On the fixed parameter tractability and approximability of the minimum error correction problem
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Correcting gene tree by removal and modification: tractability and approximability
Journal of Discrete Algorithms | 2015-08-18 | Paper |
Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability
Language, Life, Limits | 2015-02-25 | Paper |
Fixed-parameter algorithms for scaffold filling
Theoretical Computer Science | 2015-01-28 | Paper |
The constrained shortest common supersequence problem
Journal of Discrete Algorithms | 2014-08-13 | Paper |
When and how the perfect phylogeny model explains evolution
Discrete and Topological Models in Molecular Biology | 2014-06-23 | Paper |
Gene tree correction for reconciliation and species tree inference: complexity and algorithms
Journal of Discrete Algorithms | 2014-04-01 | Paper |
Covering pairs in directed acyclic graphs
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Covering pairs in directed acyclic graphs
Language and Automata Theory and Applications | 2014-03-31 | Paper |
Complexity insights of the minimum duplication problem
Theoretical Computer Science | 2014-03-27 | Paper |
The \(l\)-diversity problem: tractability and approximability
Theoretical Computer Science | 2014-01-13 | Paper |
Finding approximate and constrained motifs in graphs
Theoretical Computer Science | 2014-01-09 | Paper |
Parameterized complexity of \(k\)-anonymity: hardness and tractability
Journal of Combinatorial Optimization | 2013-08-09 | Paper |
Aligning and Labeling Genomes under the Duplication-Loss Model
Lecture Notes in Computer Science | 2013-08-05 | Paper |
Resolving rooted triplet inconsistency by dissolving multigraphs
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Duplication-loss genome alignment: complexity and algorithm
Language and Automata Theory and Applications | 2013-03-18 | Paper |
Restricted and swap common superstring: a parameterized view
Parameterized and Exact Computation | 2013-01-07 | Paper |
The binary perfect phylogeny with persistent characters
Theoretical Computer Science | 2012-10-11 | Paper |
Minimum leaf removal for reconciliation: complexity and algorithms
Combinatorial Pattern Matching | 2012-08-14 | Paper |
Complexity insights of the minimum duplication problem
SOFSEM 2012: Theory and Practice of Computer Science | 2012-06-15 | Paper |
A randomized PTAS for the minimum consensus clustering with a fixed number of clusters
Theoretical Computer Science | 2012-05-30 | Paper |
New results for the longest haplotype reconstruction problem
Discrete Applied Mathematics | 2012-05-30 | Paper |
On the parameterized complexity of the repetition free longest common subsequence problem
Information Processing Letters | 2012-05-04 | Paper |
Variants of constrained longest common subsequence
Information Processing Letters | 2012-03-27 | Paper |
On the complexity of the \(l\)-diversity problem
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
Finding approximate and constrained motifs in graphs
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Anonymizing binary and small tables is hard to approximate
Journal of Combinatorial Optimization | 2011-06-17 | Paper |
Parameterized complexity of \(k\)-anonymity: hardness and tractability
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Complexity issues in vertex-colored graph pattern matching
Journal of Discrete Algorithms | 2011-05-03 | Paper |
Beyond evolutionary trees
Natural Computing | 2010-09-16 | Paper |
Fingerprint clustering with bounded number of missing values
Algorithmica | 2010-09-16 | Paper |
The k-Anonymity Problem Is Hard
Fundamentals of Computation Theory | 2009-10-20 | Paper |
The Longest Haplotype Reconstruction Problem Revisited
Fundamentals of Computation Theory | 2009-10-20 | Paper |
Maximum Motif Problem in Vertex-Colored Graphs
Combinatorial Pattern Matching | 2009-07-07 | Paper |
Exemplar Longest Common Subsequence
Computational Science – ICCS 2006 | 2008-12-09 | Paper |
Inferring (biological) signal transduction networks via transitive reductions of directed graphs
Algorithmica | 2008-07-01 | Paper |
On the approximation of correlation clustering and consensus clustering
Journal of Computer and System Sciences | 2008-06-26 | Paper |
Fingerprint Clustering with Bounded Number of Missing Values
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Reconciling a gene tree to a species tree under the duplication cost model
Theoretical Computer Science | 2005-12-29 | Paper |
Computational Science – ICCS 2005
Lecture Notes in Computer Science | 2005-11-30 | Paper |
The haplotyping problem: an overview of computational models and solutions
Journal of Computer Science and Technology | 2004-10-28 | Paper |
| scientific article; zbMATH DE number 2011850 (Why is no real title available?) | 2003-12-02 | Paper |
