| Publication | Date of Publication | Type |
|---|
| Genome assembly, from practice to theory: safe, complete and linear-time | 2026-05-12 | Paper |
| Applying the safe-and-complete framework to practical genome assembly | 2026-02-13 | Paper |
Minimum flow decomposition in graphs with cycles using integer linear programming
Journal of Global Optimization | 2026-01-13 | Paper |
| Optimizing safe flow decompositions in DAGs | 2025-06-19 | Paper |
| Width helps and hinders splitting flows | 2025-06-19 | Paper |
Width helps and hinders splitting flows
ACM Transactions on Algorithms | 2025-02-21 | Paper |
Genome assembly, from practice to theory: safe, complete and \textit{linear-time}
ACM Transactions on Algorithms | 2025-02-21 | Paper |
| 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 |
| scientific article; zbMATH DE number 7788593 (Why is no real title available?) | 2024-01-15 | Paper |
On the Complexity of String Matching for Graphs
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Simplicity in Eulerian circuits: uniqueness and safety
Information Processing Letters | 2023-10-12 | Paper |
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
Theoretical Computer Science | 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
Algorithmica | 2023-06-05 | Paper |
Using Minimum Path Cover to Boost Dynamic Programming on DAGs: Co-linear Chaining Extended
Lecture Notes in Computer Science | 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
Algorithmica | 2022-10-06 | Paper |
Fast, flexible, and exact minimum flow decompositions via ILP
(available as arXiv preprint) | 2022-08-30 | Paper |
Safety and completeness in flow decompositions for RNA assembly
(available as arXiv preprint) | 2022-08-30 | Paper |
| scientific article; zbMATH DE number 7561548 (Why is no real title available?) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7559176 (Why is no real title available?) | 2022-07-18 | Paper |
| Random generation of essential directed acyclic graphs | 2022-07-01 | Paper |
A linear-time parameterized algorithm for computing the width of a DAG
(available as arXiv preprint) | 2022-06-08 | Paper |
Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
(available as arXiv preprint) | 2022-03-24 | Paper |
Safety in s-t paths, trails and walks
Algorithmica | 2022-03-22 | Paper |
A simplified algorithm computing all \(s\)-\(t\) bridges and articulation points
Discrete Applied Mathematics | 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
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Sparse dynamic programming on DAGs with small width
ACM Transactions on Algorithms | 2019-11-25 | Paper |
Faster FPTASes for counting and random generation of knapsack solutions
Information and Computation | 2019-05-29 | Paper |
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
ACM Transactions on Algorithms | 2018-11-13 | Paper |
Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
ACM Transactions on Algorithms | 2018-11-13 | Paper |
| The minimum conflict-free row split problem revisited | 2018-01-04 | Paper |
| On sets and graphs. Perspectives on logic and combinatorics | 2017-09-26 | Paper |
Finding a perfect phylogeny from mixed tumor samples
Lecture Notes in Computer Science | 2017-07-25 | Paper |
Interval scheduling maximizing minimum coverage
Discrete Applied Mathematics | 2017-05-12 | Paper |
Interval scheduling maximizing minimum coverage
Discrete Applied Mathematics | 2017-05-12 | Paper |
Set-syllogistics meet combinatorics
Mathematical Structures in Computer Science | 2017-04-04 | Paper |
Mapping Sets and Hypersets into Numbers
Fundamenta Informaticae | 2016-08-15 | Paper |
Safe and complete contig assembly via omnitigs
Lecture Notes in Computer Science | 2016-06-22 | Paper |
Gap filling as exact path length problem
Lecture Notes in Computer Science | 2016-06-22 | Paper |
Graph operations on parity games and polynomial-time algorithms
Theoretical Computer Science | 2016-01-21 | Paper |
Set graphs. V. on representing graphs as membership digraphs
Journal Of Logic And Computation | 2015-07-15 | Paper |
Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
Journal of Automated Reasoning | 2015-07-02 | Paper |
Markov chain algorithms for generating sets uniformly at random
Ars Mathematica Contemporanea | 2014-10-22 | Paper |
Faster FPTASes for counting and random generation of knapsack solutions
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Faster FPTASes for counting and random generation of knapsack solutions
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Motif matching using gapped patterns
Theoretical Computer Science | 2014-08-27 | Paper |
Set graphs. IV. Further connections with claw-freeness
Discrete Applied Mathematics | 2014-08-22 | Paper |
Set graphs. II. Complexity of set graph recognition and similar problems
Theoretical Computer Science | 2014-07-25 | Paper |
Well-quasi-ordering hereditarily finite sets
International Journal of Computer Mathematics | 2013-10-22 | Paper |
Counting extensional acyclic digraphs
Information Processing Letters | 2013-04-04 | Paper |
Ranking, unranking and random generation of extensional acyclic digraphs
Information Processing Letters | 2013-03-21 | Paper |
Set graphs. I. Hereditarily finite sets and extensional acyclic orientations
Discrete Applied Mathematics | 2013-03-12 | Paper |
| Abstraction in constraint optimization problems | 2013-01-14 | Paper |
Infinity, in short
Journal Of Logic And Computation | 2013-01-14 | Paper |
A randomized numerical aligner (rNA)
Journal of Computer and System Sciences | 2012-11-06 | Paper |
A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs
Discrete Mathematics | 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
Computation, Cooperation, and Life | 2011-06-24 | Paper |
Well-quasi-ordering hereditarily finite sets
Language and Automata Theory and Applications | 2011-06-03 | Paper |
| Stating infinity in set/hyperset theory | 2011-05-20 | Paper |
A randomized numerical aligner (rNA)
Language and Automata Theory and Applications | 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
Membrane Computing | 2008-03-28 | Paper |
Unicyclic and bicyclic graphs having minimum degree distance
Discrete Applied Mathematics | 2007-11-30 | Paper |
