Colm Ó'Dúnlaing

1.4k total citations
22 papers, 911 citations indexed

About

Colm Ó'Dúnlaing is a scholar working on Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design and Computer Vision and Pattern Recognition. According to data from OpenAlex, Colm Ó'Dúnlaing has authored 22 papers receiving a total of 911 indexed citations (citations by other indexed papers that have themselves been cited), including 10 papers in Computational Theory and Mathematics, 9 papers in Computer Graphics and Computer-Aided Design and 8 papers in Computer Vision and Pattern Recognition. Recurrent topics in Colm Ó'Dúnlaing's work include Computational Geometry and Mesh Generation (9 papers), semigroups and automata theory (8 papers) and Data Management and Algorithms (7 papers). Colm Ó'Dúnlaing is often cited by papers focused on Computational Geometry and Mesh Generation (9 papers), semigroups and automata theory (8 papers) and Data Management and Algorithms (7 papers). Colm Ó'Dúnlaing collaborates with scholars based in United States, Ireland and Germany. Colm Ó'Dúnlaing's co-authors include Chee Yap, Micha Sharir, Bernard Chazelle, Alok Aggarwal, Leonidas Guibas, Kurt Mehlhorn, Ronald V. Book, Leo J. Guibas, Paliath Narendran and Stefan Meiser and has published in prestigious journals such as Communications on Pure and Applied Mathematics, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Colm Ó'Dúnlaing

20 papers receiving 827 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Colm Ó'Dúnlaing United States	13	602	426	316	201	190	22	911
Chee-Keng Yap United States	15	254 0.4×	416 1.0×	92 0.3×	218 1.1×	115 0.6×	37	740
Daniel Leven Israel	8	356 0.6×	512 1.2×	142 0.4×	145 0.7×	26 0.1×	10	694
Sylvain Lazard France	17	308 0.5×	321 0.8×	112 0.4×	163 0.8×	106 0.6×	65	659
Diane L. Souvaine United States	15	281 0.5×	389 0.9×	86 0.3×	116 0.6×	31 0.2×	64	767
Thomas C. Shermer Canada	13	371 0.6×	425 1.0×	157 0.5×	213 1.1×	13 0.1×	45	743
Thérèse Biedl Canada	14	219 0.4×	345 0.8×	48 0.2×	223 1.1×	37 0.2×	83	631
Victor Milenkovic United States	19	235 0.4×	667 1.6×	35 0.1×	158 0.8×	94 0.5×	66	974
Guodong Rong United States	12	286 0.5×	269 0.6×	80 0.3×	19 0.1×	100 0.5×	16	752
Héctor H. González-Baños United States	11	647 1.1×	64 0.2×	559 1.8×	20 0.1×	100 0.5×	16	882
Adrian Dumitrescu United States	15	238 0.4×	401 0.9×	80 0.3×	206 1.0×	10 0.1×	117	804

Countries citing papers authored by Colm Ó'Dúnlaing

Since Specialization

Citations

This map shows the geographic impact of Colm Ó'Dúnlaing'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 Colm Ó'Dúnlaing with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Colm Ó'Dúnlaing more than expected).

Fields of papers citing papers by Colm Ó'Dúnlaing

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Colm Ó'Dúnlaing. 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 Colm Ó'Dúnlaing. The network helps show where Colm Ó'Dúnlaing may publish in the future.

Co-authorship network of co-authors of Colm Ó'Dúnlaing

This figure shows the co-authorship network connecting the top 25 collaborators of Colm Ó'Dúnlaing. A scholar is included among the top collaborators of Colm Ó'Dúnlaing 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 Colm Ó'Dúnlaing. Colm Ó'Dúnlaing 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

Ó'Dúnlaing, Colm & Natalie Schluter. (2009). A shorter proof that palindromes are not a Church–Rosser language, with extensions to almost-confluent and preperfect Thue systems. Theoretical Computer Science. 411(3). 677–690.

Narendran, Paliath, Colm Ó'Dúnlaing, & Friedrich Otto. (1991). It is undecidable whether a finite special string-rewriting system presents a group. Discrete Mathematics. 98(2). 153–159. 6 indexed citations

Mehlhorn, Kurt, et al.. (1991). On the construction of abstract voronoi diagrams. Discrete & Computational Geometry. 6(2). 211–224. 46 indexed citations

Narendran, Paliath & Colm Ó'Dúnlaing. (1989). Cancellativity in finitely presented semigroups. Journal of Symbolic Computation. 7(5). 457–472. 5 indexed citations

Mehlhorn, Kurt, Stefan Meiser, & Colm Ó'Dúnlaing. (1989). On the construction of abstract Voronoi diagrams. Max Planck Institute for Plasma Physics. 227–239. 9 indexed citations

Ó'Dúnlaing, Colm. (1988). A tight lower bound for the complexity of path-planning for a disc. Information Processing Letters. 28(4). 165–170. 5 indexed citations

Aggarwal, Alok, Bernard Chazelle, Leonidas Guibas, Colm Ó'Dúnlaing, & Chee Yap. (1988). Parallel computational geometry. Algorithmica. 3(1-4). 293–327. 140 indexed citations

Ó'Dúnlaing, Colm, Micha Sharir, & Chee Yap. (1987). Generalized Voronoi diagrams for a ladder: II. Efficient construction of the diagram. Algorithmica. 2(1-4). 27–59. 36 indexed citations

Ó'Dúnlaing, Colm. (1987). Motion planning with inertial constraints. Algorithmica. 2(1-4). 431–475. 64 indexed citations

10.

Ó'Dúnlaing, Colm, Micha Sharir, & Chee Yap. (1986). Generalized voronoi diagrams for moving a ladder. I: Topological analysis. Communications on Pure and Applied Mathematics. 39(4). 423–483. 45 indexed citations

11.

Aggarwal, Alok, Bernard Chazelle, Leonidas Guibas, Colm Ó'Dúnlaing, & Chee-Keng Yap. (1985). Parallel Computational Geometry (Extended Abstract). 468–477. 3 indexed citations

12.

Narendran, Paliath, et al.. (1985). Complexity of certain decision problems about congruential languages. Journal of Computer and System Sciences. 30(3). 343–358. 13 indexed citations

13.

Ó'Dúnlaing, Colm & Chee Yap. (1985). A “retraction” method for planning the motion of a disc. Journal of Algorithms. 6(1). 104–111. 283 indexed citations

14.

Ó'Dúnlaing, Colm & Chee-Keng Yap. (1984). Counting digraphs and hypergraphs.. Bulletin of the European Association for Theoretical Computer Science. 24(1). 85–87.

15.

Ó'Dúnlaing, Colm. (1983). Undecidable questions related to Church-Rosser Thue systems. Theoretical Computer Science. 23(3). 339–345. 16 indexed citations

16.

Ó'Dúnlaing, Colm. (1983). Infinite regular Thue systems. Theoretical Computer Science. 25(2). 171–192. 25 indexed citations

17.

Ó'Dúnlaing, Colm, Micha Sharir, & Chee-Keng Yap. (1983). Retraction: A New Approach to Motion-Planning (Extended Abstract). 19(3). 207–220. 4 indexed citations

18.

Ó'Dúnlaing, Colm, Micha Sharir, & Chee Yap. (1983). Retraction. 207–220. 106 indexed citations

19.

Ó'Dúnlaing, Colm & Chee Yap. (1982). Generic transformation of data structures. 19. 186–195. 3 indexed citations

20.

Book, Ronald V. & Colm Ó'Dúnlaing. (1981). Testing for the Church-Rosser property. Theoretical Computer Science. 16(2). 223–229. 30 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