| Publication | Date of Publication | Type |
|---|
| Hole dissections for planar figures | 2021-11-18 | Paper |
| Searching among intervals and compact routing tables | 2019-03-29 | Paper |
| Ernest Irving Freese's Geometric Transformations | 2018-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501845 | 2015-08-14 | Paper |
| The Proof Is in the Pizza | 2012-08-31 | Paper |
| Folding Polyominoes from One Level to Two | 2012-07-18 | Paper |
| Bracing Regular Polygons As We Race into the Future | 2012-07-18 | Paper |
| Approximation algorithms for the traveling repairman and speeding deliveryman problems | 2012-04-26 | Paper |
| Casting Light on Cube Dissections | 2011-12-07 | Paper |
| Hugo Hadwiger's influence on geometric dissections with special properties | 2010-12-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3053053 | 2010-11-04 | Paper |
| A tree-covering problem arising in integrity of tree-structured data | 2010-06-09 | Paper |
| Discrete and Computational Geometry | 2010-02-05 | Paper |
| The heptagon to the square, and other wild twists | 2009-04-20 | Paper |
| Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows | 2009-02-17 | Paper |
| Designing a Table Both Swinging and Stable | 2009-02-11 | Paper |
| Reflecting Well: Dissections of Two Regular Polygons to One | 2008-08-12 | Paper |
| Unexpected twists in geometric dissections | 2007-07-19 | Paper |
| Piano-hinged dissections. Time to fold! | 2007-01-11 | Paper |
| Efficient algorithms for robustness in resource allocation and scheduling problems | 2006-03-24 | Paper |
| Hinged dissection of polyominoes and polyforms | 2005-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4803989 | 2003-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548816 | 2002-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547799 | 2002-08-21 | Paper |
| Geometric dissections now swing and twist. | 2001-11-18 | Paper |
| Increasing the Weight of Minimum Spanning Trees | 2000-03-19 | Paper |
| Algorithms for measuring perturbality in matroid optimization | 1999-09-14 | Paper |
| Maintaining regular properties dynamically in \(k\)-terminal graphs | 1999-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222032 | 1998-12-06 | Paper |
| A Data Structure for Dynamically Maintaining Rooted Trees | 1997-08-25 | Paper |
| Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees | 1997-05-26 | Paper |
| Searching among intervals and compact routing tables | 1996-05-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875228 | 1996-04-28 | Paper |
| Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems | 1996-04-11 | Paper |
| Planar graph decomposition and all pairs shortest paths | 1994-11-13 | Paper |
| An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines | 1994-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140419 | 1993-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138951 | 1993-10-20 | Paper |
| Shortest path computations in source-deplanarized graphs | 1993-10-17 | Paper |
| An optimal algorithm for selection in a min-heap | 1993-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037428 | 1993-05-18 | Paper |
| A Note on the Complexity of a Simple Transportation Problem | 1993-05-16 | Paper |
| Space-Efficient Message Routing inc-Decomposable Networks | 1990-01-01 | Paper |
| A faster algorithm for the maximum weighted tardiness problem | 1990-01-01 | Paper |
| A new approach to the dynamic maintenance of maximal points in a plane | 1990-01-01 | Paper |
| A distributed shortest path algorithm for a planar network | 1990-01-01 | Paper |
| Efficient Message Routing in Planar Networks | 1989-01-01 | Paper |
| Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems | 1989-01-01 | Paper |
| Designing networks with compact routing tables | 1988-01-01 | Paper |
| Planar linear arrangements of outerplanar graphs | 1988-01-01 | Paper |
| Space-efficient and fault-tolerant message routing in outerplanar networks | 1988-01-01 | Paper |
| Distributed algorithms for selection in sets | 1988-01-01 | Paper |
| Electing a leader in a synchronous ring | 1987-01-01 | Paper |
| Fast Algorithms for Shortest Paths in Planar Graphs, with Applications | 1987-01-01 | Paper |
| Upper bounds for time-space trade-offs in sorting and selection | 1987-01-01 | Paper |
| On-line updating of solutions to a class of matroid intersection problems | 1987-01-01 | Paper |
| A note on finding a maximum empty rectangle | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3735086 | 1986-01-01 | Paper |
| Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3741076 | 1985-01-01 | Paper |
| Implicit data structures for weighted elements | 1985-01-01 | Paper |
| Generalized Selection and Ranking: Sorted Matrices | 1984-01-01 | Paper |
| A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors | 1984-01-01 | Paper |
| Self-Organizing Heuristics for Implicit Data Structures | 1984-01-01 | Paper |
| Recursively rotated orders and implicit data structures: A lower bound | 1984-01-01 | Paper |
| On linear-time algorithms for five-coloring planar graphs | 1984-01-01 | Paper |
| Scheduling unit-time tasks with integer release times and deadlines | 1983-01-01 | Paper |
| Finding kth paths and p-centers by generating and searching good data structures | 1983-01-01 | Paper |
| Implicit Data Structures for the Dictionary Problem | 1983-01-01 | Paper |
| The complexity of selection and ranking in X+Y and matrices with sorted columns | 1982-01-01 | Paper |
| On the relationship between the biconnectivity augmentation and traveling salesman problems | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3949968 | 1982-01-01 | Paper |
| Approximation Algorithms for Several Graph Augmentation Problems | 1981-01-01 | Paper |
| Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3901005 | 1980-01-01 | Paper |
| Probabilistic analysis for simple one- and two-dimensional bin packing algorithms | 1980-01-01 | Paper |
| Approximation Algorithms for Some Postman Problems | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4188364 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4101843 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4134503 | 1972-01-01 | Paper |
