Greg N. Frederickson

Affiliations:
  • Purdue University, West Lafayette, USA


According to our database1, Greg N. Frederickson authored at least 84 papers between 1978 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Optimal Parametric Search for Path and Tree Partitioning.
CoRR, 2017

2012
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems.
Algorithmica, 2012

2011
On the Cost of Network Inference Mechanisms.
IEEE Trans. Parallel Distributed Syst., 2011

Speedup in the Traveling Repairman Problem with Constrained Time Windows
CoRR, 2011

Two Multivehicle Routing Problems with Unit-Time Windows
CoRR, 2011

2009
Speedup in the Traveling Repairman Problem with Unit Time Windows
CoRR, 2009

On the Utility of Inference Mechanisms.
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.
Inf. Process. Lett., 2008

2007
Unexpected Twists in Geometric Dissections.
Graphs Comb., 2007

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

2006
Efficient algorithms for robustness in resource allocation and scheduling problems.
Theor. Comput. Sci., 2006

2005
Hinged dissection of polyominoes and polyforms.
Comput. Geom., 2005

2003
Hinged Dissection of Polygons is Hard.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Piano-Hinged Dissections: Now Let's Fold!
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

2000
Geometric Dissections that Swing and Twist.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000

1999
Increasing the Weight of Minimum Spanning Trees.
J. Algorithms, 1999

1998
Algorithms for Measuring Perturbability in Matroid Optimization.
Comb., 1998

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

1997
Strategic directions in research in theory of computing.
SIGACT News, 1997

Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees.
SIAM J. Comput., 1997

A Data Structure for Dynamically Maintaining Rooted Trees.
J. Algorithms, 1997

Efficient Algorithms for Robustness in Matroid Optimization.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1996
Searching Among Intervals and Compact Routing Tables.
Algorithmica, 1996

1995
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems.
J. Algorithms, 1995

1994
An NC Algorithm for Scheduling Unit-Time Jobs With Arbitrary Release Times and Deadlines.
SIAM J. Comput., 1994

1993
An Optimal Algorithm for Selection in a Min-Heap
Inf. Comput., June, 1993

A Note on the Complexity of a Simple Transportation Problem.
SIAM J. Comput., 1993

Nonpreemptive Ensemble Motion Planning on a Tree.
J. Algorithms, 1993

Shortest Path Computations in Source-Deplanarized Graphs.
Inf. Process. Lett., 1993

1992
Preemptive Ensemble Motion Planning on a Tree.
SIAM J. Comput., 1992

Editor's Foreword Special Issue on Graph Algorithms.
Algorithmica, 1992

1991
Planar Graph Decomposition and All Pairs Shortest Paths.
J. ACM, 1991

Parametric Search and Locating Supply Centers in Trees.
Proceedings of the Algorithms and Data Structures, 1991

Optimal Algorithms for Tree Partitioning.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990
A Distributed Shortest Path Algorithm for a Planar Network
Inf. Comput., June, 1990

Erratum: Generalized Selection and Ranking: Sorted Matrices.
SIAM J. Comput., 1990

Space-Efficient Message Routing in c-Decomposable Networks.
SIAM J. Comput., 1990

A Faster Algorithm for the Maximum Weighted Tardiness Problem.
Inf. Process. Lett., 1990

A New Approach to the Dynamic Maintaince of Maximal Points in a Plane.
Discret. Comput. Geom., 1990

The Information Theory Bound Is Tight for Selection in a Heap
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.
SIAM J. Comput., 1989

Efficient Message Routing in Planar Networks.
SIAM J. Comput., 1989

Ensemble Motion Planning in Trees
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)
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.
IEEE Trans. Computers, 1988

Distributed Algorithms for Selection in Sets.
J. Comput. Syst. Sci., 1988

Sorting with Efficient Use of Special-Purpose Sorters.
Inf. Process. Lett., 1988

Designing Networks with Compact Routing Tables.
Algorithmica, 1988

1987
On-line Updating of Solutions to a Class of Matroid Intersection Problems
Inf. Comput., August, 1987

Fast Algorithms for Shortest Paths in Planar Graphs, with Applications.
SIAM J. Comput., 1987

Upper Bounds for Time-Space Trade-Offs in Sorting and Selection.
J. Comput. Syst. Sci., 1987

Electing a leader in a synchronous ring.
J. ACM, 1987

A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract)
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986
A note on finding a maximum empty rectangle.
Discret. Appl. Math., 1986

Optimal Message Routing without Complete Routing Tables (preliminary version).
Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, 1986

Separator-Based Strategies for Efficient Message Routing (Preliminary Version)
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Breaking Symmetry in Synchronous Networks.
Proceedings of the VLSI Algorithms and Architectures, 1986

1985
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications.
SIAM J. Comput., 1985

Implicit Data Structures for Weighted Elements
Inf. Control., 1985

A Single Source Shortest Path Algorithm for a Planar Distributed Network.
Proceedings of the STACS 85, 1985

1984
Recursively Rotated Orders and Implicit Data Structures: A Lower Bound.
Theor. Comput. Sci., 1984

Generalized Selection and Ranking: Sorted Matrices.
SIAM J. Comput., 1984

Self-Organizing Heuristics for Implicit Data Structures.
SIAM J. Comput., 1984

A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors.
Math. Oper. Res., 1984

On Linear-Time Algorithms for Five-Coloring Planar Graphs.
Inf. Process. Lett., 1984

Data Structures for On-Line Updating of Matroid Intersection Solutions (Preliminary Version)
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
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983
Implicit Data Structures for the Dictionary Problem
J. ACM, January, 1983

Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures.
J. Algorithms, 1983

Scheduling Unit-Time Tasks With Integer Release Times and Deadlines.
Inf. Process. Lett., 1983

Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version)
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Tradeoffs for Selection in Distributed Networks (Preliminary Version).
Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, 1983

Shortest Path Problems in Planar Graphs (Preliminary Version)
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983

1982
On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems.
Theor. Comput. Sci., 1982

The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns.
J. Comput. Syst. Sci., 1982

1981
Approximation Algorithms for Several Graph Augmentation Problems.
SIAM J. Comput., 1981

Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan.
J. ACM, 1981

Implicit Data Structures for the Weighted Dictionary Problem (preliminary version)
Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, 1981

1980
Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms.
Inf. Process. Lett., 1980

Generalized Selection and Ranking (Preliminary Version)
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

Generating and Searching Sets Induced by Networks.
Proceedings of the Automata, 1980

Implicit Data Structures with Fast Update (Preliminary Report)
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979
Approximation Algorithms for Some Postman Problems.
J. ACM, 1979

1978
Approximation Algorithms for Some Routing Problems.
SIAM J. Comput., 1978


  Loading...