Greg N. Frederickson

Samson Zhou

CoRR, 2017

2012

Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems.

[BibT_eX]

[DOI]

Algorithmica, 2012

2011

On the Cost of Network Inference Mechanisms.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2011

Speedup in the Traveling Repairman Problem with Constrained Time Windows

[BibT_eX]

[DOI]

CoRR, 2011

Two Multivehicle Routing Problems with Unit-Time Windows

[BibT_eX]

[DOI]

CoRR, 2011

2009

Speedup in the Traveling Repairman Problem with Unit Time Windows

[BibT_eX]

[DOI]

CoRR, 2009

On the Utility of Inference Mechanisms.

[BibT_eX]

[DOI]

Ethan Blanton

Sonia Fahmy

Proceedings of the 29th IEEE International Conference on Distributed Computing Systems (ICDCS 2009), 2009

2008

A tree-covering problem arising in integrity of tree-structured data.

[BibT_eX]

[DOI]

Mikhail J. Atallah

Ashish Kundu

Inf. Process. Lett., 2008

2007

Unexpected Twists in Geometric Dissections.

[BibT_eX]

[DOI]

Graphs Comb., 2007

Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2007

2006

Efficient algorithms for robustness in resource allocation and scheduling problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

2005

Hinged dissection of polyominoes and polyforms.

[BibT_eX]

[DOI]

Comput. Geom., 2005

2003

Hinged Dissection of Polygons is Hard.

[BibT_eX]

[DOI]

Robert A. Hearn

Erik D. Demaine

Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002

Piano-Hinged Dissections: Now Let's Fold!

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2000

Geometric Dissections that Swing and Twist.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1999

Increasing the Weight of Minimum Spanning Trees.

[BibT_eX]

[DOI]

J. Algorithms, 1999

1998

Algorithms for Measuring Perturbability in Matroid Optimization.

[BibT_eX]

[DOI]

Comb., 1998

Maintaining Regular Properties Dynamically in <i>k</i>-Terminal Graphs.

[BibT_eX]

[DOI]

Algorithmica, 1998

1997

Strategic directions in research in theory of computing.

[BibT_eX]

[DOI]

SIGACT News, 1997

Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees.

[BibT_eX]

[DOI]

SIAM J. Comput., 1997

A Data Structure for Dynamically Maintaining Rooted Trees.

[BibT_eX]

[DOI]

J. Algorithms, 1997

Efficient Algorithms for Robustness in Matroid Optimization.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996

Searching Among Intervals and Compact Routing Tables.

[BibT_eX]

[DOI]

Algorithmica, 1996

1995

Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems.

[BibT_eX]

[DOI]

J. Algorithms, 1995

1994

An NC Algorithm for Scheduling Unit-Time Jobs With Arbitrary Release Times and Deadlines.

[BibT_eX]

[DOI]

Susan H. Rodger

SIAM J. Comput., 1994

1993

An Optimal Algorithm for Selection in a Min-Heap

[BibT_eX]

[DOI]

Inf. Comput., June, 1993

A Note on the Complexity of a Simple Transportation Problem.

[BibT_eX]

[DOI]

SIAM J. Comput., 1993

Nonpreemptive Ensemble Motion Planning on a Tree.

[BibT_eX]

[DOI]

D. J. Guan

J. Algorithms, 1993

Shortest Path Computations in Source-Deplanarized Graphs.

[BibT_eX]

[DOI]

Susanne E. Hambrusch

Hung-Yi Tu

Inf. Process. Lett., 1993

1992

Preemptive Ensemble Motion Planning on a Tree.

[BibT_eX]

[DOI]

D. J. Guan

SIAM J. Comput., 1992

Editor's Foreword Special Issue on Graph Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 1992

1991

Planar Graph Decomposition and All Pairs Shortest Paths.

[BibT_eX]

[DOI]

J. ACM, 1991

Parametric Search and Locating Supply Centers in Trees.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 1991

Optimal Algorithms for Tree Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990

A Distributed Shortest Path Algorithm for a Planar Network

[BibT_eX]

[DOI]

Inf. Comput., June, 1990

Erratum: Generalized Selection and Ranking: Sorted Matrices.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

Space-Efficient Message Routing in c-Decomposable Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 1990

A Faster Algorithm for the Maximum Weighted Tardiness Problem.

[BibT_eX]

[DOI]

Malcolm C. Fields

Inf. Process. Lett., 1990

A New Approach to the Dynamic Maintaince of Maximal Points in a Plane.

[BibT_eX]

[DOI]

Susan H. Rodger

