Glenn K. Manacher
-
- Computational Geometry and Mesh Generation 6
-
- Advanced Graph Theory Research 9
- Complexity and Algorithms in Graphs 4
- Hardware and Architecture top 10%
-
- Optimization and Packing Problems 3
-
- Algorithms and Data Compression 6
-
- Optimization and Search Problems 2
- Advanced Database Systems and Queries 2
-
- Data Management and Algorithms 2
- Co-authors
- A. L. ZobristJorge UrrutiaMikhail J. AtallahC. Pandu RanganYan LiangTu Bui
- Cited by
- Computer Graphics and Computer-Aided DesignComputational Theory and MathematicsHardware and Architecture
- Partner nations
- United StatesCanadaIndia
In The Last Decade
Glenn K. Manacher
21 papers receiving 276 citations
Peers
Comparison fields: 5 of 41
- Computer Graphics and Computer-Aided Design 57
- Computational Theory and Mathematics 165
- Hardware and Architecture 59
- Discrete Mathematics and Combinatorics 21
- Industrial and Manufacturing Engineering 42
Countries citing papers authored by Glenn K. Manacher
This map shows the geographic impact of Glenn K. Manacher'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 Glenn K. Manacher with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Glenn K. Manacher more than expected).
Fields of papers citing papers by Glenn K. Manacher
This network shows the impact of papers produced by Glenn K. Manacher. 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 Glenn K. Manacher. The network helps show where Glenn K. Manacher may publish in the future.
Co-authorship network
The 6 scholars most cited alongside Glenn K. Manacher, 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 | 2002 | 4 | |
| 2 | 1997 | 1 | |
| 3 | 1996 | 3 | |
| 4 | A Linear Algorithm for Finding Hamiltonian Circuits in circular-Arc Graphs | 1994 | 3 |
| 5 | 1993 | 4 | |
| 6 | 1992 | 6 | |
| 7 | 1990 | 25 | |
| 8 | 1989 | 2 | |
| 9 | 1988 | 21 | |
| 10 | 1982 | 3 | |
| 11 | A fast, space-efficient average-case algorithm for the 'Greedy' Triangulation of a point set, and a proof that the Greedy Triangulation is not approximately optimal | 1979 | 2 |
| 12 | 1979 | 48 | |
| 13 | 1979 | 12 | |
| 14 | 1979 | 15 | |
| 15 | 1978 | 4 | |
| 16 | 1976 | 23 | |
| 17 | 1975 | 9 | |
| 18 | 1975 | 61 | |
| 19 | 1967 | 1 | |
| 20 | 1967 | 65 |
About Glenn K. Manacher
Glenn K. Manacher is a scholar working on Computer Graphics and Computer-Aided Design, Theoretical Computer Science and Computational Theory and Mathematics, having authored 22 papers that have together received 324 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (9 papers), Computational Geometry and Mesh Generation (6 papers), Algorithms and Data Compression (6 papers), Complexity and Algorithms in Graphs (4 papers), Optimization and Packing Problems (3 papers), Optimization and Search Problems (2 papers), Advanced Database Systems and Queries (2 papers) and Data Management and Algorithms (2 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (57 citations), Computational Theory and Mathematics (165 citations) and Hardware and Architecture (59 citations). Glenn K. Manacher has collaborated with scholars based in United States, Canada and India. Frequent co-authors include A. L. Zobrist, Jorge Urrutia, Mikhail J. Atallah, C. Pandu Rangan, Yan Liang and Tu Bui. Their work appears in journals such as Journal of the ACM, SIAM Review and Networks.
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.