default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGreg N. Frederickson
Person information
- affiliation: Purdue University, West Lafayette, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[i6]Greg N. Frederickson, Samson Zhou:
Optimal Parametric Search for Path and Tree Partitioning. CoRR abs/1711.00599 (2017)- 2012
- [j55]Greg N. Frederickson, Barry Wittman:
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems. Algorithmica 62(3-4): 1198-1221 (2012) - 2011
- [j54]Ethan Blanton, Sonia Fahmy
, Greg N. Frederickson, Sriharsha Gangam:
On the Cost of Network Inference Mechanisms. IEEE Trans. Parallel Distributed Syst. 22(4): 662-672 (2011) - [i5]Greg N. Frederickson, Barry Wittman:
Two Multivehicle Routing Problems with Unit-Time Windows. CoRR abs/1101.3953 (2011) - [i4]Greg N. Frederickson, Barry Wittman:
Speedup in the Traveling Repairman Problem with Constrained Time Windows. CoRR abs/1101.3960 (2011)
2000 – 2009
- 2009
- [c30]Ethan Blanton, Sonia Fahmy, Greg N. Frederickson:
On the Utility of Inference Mechanisms. ICDCS 2009: 256-263 - [i3]Greg N. Frederickson, Barry Wittman:
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems. CoRR abs/0905.4444 (2009) - [i2]Greg N. Frederickson, Barry Wittman:
Speedup in the Traveling Repairman Problem with Unit Time Windows. CoRR abs/0907.5372 (2009) - 2008
- [j53]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
- [j52]Greg N. Frederickson:
Unexpected Twists in Geometric Dissections. Graphs Comb. 23(Supplement-1): 245-258 (2007) - [c29]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
- [j51]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
- [j50]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
- [c28]Robert A. Hearn, Erik D. Demaine, Greg N. Frederickson:
Hinged Dissection of Polygons is Hard. CCCG 2003: 98-102 - 2002
- [c27]Greg N. Frederickson:
Piano-Hinged Dissections: Now Let's Fold! JCDCG 2002: 159-171 - 2000
- [c26]Greg N. Frederickson:
Geometric Dissections that Swing and Twist. JCDCG 2000: 137-148
1990 – 1999
- 1999
- [j49]Greg N. Frederickson, Roberto Solis-Oba:
Increasing the Weight of Minimum Spanning Trees. J. Algorithms 33(2): 244-266 (1999) - [i1]Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman:
Hinged Dissection of Polyominoes and Polyforms. CoRR cs.CG/9907018 (1999) - 1998
- [j48]Greg N. Frederickson:
Maintaining Regular Properties Dynamically in k-Terminal Graphs. Algorithmica 22(3): 330-350 (1998) - [j47]Greg N. Frederickson, Roberto Solis-Oba:
Algorithms for Measuring Perturbability in Matroid Optimization. Comb. 18(4): 503-518 (1998) - 1997
- [j46]Greg N. Frederickson:
A Data Structure for Dynamically Maintaining Rooted Trees. J. Algorithms 24(1): 37-65 (1997) - [j45]Greg N. Frederickson:
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees. SIAM J. Comput. 26(2): 484-538 (1997) - [j44]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:
Strategic directions in research in theory of computing. SIGACT News 28(3): 75-93 (1997) - [c25]Greg N. Frederickson, Roberto Solis-Oba:
Efficient Algorithms for Robustness in Matroid Optimization. SODA 1997: 659-668 - 1996
- [j43]Greg N. Frederickson:
Searching Among Intervals and Compact Routing Tables. Algorithmica 15(5): 448-466 (1996) - [c24]Greg N. Frederickson, Roberto Solis-Oba:
Increasing the Weight of Minimum Spanning Trees. SODA 1996: 539-546 - 1995
- [j42]Greg N. Frederickson:
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems. J. Algorithms 19(1): 45-85 (1995) - 1994
- [j41]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
- [j40]Greg N. Frederickson:
An Optimal Algorithm for Selection in a Min-Heap. Inf. Comput. 104(2): 197-214 (1993) - [j39]Greg N. Frederickson, Susanne E. Hambrusch, Hung-Yi Tu:
Shortest Path Computations in Source-Deplanarized Graphs. Inf. Process. Lett. 47(2): 71-75 (1993) - [j38]Greg N. Frederickson, D. J. Guan:
Nonpreemptive Ensemble Motion Planning on a Tree. J. Algorithms 15(1): 29-60 (1993) - [j37]Greg N. Frederickson:
A Note on the Complexity of a Simple Transportation Problem. SIAM J. Comput. 22(1): 57-61 (1993) - [c23]Greg N. Frederickson:
Searching among Intervals and Compact Routing Tables. ICALP 1993: 28-39 - [c22]Greg N. Frederickson:
A Data Structure for Dynamically Maintaining Rooted Trees. SODA 1993: 175-184 - 1992
- [j36]Greg N. Frederickson:
Editor's Foreword Special Issue on Graph Algorithms. Algorithmica 7(5&6): 429-431 (1992) - [j35]Greg N. Frederickson, D. J. Guan:
Preemptive Ensemble Motion Planning on a Tree. SIAM J. Comput. 21(6): 1130-1152 (1992) - [e1]Greg N. Frederickson:
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 27-29 January 1992, Orlando, Florida, USA. ACM/SIAM 1992, ISBN 0-89791-466-X [contents] - 1991
- [j34]Greg N. Frederickson:
Planar Graph Decomposition and All Pairs Shortest Paths. J. ACM 38(1): 162-204 (1991) - [c21]Greg N. Frederickson:
Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees. FOCS 1991: 632-641 - [c20]Greg N. Frederickson:
Optimal Algorithms for Tree Partitioning. SODA 1991: 168-177 - [c19]Greg N. Frederickson:
Parametric Search and Locating Supply Centers in Trees. WADS 1991: 299-319 - 1990
- [j33]Greg N. Frederickson, Susan H. Rodger:
A New Approach to the Dynamic Maintaince of Maximal Points in a Plane. Discret. Comput. Geom. 5: 365-374 (1990) - [j32]Greg N. Frederickson:
A Distributed Shortest Path Algorithm for a Planar Network. Inf. Comput. 86(2): 140-159 (1990) - [j31]Malcolm C. Fields, Greg N. Frederickson:
A Faster Algorithm for the Maximum Weighted Tardiness Problem. Inf. Process. Lett. 36(1): 39-44 (1990) - [j30]Greg N. Frederickson, Ravi Janardan:
Space-Efficient Message Routing in c-Decomposable Networks. SIAM J. Comput. 19(1): 164-181 (1990) - [j29]Greg N. Frederickson, Donald B. Johnson:
Erratum: Generalized Selection and Ranking: Sorted Matrices. SIAM J. Comput. 19(1): 205-206 (1990) - [c18]Greg N. Frederickson:
The Information Theory Bound Is Tight for Selection in a Heap. STOC 1990: 26-33
1980 – 1989
- 1989
- [j28]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) - [j27]Greg N. Frederickson, Ravi Janardan:
Efficient Message Routing in Planar Networks. SIAM J. Comput. 18(4): 843-857 (1989) - [c17]Greg N. Frederickson, D. J. Guan:
Ensemble Motion Planning in Trees. FOCS 1989: 66-71 - [c16]Greg N. Frederickson:
Using Cellular Graph Embeddings in Solving All Pairs Shortest Paths Problems (Preliminary Version). FOCS 1989: 448-453 - 1988
- [j26]Greg N. Frederickson, Ravi Janardan:
Designing Networks with Compact Routing Tables. Algorithmica 3: 171-190 (1988) - [j25]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) - [j24]Greg N. Frederickson:
Distributed Algorithms for Selection in Sets. J. Comput. Syst. Sci. 37(3): 337-348 (1988) - [j23]Greg N. Frederickson, Ravi Janardan:
Space-Efficient and Fault-Tolerant Message Routing in Outerplanar Networks. IEEE Trans. Computers 37(12): 1529-1540 (1988) - 1987
- [j22]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) - [j21]Greg N. Frederickson, Nancy A. Lynch:
Electing a leader in a synchronous ring. J. ACM 34(1): 98-115 (1987) - [j20]Greg N. Frederickson:
Upper Bounds for Time-Space Trade-Offs in Sorting and Selection. J. Comput. Syst. Sci. 34(1): 19-26 (1987) - [j19]Greg N. Frederickson:
Fast Algorithms for Shortest Paths in Planar Graphs, with Applications. SIAM J. Comput. 16(6): 1004-1022 (1987) - [c15]Greg N. Frederickson:
A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract). STOC 1987: 19-28 - 1986
- [j18]Mikhail J. Atallah, Greg N. Frederickson:
A note on finding a maximum empty rectangle. Discret. Appl. Math. 13(1): 87-91 (1986) - [c14]Greg N. Frederickson, Nicola Santoro:
Breaking Symmetry in Synchronous Networks. Aegean Workshop on Computing 1986: 26-33 - [c13]Greg N. Frederickson, Ravi Janardan:
Separator-Based Strategies for Efficient Message Routing (Preliminary Version). FOCS 1986: 428-437 - [c12]Greg N. Frederickson, Ravi Janardan:
Optimal Message Routing without Complete Routing Tables (preliminary version). PODC 1986: 88-97 - 1985
- [j17]Greg N. Frederickson:
Implicit Data Structures for Weighted Elements. Inf. Control. 66(1/2): 61-82 (1985) - [j16]Greg N. Frederickson:
Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications. SIAM J. Comput. 14(4): 781-798 (1985) - [c11]Greg N. Frederickson:
A Single Source Shortest Path Algorithm for a Planar Distributed Network. STACS 1985: 143-150 - 1984
- [j15]Greg N. Frederickson:
On Linear-Time Algorithms for Five-Coloring Planar Graphs. Inf. Process. Lett. 19(5): 219-224 (1984) - [j14]Edward G. Coffman Jr., Greg N. Frederickson, George S. Lueker:
A Note on Expected Makespans for Largest-First Sequences of Independent Tasks on Two Processors. Math. Oper. Res. 9(2): 260-266 (1984) - [j13]Greg N. Frederickson, Donald B. Johnson:
Generalized Selection and Ranking: Sorted Matrices. SIAM J. Comput. 13(1): 14-30 (1984) - [j12]Greg N. Frederickson:
Self-Organizing Heuristics for Implicit Data Structures. SIAM J. Comput. 13(2): 277-291 (1984) - [j11]Greg N. Frederickson:
Recursively Rotated Orders and Implicit Data Structures: A Lower Bound. Theor. Comput. Sci. 29: 75-85 (1984) - [c10]Greg N. Frederickson, Mandayam A. Srinivas:
Data Structures for On-Line Updating of Matroid Intersection Solutions (Preliminary Version). STOC 1984: 383-390 - [c9]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 - 1983
- [j10]Greg N. Frederickson:
Scheduling Unit-Time Tasks With Integer Release Times and Deadlines. Inf. Process. Lett. 16(4): 171-173 (1983) - [j9]Greg N. Frederickson:
Implicit Data Structures for the Dictionary Problem. J. ACM 30(1): 80-94 (1983) - [j8]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) - [c8]Greg N. Frederickson:
Shortest Path Problems in Planar Graphs (Preliminary Version). FOCS 1983: 242-247 - [c7]Greg N. Frederickson:
Tradeoffs for Selection in Distributed Networks (Preliminary Version). PODC 1983: 154-160 - [c6]Greg N. Frederickson:
Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version). STOC 1983: 252-257 - 1982
- [j7]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) - [j6]Greg N. Frederickson, Joseph F. JáJá:
On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems. Theor. Comput. Sci. 19: 189-201 (1982) - 1981
- [j5]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) - [j4]Greg N. Frederickson, Joseph F. JáJá:
Approximation Algorithms for Several Graph Augmentation Problems. SIAM J. Comput. 10(2): 270-283 (1981) - [c5]Greg N. Frederickson:
Implicit Data Structures for the Weighted Dictionary Problem (preliminary version). FOCS 1981: 133-139 - 1980
- [j3]Greg N. Frederickson:
Probabilistic Analysis for Simple One- and Two-Dimensional Bin Packing Algorithms. Inf. Process. Lett. 11(4/5): 156-161 (1980) - [c4]Greg N. Frederickson:
Implicit Data Structures with Fast Update (Preliminary Report). FOCS 1980: 255-259 - [c3]Greg N. Frederickson, Donald B. Johnson:
Generating and Searching Sets Induced by Networks. ICALP 1980: 221-233 - [c2]Greg N. Frederickson, Donald B. Johnson:
Generalized Selection and Ranking (Preliminary Version). STOC 1980: 420-428
1970 – 1979
- 1979
- [j2]Greg N. Frederickson:
Approximation Algorithms for Some Postman Problems. J. ACM 26(3): 538-554 (1979) - 1978
- [j1]Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim:
Approximation Algorithms for Some Routing Problems. SIAM J. Comput. 7(2): 178-193 (1978) - 1976
- [c1]Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim:
Approximation Algorithms for some Routing Problems. FOCS 1976: 216-227
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
