Approximation Algorithms for Some Routing Problems. - Greg N. Frederickson; Matthew S. Hecht; Chul E. Kim (SIAM J. Comput., 1978)

Approximation Algorithms for Some Postman Problems. - Greg N. Frederickson (J. ACM, 1979)

Implicit Data Structures with Fast Update (Preliminary Report) - Greg N. Frederickson (FOCS, 1980)

Generating and Searching Sets Induced by Networks. - Greg N. Frederickson; Donald B. Johnson 001 (ICALP, 1980)

Generalized Selection and Ranking (Preliminary Version) - Greg N. Frederickson; Donald B. Johnson 001 (STOC, 1980)

Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms. - Greg N. Frederickson (Inf. Process. Lett., 1980)

Implicit Data Structures for the Weighted Dictionary Problem (preliminary version) - Greg N. Frederickson (FOCS, 1981)

Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan. - John L. Bruno; Peter J. Downey; Greg N. Frederickson (J. ACM, 1981)

Approximation Algorithms for Several Graph Augmentation Problems. - Greg N. Frederickson; Joseph F. JáJá (SIAM J. Comput., 1981)

The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns. - Greg N. Frederickson; Donald B. Johnson 001 (J. Comput. Syst. Sci., 1982)

On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems. - Greg N. Frederickson; Joseph F. JáJá (Theor. Comput. Sci., 1982)

Shortest Path Problems in Planar Graphs (Preliminary Version) - Greg N. Frederickson (FOCS, 1983)

Tradeoffs for Selection in Distributed Networks (Preliminary Version). - Greg N. Frederickson (PODC, 1983)

Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version) - Greg N. Frederickson (STOC, 1983)

Scheduling Unit-Time Tasks With Integer Release Times and Deadlines. - Greg N. Frederickson (Inf. Process. Lett., 1983)

Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures. - Greg N. Frederickson; Donald B. Johnson 001 (J. Algorithms, 1983)

Implicit Data Structures for the Dictionary Problem - Greg N. Frederickson (J. ACM, 1983)

The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring - Greg N. Frederickson; Nancy A. Lynch (STOC, 1984)

Data Structures for On-Line Updating of Matroid Intersection Solutions (Preliminary Version) - Greg N. Frederickson; Mandayam A. Srinivas (STOC, 1984)

On Linear-Time Algorithms for Five-Coloring Planar Graphs. - Greg N. Frederickson (Inf. Process. Lett., 1984)

A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors. - Edward G. Coffman Jr.; Greg N. Frederickson; George S. Lueker (Math. Oper. Res., 1984)

Self-Organizing Heuristics for Implicit Data Structures. - Greg N. Frederickson (SIAM J. Comput., 1984)

Generalized Selection and Ranking: Sorted Matrices. - Greg N. Frederickson; Donald B. Johnson 001 (SIAM J. Comput., 1984)

Recursively Rotated Orders and Implicit Data Structures: A Lower Bound. - Greg N. Frederickson (Theor. Comput. Sci., 1984)

A Single Source Shortest Path Algorithm for a Planar Distributed Network. - Greg N. Frederickson (STACS, 1985)

Implicit Data Structures for Weighted Elements - Greg N. Frederickson (Inf. Control., 1985)

Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications. - Greg N. Frederickson (SIAM J. Comput., 1985)

Breaking Symmetry in Synchronous Networks. - Greg N. Frederickson; Nicola Santoro (Aegean Workshop on Computing, 1986)

Separator-Based Strategies for Efficient Message Routing (Preliminary Version) - Greg N. Frederickson; Ravi Janardan (FOCS, 1986)

Optimal Message Routing without Complete Routing Tables (preliminary version). - Greg N. Frederickson; Ravi Janardan (PODC, 1986)

A note on finding a maximum empty rectangle. - Mikhail J. Atallah; Greg N. Frederickson (Discret. Appl. Math., 1986)

A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract) - Greg N. Frederickson (STOC, 1987)

Electing a leader in a synchronous ring. - Greg N. Frederickson; Nancy A. Lynch (J. ACM, 1987)

Upper Bounds for Time-Space Trade-Offs in Sorting and Selection. - Greg N. Frederickson (J. Comput. Syst. Sci., 1987)

Fast Algorithms for Shortest Paths in Planar Graphs, with Applications. - Greg N. Frederickson (SIAM J. Comput., 1987)

On-line Updating of Solutions to a Class of Matroid Intersection Problems - Greg N. Frederickson; Mandayan A. Srinivas (Inf. Comput., 1987)

Designing Networks with Compact Routing Tables. - Greg N. Frederickson; Ravi Janardan (Algorithmica, 1988)

Sorting with Efficient Use of Special-Purpose Sorters. - Mikhail J. Atallah; Greg N. Frederickson; S. Rao Kosaraju (Inf. Process. Lett., 1988)

Distributed Algorithms for Selection in Sets. - Greg N. Frederickson (J. Comput. Syst. Sci., 1988)

Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks. - Greg N. Frederickson; Ravi Janardan (IEEE Trans. Computers, 1988)

Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (Preliminary Version) - Greg N. Frederickson (FOCS, 1989)

Ensemble Motion Planning in Trees - Greg N. Frederickson; D. J. Guan (FOCS, 1989)

Efficient Message Routing in Planar Networks. - Greg N. Frederickson; Ravi Janardan (SIAM J. Comput., 1989)

Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems. - Greg N. Frederickson; Mandayam A. Srinivas (SIAM J. Comput., 1989)

