| Publication | Date of Publication | Type |
|---|
| Recognizing geometric intersection graphs stabbed by a line | 2024-03-28 | Paper |
| Decomposing subcubic graphs into claws, paths or triangles | 2023-10-04 | Paper |
| On the complexity of recognizing Stick, BipHook and max point-tolerance graphs | 2023-03-24 | Paper |
| Raney numbers, threshold sequences and Motzkin-like paths | 2022-08-24 | Paper |
| Forced pairs in \(A\)-Stick graphs | 2022-06-14 | Paper |
| Hamiltonian problems in directed graphs with simple row patterns | 2022-05-31 | Paper |
| Admissible pinnacle orderings | 2021-07-28 | Paper |
| Sorting permutations with fixed pinnacle set | 2020-08-07 | Paper |
| The Contig Assembly Problem and Its Algorithmic Solutions | 2020-08-07 | Paper |
| Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT | 2019-05-17 | Paper |
| Finding supported paths in heterogeneous networks | 2019-03-26 | Paper |
| Common intervals and permutation reconstruction from \textit{MinMax}-betweenness constraints | 2018-09-27 | Paper |
| The \(S\)-\textsc{labeling} problem: an algorithmic tour | 2018-06-27 | Paper |
| Sorting signed permutations by reversals using link-cut trees | 2018-03-16 | Paper |
| Graph matching problems and the NP-hardness of sortedness constraints | 2017-09-13 | Paper |
| \(\log\)-lists and their applications to sorting by transpositions, reversals and block-interchanges | 2016-12-22 | Paper |
| Decomposing Cubic Graphs into Connected Subgraphs of Size Three | 2016-09-02 | Paper |
| Recognizing \(i\)-triangulated graphs in \(O(mn)\) time | 2016-06-16 | Paper |
| Permutation reconstruction from MinMax-betweenness constraints | 2016-06-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 |
| Pancake flipping is hard | 2015-08-31 | Paper |
| HOLES AND DOMINOES IN MEYNIEL GRAPHS | 2015-04-29 | Paper |
| ON GRAPHS WITH LIMITED NUMBER OF P4-PARTNERS | 2015-04-29 | Paper |
| Path-driven orientation of mixed graphs | 2014-12-05 | Paper |
| Extending common intervals searching from permutations to sequences | 2014-11-24 | Paper |
| \textit{MinMax}-profiles: a unifying view of common intervals, nested common intervals and conserved intervals of \(K\) permutations | 2014-07-07 | 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 |
| 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 |
| New applications of interval generators to genome comparison | 2012-05-11 | 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 |
| Statistical properties of factor oracles | 2011-05-03 | Paper |
| Revisiting the Minimum Breakpoint Linearization Problem | 2010-06-17 | Paper |
| Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms | 2009-12-17 | Paper |
| The strong perfect graph conjecture: 40 years of attempts, and its resolution | 2009-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3393448 | 2009-08-26 | Paper |
| Statistical Properties of Factor Oracles | 2009-07-07 | Paper |
| On the Approximability of Comparing Genomes with Duplicates | 2009-05-19 | Paper |
| Extending the Hardness of RNA Secondary Structure Comparison | 2009-03-03 | Paper |
| Converting suffix trees into factor/suffix oracles | 2008-08-08 | Paper |
| On the Approximability of Comparing Genomes with Duplicates | 2008-03-25 | Paper |
| Maximum weight edge-constrained matchings | 2008-03-18 | Paper |
| Hard problems in similarity searching | 2004-11-12 | Paper |
| Dirac-type characterizations of graphs without long chordless cycles | 2002-12-02 | Paper |
| Loose vertices in \(C_{4}\)-free Berge graphs | 2002-12-02 | Paper |
| A linear algorithm to color \(i\)-triangulated graphs | 2002-07-25 | Paper |
| Forbidden subgraph decomposition | 2002-05-28 | Paper |
| Cutsets in perfect and minimal imperfect graphs | 2002-05-02 | Paper |
| Domination graphs: Examples and counterexamples | 2002-04-08 | Paper |
| An \(O(n^2)\) algorithm to color Meyniel graphs | 2001-10-23 | Paper |
| Even pairs in Artemis graphs | 2001-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4944996 | 2000-08-07 | Paper |
| Perfectly contractile diamond-free graphs | 2000-04-09 | Paper |
| \(P_4\)-domination in minimal imperfect graphs | 2000-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4265589 | 2000-01-11 | Paper |
| Weighted parameters in \((P_5,\overline {P_5})\)-free graphs | 1999-01-05 | Paper |
| Building counterexamples | 1997-10-22 | Paper |
| On transversals in minimal imperfect graphs | 1997-10-20 | Paper |
| Properly orderable graphs | 1997-04-07 | Paper |
| Quasi-parity and perfect graphs | 1997-02-27 | Paper |
| Perfect and locally perfect colorings | 1996-05-30 | Paper |
| A new class of perfect Hoàng graphs | 1995-12-03 | Paper |
