| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Greg N. Frederickson, Barry Wittman |
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems.  |
Algorithmica  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Ethan Blanton, Sonia Fahmy, Greg N. Frederickson, Sriharsha Gangam |
On the Cost of Network Inference Mechanisms.  |
IEEE Trans. Parallel Distrib. Syst.  |
2011 |
DBLP DOI BibTeX RDF |
delay inference, Internet measurement |
| 1 | Greg N. Frederickson, Barry Wittman |
Speedup in the Traveling Repairman Problem with Constrained Time Windows  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Greg N. Frederickson, Barry Wittman |
Two Multivehicle Routing Problems with Unit-Time Windows  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Greg N. Frederickson, Barry Wittman |
Speedup in the Traveling Repairman Problem with Unit Time Windows  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Greg N. Frederickson, Barry Wittman |
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ethan Blanton, Sonia Fahmy, Greg N. Frederickson |
On the Utility of Inference Mechanisms.  |
ICDCS  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikhail J. Atallah, Greg N. Frederickson, Ashish Kundu |
A tree-covering problem arising in integrity of tree-structured data.  |
Inf. Process. Lett.  |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Barry Wittman |
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows.  |
APPROX-RANDOM  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Roberto Solis-Oba |
Efficient algorithms for robustness in resource allocation and scheduling problems.  |
Theor. Comput. Sci.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman |
Hinged dissection of polyominoes and polyforms.  |
Comput. Geom.  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert A. Hearn, Erik D. Demaine, Greg N. Frederickson |
Hinged Dissection of Polygons is Hard.  |
CCCG  |
2003 |
DBLP BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Piano-Hinged Dissections: Now Let's Fold!  |
JCDCG  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Geometric Dissections that Swing and Twist.  |
JCDCG  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Roberto Solis-Oba |
Increasing the Weight of Minimum Spanning Trees.  |
J. Algorithms  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman |
Hinged Dissection of Polyominoes and Polyforms  |
CoRR  |
1999 |
DBLP BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Maintaining Regular Properties Dynamically in k-Terminal Graphs.  |
Algorithmica  |
1998 |
DBLP DOI BibTeX RDF |
Dynamic graph operation, k -Terminal graph, Tree-decomposable graph, t -Topology tree. Key words, Dynamic graph operation, k -Terminal graph, Tree-decomposable graph, t -Topology tree, Data structures, Data structures, Analysis of algorithms, Analysis of algorithms |
| 1 | Greg N. Frederickson, Roberto Solis-Oba |
Algorithms for Measuring Perturbability in Matroid Optimization.  |
Combinatorica  |
1998 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 05B35, 0504, 68R05 |
| 1 | Greg N. Frederickson |
A Data Structure for Dynamically Maintaining Rooted Trees.  |
J. Algorithms  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne Condon, Faith 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 |
Strategic directions in research in theory of computing.  |
SIGACT News  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees.  |
SIAM J. Comput.  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Roberto Solis-Oba |
Efficient Algorithms for Robustness in Matroid Optimization.  |
SODA  |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Searching Among Intervals and Compact Routing Tables.  |
Algorithmica  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Roberto Solis-Oba |
Increasing the Weight of Minimum Spanning Trees.  |
SODA  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems.  |
J. Algorithms  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Susan H. Rodger |
An NC Algorithm for Scheduling Unit-Time Jobs With Arbitrary Release Times and Deadlines.  |
SIAM J. Comput.  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Susanne E. Hambrusch, Hung-Yi Tu |
Shortest Path Computations in Source-Deplanarized Graphs.  |
Inf. Process. Lett.  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
An Optimal Algorithm for Selection in a Min-Heap  |
Inf. Comput.  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, D. J. Guan |
Nonpreemptive Ensemble Motion Planning on a Tree.  |
J. Algorithms  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
A Note on the Complexity of a Simple Transportation Problem.  |
SIAM J. Comput.  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
A Data Structure for Dynamically Maintaining Rooted Trees.  |
SODA  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Searching among Intervals and Compact Routing Tables.  |
ICALP  |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Editor's Foreword Special Issue on Graph Algorithms.  |
Algorithmica  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, D. J. Guan |
Preemptive Ensemble Motion Planning on a Tree.  |
SIAM J. Comput.  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson (eds.) |
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida.  |
SODA  |
1992 |
DBLP BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Planar Graph Decomposition and All Pairs Shortest Paths.  |
J. ACM  |
1991 |
DBLP DOI BibTeX RDF |
succinct encoding, approximation algorithm, NP-completeness, planar graph, graph embedding, all pairs shortest paths, outerplanar graph, compact routing table |
| 1 | Greg N. Frederickson |
Optimal Algorithms for Tree Partitioning.  |
SODA  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Parametric Search and Locating Supply Centers in Trees.  |
WADS  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees  |
FOCS  |
1991 |
DBLP DOI BibTeX RDF |
ambivalent data structures, dynamic maintenance, dynamic 2-edge-connectivity, k smallest spanning trees, weighted undirected graph, embedded planar graph, query, edges, vertices |
| 1 | Malcolm C. Fields, Greg N. Frederickson |
A Faster Algorithm for the Maximum Weighted Tardiness Problem.  |
Inf. Process. Lett.  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
A Distributed Shortest Path Algorithm for a Planar Network  |
Inf. Comput.  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Susan H. Rodger |
A New Approach to the Dynamic Maintaince of Maximal Points in a Plane.  |
Discrete & Computational Geometry  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Donald B. Johnson |
Erratum: Generalized Selection and Ranking: Sorted Matrices.  |
SIAM J. Comput.  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Ravi Janardan |
Space-Efficient Message Routing in c-Decomposable Networks.  |
SIAM J. Comput.  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
The Information Theory Bound Is Tight for Selection in a Heap  |
STOC  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Mandayam A. Srinivas |
Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems.  |
SIAM J. Comput.  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Ravi Janardan |
Efficient Message Routing in Planar Networks.  |
SIAM J. Comput.  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, D. J. Guan |
Ensemble Motion Planning in Trees  |
FOCS  |
1989 |
DBLP DOI BibTeX RDF |
ensemble motion planning, unit capacity vehicle, minimum cost transportation, nontrivial connected components, initial vertex, route, approximation algorithms, trees, NP-hard, directed graph, objects, edges, vertices, destination, performance ratio |
| 1 | Greg N. Frederickson |
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (Preliminary Version)  |
FOCS  |
1989 |
DBLP DOI BibTeX RDF |
topological embedding, cellular graph embeddings, shortest path information, time complexity, shortest paths problems |
| 1 | Mikhail J. Atallah, Greg N. Frederickson, S. Rao Kosaraju |
Sorting with Efficient Use of Special-Purpose Sorters.  |
Inf. Process. Lett.  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Ravi Janardan |
Designing Networks with Compact Routing Tables.  |
Algorithmica  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Ravi Janardan |
Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks.  |
IEEE Trans. Computers  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Distributed Algorithms for Selection in Sets.  |
J. Comput. Syst. Sci.  |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Mandayan A. Srinivas |
On-line Updating of Solutions to a Class of Matroid Intersection Problems  |
Inf. Comput.  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Nancy A. Lynch |
Electing a leader in a synchronous ring.  |
J. ACM  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Upper Bounds for Time-Space Trade-Offs in Sorting and Selection.  |
J. Comput. Syst. Sci.  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications.  |
SIAM J. Comput.  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract)  |
STOC  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Ravi Janardan |
Optimal Message Routing without Complete Routing Tables (preliminary version).  |
PODC  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Nicola Santoro |
Breaking Symmetry in Synchronous Networks.  |
Aegean Workshop on Computing  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Ravi Janardan |
Separator-Based Strategies for Efficient Message Routing (Preliminary Version)  |
FOCS  |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Implicit Data Structures for Weighted Elements  |
Information and Control  |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications.  |
SIAM J. Comput.  |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
A Single Source Shortest Path Algorithm for a Planar Distributed Network.  |
STACS  |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
On Linear-Time Algorithms for Five-Coloring Planar Graphs.  |
Inf. Process. Lett.  |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Recursively Rotated Orders and Implicit Data Structures: A Lower Bound.  |
Theor. Comput. Sci.  |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Donald B. Johnson |
Generalized Selection and Ranking: Sorted Matrices.  |
SIAM J. Comput.  |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Self-Organizing Heuristics for Implicit Data Structures.  |
SIAM J. Comput.  |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Nancy A. Lynch |
The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring  |
STOC  |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Mandayam A. Srinivas |
Data Structures for On-Line Updating of Matroid Intersection Solutions (Preliminary Version)  |
STOC  |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Scheduling Unit-Time Tasks With Integer Release Times and Deadlines.  |
Inf. Process. Lett.  |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Donald B. Johnson |
Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures.  |
J. Algorithms  |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Implicit Data Structures for the Dictionary Problem  |
J. ACM  |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Tradeoffs for Selection in Distributed Networks (Preliminary Version).  |
PODC  |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Shortest Path Problems in Planar Graphs (Preliminary Version)  |
FOCS  |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version)  |
STOC  |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Joseph JáJá |
On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems.  |
Theor. Comput. Sci.  |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Donald B. Johnson |
The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns.  |
J. Comput. Syst. Sci.  |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | John L. Bruno, Peter J. Downey, Greg N. Frederickson |
Sequencing Tasks with Exponential Service Times to Minimize the Expected Flow Time or Makespan.  |
J. ACM  |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Joseph JáJá |
Approximation Algorithms for Several Graph Augmentation Problems.  |
SIAM J. Comput.  |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Implicit Data Structures for the Weighted Dictionary Problem (preliminary version)  |
FOCS  |
1981 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms.  |
Inf. Process. Lett.  |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Donald B. Johnson |
Generating and Searching Sets Induced by Networks.  |
ICALP  |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Implicit Data Structures with Fast Update (Preliminary Report)  |
FOCS  |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Donald B. Johnson |
Generalized Selection and Ranking (Preliminary Version)  |
STOC  |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson |
Approximation Algorithms for Some Postman Problems.  |
J. ACM  |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim |
Approximation Algorithms for Some Routing Problems.  |
SIAM J. Comput.  |
1978 |
DBLP DOI BibTeX RDF |
|
| 1 | Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim |
Approximation Algorithms for some Routing Problems  |
FOCS  |
1976 |
DBLP DOI BibTeX RDF |
|