The Information Theory Bound Is Tight for Selection in a Heap - Greg N. Frederickson (STOC, 1990)

A New Approach to the Dynamic Maintaince of Maximal Points in a Plane. - Greg N. Frederickson; Susan H. Rodger (Discret. Comput. Geom., 1990)

A Faster Algorithm for the Maximum Weighted Tardiness Problem. - Malcolm C. Fields; Greg N. Frederickson (Inf. Process. Lett., 1990)

Space-Efficient Message Routing in c-Decomposable Networks. - Greg N. Frederickson; Ravi Janardan (SIAM J. Comput., 1990)

Erratum: Generalized Selection and Ranking: Sorted Matrices. - Greg N. Frederickson; Donald B. Johnson 001 (SIAM J. Comput., 1990)

A Distributed Shortest Path Algorithm for a Planar Network - Greg N. Frederickson (Inf. Comput., 1990)

Optimal Algorithms for Tree Partitioning. - Greg N. Frederickson (SODA, 1991)

Parametric Search and Locating Supply Centers in Trees. - Greg N. Frederickson (WADS, 1991)

Planar Graph Decomposition and All Pairs Shortest Paths. - Greg N. Frederickson (J. ACM, 1991)

Editor's Foreword Special Issue on Graph Algorithms. - Greg N. Frederickson (Algorithmica, 1992)

Preemptive Ensemble Motion Planning on a Tree. - Greg N. Frederickson; D. J. Guan (SIAM J. Comput., 1992)

Shortest Path Computations in Source-Deplanarized Graphs. - Greg N. Frederickson; Susanne E. Hambrusch; Hung-Yi Tu (Inf. Process. Lett., 1993)

Nonpreemptive Ensemble Motion Planning on a Tree. - Greg N. Frederickson; D. J. Guan (J. Algorithms, 1993)

A Note on the Complexity of a Simple Transportation Problem. - Greg N. Frederickson (SIAM J. Comput., 1993)

An Optimal Algorithm for Selection in a Min-Heap - Greg N. Frederickson (Inf. Comput., 1993)

An NC Algorithm for Scheduling Unit-Time Jobs With Arbitrary Release Times and Deadlines. - Greg N. Frederickson; Susan H. Rodger (SIAM J. Comput., 1994)

Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems. - Greg N. Frederickson (J. Algorithms, 1995)

Searching Among Intervals and Compact Routing Tables. - Greg N. Frederickson (Algorithmica, 1996)

Efficient Algorithms for Robustness in Matroid Optimization. - Greg N. Frederickson; Roberto Solis-Oba (SODA, 1997)

A Data Structure for Dynamically Maintaining Rooted Trees. - Greg N. Frederickson (J. Algorithms, 1997)

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

Strategic directions in research in theory of computing. - Anne Condon; Faith E. Fich; Greg N. Frederickson; Andrew V. Goldberg; David S. Johnson 001; Michael C. Loui; Steven Mahaney; Prabhakar Raghavan; John E. Savage; Alan L. Selman; David B. Shmoys (SIGACT News, 1997)

Maintaining Regular Properties Dynamically in k-Terminal Graphs. - Greg N. Frederickson (Algorithmica, 1998)

Algorithms for Measuring Perturbability in Matroid Optimization. - Greg N. Frederickson; Roberto Solis-Oba (Comb., 1998)

Increasing the Weight of Minimum Spanning Trees. - Greg N. Frederickson; Roberto Solis-Oba (J. Algorithms, 1999)

Geometric Dissections that Swing and Twist. - Greg N. Frederickson (JCDCG, 2000)

Piano-Hinged Dissections: Now Let's Fold! - Greg N. Frederickson (JCDCG, 2002)

Hinged Dissection of Polygons is Hard. - Robert A. Hearn; Erik D. Demaine; Greg N. Frederickson (CCCG, 2003)

Hinged dissection of polyominoes and polyforms. - Erik D. Demaine; Martin L. Demaine; David Eppstein; Greg N. Frederickson; Erich Friedman (Comput. Geom., 2005)

Efficient algorithms for robustness in resource allocation and scheduling problems. - Greg N. Frederickson; Roberto Solis-Oba (Theor. Comput. Sci., 2006)

Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows. - Greg N. Frederickson; Barry Wittman (APPROX-RANDOM, 2007)

Unexpected Twists in Geometric Dissections. - Greg N. Frederickson (Graphs Comb., 2007)

A tree-covering problem arising in integrity of tree-structured data. - Mikhail J. Atallah; Greg N. Frederickson; Ashish Kundu (Inf. Process. Lett., 2008)

On the Utility of Inference Mechanisms. - Ethan Blanton; Sonia Fahmy; Greg N. Frederickson (ICDCS, 2009)

Speedup in the Traveling Repairman Problem with Unit Time Windows - Greg N. Frederickson; Barry Wittman (CoRR, 2009)

Two Multivehicle Routing Problems with Unit-Time Windows - Greg N. Frederickson; Barry Wittman (CoRR, 2011)

Speedup in the Traveling Repairman Problem with Constrained Time Windows - Greg N. Frederickson; Barry Wittman (CoRR, 2011)

On the Cost of Network Inference Mechanisms. - Ethan Blanton; Sonia Fahmy; Greg N. Frederickson; Sriharsha Gangam (IEEE Trans. Parallel Distributed Syst., 2011)

Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems. - Greg N. Frederickson; Barry Wittman (Algorithmica, 2012)

Optimal Parametric Search for Path and Tree Partitioning. - Greg N. Frederickson; Samson Zhou (CoRR, 2017)