Glenn K. Manacher

549 total citations
22 papers, 324 citations indexed

About

Glenn K. Manacher is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence. According to data from OpenAlex, Glenn K. Manacher has authored 22 papers receiving a total of 324 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Computational Theory and Mathematics, 6 papers in Computer Networks and Communications and 6 papers in Artificial Intelligence. Recurrent topics in Glenn K. Manacher's work include Advanced Graph Theory Research (9 papers), Computational Geometry and Mesh Generation (6 papers) and Algorithms and Data Compression (6 papers). Glenn K. Manacher is often cited by papers focused on Advanced Graph Theory Research (9 papers), Computational Geometry and Mesh Generation (6 papers) and Algorithms and Data Compression (6 papers). Glenn K. Manacher collaborates with scholars based in United States, Canada and India. Glenn K. Manacher's co-authors include A. L. Zobrist, Jorge Urrutia, Mikhail J. Atallah, C. Pandu Rangan, Yan Liang and Tu Bui and has published in prestigious journals such as Journal of the ACM, SIAM Review and Networks.

In The Last Decade

Glenn K. Manacher

21 papers receiving 276 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Glenn K. Manacher United States	9	165	122	83	59	57	22	324
John W. Williams United States	2	89 0.5×	152 1.2×	78 0.9×	39 0.7×	22 0.4×	3	269
Omer Berkman United States	9	194 1.2×	253 2.1×	119 1.4×	79 1.3×	42 0.7×	17	396
Peter Emde Boas Netherlands	2	117 0.7×	179 1.5×	125 1.5×	61 1.0×	51 0.9×	2	325
Prabhakar Ragde Canada	17	411 2.5×	264 2.2×	259 3.1×	88 1.5×	59 1.0×	37	623
Norbert Blüm Germany	7	182 1.1×	145 1.2×	98 1.2×	23 0.4×	16 0.3×	22	301
Elad Verbin Israel	12	165 1.0×	130 1.1×	127 1.5×	22 0.4×	42 0.7×	25	309
H. Ramesh India	9	137 0.8×	122 1.0×	61 0.7×	10 0.2×	37 0.6×	14	294
P. M. Camerini Italy	11	190 1.2×	70 0.6×	114 1.4×	20 0.3×	39 0.7×	19	389
Ondřej Sýkora Slovakia	11	175 1.1×	49 0.4×	89 1.1×	19 0.3×	135 2.4×	47	328
Mark R. Brown United States	7	83 0.5×	157 1.3×	103 1.2×	34 0.6×	20 0.4×	9	244

Countries citing papers authored by Glenn K. Manacher

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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 of co-authors of Glenn K. Manacher

This figure shows the co-authorship network connecting the top 25 collaborators of Glenn K. Manacher. A scholar is included among the top collaborators of Glenn K. Manacher based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Glenn K. Manacher. Glenn K. Manacher is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Manacher, Glenn K., et al.. (2002). A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals alone. Networks. 39(2). 68–72. 4 indexed citations

Manacher, Glenn K., et al.. (1997). Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications. International Journal of Foundations of Computer Science. 8(4). 443–467. 1 indexed citations

Manacher, Glenn K., et al.. (1996). Finding a Domatic Partition of an Interval Graph in Time $O(n)$. SIAM Journal on Discrete Mathematics. 9(2). 167–172. 3 indexed citations

Liang, Yan, et al.. (1994). A Linear Algorithm for Finding Hamiltonian Circuits in circular-Arc Graphs. 101. 3 indexed citations

Manacher, Glenn K., et al.. (1993). An O(nlogn) algorithm for finding minimal path cover in circular-arc graphs. 390–397. 4 indexed citations

Manacher, Glenn K., et al.. (1992). Incorporating negative-weight vertices in certain vertex-search graph algorithms. Information Processing Letters. 42(6). 293–294. 6 indexed citations

Manacher, Glenn K., et al.. (1990). An optimum Θ(n log n) algorithm for finding a canonical hamiltonian path and a canonical hamiltonian circuit in a set of intervals. Information Processing Letters. 35(4). 205–211. 25 indexed citations

Manacher, Glenn K.. (1989). Algorithmic Graph Theory (Alan Gibbons). SIAM Review. 31(1). 145–147. 2 indexed citations

Atallah, Mikhail J., Glenn K. Manacher, & Jorge Urrutia. (1988). Finding a minimum independent dominating set in a permutation graph. Discrete Applied Mathematics. 21(3). 177–183. 21 indexed citations

10.

Manacher, Glenn K.. (1982). Steady-paced-output and fractional-on-line algorithms on a ram. Information Processing Letters. 15(2). 47–52. 3 indexed citations

11.

Manacher, Glenn K. & A. L. Zobrist. (1979). 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. 2 indexed citations

12.

Manacher, Glenn K. & A. L. Zobrist. (1979). Neither the greedy nor the delaunay triangulation of a planar point set approximates the optimal triangulation. Information Processing Letters. 9(1). 31–34. 48 indexed citations

13.

Manacher, Glenn K.. (1979). Significant Improvements to the Hwang-Lin Merging Algorithm. Journal of the ACM. 26(3). 434–440. 12 indexed citations

14.

Manacher, Glenn K.. (1979). The Ford-Johnson Sorting Algorithm Is Not Optimal. Journal of the ACM. 26(3). 441–456. 15 indexed citations

15.

Manacher, Glenn K.. (1978). An improved version of the Cocke-Younger-Kasami algorithm. Computer Languages. 3(2). 127–133. 4 indexed citations

16.

Manacher, Glenn K.. (1976). An application of pattern matching to a problem in geometrical complexity. Information Processing Letters. 5(1). 6–7. 23 indexed citations

17.

Manacher, Glenn K.. (1975). On the feasibility of implementing a large relational data base with optimal performance on a minicomputer. 175–175. 9 indexed citations

18.

Manacher, Glenn K.. (1975). A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String. Journal of the ACM. 22(3). 346–351. 61 indexed citations

19.

Manacher, Glenn K.. (1967). A content-evaluating mode of computer-aided instruction. 286–293. 1 indexed citations

20.

Manacher, Glenn K.. (1967). Production and Stabilization of Real-Time Task Schedules. Journal of the ACM. 14(3). 439–465. 65 indexed citations

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.

Explore authors with similar magnitude of impact