| Publication | Date of Publication | Type |
|---|
| Improving the sensitivity of MinHash through hash-value analysis | 2024-10-21 | Paper |
| Point probe decision trees for geometric concept classes | 2023-01-18 | Paper |
| Reconstructing strings from substrings (Extended abstract) | 2023-01-18 | Paper |
| Dominance certificates for combinatorial optimization problems | 2019-07-25 | Paper |
| Combinatorial dominance guarantees for problems with infeasible solutions | 2018-11-05 | Paper |
| On minimum-area hulls | 2017-12-05 | Paper |
| The data science design manual | 2017-11-23 | Paper |
| Optimizing Read Reversals for Sequence Compression | 2017-07-25 | Paper |
| The books of numbers: quantifying historical trends in numeracy | 2016-09-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501817 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501798 | 2015-08-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501354 | 2015-08-03 | Paper |
| Synthetic sequence design for signal location search | 2013-11-11 | Paper |
| Optimizing restriction site placement for synthetic genomes | 2012-05-24 | Paper |
| Constructing Orthogonal de Bruijn Sequences | 2011-08-12 | Paper |
| Pattern matching with address errors | 2010-08-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3576755 | 2010-08-02 | Paper |
| Optimizing Restriction Site Placement for Synthetic Genomes | 2010-07-26 | Paper |
| Algorithms and Data Structures | 2010-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3642544 | 2009-11-05 | Paper |
| Pattern matching with address errors: rearrangement distances | 2009-07-24 | Paper |
| Improved bounds on sorting by length-weighted reversals | 2008-06-26 | Paper |
| The algorithm design manual | 2008-05-29 | Paper |
| Optimal boarding policies for thin passengers | 2008-02-20 | Paper |
| Data Integration in the Life Sciences | 2007-09-28 | Paper |
| Identifying Co-referential Names Across Large Corpora | 2007-09-14 | Paper |
| Shift error detection in standardized exams | 2007-04-26 | Paper |
| Restricting SBH ambiguity via restriction enzymes | 2007-04-18 | Paper |
| String Processing and Information Retrieval | 2006-10-24 | Paper |
| Analysis of aeroplane boarding via spacetime geometry and random matrix theory | 2006-08-17 | Paper |
| SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS | 2006-05-10 | Paper |
| Lowest common ancestors in trees and directed acyclic graphs | 2005-12-08 | Paper |
| Algorithmic Applications in Management | 2005-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5692717 | 2005-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3024770 | 2005-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3159164 | 2005-02-15 | Paper |
| When can you fold a map? | 2004-10-13 | Paper |
| Data structures for maintaining set partitions | 2004-08-16 | Paper |
| Algorithms for testing that sets of DNA words concatenate without secondary structure | 2004-03-15 | Paper |
| Programming challenges. The programming contest training manual. | 2003-10-01 | Paper |
| The lazy bureaucrat scheduling problem | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414677 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4410153 | 2003-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707783 | 2003-06-11 | Paper |
| LINK: a system for graph computation | 2003-01-23 | Paper |
| Finding least common ancestors in directed acyclic graphs | 2002-05-02 | Paper |
| Calculated bets. Computers, gambling, and mathematical modeling to win | 2001-10-11 | Paper |
| Identifying gene regulatory networks from experimental data | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721970 | 2001-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723956 | 2001-07-08 | Paper |
| Decision Trees for Geometric Models | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252746 | 2000-04-26 | Paper |
| On the Maximum Scatter Traveling Salesperson Problem | 1999-10-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4401016 | 1999-07-14 | Paper |
| Matching for run-length encoded strings | 1999-05-11 | Paper |
| On minimum-area hulls | 1998-10-01 | Paper |
| Recognizing polygonal parts width measurements | 1998-08-19 | Paper |
| Reconstructing polygons from X-rays | 1997-11-04 | Paper |
| Sorting with fixed-length reversals | 1997-09-07 | Paper |
| Recognizing small subgraphs | 1996-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4871060 | 1996-03-28 | Paper |
| COMPLEXITY ASPECTS OF VISIBILITY GRAPHS | 1995-09-20 | Paper |
| Algorithms for Square Roots of Graphs | 1995-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763312 | 1995-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4326207 | 1995-03-19 | Paper |
| A partial digest approach to restriction site mapping | 1994-04-19 | Paper |
| An anomaly concerning ties in Lotto-like games | 1994-01-03 | Paper |
| Model-based probing strategies for convex polygons | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4000231 | 1993-01-23 | Paper |
| Tight bounds on a problem of lines and intersections | 1992-06-25 | Paper |
| Counting \(k\)-projections of a point set | 1992-06-25 | Paper |
| Probing convex polygons with half-planes | 1991-01-01 | Paper |
| Reconstructing graphs from cut-set sizes | 1989-01-01 | Paper |
| On the Number of Furthest Neighbour Pairs in a Point Set | 1989-01-01 | Paper |
| Encroaching lists as a measure of presortedness | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3800154 | 1987-01-01 | Paper |
