Greg N. Frederickson
Impact in
-
- Computational Geometry and Mesh Generation
-
- Vehicle Routing Optimization Methods
- Optimization and Packing Problems
Papers in
-
- Computational Geometry and Mesh Generation 16
- Co-authors
- D. Barton JohnsonChul E. KimMatthew S. HechtRavi JanardanJoseph F. JáJáNancy LynchRoberto Solis-ObaD.J. Guan
- Journals
- SIAM Journal on Computing (12 papers)Algorithmica (5 papers)Journal of Algorithms (5 papers)Journal of the ACM (5 papers)Theoretical Computer Science (3 papers)
- Partner nations
- United StatesCanadaGermany
In The Last Decade
Greg N. Frederickson
101 papers receiving 2.5k citations
Peers
Comparison fields: 5 of 87
- Computer Graphics and Computer-Aided Design 448
- Industrial and Manufacturing Engineering 762
- Computational Theory and Mathematics 1.1k
- Computer Networks and Communications 1.3k
- Signal Processing 258
Countries citing papers authored by Greg N. Frederickson
This map shows the geographic impact of Greg N. Frederickson's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Greg N. Frederickson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Greg N. Frederickson more than expected).
Fields of papers citing papers by Greg N. Frederickson
This network shows the impact of papers produced by Greg N. Frederickson. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Greg N. Frederickson. The network helps show where Greg N. Frederickson may publish in the future.
Co-authors
The 25 scholars most cited alongside Greg N. Frederickson, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 2012 | 0 | |
| 2 | My Parade of Algorithmic Mathematical Art | 2012 | 0 |
| 3 | 2005 | 22 | |
| 4 | Hinged Dissection of Polygons is Hard | 2003 | 4 |
| 5 | 1997 | 9 | |
| 6 | 1996 | 27 | |
| 7 | 1993 | 10 | |
| 8 | 1993 | 35 | |
| 9 | Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms | 1992 | 19 |
| 10 | 1991 | 44 | |
| 11 | 1989 | 2 | |
| 12 | A New Approach to All Pairs Shortest Paths in Planar Graphs (Extended Abstract) | 1987 | 2 |
| 13 | 1987 | 19 | |
| 14 | Optimal Message Routing without Complete Routing Tables (preliminary version). | 1986 | 1 |
| 15 | 1986 | 23 | |
| 16 | A General Lower Bound for Electing a Leader in a Ring. | 1985 | 0 |
| 17 | 1985 | 5 | |
| 18 | Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version) | 1983 | 1 |
| 19 | 1982 | 153 | |
| 20 | Approximation algorithm for some routing problems | 1976 | 9 |
About Greg N. Frederickson
Greg N. Frederickson is a scholar working on Computer Graphics and Computer-Aided Design, Architecture, Computational Theory and Mathematics, Industrial and Manufacturing Engineering and Computer Networks and Communications, having authored 106 papers that have together received 2.7k indexed citations. Recurring topics across this work include Optimization and Search Problems (22 papers), Advanced Graph Theory Research (21 papers), Data Management and Algorithms (19 papers), Algorithms and Data Compression (17 papers), Computational Geometry and Mesh Generation (16 papers), Complexity and Algorithms in Graphs (15 papers), Vehicle Routing Optimization Methods (15 papers) and Optimization and Packing Problems (14 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (448 citations), Industrial and Manufacturing Engineering (762 citations), Computational Theory and Mathematics (1.1k citations), Computer Networks and Communications (1.3k citations) and Signal Processing (258 citations). Greg N. Frederickson has collaborated with scholars based in United States, Canada and Germany. Frequent co-authors include D. Barton Johnson, Chul E. Kim, Matthew S. Hecht, Ravi Janardan, Joseph F. JáJá, Nancy Lynch, Roberto Solis-Oba, D.J. Guan, Peter J. Downey and John Bruno. Their work appears in journals such as SIAM Journal on Computing, Algorithmica, Journal of Algorithms, Journal of the ACM and Theoretical Computer Science.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.