| Publication | Date of Publication | Type |
|---|
| Decomposing subcubic graphs into claws, paths or triangles | 2023-10-04 | Paper |
| Sorting genomes by prefix double-cut-and-joins | 2023-08-04 | Paper |
| The Exact Subset MultiCover problem | 2023-08-04 | Paper |
| Approximation algorithms for sorting by \(k\)-cuts on signed permutations | 2022-11-23 | Paper |
| A 3.5-Approximation Algorithm for Sorting by Intergenic Transpositions | 2022-10-13 | Paper |
| Sorting by \(k\)-cuts on signed permutations | 2022-08-11 | Paper |
| Finding a Small Number of Colourful Components | 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? | 2021-01-25 | Paper |
| The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph | 2020-12-16 | Paper |
| Graph Motif Problems Parameterized by Dual | 2020-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5110893 | 2020-05-25 | Paper |
| Unshuffling permutations: trivial bijections and compositions | 2019-10-15 | Paper |
| Finding supported paths in heterogeneous networks | 2019-03-26 | Paper |
| Optimal odd gossiping | 2018-09-06 | Paper |
| The \(S\)-\textsc{labeling} problem: an algorithmic tour | 2018-06-27 | Paper |
| Prefix and suffix reversals on strings | 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 | 2018-02-09 | Paper |
| Graph Motif Problems Parameterized by Dual | 2017-10-17 | Paper |
| Algorithmic Aspects of the Maximum Colorful Arborescence Problem | 2017-05-19 | Paper |
| Odd gossiping | 2017-03-15 | Paper |
| Decomposing Cubic Graphs into Connected Subgraphs of Size Three | 2016-09-02 | Paper |
| (Prefix) reversal distance for (signed) strings with few blocks or small alphabets | 2016-07-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2816083 | 2016-07-01 | Paper |
| Algorithmic Aspects of the S-Labeling Problem | 2016-04-04 | Paper |
| Obtaining a Triangular Matrix by Independent Row-Column Permutations | 2016-01-11 | Paper |
| Approximation algorithms for sorting by length-weighted prefix and suffix operations | 2015-10-08 | Paper |
| Prefix and Suffix Reversals on Strings | 2015-10-02 | Paper |
| Pancake flipping is hard | 2015-08-31 | Paper |
| Towards an algorithmic guide to Spiral Galaxies | 2015-05-26 | Paper |
| Path-driven orientation of mixed graphs | 2014-12-05 | Paper |
| Some algorithmic results for [2-sumset covers] | 2014-10-07 | Paper |
| Reversal Distances for Strings with Few Blocks or Small Alphabets | 2014-06-30 | Paper |
| Maximal strip recovery problem with gaps: hardness and approximation algorithms | 2014-02-03 | Paper |
| Revisiting the minimum breakpoint linearization problem | 2014-01-10 | Paper |
| Finding approximate and constrained motifs in graphs | 2014-01-09 | Paper |
| On the S-Labeling problem | 2013-10-10 | Paper |
| Sorting by Transpositions Is Difficult | 2013-01-04 | Paper |
| Pancake flipping is hard | 2012-09-25 | Paper |
| Tractability and approximability of maximal strip recovery | 2012-08-08 | Paper |
| Algorithmic Aspects of Heterogeneous Biological Networks Comparison | 2011-08-12 | Paper |
| Sorting by Transpositions Is Difficult | 2011-07-06 | Paper |
| Tractability and Approximability of Maximal Strip Recovery | 2011-06-29 | Paper |
| Finding Approximate and Constrained Motifs in Graphs | 2011-06-29 | Paper |
| Complexity issues in vertex-colored graph pattern matching | 2011-05-03 | Paper |
| Upper and lower bounds for finding connected motifs in vertex-colored graphs | 2011-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576724 | 2010-07-30 | Paper |
| Revisiting the Minimum Breakpoint Linearization Problem | 2010-06-17 | Paper |
| Finding common structured patterns in linear graphs | 2010-06-07 | Paper |
| Acyclic coloring of graphs of maximum degree five: nine colors are enough | 2010-03-24 | Paper |
| Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms | 2009-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3393448 | 2009-08-26 | Paper |
| On Finding Small 2-Generating Sets | 2009-07-23 | Paper |
| Maximum Motif Problem in Vertex-Colored Graphs | 2009-07-07 | Paper |
| On the Approximability of Comparing Genomes with Duplicates | 2009-05-19 | Paper |
| Acyclic and \(k\)-distance coloring of the grid | 2009-04-28 | Paper |
| Finding occurrences of protein complexes in protein-protein interaction graphs | 2009-04-16 | Paper |
| On the oriented chromatic number of grids | 2009-03-23 | Paper |
| Extending the Hardness of RNA Secondary Structure Comparison | 2009-03-03 | Paper |
| The Exemplar Breakpoint Distance for Non-trivial Genomes Cannot Be Approximated | 2009-02-24 | Paper |
| Fixed-parameter algorithms for protein similarity search under mRNA structure constraints | 2009-02-23 | Paper |
| Exemplar Longest Common Subsequence | 2008-12-09 | Paper |
| Genomes Containing Duplicates Are Hard to Compare | 2008-12-09 | Paper |
| Common Structured Patterns in Linear Graphs: Approximation and Combinatorics | 2008-06-17 | Paper |
| On the Approximability of Comparing Genomes with Duplicates | 2008-03-25 | Paper |
| What Makes the Arc-Preserving Subsequence Problem Hard? | 2008-03-19 | Paper |
| Vertex labeling and routing in expanded Apollonian networks | 2008-02-04 | Paper |
| Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs | 2007-11-28 | Paper |
| Extracting constrained 2-interval subsets in 2-interval sets | 2007-10-18 | Paper |
| \(L(p,q)\) labeling of \(d\)-dimensional grids | 2007-06-26 | Paper |
| Neighborhood Communications in Networks | 2007-05-29 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2006-11-01 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| High-dimensional Apollonian networks | 2006-04-06 | Paper |
| Computational Science – ICCS 2005 | 2005-11-30 | Paper |
| Structural Information and Communication Complexity | 2005-09-07 | Paper |
| Combinatorial Pattern Matching | 2005-09-07 | Paper |
| Edge-disjoint spanners in Cartesian products of graphs | 2005-08-17 | Paper |
| Star coloring of graphs | 2005-02-16 | Paper |
| On maximal instances for the original syntenic distance | 2005-01-11 | Paper |
| A survey on Knödel graphs. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448754 | 2004-02-18 | Paper |
| Factor \(d\)-domatic colorings of graphs | 2003-04-28 | Paper |
| Minimum feedback vertex set and acyclic coloring. | 2003-01-21 | Paper |
| Hierarchical broadcast and gossip networks | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766678 | 2002-07-22 | Paper |
| Routing permutations and 2-1 routing requests in the hypercube | 2002-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944978 | 2000-12-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4519135 | 2000-12-03 | Paper |
| On the structure of minimum broadcast digraphs | 2000-08-21 | Paper |
| A study of minimum gossip graphs | 2000-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232778 | 1999-03-15 | Paper |