Discret. Comput. Geom., 1990

The Information Theory Bound Is Tight for Selection in a Heap

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989

Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems.

[BibT_eX]

[DOI]

Mandayam A. Srinivas

SIAM J. Comput., 1989

Efficient Message Routing in Planar Networks.

[BibT_eX]

[DOI]

SIAM J. Comput., 1989

Ensemble Motion Planning in Trees

[BibT_eX]

[DOI]

D. J. Guan

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

1988

Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1988

Distributed Algorithms for Selection in Sets.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1988

Sorting with Efficient Use of Special-Purpose Sorters.

[BibT_eX]

[DOI]

Mikhail J. Atallah

S. Rao Kosaraju

Inf. Process. Lett., 1988

Designing Networks with Compact Routing Tables.

[BibT_eX]

[DOI]

Algorithmica, 1988

1987

On-line Updating of Solutions to a Class of Matroid Intersection Problems

[BibT_eX]

[DOI]

Mandayan A. Srinivas

Inf. Comput., August, 1987

Fast Algorithms for Shortest Paths in Planar Graphs, with Applications.

[BibT_eX]

[DOI]

SIAM J. Comput., 1987

Upper Bounds for Time-Space Trade-Offs in Sorting and Selection.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1987

Electing a leader in a synchronous ring.

[BibT_eX]

[DOI]

Nancy A. Lynch

J. ACM, 1987

A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986

A note on finding a maximum empty rectangle.

[BibT_eX]

[DOI]

Mikhail J. Atallah

Discret. Appl. Math., 1986

Optimal Message Routing without Complete Routing Tables (preliminary version).

[BibT_eX]

[DOI]

Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, 1986

Separator-Based Strategies for Efficient Message Routing (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Breaking Symmetry in Synchronous Networks.

[BibT_eX]

[DOI]

Nicola Santoro

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications.

[BibT_eX]

[DOI]

SIAM J. Comput., 1985

Implicit Data Structures for Weighted Elements

[BibT_eX]

[DOI]

Inf. Control., 1985

A Single Source Shortest Path Algorithm for a Planar Distributed Network.

[BibT_eX]

[DOI]

Proceedings of the STACS 85, 1985

1984

Recursively Rotated Orders and Implicit Data Structures: A Lower Bound.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1984

Generalized Selection and Ranking: Sorted Matrices.

[BibT_eX]

[DOI]

SIAM J. Comput., 1984

Self-Organizing Heuristics for Implicit Data Structures.

[BibT_eX]

[DOI]

SIAM J. Comput., 1984

A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors.

[BibT_eX]

[DOI]

Edward G. Coffman Jr.

George S. Lueker

Math. Oper. Res., 1984

On Linear-Time Algorithms for Five-Coloring Planar Graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

Data Structures for On-Line Updating of Matroid Intersection Solutions (Preliminary Version)

[BibT_eX]

[DOI]

Mandayam A. Srinivas

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring

[BibT_eX]

[DOI]

Nancy A. Lynch

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983

Implicit Data Structures for the Dictionary Problem

[BibT_eX]

[DOI]

J. ACM, January, 1983

Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures.

[BibT_eX]

[DOI]

J. Algorithms, 1983

Scheduling Unit-Time Tasks With Integer Release Times and Deadlines.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1983

Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Tradeoffs for Selection in Distributed Networks (Preliminary Version).

[BibT_eX]

[DOI]

Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, 1983

Shortest Path Problems in Planar Graphs (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982

On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems.

[BibT_eX]

[DOI]

Joseph F. JáJá

Theor. Comput. Sci., 1982

The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1982

1981

Approximation Algorithms for Several Graph Augmentation Problems.

[BibT_eX]

[DOI]

Joseph F. JáJá

SIAM J. Comput., 1981

Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan.

[BibT_eX]

[DOI]

John L. Bruno

Peter J. Downey

J. ACM, 1981

Implicit Data Structures for the Weighted Dictionary Problem (preliminary version)

[BibT_eX]

[DOI]

Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980

Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1980

Generalized Selection and Ranking (Preliminary Version)

[BibT_eX]

[DOI]

Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

Generating and Searching Sets Induced by Networks.

[BibT_eX]

[DOI]

Proceedings of the Automata, 1980

Implicit Data Structures with Fast Update (Preliminary Report)

[BibT_eX]

[DOI]

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

Approximation Algorithms for Some Postman Problems.

[BibT_eX]

[DOI]

J. ACM, 1979

1978

Approximation Algorithms for Some Routing Problems.

[BibT_eX]

[DOI]