| Publication | Date of Publication | Type |
|---|
Hole dissections for planar figures
The Mathematical Gazette | 2021-11-18 | Paper |
Searching among intervals and compact routing tables
Automata, Languages and Programming | 2019-03-29 | Paper |
Ernest Irving Freese's Geometric Transformations
| 2018-01-11 | Paper |
scientific article; zbMATH DE number 6472643 (Why is no real title available?)
| 2015-08-14 | Paper |
The proof is in the pizza
Mathematics Magazine | 2012-08-31 | Paper |
Folding polyominoes from one level to two
The College Mathematics Journal | 2012-07-18 | Paper |
Bracing regular polygons as we race into the future
The College Mathematics Journal | 2012-07-18 | Paper |
Approximation algorithms for the traveling repairman and speeding deliveryman problems
Algorithmica | 2012-04-26 | Paper |
Casting light on cube dissections
Mathematics Magazine | 2011-12-07 | Paper |
Hugo Hadwiger's influence on geometric dissections with special properties
Elemente der Mathematik | 2010-12-23 | Paper |
scientific article; zbMATH DE number 5810078 (Why is no real title available?)
| 2010-11-04 | Paper |
A tree-covering problem arising in integrity of tree-structured data
Information Processing Letters | 2010-06-09 | Paper |
Discrete and Computational Geometry
Lecture Notes in Computer Science | 2010-02-05 | Paper |
The heptagon to the square, and other wild twists
The Mathematical Intelligencer | 2009-04-20 | Paper |
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
Designing a Table Both Swinging and Stable
The College Mathematics Journal | 2009-02-11 | Paper |
Reflecting Well: Dissections of Two Regular Polygons to One
| 2008-08-12 | Paper |
Unexpected twists in geometric dissections
Graphs and Combinatorics | 2007-07-19 | Paper |
Piano-hinged dissections. Time to fold!
| 2007-01-11 | Paper |
Efficient algorithms for robustness in resource allocation and scheduling problems
Theoretical Computer Science | 2006-03-24 | Paper |
Hinged dissection of polyominoes and polyforms
Computational Geometry | 2005-08-05 | Paper |
scientific article; zbMATH DE number 1896100 (Why is no real title available?)
| 2003-04-09 | Paper |
scientific article; zbMATH DE number 1789347 (Why is no real title available?)
| 2002-08-27 | Paper |
scientific article; zbMATH DE number 1786506 (Why is no real title available?)
| 2002-08-21 | Paper |
Geometric dissections now swing and twist.
The Mathematical Intelligencer | 2001-11-18 | Paper |
Increasing the Weight of Minimum Spanning Trees
Journal of Algorithms | 2000-03-19 | Paper |
Algorithms for measuring perturbality in matroid optimization
Combinatorica | 1999-09-14 | Paper |
Maintaining regular properties dynamically in \(k\)-terminal graphs
Algorithmica | 1999-06-22 | Paper |
scientific article; zbMATH DE number 1229395 (Why is no real title available?)
| 1998-12-06 | Paper |
A Data Structure for Dynamically Maintaining Rooted Trees
Journal of Algorithms | 1997-08-25 | Paper |
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
SIAM Journal on Computing | 1997-05-26 | Paper |
Searching among intervals and compact routing tables
Algorithmica | 1996-05-27 | Paper |
scientific article; zbMATH DE number 871953 (Why is no real title available?)
| 1996-04-28 | Paper |
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems
Journal of Algorithms | 1996-04-11 | Paper |
Planar graph decomposition and all pairs shortest paths
Journal of the ACM | 1994-11-13 | Paper |
An NC Algorithm for Scheduling Unit-Time Jobs with Arbitrary Release Times and Deadlines
SIAM Journal on Computing | 1994-03-27 | Paper |
scientific article; zbMATH DE number 437542 (Why is no real title available?)
| 1993-12-15 | Paper |
scientific article; zbMATH DE number 432817 (Why is no real title available?)
| 1993-10-20 | Paper |
Shortest path computations in source-deplanarized graphs
Information Processing Letters | 1993-10-17 | Paper |
An optimal algorithm for selection in a min-heap
Information and Computation | 1993-08-30 | Paper |
scientific article; zbMATH DE number 177557 (Why is no real title available?)
| 1993-05-18 | Paper |
A Note on the Complexity of a Simple Transportation Problem
SIAM Journal on Computing | 1993-05-16 | Paper |
Space-Efficient Message Routing inc-Decomposable Networks
SIAM Journal on Computing | 1990-01-01 | Paper |
A faster algorithm for the maximum weighted tardiness problem
Information Processing Letters | 1990-01-01 | Paper |
A new approach to the dynamic maintenance of maximal points in a plane
Discrete & Computational Geometry | 1990-01-01 | Paper |
A distributed shortest path algorithm for a planar network
Information and Computation | 1990-01-01 | Paper |
Efficient Message Routing in Planar Networks
SIAM Journal on Computing | 1989-01-01 | Paper |
Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
SIAM Journal on Computing | 1989-01-01 | Paper |
Designing networks with compact routing tables
Algorithmica | 1988-01-01 | Paper |
Planar linear arrangements of outerplanar graphs
IEEE Transactions on Circuits and Systems | 1988-01-01 | Paper |
Space-efficient and fault-tolerant message routing in outerplanar networks
IEEE Transactions on Computers | 1988-01-01 | Paper |
Distributed algorithms for selection in sets
Journal of Computer and System Sciences | 1988-01-01 | Paper |
Electing a leader in a synchronous ring
Journal of the ACM | 1987-01-01 | Paper |
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications
SIAM Journal on Computing | 1987-01-01 | Paper |
Upper bounds for time-space trade-offs in sorting and selection
Journal of Computer and System Sciences | 1987-01-01 | Paper |
On-line updating of solutions to a class of matroid intersection problems
Information and Computation | 1987-01-01 | Paper |
A note on finding a maximum empty rectangle
Discrete Applied Mathematics | 1986-01-01 | Paper |
scientific article; zbMATH DE number 3967924 (Why is no real title available?)
| 1986-01-01 | Paper |
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
SIAM Journal on Computing | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3976361 (Why is no real title available?)
| 1985-01-01 | Paper |
Implicit data structures for weighted elements
Information and Control | 1985-01-01 | Paper |
Generalized Selection and Ranking: Sorted Matrices
SIAM Journal on Computing | 1984-01-01 | Paper |
A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors
Mathematics of Operations Research | 1984-01-01 | Paper |
Self-Organizing Heuristics for Implicit Data Structures
SIAM Journal on Computing | 1984-01-01 | Paper |
Recursively rotated orders and implicit data structures: A lower bound
Theoretical Computer Science | 1984-01-01 | Paper |
On linear-time algorithms for five-coloring planar graphs
Information Processing Letters | 1984-01-01 | Paper |
Scheduling unit-time tasks with integer release times and deadlines
Information Processing Letters | 1983-01-01 | Paper |
Finding kth paths and p-centers by generating and searching good data structures
Journal of Algorithms | 1983-01-01 | Paper |
Implicit Data Structures for the Dictionary Problem
Journal of the ACM | 1983-01-01 | Paper |
The complexity of selection and ranking in X+Y and matrices with sorted columns
Journal of Computer and System Sciences | 1982-01-01 | Paper |
On the relationship between the biconnectivity augmentation and traveling salesman problems
Theoretical Computer Science | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3768966 (Why is no real title available?)
| 1982-01-01 | Paper |
Approximation Algorithms for Several Graph Augmentation Problems
SIAM Journal on Computing | 1981-01-01 | Paper |
Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan
Journal of the ACM | 1981-01-01 | Paper |
scientific article; zbMATH DE number 3709597 (Why is no real title available?)
| 1980-01-01 | Paper |
Probabilistic analysis for simple one- and two-dimensional bin packing algorithms
Information Processing Letters | 1980-01-01 | Paper |
Approximation Algorithms for Some Postman Problems
Journal of the ACM | 1979-01-01 | Paper |
scientific article; zbMATH DE number 3626160 (Why is no real title available?)
| 1979-01-01 | Paper |
scientific article; zbMATH DE number 3523579 (Why is no real title available?)
| 1975-01-01 | Paper |
scientific article; zbMATH DE number 3562001 (Why is no real title available?)
| 1972-01-01 | Paper |
