| 2009 |
|---|
| 29 | EE | Colm Ó'Dúnlaing:
A Simple Criterion for Nodal 3-connectivity in Planar Graphs.
Electr. Notes Theor. Comput. Sci. 225: 245-253 (2009) |
| 2007 |
|---|
| 28 | EE | Colm Ó'Dúnlaing:
Nodally 3-connected planar graphs and convex combination mappings
CoRR abs/0708.0964: (2007) |
| 27 | EE | Colm Ó'Dúnlaing,
Natalie Schluter:
Remarks on Jurdzinski and Lorys' proof that palindromes are not a Church-Rosser language
CoRR abs/0710.4499: (2007) |
| 26 | EE | Paul Harrington,
Colm Ó'Dúnlaing,
Chee-Keng Yap:
Optimal Voronoi Diagram Construction with n Convex Sites in Three Dimensions.
Int. J. Comput. Geometry Appl. 17(6): 555-593 (2007) |
| 2002 |
|---|
| 25 | EE | Colm Ó'Dúnlaing:
Inorder traversal of splay trees.
Electr. Notes Theor. Comput. Sci. 74: (2002) |
| 2000 |
|---|
| 24 | EE | Klemens Hägele,
Colm Ó'Dúnlaing,
Søren Riis:
The complexity of scheduling TV commercials.
Electr. Notes Theor. Comput. Sci. 40: (2000) |
| 23 | | Colm Ó'Dúnlaing,
Colum Watt,
David Wilkins:
Homeomorphism of 2-Complexes is Equivalent to Graph Isomorphism.
Int. J. Comput. Geometry Appl. 10(5): 453-476 (2000) |
| 1996 |
|---|
| 22 | | Richard Cole,
Michael T. Goodrich,
Colm Ó'Dúnlaing:
A Nearly Optimal Deterministic Parallel Voroni Diagram Algorithm.
Algorithmica 16(6): 569-617 (1996) |
| 21 | | Colm Ó'Dúnlaing:
Resolution Proofs viewed as Automata.
Bulletin of the EATCS 59: (1996) |
| 1993 |
|---|
| 20 | | Michael T. Goodrich,
Colm Ó'Dúnlaing,
Chee-Keng Yap:
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel.
Algorithmica 9(2): 128-141 (1993) |
| 1991 |
|---|
| 19 | | Kurt Mehlhorn,
Stefan Meiser,
Colm Ó'Dúnlaing:
On the Construction of Abstract Voronoi Diagrams.
Discrete & Computational Geometry 6: 211-224 (1991) |
| 18 | EE | Paliath Narendran,
Colm Ó'Dúnlaing,
Friedrich Otto:
It is undecidable whether a finite special string-rewriting system presents a group.
Discrete Mathematics 98(2): 153-159 (1991) |
| 1990 |
|---|
| 17 | | Richard Cole,
Michael T. Goodrich,
Colm Ó'Dúnlaing:
Merging Free Trees in Parallel for Efficient Voronoi Diagram Construction (Preliminary Version).
ICALP 1990: 432-445 |
| 16 | | Kurt Mehlhorn,
Stefan Meiser,
Colm Ó'Dúnlaing:
On the Construction of Abstract Voronoi Diagrams.
STACS 1990: 227-239 |
| 1989 |
|---|
| 15 | | Michael T. Goodrich,
Colm Ó'Dúnlaing,
Chee-Keng Yap:
Constructing the Voronoi Diagram of a Set of Line Segments in Parallel (Preliminary Version).
WADS 1989: 12-23 |
| 14 | | Paliath Narendran,
Colm Ó'Dúnlaing:
Cancellativity in Finitely Presented Semigroups.
J. Symb. Comput. 7(5): 457-472 (1989) |
| 1988 |
|---|
| 13 | | Alok Aggarwal,
Bernard Chazelle,
Leonidas J. Guibas,
Colm Ó'Dúnlaing,
Chee-Keng Yap:
Parallel Computational Geometry.
Algorithmica 3: 293-327 (1988) |
| 12 | | Colm Ó'Dúnlaing:
A Tight Lower Bound for the Complexity of Path-Planning for a Disc.
Inf. Process. Lett. 28(4): 165-170 (1988) |
| 1987 |
|---|
| 11 | | Colm Ó'Dúnlaing,
Micha Sharir,
Chee-Keng Yap:
Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram.
Algorithmica 2: 27-59 (1987) |
| 10 | | Colm Ó'Dúnlaing:
Motion Planning with Inertial Constraints.
Algorithmica 2: 431-475 (1987) |
| 1985 |
|---|
| 9 | | Alok Aggarwal,
Bernard Chazelle,
Leonidas J. Guibas,
Colm Ó'Dúnlaing,
Chee-Keng Yap:
Parallel Computational Geometry (Extended Abstract)
FOCS 1985: 468-477 |
| 8 | | Colm Ó'Dúnlaing,
Chee-Keng Yap:
A "Retraction" Method for Planning the Motion of a Disc.
J. Algorithms 6(1): 104-111 (1985) |
| 7 | | Paliath Narendran,
Colm Ó'Dúnlaing,
Heinrich Rolletschek:
Complexity of Certain Decision Problems about Congruential Languages.
J. Comput. Syst. Sci. 30(3): 343-358 (1985) |
| 1984 |
|---|
| 6 | | Colm Ó'Dúnlaing,
Chee-Keng Yap:
Counting digraphs and hypergraphs.
Bulletin of the EATCS 24: 85-87 (1984) |
| 1983 |
|---|
| 5 | | Colm Ó'Dúnlaing,
Micha Sharir,
Chee-Keng Yap:
Retraction: A New Approach to Motion-Planning (Extended Abstract)
STOC 1983: 207-220 |
| 4 | | Colm Ó'Dúnlaing:
Infinite Regular Thue Systems.
Theor. Comput. Sci. 25: 171-192 (1983) |
| 1982 |
|---|
| 3 | | Colm Ó'Dúnlaing,
Chee-Keng Yap:
Generic Transformation of Data Structures
FOCS 1982: 186-195 |
| 1981 |
|---|
| 2 | | Ronald V. Book,
Matthias Jantzen,
Burkhard Monien,
Colm Ó'Dúnlaing,
Celia Wrathall:
On the Complexity of Word Problems in Certain Thue Systems (Preliminary Report).
MFCS 1981: 216-223 |
| 1 | | Ronald V. Book,
Colm Ó'Dúnlaing:
Testing for the Church-Rosser Property.
Theor. Comput. Sci. 16: 223-229 (1981) |
