| Publication | Date of Publication | Type |
|---|
Sorting genomes by prefix double-cut-and-joins
Theoretical Computer Science | 2024-12-12 | Paper |
The \textsc{Exact Subset MultiCover} problem
Theoretical Computer Science | 2024-12-12 | Paper |
The \textsc{maximum zero-sum partition} problem
Theoretical Computer Science | 2024-11-06 | Paper |
| Permutation pattern matching for doubly partially ordered patterns | 2024-05-06 | Paper |
Decomposing subcubic graphs into claws, paths or triangles
Journal of Graph Theory | 2023-10-04 | Paper |
Sorting genomes by prefix double-cut-and-joins
String Processing and Information Retrieval | 2023-08-04 | Paper |
The Exact Subset MultiCover problem
Lecture Notes in Computer Science | 2023-08-04 | Paper |
Approximation algorithms for sorting by \(k\)-cuts on signed permutations
Journal of Combinatorial Optimization | 2022-11-23 | Paper |
A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions
Algorithms for Computational Biology | 2022-10-13 | Paper |
| Sorting by \(k\)-cuts on signed permutations | 2022-08-11 | Paper |
Finding a small number of colourful components
(available as arXiv preprint) | 2022-07-18 | Paper |
| Sorting by multi-cut rearrangements | 2022-03-24 | Paper |
The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be?
Theoretical Computer Science | 2021-01-25 | Paper |
On the maximum colorful arborescence problem and color hierarchy graph structure
(available as arXiv preprint) | 2020-12-16 | Paper |
Graph motif problems parameterized by dual
Journal of Graph Algorithms and Applications | 2020-09-04 | Paper |
| scientific article; zbMATH DE number 7203332 (Why is no real title available?) | 2020-05-25 | Paper |
| Unshuffling permutations: trivial bijections and compositions | 2019-10-15 | Paper |
Finding supported paths in heterogeneous networks
Algorithms | 2019-03-26 | Paper |
Optimal odd gossiping
Discrete Applied Mathematics | 2018-09-06 | Paper |
The \(S\)-\textsc{labeling} problem: an algorithmic tour
Discrete Applied Mathematics | 2018-06-27 | Paper |
Prefix and suffix reversals on strings
Discrete Applied Mathematics | 2018-06-27 | Paper |
| Genome rearrangements on both gene order and intergenic regions | 2018-03-23 | Paper |
Sorting permutations and binary strings by length-weighted rearrangements
Theoretical Computer Science | 2018-02-09 | Paper |
Graph motif problems parameterized by dual
(available as arXiv preprint) | 2017-10-17 | Paper |
Algorithmic aspects of the maximum colorful arborescence problem
Lecture Notes in Computer Science | 2017-05-19 | Paper |
Odd gossiping
Discrete Applied Mathematics | 2017-03-15 | Paper |
Decomposing cubic graphs into connected subgraphs of size three
Lecture Notes in Computer Science | 2016-09-02 | Paper |
(Prefix) reversal distance for (signed) strings with few blocks or small alphabets
Journal of Discrete Algorithms | 2016-07-15 | Paper |
| Recognizing recursive circulant graphs (extended abstract) | 2016-07-01 | Paper |
Algorithmic aspects of the \(S\)-labeling problem
Lecture Notes in Computer Science | 2016-04-04 | Paper |
Obtaining a triangular matrix by independent row-column permutations
Algorithms and Computation | 2016-01-11 | Paper |
Approximation algorithms for sorting by length-weighted prefix and suffix operations
Theoretical Computer Science | 2015-10-08 | Paper |
Prefix and Suffix Reversals on Strings
String Processing and Information Retrieval | 2015-10-02 | Paper |
Pancake flipping is hard
Journal of Computer and System Sciences | 2015-08-31 | Paper |
Towards an algorithmic guide to Spiral Galaxies
Theoretical Computer Science | 2015-05-26 | Paper |
Path-driven orientation of mixed graphs
Discrete Applied Mathematics | 2014-12-05 | Paper |
Some algorithmic results for [2-sumset covers]
Information Processing Letters | 2014-10-07 | Paper |
Reversal distances for strings with few blocks or small alphabets
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Maximal strip recovery problem with gaps: hardness and approximation algorithms
Journal of Discrete Algorithms | 2014-02-03 | Paper |
Revisiting the minimum breakpoint linearization problem
Theoretical Computer Science | 2014-01-10 | Paper |
Finding approximate and constrained motifs in graphs
Theoretical Computer Science | 2014-01-09 | Paper |
On the \(S\)-\textsc{Labeling} problem
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Sorting by transpositions is difficult
SIAM Journal on Discrete Mathematics | 2013-01-04 | Paper |
Pancake flipping is hard
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Tractability and approximability of maximal strip recovery
Theoretical Computer Science | 2012-08-08 | Paper |
Algorithmic aspects of heterogeneous biological networks comparison
Combinatorial Optimization and Applications | 2011-08-12 | Paper |
Sorting by transpositions is difficult
Lecture Notes in Computer Science | 2011-07-06 | Paper |
Finding approximate and constrained motifs in graphs
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Tractability and approximability of maximal strip recovery
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Complexity issues in vertex-colored graph pattern matching
Journal of Discrete Algorithms | 2011-05-03 | Paper |
Upper and lower bounds for finding connected motifs in vertex-colored graphs
Journal of Computer and System Sciences | 2011-04-28 | Paper |
| Acyclic coloring of graphs of maximum degree \(\Delta \) | 2010-07-30 | Paper |
Revisiting the minimum breakpoint linearization problem
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Finding common structured patterns in linear graphs
Theoretical Computer Science | 2010-06-07 | Paper |
Acyclic coloring of graphs of maximum degree five: nine colors are enough
Information Processing Letters | 2010-03-24 | Paper |
Maximal strip recovery problem with gaps: hardness and approximation algorithms
Algorithms and Computation | 2009-12-17 | Paper |
| Combinatorics of genome rearrangements. | 2009-08-26 | Paper |
On Finding Small 2-Generating Sets
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Maximum Motif Problem in Vertex-Colored Graphs
Combinatorial Pattern Matching | 2009-07-07 | Paper |
On the Approximability of Comparing Genomes with Duplicates
Journal of Graph Algorithms and Applications | 2009-05-19 | Paper |
Acyclic and \(k\)-distance coloring of the grid
Information Processing Letters | 2009-04-28 | Paper |
Finding occurrences of protein complexes in protein-protein interaction graphs
Journal of Discrete Algorithms | 2009-04-16 | Paper |
On the oriented chromatic number of grids
Information Processing Letters | 2009-03-23 | Paper |
Extending the Hardness of RNA Secondary Structure Comparison
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
Fixed-parameter algorithms for protein similarity search under mRNA structure constraints
Journal of Discrete Algorithms | 2009-02-23 | Paper |
Genomes Containing Duplicates Are Hard to Compare
Computational Science – ICCS 2006 | 2008-12-09 | Paper |
Exemplar Longest Common Subsequence
Computational Science – ICCS 2006 | 2008-12-09 | Paper |
Common Structured Patterns in Linear Graphs: Approximation and Combinatorics
Combinatorial Pattern Matching | 2008-06-17 | Paper |
On the Approximability of Comparing Genomes with Duplicates
WALCOM: Algorithms and Computation | 2008-03-25 | Paper |
What Makes the Arc-Preserving Subsequence Problem Hard?
Transactions on Computational Systems Biology II | 2008-03-19 | Paper |
Vertex labeling and routing in expanded Apollonian networks
Journal of Physics A: Mathematical and Theoretical | 2008-02-04 | Paper |
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
Automata, Languages and Programming | 2007-11-28 | Paper |
Extracting constrained 2-interval subsets in 2-interval sets
Theoretical Computer Science | 2007-10-18 | Paper |
\(L(p,q)\) labeling of \(d\)-dimensional grids
Discrete Mathematics | 2007-06-26 | Paper |
Neighborhood Communications in Networks
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
High-dimensional Apollonian networks
Journal of Physics A: Mathematical and General | 2006-04-06 | Paper |
Computational Science – ICCS 2005
Lecture Notes in Computer Science | 2005-11-30 | Paper |
Combinatorial Pattern Matching
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Structural Information and Communication Complexity
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Edge-disjoint spanners in Cartesian products of graphs
Discrete Mathematics | 2005-08-17 | Paper |
Star coloring of graphs
Journal of Graph Theory | 2005-02-16 | Paper |
On maximal instances for the original syntenic distance
Theoretical Computer Science | 2005-01-11 | Paper |
A survey on Knödel graphs.
Discrete Applied Mathematics | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2044931 (Why is no real title available?) | 2004-02-18 | Paper |
Factor \(d\)-domatic colorings of graphs
Discrete Mathematics | 2003-04-28 | Paper |
Minimum feedback vertex set and acyclic coloring.
Information Processing Letters | 2003-01-21 | Paper |
Hierarchical broadcast and gossip networks
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1696530 (Why is no real title available?) | 2002-07-22 | Paper |
Routing permutations and 2-1 routing requests in the hypercube
Discrete Applied Mathematics | 2002-04-28 | Paper |
| scientific article; zbMATH DE number 1420909 (Why is no real title available?) | 2000-12-27 | Paper |
| scientific article; zbMATH DE number 1538541 (Why is no real title available?) | 2000-12-03 | Paper |
On the structure of minimum broadcast digraphs
Theoretical Computer Science | 2000-08-21 | Paper |
A study of minimum gossip graphs
Discrete Mathematics | 2000-05-07 | Paper |
| scientific article; zbMATH DE number 1262788 (Why is no real title available?) | 1999-03-15 | Paper |
