Greg N. Frederickson

92 papers A* 23A 2B 1Journal 61Unranked 5
YearRankTypeTitle / Venue / Authors
2017 J jnl
Optimal Parametric Search for Path and Tree Partitioning.
CoRR
Greg N. Frederickson, Samson Zhou
2012 J jnl
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems.
Algorithmica
Greg N. Frederickson, Barry Wittman
2011 J jnl
On the Cost of Network Inference Mechanisms.
IEEE Trans. Parallel Distributed Syst.
Ethan Blanton, Sonia Fahmy, Greg N. Frederickson, Sriharsha Gangam
2011 J jnl
Speedup in the Traveling Repairman Problem with Constrained Time Windows
CoRR
Greg N. Frederickson, Barry Wittman
2011 J jnl
Two Multivehicle Routing Problems with Unit-Time Windows
CoRR
Greg N. Frederickson, Barry Wittman
2009 J jnl
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems
CoRR
Greg N. Frederickson, Barry Wittman
2009 A conf
On the Utility of Inference Mechanisms.
ICDCS
Ethan Blanton, Sonia Fahmy, Greg N. Frederickson
2009 J jnl
Speedup in the Traveling Repairman Problem with Unit Time Windows
CoRR
Greg N. Frederickson, Barry Wittman
2008 J jnl
A tree-covering problem arising in integrity of tree-structured data.
Inf. Process. Lett.
Mikhail J. Atallah, Greg N. Frederickson, Ashish Kundu
2007 — conf
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows.
APPROX-RANDOM
Greg N. Frederickson, Barry Wittman
2007 J jnl
Unexpected Twists in Geometric Dissections.
Graphs Comb.
Greg N. Frederickson
2006 J jnl
Efficient algorithms for robustness in resource allocation and scheduling problems.
Theor. Comput. Sci.
Greg N. Frederickson, Roberto Solis-Oba
2005 J jnl
Hinged dissection of polyominoes and polyforms.
Comput. Geom.
Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman
2003 — conf
Hinged Dissection of Polygons is Hard.
CCCG
Robert A. Hearn, Erik D. Demaine, Greg N. Frederickson
2002 — conf
Piano-Hinged Dissections: Now Let's Fold!
JCDCG
Greg N. Frederickson
2000 — conf
Geometric Dissections that Swing and Twist.
JCDCG
Greg N. Frederickson
1999 J jnl
Hinged Dissection of Polyominoes and Polyforms
CoRR
Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman
1999 J jnl
Increasing the Weight of Minimum Spanning Trees.
J. Algorithms
Greg N. Frederickson, Roberto Solis-Oba
1998 J jnl
Algorithms for Measuring Perturbability in Matroid Optimization.
Comb.
Greg N. Frederickson, Roberto Solis-Oba
1998 J jnl
Maintaining Regular Properties Dynamically in
Algorithmica
Greg N. Frederickson
1997 J jnl
A Data Structure for Dynamically Maintaining Rooted Trees.
J. Algorithms
Greg N. Frederickson
1997 J jnl
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees.
SIAM J. Comput.
Greg N. Frederickson
1997 A* conf
Efficient Algorithms for Robustness in Matroid Optimization.
SODA
Greg N. Frederickson, Roberto Solis-Oba
1997 J jnl
Strategic directions in research in theory of computing.
SIGACT News
Anne Condon, Faith E. Fich, Greg N. Frederickson, Andrew V. Goldberg, David S. Johnson, Michael C. Loui, Steven Mahaney, Prabhakar Raghavan, John E. Savage, Alan L. Selman, David B. Shmoys
1996 A* conf
Increasing the Weight of Minimum Spanning Trees.
SODA
Greg N. Frederickson, Roberto Solis-Oba
1996 J jnl
Searching Among Intervals and Compact Routing Tables.
Algorithmica
Greg N. Frederickson
1995 J jnl
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems.
J. Algorithms
Greg N. Frederickson
1994 J jnl
An NC Algorithm for Scheduling Unit-Time Jobs With Arbitrary Release Times and Deadlines.
SIAM J. Comput.
Greg N. Frederickson, Susan H. Rodger
1993 A* conf
A Data Structure for Dynamically Maintaining Rooted Trees.
SODA
Greg N. Frederickson
1993 J jnl
A Note on the Complexity of a Simple Transportation Problem.
SIAM J. Comput.
Greg N. Frederickson
1993 J jnl
An Optimal Algorithm for Selection in a Min-Heap
Inf. Comput.
Greg N. Frederickson
1993 J jnl
Nonpreemptive Ensemble Motion Planning on a Tree.
J. Algorithms
Greg N. Frederickson, D. J. Guan
1993 A* conf
Searching among Intervals and Compact Routing Tables.
ICALP
Greg N. Frederickson
1993 J jnl
Shortest Path Computations in Source-Deplanarized Graphs.
Inf. Process. Lett.
Greg N. Frederickson, Susanne E. Hambrusch, Hung-Yi Tu
1992 J jnl
Editor's Foreword Special Issue on Graph Algorithms.
Algorithmica
Greg N. Frederickson
1992 J jnl
Preemptive Ensemble Motion Planning on a Tree.
SIAM J. Comput.
Greg N. Frederickson, D. J. Guan
1992 A* ed.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA.
SODA
Greg N. Frederickson
1991 A* conf
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
FOCS
Greg N. Frederickson
1991 A* conf
Optimal Algorithms for Tree Partitioning.
SODA
Greg N. Frederickson
1991 B conf
Parametric Search and Locating Supply Centers in Trees.
WADS
Greg N. Frederickson
1991 J jnl
Planar Graph Decomposition and All Pairs Shortest Paths.
J. ACM
Greg N. Frederickson
1990 J jnl
A Distributed Shortest Path Algorithm for a Planar Network
Inf. Comput.
Greg N. Frederickson
1990 J jnl
A Faster Algorithm for the Maximum Weighted Tardiness Problem.
Inf. Process. Lett.
Malcolm C. Fields, Greg N. Frederickson
1990 J jnl
A New Approach to the Dynamic Maintaince of Maximal Points in a Plane.
Discret. Comput. Geom.
Greg N. Frederickson, Susan H. Rodger
1990 J jnl
Erratum: Generalized Selection and Ranking: Sorted Matrices.
SIAM J. Comput.
Greg N. Frederickson, Donald B. Johnson
1990 J jnl
Space-Efficient Message Routing in c-Decomposable Networks.
SIAM J. Comput.
Greg N. Frederickson, Ravi Janardan
1990 A* conf
The Information Theory Bound Is Tight for Selection in a Heap
STOC
Greg N. Frederickson
1989 J jnl
Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems.
SIAM J. Comput.
Greg N. Frederickson, Mandayam A. Srinivas
1989 J jnl
Efficient Message Routing in Planar Networks.
SIAM J. Comput.
Greg N. Frederickson, Ravi Janardan
1989 A* conf
Ensemble Motion Planning in Trees
FOCS
Greg N. Frederickson, D. J. Guan
1989 A* conf
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (Preliminary Version)
FOCS
Greg N. Frederickson
1988 J jnl
Designing Networks with Compact Routing Tables.
Algorithmica
Greg N. Frederickson, Ravi Janardan
1988 J jnl
Distributed Algorithms for Selection in Sets.
J. Comput. Syst. Sci.
Greg N. Frederickson
1988 J jnl
Sorting with Efficient Use of Special-Purpose Sorters.
Inf. Process. Lett.
Mikhail J. Atallah, Greg N. Frederickson, S. Rao Kosaraju
1988 J jnl
Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks.
IEEE Trans. Computers
Greg N. Frederickson, Ravi Janardan
1987 A* conf
A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract)
STOC
Greg N. Frederickson
1987 J jnl
Electing a leader in a synchronous ring.
J. ACM
Greg N. Frederickson, Nancy A. Lynch
1987 J jnl
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications.
SIAM J. Comput.
Greg N. Frederickson
1987 J jnl
On-line Updating of Solutions to a Class of Matroid Intersection Problems
Inf. Comput.
Greg N. Frederickson, Mandayan A. Srinivas
1987 J jnl
Upper Bounds for Time-Space Trade-Offs in Sorting and Selection.
J. Comput. Syst. Sci.
Greg N. Frederickson
1986 J jnl
A note on finding a maximum empty rectangle.
Discret. Appl. Math.
Mikhail J. Atallah, Greg N. Frederickson
1986 — conf
Breaking Symmetry in Synchronous Networks.
Aegean Workshop on Computing
Greg N. Frederickson, Nicola Santoro
1986 A* conf
Optimal Message Routing without Complete Routing Tables (preliminary version).
PODC
Greg N. Frederickson, Ravi Janardan
1986 A* conf
Separator-Based Strategies for Efficient Message Routing (Preliminary Version)
FOCS
Greg N. Frederickson, Ravi Janardan
1985 A conf
A Single Source Shortest Path Algorithm for a Planar Distributed Network.
STACS
Greg N. Frederickson
1985 J jnl
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications.
SIAM J. Comput.
Greg N. Frederickson
1985 J jnl
Implicit Data Structures for Weighted Elements
Inf. Control.
Greg N. Frederickson
1984 J jnl
A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors.
Math. Oper. Res.
Edward G. Coffman Jr., Greg N. Frederickson, George S. Lueker
1984 A* conf
Data Structures for On-Line Updating of Matroid Intersection Solutions (Preliminary Version)
STOC
Greg N. Frederickson, Mandayam A. Srinivas
1984 J jnl
Generalized Selection and Ranking: Sorted Matrices.
SIAM J. Comput.
Greg N. Frederickson, Donald B. Johnson
1984 J jnl
On Linear-Time Algorithms for Five-Coloring Planar Graphs.
Inf. Process. Lett.
Greg N. Frederickson
1984 J jnl
Recursively Rotated Orders and Implicit Data Structures: A Lower Bound.
Theor. Comput. Sci.
Greg N. Frederickson
1984 J jnl
Self-Organizing Heuristics for Implicit Data Structures.
SIAM J. Comput.
Greg N. Frederickson
1984 A* conf
The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring
STOC
Greg N. Frederickson, Nancy A. Lynch
1983 A* conf
Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version)
STOC
Greg N. Frederickson
1983 J jnl
Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures.
J. Algorithms
Greg N. Frederickson, Donald B. Johnson
1983 J jnl
Implicit Data Structures for the Dictionary Problem
J. ACM
Greg N. Frederickson
1983 J jnl
Scheduling Unit-Time Tasks With Integer Release Times and Deadlines.
Inf. Process. Lett.
Greg N. Frederickson
1983 A* conf
Shortest Path Problems in Planar Graphs (Preliminary Version)
FOCS
Greg N. Frederickson
1983 A* conf
Tradeoffs for Selection in Distributed Networks (Preliminary Version).
PODC
Greg N. Frederickson
1982 J jnl
On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems.
Theor. Comput. Sci.
Greg N. Frederickson, Joseph F. JáJá
1982 J jnl
The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns.
J. Comput. Syst. Sci.
Greg N. Frederickson, Donald B. Johnson
1981 J jnl
Approximation Algorithms for Several Graph Augmentation Problems.
SIAM J. Comput.
Greg N. Frederickson, Joseph F. JáJá
1981 A* conf
Implicit Data Structures for the Weighted Dictionary Problem (preliminary version)
FOCS
Greg N. Frederickson
1981 J jnl
Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan.
J. ACM
John L. Bruno, Peter J. Downey, Greg N. Frederickson
1980 A* conf
Generalized Selection and Ranking (Preliminary Version)
STOC
Greg N. Frederickson, Donald B. Johnson
1980 A* conf
Generating and Searching Sets Induced by Networks.
ICALP
Greg N. Frederickson, Donald B. Johnson
1980 A* conf
Implicit Data Structures with Fast Update (Preliminary Report)
FOCS
Greg N. Frederickson
1980 J jnl
Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms.
Inf. Process. Lett.
Greg N. Frederickson
1979 J jnl
Approximation Algorithms for Some Postman Problems.
J. ACM
Greg N. Frederickson
1978 J jnl
Approximation Algorithms for Some Routing Problems.
SIAM J. Comput.
Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim
1976 A* conf
Approximation Algorithms for some Routing Problems
FOCS
Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim