| Publication | Date of Publication | Type |
|---|
| IsoQuant graphs from PacBio and ONT Mouse sequencing data | 2024-10-24 | Dataset |
| Cut paths and their remainder structure, with applications | 2024-10-08 | Paper |
| Sparsifying, shrinking and splicing for minimum path cover in parameterized linear time | 2024-07-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6147517 | 2024-01-15 | Paper |
| On the Complexity of String Matching for Graphs | 2023-10-23 | Paper |
| Simplicity in Eulerian circuits: uniqueness and safety | 2023-10-12 | Paper |
| Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails | 2023-09-21 | Paper |
| Genome-Scale Algorithm Design | 2023-08-29 | Paper |
| Flow Decomposition with Subpath Constraints | 2023-07-24 | Paper |
| Algorithms and complexity on indexing founder graphs | 2023-06-05 | Paper |
| Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended | 2023-03-09 | Paper |
| Linear time construction of indexable founder block graphs | 2023-02-07 | Paper |
| A Safety Framework for Flow Decomposition Problems via Integer Linear Programming | 2023-01-30 | Paper |
| Human genomes for GGCAT benchmarks - part 1 | 2023-01-05 | Dataset |
| Human genomes for GGCAT benchmarks - part 2 | 2023-01-05 | Dataset |
| Cut paths and their remainder structure, with applications | 2022-10-14 | Paper |
| Solving string problems on graphs using the labeled direct product | 2022-10-06 | Paper |
| Fast, flexible, and exact minimum flow decompositions via ILP | 2022-08-30 | Paper |
| Safety and completeness in flow decompositions for RNA assembly | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091210 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5088896 | 2022-07-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5087784 | 2022-07-01 | Paper |
| A linear-time parameterized algorithm for computing the width of a DAG | 2022-06-08 | Paper |
| Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails | 2022-03-24 | Paper |
| Safety in \(s\)-\(t\) paths, trails and walks | 2022-03-22 | Paper |
| A simplified algorithm computing all \(s-t\) bridges and articulation points | 2021-10-21 | Paper |
| The Hydrostructure: a Universal Framework for Safe and Complete Algorithms for Genome Assembly | 2020-11-25 | Paper |
| Optimal Omnitig Listing for Safe and Complete Contig Assembly | 2020-05-25 | Paper |
| Genome assembly, from practice to theory: safe, complete and linear-time | 2020-02-24 | Paper |
| An Optimal O ( nm ) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph | 2019-12-02 | Paper |
| Sparse Dynamic Programming on DAGs with Small Width | 2019-11-25 | Paper |
| Faster FPTASes for counting and random generation of knapsack solutions | 2019-05-29 | Paper |
| Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth’s Theorem | 2018-11-13 | Paper |
| The minimum conflict-free row split problem revisited | 2018-01-04 | Paper |
| On Sets and Graphs | 2017-09-26 | Paper |
| Finding a Perfect Phylogeny from Mixed Tumor Samples | 2017-07-25 | Paper |
| Interval scheduling maximizing minimum coverage | 2017-05-12 | Paper |
| Set-syllogistics meet combinatorics | 2017-04-04 | Paper |
| Mapping Sets and Hypersets into Numbers | 2016-08-15 | Paper |
| Safe and Complete Contig Assembly Via Omnitigs | 2016-06-22 | Paper |
| Gap Filling as Exact Path Length Problem | 2016-06-22 | Paper |
| Graph operations on parity games and polynomial-time algorithms | 2016-01-21 | Paper |
| Set Graphs. V. On representing graphs as membership digraphs | 2015-07-15 | Paper |
| Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets | 2015-07-02 | Paper |
| Markov chain algorithms for generating sets uniformly at random | 2014-10-22 | Paper |
| Faster FPTASes for Counting and Random Generation of Knapsack Solutions | 2014-10-08 | Paper |
| Motif matching using gapped patterns | 2014-08-27 | Paper |
| Set graphs. IV. Further connections with claw-freeness | 2014-08-22 | Paper |
| Set graphs. II. Complexity of set graph recognition and similar problems | 2014-07-25 | Paper |
| Well-quasi-ordering hereditarily finite sets | 2013-10-22 | Paper |
| Counting extensional acyclic digraphs | 2013-04-04 | Paper |
| Ranking, unranking and random generation of extensional acyclic digraphs | 2013-03-21 | Paper |
| Set graphs. I. Hereditarily finite sets and extensional acyclic orientations | 2013-03-12 | Paper |
| Infinity, in short | 2013-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4902266 | 2013-01-14 | Paper |
| A randomized numerical aligner (rNA) | 2012-11-06 | Paper |
| A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs | 2012-08-10 | Paper |
| Statements of ill-founded infinity in set theory | 2011-10-05 | Paper |
| Computing the Maximum Bisimulation with Spiking Neural P Systems | 2011-06-24 | Paper |
| Well-quasi-ordering hereditarily finite sets | 2011-06-03 | Paper |
| Stating infinity in set/hyperset theory | 2011-05-20 | Paper |
| A randomized numerical aligner (rNA) | 2010-05-26 | Paper |
| Using ÆtnaNova to formally prove that the Davis-Putnam satisfiability test is correct | 2009-11-18 | Paper |
| Implementing sorting networks with spiking neural P systems | 2009-02-12 | Paper |
| Simulating the Bitonic Sort Using P Systems | 2008-03-28 | Paper |
| Unicyclic and bicyclic graphs having minimum degree distance | 2007-11-30 | Paper |
