| 2008 |
|---|
| 79 | EE | Mikhail J. Atallah,
Greg N. Frederickson,
Ashish Kundu:
A tree-covering problem arising in integrity of tree-structured data.
Inf. Process. Lett. 109(1): 79-82 (2008) |
| 2007 |
|---|
| 78 | EE | Greg N. Frederickson,
Barry Wittman:
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems with Unit-Time Windows.
APPROX-RANDOM 2007: 119-133 |
| 2006 |
|---|
| 77 | EE | Greg N. Frederickson,
Roberto Solis-Oba:
Efficient algorithms for robustness in resource allocation and scheduling problems.
Theor. Comput. Sci. 352(1-3): 250-265 (2006) |
| 2005 |
|---|
| 76 | EE | Erik D. Demaine,
Martin L. Demaine,
David Eppstein,
Greg N. Frederickson,
Erich Friedman:
Hinged dissection of polyominoes and polyforms.
Comput. Geom. 31(3): 237-262 (2005) |
| 2003 |
|---|
| 75 | | Robert A. Hearn,
Erik D. Demaine,
Greg N. Frederickson:
Hinged Dissection of Polygons is Hard.
CCCG 2003: 98-102 |
| 2002 |
|---|
| 74 | EE | Greg N. Frederickson:
Piano-Hinged Dissections: Now Let's Fold!
JCDCG 2002: 159-171 |
| 2000 |
|---|
| 73 | EE | Greg N. Frederickson:
Geometric Dissections that Swing and Twist.
JCDCG 2000: 137-148 |
| 1999 |
|---|
| 72 | EE | Erik D. Demaine,
Martin L. Demaine,
David Eppstein,
Greg N. Frederickson,
Erich Friedman:
Hinged Dissection of Polyominoes and Polyforms
CoRR cs.CG/9907018: (1999) |
| 71 | | Greg N. Frederickson,
Roberto Solis-Oba:
Increasing the Weight of Minimum Spanning Trees.
J. Algorithms 33(2): 244-266 (1999) |
| 1998 |
|---|
| 70 | EE | Greg N. Frederickson:
Maintaining Regular Properties Dynamically in k-Terminal Graphs.
Algorithmica 22(3): 330-350 (1998) |
| 69 | EE | Greg N. Frederickson,
Roberto Solis-Oba:
Algorithms for Measuring Perturbability in Matroid Optimization.
Combinatorica 18(4): 503-518 (1998) |
| 1997 |
|---|
| 68 | | Greg N. Frederickson,
Roberto Solis-Oba:
Efficient Algorithms for Robustness in Matroid Optimization.
SODA 1997: 659-668 |
| 67 | | Greg N. Frederickson:
A Data Structure for Dynamically Maintaining Rooted Trees.
J. Algorithms 24(1): 37-65 (1997) |
| 66 | | Greg N. Frederickson:
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees.
SIAM J. Comput. 26(2): 484-538 (1997) |
| 1996 |
|---|
| 65 | | Greg N. Frederickson,
Roberto Solis-Oba:
Increasing the Weight of Minimum Spanning Trees.
SODA 1996: 539-546 |
| 64 | | Greg N. Frederickson:
Searching Among Intervals and Compact Routing Tables.
Algorithmica 15(5): 448-466 (1996) |
| 1995 |
|---|
| 63 | | Greg N. Frederickson:
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems.
J. Algorithms 19(1): 45-85 (1995) |
| 1994 |
|---|
| 62 | | Greg N. Frederickson,
Susan H. Rodger:
An NC Algorithm for Scheduling Unit-Time Jobs With Arbitrary Release Times and Deadlines.
SIAM J. Comput. 23(1): 185-211 (1994) |
| 1993 |
|---|
| 61 | | Greg N. Frederickson:
Searching among Intervals and Compact Routing Tables.
ICALP 1993: 28-39 |
| 60 | | Greg N. Frederickson:
A Data Structure for Dynamically Maintaining Rooted Trees.
SODA 1993: 175-184 |
| 59 | | Greg N. Frederickson:
An Optimal Algorithm for Selection in a Min-Heap
Inf. Comput. 104(2): 197-214 (1993) |
| 58 | | Greg N. Frederickson,
Susanne E. Hambrusch,
Hung-Yi Tu:
Shortest Path Computations in Source-Deplanarized Graphs.
Inf. Process. Lett. 47(2): 71-75 (1993) |
| 57 | | Greg N. Frederickson,
D. J. Guan:
Nonpreemptive Ensemble Motion Planning on a Tree.
J. Algorithms 15(1): 29-60 (1993) |
| 56 | | Greg N. Frederickson:
A Note on the Complexity of a Simple Transportation Problem.
SIAM J. Comput. 22(1): 57-61 (1993) |
| 1992 |
|---|
| 55 | | Greg N. Frederickson:
Editor's Foreword Special Issue on Graph Algorithms.
Algorithmica 7(5&6): 429-431 (1992) |
| 54 | | Greg N. Frederickson,
D. J. Guan:
Preemptive Ensemble Motion Planning on a Tree.
SIAM J. Comput. 21(6): 1130-1152 (1992) |
| 1991 |
|---|
| 53 | | Greg N. Frederickson:
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
FOCS 1991: 632-641 |
| 52 | | Greg N. Frederickson:
Optimal Algorithms for Tree Partitioning.
SODA 1991: 168-177 |
| 51 | | Greg N. Frederickson:
Parametric Search and Locating Supply Centers in Trees.
WADS 1991: 299-319 |
| 50 | EE | Greg N. Frederickson:
Planar Graph Decomposition and All Pairs Shortest Paths.
J. ACM 38(1): 162-204 (1991) |
| 1990 |
|---|
| 49 | | Greg N. Frederickson:
The Information Theory Bound Is Tight for Selection in a Heap
STOC 1990: 26-33 |
| 48 | | Greg N. Frederickson,
Susan H. Rodger:
A New Approach to the Dynamic Maintaince of Maximal Points in a Plane.
Discrete & Computational Geometry 5: 365-374 (1990) |
| 47 | | Greg N. Frederickson:
A Distributed Shortest Path Algorithm for a Planar Network
Inf. Comput. 86(2): 140-159 (1990) |
| 46 | | Malcolm C. Fields,
Greg N. Frederickson:
A Faster Algorithm for the Maximum Weighted Tardiness Problem.
Inf. Process. Lett. 36(1): 39-44 (1990) |
| 45 | | Greg N. Frederickson,
Ravi Janardan:
Space-Efficient Message Routing in c-Decomposable Networks.
SIAM J. Comput. 19(1): 164-181 (1990) |
| 44 | | Greg N. Frederickson,
Donald B. Johnson:
Erratum: Generalized Selection and Ranking: Sorted Matrices.
SIAM J. Comput. 19(1): 205-206 (1990) |
| 1989 |
|---|
| 43 | | Greg N. Frederickson:
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (Preliminary Version)
FOCS 1989: 448-453 |
| 42 | | Greg N. Frederickson,
D. J. Guan:
Ensemble Motion Planning in Trees
FOCS 1989: 66-71 |
| 41 | | Greg N. Frederickson,
Mandayam A. Srinivas:
Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems.
SIAM J. Comput. 18(1): 112-138 (1989) |
| 40 | | Greg N. Frederickson,
Ravi Janardan:
Efficient Message Routing in Planar Networks.
SIAM J. Comput. 18(4): 843-857 (1989) |
| 1988 |
|---|
| 39 | | Greg N. Frederickson,
Ravi Janardan:
Designing Networks with Compact Routing Tables.
Algorithmica 3: 171-190 (1988) |
| 38 | | Greg N. Frederickson,
Ravi Janardan:
Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks.
IEEE Trans. Computers 37(12): 1529-1540 (1988) |
| 37 | | Mikhail J. Atallah,
Greg N. Frederickson,
S. Rao Kosaraju:
Sorting with Efficient Use of Special-Purpose Sorters.
Inf. Process. Lett. 27(1): 13-15 (1988) |
| 36 | | Greg N. Frederickson:
Distributed Algorithms for Selection in Sets.
J. Comput. Syst. Sci. 37(3): 337-348 (1988) |
| 1987 |
|---|
| 35 | | Greg N. Frederickson:
A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract)
STOC 1987: 19-28 |
| 34 | | Greg N. Frederickson,
Mandayan A. Srinivas:
On-line Updating of Solutions to a Class of Matroid Intersection Problems
Inf. Comput. 74(2): 113-139 (1987) |
| 33 | EE | Greg N. Frederickson,
Nancy A. Lynch:
Electing a leader in a synchronous ring.
J. ACM 34(1): 98-115 (1987) |
| 32 | | Greg N. Frederickson:
Upper Bounds for Time-Space Trade-Offs in Sorting and Selection.
J. Comput. Syst. Sci. 34(1): 19-26 (1987) |
| 31 | | Greg N. Frederickson:
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications.
SIAM J. Comput. 16(6): 1004-1022 (1987) |
| 1986 |
|---|
| 30 | | Greg N. Frederickson,
Nicola Santoro:
Breaking Symmetry in Synchronous Networks.
Aegean Workshop on Computing 1986: 26-33 |
| 29 | | Greg N. Frederickson,
Ravi Janardan:
Separator-Based Strategies for Efficient Message Routing (Preliminary Version)
FOCS 1986: 428-437 |
| 28 | | Greg N. Frederickson,
Ravi Janardan:
Optimal Message Routing without Complete Routing Tables (preliminary version).
PODC 1986: 88-97 |
| 1985 |
|---|
| 27 | | Greg N. Frederickson:
A Single Source Shortest Path Algorithm for a Planar Distributed Network.
STACS 1985: 143-150 |
| 26 | | Greg N. Frederickson:
Implicit Data Structures for Weighted Elements
Information and Control 66(1/2): 61-82 (1985) |
| 25 | | Greg N. Frederickson:
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications.
SIAM J. Comput. 14(4): 781-798 (1985) |
| 1984 |
|---|
| 24 | | Greg N. Frederickson,
Mandayam A. Srinivas:
Data Structures for On-Line Updating of Matroid Intersection Solutions (Preliminary Version)
STOC 1984: 383-390 |
| 23 | | Greg N. Frederickson,
Nancy A. Lynch:
The Impact of Synchronous Communication on the Problem of Electing a Leader in a Ring
STOC 1984: 493-503 |
| 22 | | Greg N. Frederickson:
On Linear-Time Algorithms for Five-Coloring Planar Graphs.
Inf. Process. Lett. 19(5): 219-224 (1984) |
| 21 | | Greg N. Frederickson,
Donald B. Johnson:
Generalized Selection and Ranking: Sorted Matrices.
SIAM J. Comput. 13(1): 14-30 (1984) |
| 20 | | Greg N. Frederickson:
Self-Organizing Heuristics for Implicit Data Structures.
SIAM J. Comput. 13(2): 277-291 (1984) |
| 19 | | Greg N. Frederickson:
Recursively Rotated Orders and Implicit Data Structures: A Lower Bound.
Theor. Comput. Sci. 29: 75-85 (1984) |
| 1983 |
|---|
| 18 | | Greg N. Frederickson:
Shortest Path Problems in Planar Graphs (Preliminary Version)
FOCS 1983: 242-247 |
| 17 | | Greg N. Frederickson:
Tradeoffs for Selection in Distributed Networks (Preliminary Version).
PODC 1983: 154-160 |
| 16 | | Greg N. Frederickson:
Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version)
STOC 1983: 252-257 |
| 15 | | Greg N. Frederickson:
Scheduling Unit-Time Tasks With Integer Release Times and Deadlines.
Inf. Process. Lett. 16(4): 171-173 (1983) |
| 14 | EE | Greg N. Frederickson:
Implicit Data Structures for the Dictionary Problem
J. ACM 30(1): 80-94 (1983) |
| 13 | | Greg N. Frederickson,
Donald B. Johnson:
Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures.
J. Algorithms 4(1): 61-80 (1983) |
| 1982 |
|---|
| 12 | | Greg N. Frederickson,
Donald B. Johnson:
The Complexity of Selection and Ranking in X+Y and Matrices with Sorted Columns.
J. Comput. Syst. Sci. 24(2): 197-208 (1982) |
| 11 | | Greg N. Frederickson,
Joseph JáJá:
On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems.
Theor. Comput. Sci. 19: 189-201 (1982) |
| 1981 |
|---|
| 10 | | Greg N. Frederickson:
Implicit Data Structures for the Weighted Dictionary Problem (preliminary version)
FOCS 1981: 133-139 |
| 9 | EE | 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 28(1): 100-113 (1981) |
| 8 | | Greg N. Frederickson,
Joseph JáJá:
Approximation Algorithm for Several Graph Augmentation Problems.
SIAM J. Comput. 10(2): 270-283 (1981) |
| 1980 |
|---|
| 7 | | Greg N. Frederickson:
Implicit Data Structures with Fast Update (Preliminary Report)
FOCS 1980: 255-259 |
| 6 | | Greg N. Frederickson,
Donald B. Johnson:
Generating and Searching Sets Induced by Networks.
ICALP 1980: 221-233 |
| 5 | | Greg N. Frederickson,
Donald B. Johnson:
Generalized Selection and Ranking (Preliminary Version)
STOC 1980: 420-428 |
| 4 | | Greg N. Frederickson:
Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms.
Inf. Process. Lett. 11(4/5): 156-161 (1980) |
| 1979 |
|---|
| 3 | EE | Greg N. Frederickson:
Approximation Algorithms for Some Postman Problems.
J. ACM 26(3): 538-554 (1979) |
| 1978 |
|---|
| 2 | | Greg N. Frederickson,
Matthew S. Hecht,
Chul E. Kim:
Approximation Algorithms for Some Routing Problems.
SIAM J. Comput. 7(2): 178-193 (1978) |
| 1976 |
|---|
| 1 | | Greg N. Frederickson,
Matthew S. Hecht,
Chul E. Kim:
Approximation Algorithms for some Routing Problems
FOCS 1976: 216-227 |
