| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5077652 | 2022-05-18 | Paper |
| Weight Balancing on Boundaries and Skeletons | 2018-04-23 | Paper |
| Counting Circles Without Computing Them | 2017-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501850 | 2015-08-14 | Paper |
| Decision trees | 2015-05-07 | Paper |
| Order-preserving matching | 2014-03-13 | Paper |
| A Survey of the Game “Lights Out!” | 2013-09-13 | Paper |
| Computing minimum diameter color-spanning sets is hard | 2013-04-04 | Paper |
| An algorithmic analysis of the Honey-Bee game | 2012-10-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2887528 | 2012-06-01 | Paper |
| Edge Clique Partition of K 4-Free and Planar Graphs | 2011-11-11 | Paper |
| Densest k-Subgraph Approximation on Intersection Graphs | 2011-02-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4929404 | 2010-09-22 | Paper |
| Computing Minimum Diameter Color-Spanning Sets | 2010-09-07 | Paper |
| Extended Islands of Tractability for Parsimony Haplotyping | 2010-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3574138 | 2010-07-09 | Paper |
| Algorithms for core stability, core largeness, exactness, and extendability of flow games | 2010-02-26 | Paper |
| On the Camera Placement Problem | 2009-12-17 | Paper |
| Is the World Linear? | 2009-11-12 | Paper |
| Die another day | 2009-08-06 | Paper |
| Competitive Online Approximation of the Optimal Search Ratio | 2009-06-22 | Paper |
| Algorithms for Core Stability, Core Largeness, Exactness, and Extendability of Flow Games | 2009-03-06 | Paper |
| Approximating the Maximum Sharing Problem | 2009-02-17 | Paper |
| On Approximating the Maximum Simple Sharing Problem | 2008-04-24 | Paper |
| Traversing the Machining Graph | 2008-03-11 | Paper |
| Non-metric Multicommodity and Multilevel Facility Location | 2008-01-04 | Paper |
| Efficient Algorithms for k-Disjoint Paths Problems on DAGs | 2008-01-04 | Paper |
| Die Another Day | 2007-11-15 | Paper |
| Approximating the minimum weight weak vertex cover | 2007-01-09 | Paper |
| Online maintenance of \(k\)-medians and \(k\)-covers on a line | 2006-09-26 | Paper |
| Algorithms – ESA 2005 | 2006-06-27 | Paper |
| Algorithm Theory - SWAT 2004 | 2005-09-07 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| Fun-Sort -- or the chaos of unordered binary search | 2005-02-23 | Paper |
| Balanced scheduling toward loss-free packet queuing and delay fairness | 2004-12-02 | Paper |
| New results for online page replication | 2004-11-23 | Paper |
| Solitaire clobber | 2004-10-27 | Paper |
| Traveling salesmen in the presence of competition | 2004-10-27 | Paper |
| ONLINE ROUTING IN CONVEX SUBDIVISIONS | 2004-09-29 | Paper |
| Tight bounds on maximal and maximum matchings | 2004-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472479 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474098 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471640 | 2004-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4426350 | 2003-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417674 | 2003-07-29 | Paper |
| Decision trees: Old and new results. | 2003-01-14 | Paper |
| Optimal robot localization in trees | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536356 | 2002-10-13 | Paper |
| Limited bookmark randomized online algorithms for the paging problem | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2764034 | 2002-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4407717 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753734 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753936 | 2001-11-11 | Paper |
| A strong and easily computable separation bound for arithmetic expressions involving radicals | 2001-01-29 | Paper |
| On-line scheduling revisited | 2001-01-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218408 | 1998-11-11 | Paper |
| More Efficient Parallel Totally Monotone Matrix Searching | 1997-11-10 | Paper |
| Matching nuts and bolts faster | 1997-02-27 | Paper |
| A SIMPLE BALANCED SEARCH TREE WITH O(1) WORST-CASE UPDATE TIME | 1996-12-11 | Paper |
| A communication-randomness tradeoff for two-processor systems | 1995-05-28 | Paper |
| A lower bound for the worst case of bottom-up-heapsort | 1993-05-16 | Paper |
| Simultaneous inner and outer approximation of shapes | 1993-01-17 | Paper |
| Approximate motion planning and the complexity of the boundary of the union of simple geometric figures | 1993-01-17 | Paper |
| Communication complexity of multi-processor systems | 1989-01-01 | Paper |
