R. Fabila-Monroy, Andres Ruis Vargas, and J. Urrutia, "On Modem Illumination Problems". To appear in XIII Encuentros de Geometria Computacional, Zaragoza, España, June 29 - July 1 2009.

S. Bereg, J.M. Díaz-Báñez, D. Lara, P. Pérez, C. Seara and J. Urrutia, "Bichromatic Discrepancy via Convex Partitions". To appear in XIII Encuentros de Geometria Computacional, Zaragoza, España, June 29 - July 1 2009.

B. Aronov, D. Garijo, Y. Núñez, D. Rappaport. C. Seara and J. Urrutia, "Measuring the error of linear separators on linearly inseparable data". To appear in XIII Encuentros de Geometria Computacional, Zaragoza, España, June 29 - July 1 2009.

C. Bautista, J. Cano, J.M. Díaz-Báñez, H. González, D. Lara y J. Urrutia, "L-corredor k-cromático". To appear in XIII Encuentros de Geometria Computacional, Zaragoza, España, June 29 - July 1 2009.

J.M. Díaz-Báñez, R. Fabila, D. Flores, M.A. Heredia and J. Urrutia, "Min-energy Broadcast in Fixed-trajectory Mobile Ad-hoc Networks". To appear in XIII Encuentros de Geometria Computacional, Zaragoza, España, June 29 - July 1 2009.

J. Cano, J. Espinosa y J. Urrutia, "Vigilancia en Galerías de Arte Curvilíneas". To appear in XIII Encuentros de Geometria Computacional, Zaragoza, España, June 29 - July 1 2009.

F. Hurtado, C. Merino, D. Oliveros, T. Sakai, Jorge Urrutia, and I. Ventura, "On Polygons Enclosing Point Sets II". To appear in Graphs and Combinatorics.

Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane Souvaine, Jorge Urrutia and David R. Wood, "Compatible Geometric Matchings". Computational Geometry, Theory and Applications, Vol. 42, Issue 6-7, August 2009, pp. 617-626.

J. Czyzowicz, S. Dobrev, E. Kranakis, J. Opatrny, and J. Urrutia, "Local Edge Colouring of Yao-like Subgraphs of Unit Disk Graphs". Theorethical Computer Science, Vol. 410, Issue 14 (March 2009), pp. 1388-1400.

C. Cortés, J.M. Díaz-Báñez, P. Pérez-Lantero, C. Seara, J. Urrutia, and I. Ventura. "Bichromatic separability with two boxes: a general approach". Journal of Algorithms, Vol. 64 (2009), pp. 79-88.

J.M. Díaz-Báñez, G. Hernandez, D. Oliveros, A. Ramírez-Vigueras, J. A. Sellarès, J. Urrutia, and I. Ventura. "Computing Shortest Heterochromatic Monotone Routes". Operations Research Letters, Vol. 36, 2008, pp. 684-687.

Bernardo Ábrego, Estie Arkin, Silvia Fernández, Ferran Hurtado, Mikio Kano, Joseph Mitchell, Jorge Urrutia. "Matching points with squares". Discrete and Computational Geometry, Volume 41, number 1, pages 77-95, January 2009.

C. Bautista-Santiago, J.M. Díaz-Báñez, D. Lara, P. Pérez-Lantero, J. Urrutia, and I. Ventura. "Computing Maximal Islands". In Proc. 25th European Workshop on Computational Geometry EuroCG '09, to appear, Brussels, Belgium, 2009.

O. Aichholzer, F. Aurenhammer, F. Hurtado, P. Ramos, and J. Urrutia. "Two Convex Polygons". In Proc. 25th European Workshop on Computational Geometry EuroCG '09, to appear, Brussels, Belgium, 2009.

O. Aichholzer, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl, C. Huemer, J. Urrutia, and B. Vogtenhuber. "Modem Illumination of Monotone Polygons". In Proc. 25th European Workshop on Computational Geometry EuroCG '09, to appear, Brussels, Belgium, 2009.

J. Czyzowicz, S. Dobrev, T. Fevens, H. Gonzalez-Aguilar, E. Kranakis, J. Opatrny, J. Urrutia "Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs". Proc. 8th Latin American Theoretical Informatics Symposium April 7-11, 2008 in Búzios, Rio de Janeiro, Brazil. LNCS, Vol. 4957, pp. 158-169, 2008.

J. Czyzowicz, S. Dobrev, H. Gonzalez-Aguilar, R. Kralovic, E. Kranakis, J. Opatrny, L. Stacho, and J. Urrutia "Local 7-Colorings for Planar Subgraphs of Unit Distance Graphs". Proceedings of 5th Annual Conference on Theory and Applications of Models of Computation (TAMC08) Xi'an, China, April 25-29, 2008, LNCS, vol. 4978, pp. 170-181, 2008.

M. Fraser, E. Kranakis J. Urrutia. "Memory Requirements for Local Geometric Routing and Traversal in Digraphs". Proc. 20th Annual Canadian Conference on Computational Geometry CCCG 2008 pp. 75-78, Montreal, Quebec, Canada, 2008.

O. Aichholzer, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl, C. Huemer, and J. Urrutia. "Empty monochromatic triangles". Proc. 20th Annual Canadian Conference on Computational Geometry CCCG 2008 pp. 75-78, Montreal, Quebec, Canada, 2008.

S. Cabello, J.M. Díaz-Báñez, C. Seara, J.A. Sellarès, J. Urrutia, and I. Ventura, "Covering Point Sets with Two Disjoint Disks or Squares". Computational Geometry, Theory and Applications, Vol. 40, Issue 3, pp. 195-206, 2008.

M. Abellanas, A. García, F. Hurtado, J. Tejel, and J. Urrutia, "Augmenting the connectivity of geometric graphs". Computational Geometry, Theory and Applications. Vol. 40, No. 3, pp. 134-141, 2008,

J. Akiyama, H. Fukuda, C. Nara, T. Sakai, and J. Urrutia, "Universal Measuring Boxes With Triangular Bases". American Mathematical Monthly, Vol. 115, pp. 195-201, March 2008.

G. Araujo, J. Balog, R. Fabila-Monroy, G. Salazar, and J. Urrutia, "A note on harmonic subgraphs in labelled geometric graphs". Information Processing Letters, 105, (2008), 98-102.

J. Leaños, M. Lomelí, C. Merino, G. Salazar, and J. Urrutia, "Simple Euclidean Arrangements with no ( ≥ 5) -gons". Discrete and Computational Geometry, Vol. 38, No. 3, pp. 605-614, 2007.

Alfredo García, Ferran Hurtado, Javier Tejel, J. Urrutia, " On the number of non-crossing rays configurations". XII Encuentros de Geometria Computacional, June 25-27, 2007, Valladolid, España.

F. Hurtado, C. Merino, D. Oliveros, J. Urrutia, T. Sakai, I. Ventura, " On polygons enclosing point sets". XII Encuentros de Geometria Computacional, June 25-27, 2007, Valladolid, España.

J. M. Díaz-Báñez, G. Hernández, D. Oliveros, A. Ramírez-Vigueras, J. A. Sellarès, J. Urrutia, I. Ventura, " Poligonales heterocromáticas monótonas de mínima longitud ". XII Encuentros de Geometria Computacional, June 25-27, 2007, Valladolid, España.

F. Escalona, R. Fabila-Monroy, and J. Urrutia, "Hamiltonian Tetrahedralizations with Steiner Points". 23rd European Workshop on Computational Geometry, pp. 50-53 March 12-16, Graz, Austria, 2007.

R. Fabila-Monroy, D. Flores-Peñaloza, C. Huemer, F. Hurtado, J. Urrutia, and D.R. Wood, "On the Chromatic Numbers of Some Flip Graphs". 23rd European Workshop on Computational Geometry, pp.110-113 March 12-16, Graz, Austria, 2007.

J. Czyzowicz, E. Kranakis, J. Urrutia, "Efficient Rectilinear Glass-Cut Dissections of Rectangles". Applied Mathematical Sciences, Vol. 1, 2007, no. 52, pp. 2593 - 2600.

M. Kano, M.J. Ruiz, and J. Urrutia, "Jin Akiyama: A friend and his mathematics". Graphs and Combinatorics, 23, 1-39, 2007.

T. Sakai, and J. Urrutia, "Covering the Convex Quadrilaterals of Point Sets". Graphs and Combinatorics, 23, 343-358, 2007.

V. Alvares, T. Sakai, and J. Urrutia, "Bichromatic Quadrangulations with Steiner Points". Graphs and Combinatorics, 23, 85-98, 2007.

L. Montejano, and J. Urrutia, "Paths of Trains with Two-Wheeled Cars". Discrete and Computational Geometry, 38, 99-110, 2007.

J. Urrutia, "Local solutions for global problems in wireless networks". Journal of Discrete Algorithms, 5, pp. 395-407, 2007.

M.A. Heredia, and J. Urrutia, "On convex quadrangulations of point sets on the plane". Discrete Geometry, Combinatorics and Graph Theory, Lecture Notes in Computer Science 4381, Proc. CJCDGCGT 2005, pp. 38-46, 2007.

C. Merino, G. Salazar and J. Urrutia, "On the length of the longest alternating path for multicoloured point sets in convex position ". Discrete Mathematics Vol. 360, no. 15, pp. 1791-1797, 2006.

C. Cortés, J.M. Díaz-Báñez, and J. Urrutia, "Finding enclosing boxes with empty intersection". Proc. 23rd. European Workshop on Computational Geometry. March 27-29 2006, Delphi, Greece, pp. 185-188.

E. Chavez, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, and J. Urrutia, "Route discovery with constant memory in oriented planar geometric networks" . Networks Vol. 48, Issue 1, pp. 7-15, 2006.
Also in Proceedings of Algosensors 2004, Springer Verlag, LNCS, Vol. 3121, pp. 147-156, S. Nikoletseas, J. Rolim, editors. July 16 2004, Turku, Finland.

E. Chaves, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, and J. Urrutia, "Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges". LATIN 2006, 7th Latin American Symposium, , Valdivia, Chile, March 2006, LNCS 3887, pp. 286-297.

E. Chaves, S. Dobrev, E. Kranakis, J. Opatrny, L. Stacho, H. Tejeda, and J. Urrutia, "Half-space proximal: a new local test for extracting a bounded dialation spanner of a unit disk graph". OPODIS 2005, Pisa, Italy, Dec. 12-14. LNCS 3974, 235-245, 2006.

C. Georgiou, E. Kranakis, R. Marcelin-Jimenez, S. Rajsbaum, J. Urrutia, "Distributed Dynamic Storage in Wireless Networks". International Journal of Distributed Sensor Networks. Vol. 1, no. 3-4, pp. 355-371. 2005.

J.M. Díaz-Báñez, C. Seara, J.A. Sellarès, J. Urrutia, I. Ventura, "Covering Point Sets with Two Convex Objects" 21th European Workshop on Computational Geometry, pp 179-182, 2005.

G. Araujo, A. Dumitrescu, F. Hurtado, M. Noy and J. Urrutia, "On the chromatic number of some geometric Kneser graphs". Computational Geometry, Theory and Aplications. Vol. 32(1), pp. 59-69, 2005.

C. Merino, G. Salazar and J. Urrutia, On the Intersection number of matchings and minimum weight perfect matchings of multicolored point sets". Graphs and Combinatorics. Vol 21(3), pp. 333-341, 2005.

M. Kano, C. Merino and J. Urrutia, "On spanning trees and cycles of multicolored point sets with few intersections". Information Processing Letters, 96, pp. 301-306, 2005.

R. Fabila-Monroy, and J. Urrutia, "Graham Triangulations and Triangulations With a Center are Hamiltonean", Information Processing Letters, 96, pp. 295-299, 2005.

T. Sakai, C. Nara, and Jorge Urrutia, "Equal area polygons in convex bodies". Proc. Indonesia-Japan Conference in Discrete and Computational Geometry 2003. Tokio, Japan. Lecture Notes in Computer Science Vol 3330, pp 146-158 (2005).

Jin Akiyama, K. Hirata, Mari-Jo P. Ruiz, and Jorge Urrutia, "Flat 2-foldings of Convex Polygons". Indonesia-Japan Conference in Discrete and Computational Geometry 2003. Lecture Notes in Computer Science 3330, pp. 14-24 (2005).

Kiyoshi Hosono, Ferran Hurtado, Masatsugu Urabe, Jorge Urrutia, "On a triangle with the maximum area in a planar point set". Indonesia-Japan Conference in Discrete and Computational Geometry 2003, Lecture Notes in Computer Science 3330, pp. 102-107 (2005).

E. Chavez, D. Dobrev, E. Kranakis, J. Opartny, L. Stacho, and J. Urrutia, "Traverasl of a quasi-planar graph without using mark bits". Journal of Interconnected Networks, 5(4), pp. 395-408, 2004. Also in International Workshop on Wireless, Mobile, and Ad Hoc Networks WMAN04 IPDPS, 2004 WORKSHOPS Santa Fe, New Mexico, April 30, 2004.

G. Csiszmadia, J. Czyzowicz, L. Gasienec, E. Kranakis, E. Rivera-Campo, J. Urrutia, "On Tilable Orthogonal Polygons", International Journal of Pure and Applied Mathematics, 13(4), 443-459, (2004).

J. Czyzowicz, E. Kranakis, D. Krizanc, and J. Urrutia, "Discrete Realizations of Contact and Intersection Graphs", International Journal of Pure and Applied Mathematics, 13(4), 429-442, (2004).

E. Kranakis, D. Krizanc, and J. Urrutia, "Coverage and connectivity in networks with directional sensors" Euro-Par 2004, Aug. 31- Sept. 3. Pisa Italy. LNCS 3149, pp. 917-924, (2004).

Paul Boone, Edgar Chavez, Lev Gleitzky, Evangelos Kranakis, Jaroslav Opatrny, Gelasio Salazar, Jorge Urrutia, "Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-hoc Networks". In proceedings of SIROCCO 2004, Springer Verlag, LNCS, Vol. 3104, R. Kralovic O. Sykora, editors. June 2004, Smolenice Castle, Slovakia.

J. Akiyama, F. Hurtado, C. Merino and J, Urrutia, "A problem on hinged dissections with colours". Graphs and Combinatorics Vol. 20, no. 2, pp. 145-159, (2004).

Neumann-Lara, V., E. Rivera-Campo, and J. Urrutia, "A note on convex decompositions of point sets in the plane". Graphs and Combinatorics Vol. 20, no. 2, pp. 223-231, (2004).

Neumann-Lara, V., E. Rivera-Campo, and J. Urrutia, "A note on minimal 3-connected graphs". Discusiones Mathematicae 24 (1), 115-123, (2004).

J. Leaños, C. Merino, G. Salazar and J. Urrutia, "Spanning trees of multicoloured point sets with few intersections". Indonesia-Japan Conference in Discrete and Computational Geometry 2003. Lecture Notes in Computer Science Vol. 3330, pp. 113-122, (2004).

J. Galtier, F. Hurtado, M. Noy, S. Pérenes, and J. Urrutia, "Simultaneous edge flipping in triangulations", Int. J. Comp. Geometry, 13, no. 2, 113-133, (2003).

C. Nara, T. Sakai, and J. Urrutia, "Maximal number of edges in geometric graphs without convex polygons". Discerete and Computational geometry, Proc. JCDCG 2002, Tokio, Japan. Lecture Notes in Computer Science Vol. 2866, pp 215-220 (2003).

J. Urrutia, "Coloraciones, tetraedralizaciones, y tetraedros vacios en coloraciones de conjuntos de puntos en R^3". Proc. X Encuentros de geometria Computacional, Sevilla, Junio 2003, pp 95-100.

J. Urrutia, and P. Valencia, "Problemas de cubertura circular". Proc. X Encuentros de geometria Computacional, Sevilla, Junio 2003, pp 75-81.

R.P. Boland, and J. Urrutia, "Partitioning polygons into tree monotone and Y-monotone subpolygons". International Workshop on Computational Geometry and Applications CGA'03 May 18, 2003 -- May 21, 2003 Montreal, Canada.

Jorge Urrutia, "Some Open Problems". LATIN 2002, Cancun, Mexico Abril 3-6. Lecture Notes in Computer Science 2286 (2002), pp 4-11.

Urrutia, J., "Routing with guaranteed delivery in geometric and wireless networks". In I. Stojmenovic, editor, Handbook of Wireless Networks and Mobile Computing, chapter 18, pages 393-406. John Wiley 8 Sons, 2002.

J. Akiyama, T. Sakai, and J. Urrutia, "Sequentially divisible dissections of simple polygons". Japan Conference on Discrete and Computational Geometry 2000, Tokio, Japon, Nov 2000. Lecture Notes in Computer Science, Vol. 2098, 53-66 (2001).

E. Kranakis, D. Krizanc, A. Maheshwari, J-R. Sack, J-R. Sack, and J. Urrutia, "Ray shooting from convex ranges". Discrete Appl. Math. Vol. 108, no. 3, 259-267, (2001).

J. Czyzowicz, F. Hurtado, J. Urrutia, and N. Zaguia, "On polygons enclosing point sets". Geombinatorics, Vol. XI-1, pp. 21-28, (2001).

Z. Gao, J. Urrutia, and W. Jianyu, "Diagonal flips in labelled planar triangulations". Graphs and Combinatorics Vol. 17, no. 4, 647-657 (2001).

P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, "Routing with guaranteed delivery in ad hoc wireless networks". Wireless Networks, 7(6): 609-616, (2001).

Jorge Urrutia "Algunos problemas abiertos". Proc. IX Encuentros de Geometr’a Computacional, N. Coll, J.A. Sellares eds. Univ. De Girona, julio 2-4, pp. 13-24 (2001).

Kranakis, Evangelos; Krizanc, Danny; Urrutia, Jorge, "Efficient regular polygon dissections". Geom. Dedicata Vol. 80, no. 1-3, 247-262, (2000). Also in Proc. Japan Conference on Discrete and Computational geometry'', Tokio, Japan, (1998) 148-166.

Boissonnat, Jean-Daniel; Czyzowicz, Jurek; Devillers, Olivier; Urrutia, Jorge; Yvinec, Mariette, "Computing largest circles separating two sets of segments". Internat. J. Comp. Geometry. Vol. 10, no. 1, 41-53. (2000).

Estivill-Castro, V.; Noy, M.; Urrutia, J. "On the chromatic number of tree graphs". Discrete Math. Vol. 223, no. 1-3, 363-366 (2000).

R.P. Boland, and J. Urrutia, "Polygon area problems". 12th Canadian Conference on Computational Geometry, August 16-19th 2000, Fredericton, New Brunswick, Canada, 159-162.

J. Czyzowicz, E. Kranakis, and J. Urrutia, "Guarding the Convex Subsets of a Point Set". 12th Canadian Conference on Computational Geometry, August 16-19th 2000, Fredericton, New Brunswick, Canada, 47-50.

J. Urrutia, "Art Gallery and Illumination Problems" Handbook on Computational Geometry, Elsevier Science Publishers, J.R. Sack and J. Urrutia eds. pp. 973-1026, 2000. This is a comprehensive survey on Art Galleries or Illumination problems.
(54 pages) ps version (689032 bytes), gz version (169 k)

J. Akiyama, A. Kaneko, M. Kano, G. Nakamura, E. Rivera-Campo, S. Tokunaga, and J. Urrutia, "Radial Perfect Partitions of Convex Sets in the Plane". Discrete and computational geometry (Tokyo, 1998), 1-13, Lecture Notes in Comput. Sci., 1763, Springer, Berlin, 2000.

J. Czyzowicz, E. Kranakis, J. Urrutia, " Dissections, Cuts and Triangulations". Proceedings of 11th Canadian Conference on Computational Geometry, CCCG-99, pages 154-157, Vancouver Aug. 15-18, 1999.

G. Csiszmadia, J. Czyzowicz, L. Gasienec, E. Kranakis, J. Urrutia, "Domino Tilings of Orthogonal Polygons". Proceedings of 11th Canadian Conference on Computational Geometry, CCCG-99, pages 158-161, Vancouver Aug. 15-18, 1999.

F. Hurtado, M. Noy, and J. Urrutia, "Flipping edges in triangulations". Discrete and Computational Geoemetry, 22,.333-346 (1999). Also in Proc. 12 ACM Symposium on Computational Geometry, May 24-26 1996, 214-223.

E. Kranakis, H. Singh, and J. Urrutia, "Compass Routing on Geometric Networks". Proceedings of 11th Canadian Conference on Computational Geometry, CCCG-99, pages 51-54, Vancouver Aug. 15-18, 1999.

S. Rajsbaum, and J. Urrutia,"Some problems Distributed Computational Geometry". International Colloquium on Structural Information and Communication Complexity (SIROCCO), July 1999.

DeLoera, J., F. Santos and J. Urrutia, "The number of geometric bistellar neigbors of a triangulation". Discrete and Computational Geometry, 21, 131-142, (1999).

Evangelos Kranakis, and Jorge Urrutia, "Isomorphic triangulations with minimal number of Steiner points". International Journal of Computational Geometry and Applications, 9 (1999), 171-180. Also in Proc. Seventh Canadian Conference on Computational Geometry, August 1995, 291- 296.

Czyzowicz, J., I. Stojmenovic and J. Urrutia, "Immobilizing a shape". International Journal of Computational Geometry, 9, (1999), 181-206.

Neumann-Lara, V., E. Rivera-Campo, and J. Urrutia, "A note on covering the edges of a graph with bonds". Discrete Math. 197/198 (1999), 633-636.

Felipe Contreras, Jurek Czyzowicz, Nicolas Fraiji, Jorge Urrutia "Illuminating triangles and quadrilaterals with vertex floodlights" Proceedings of 10th Canadian Conference on Computational Geometry, 1998, (CCCG98).

Jurek Czyzowicz, Felipe Contreras, Jorge Urrutia "On measuring areas of polygons" Proceedings of 10th Canadian Conference on Computational Geometry, 1998, (CCCG98).

Akiyama, J., E. Rivera-Campo, G. Nakamura, and J. Urrutia "Perfect divisions of a cake" Proceedings of 10th Canadian Conference on Computational Geometry, 1998, (CCCG98).

F. Hurtado, M. Noy, and J. Urrutia "Parallel edge flippinge" Proceedings of 10th Canadian Conference on Computational Geometry, 1998, (CCCG98).

J. Urrutia, "Flipping Edges in Triangulations of Point Sets, Polygons and Maximal Planar Graphss" Invited talk in First Japan Conference on Discrete and Computational Geometry, Tokai University, Tokio, Japan, November 17-20, 1997. (1997).

Abellanas, M., G. Hernandez, V. Neumann-Lara, J. Urrutia and R. Klein, "A Combinatorial Property of Convex Sets" Discrete and Computational Geometry, 17, 307-318, (1997).

J. Urrutia, "Sixth proof of the Orthogonal Art Gallery Theorem" Technical report TR-97-03, Department of Computer Science, University of Ottawa, February, 1997.

J. Urrutia, "On the number of internal and external visibility edges of polygons" Proceedings of 9th Canadian Conference on Computational Geometry, 1997, (CCCG97).

J. Urrutia, "Tres Problemas de Iluminacion y Visibilidad". Proc. 7th. Spanish Conference on Computational Geometry, Madrid, July 7-9 pp. 3-16, 1997.

J. Bagga, L. Gewali, S. Ntafos, and J. Urrutia, "Internal, external, and mixed visibility edges of polygons". Preprint, July 1997.

Bose, J., L. Guibas, A. Lubiw, M. Overmars, D. Souvaine and J. Urrutia, "The floodlight illumination problem". Int. Journal in Computational Geometry, (1997), 7, 153-163.

Kranakis, E. D. Krizanc, A. Maheshwari, M. Noy, J.R. Sack and J.Urrutia, "Stage-graph representations". Discrete Applied Mathematics.Vol. 75:1, pp. 71-80, (1997).

Boissonant, J.D., J. Czyzowicz, O. Devillers, J. Urrutia, and M. Yvinec, "Computing largest circles separating two sets of segments". Proc. Eighth Canadian Conference on Computational Geometry, August 1996, Ottawa, 173-178.

N. Castañeda, and J. Urrutia, "Straight line embeddings of planar graphs on point sets". Proc. Eighth Canadian Conference on Computational Geometry, August 1996, Ottawa, 312-318.
(7 pages).

Czyzowicz, J., E. Kranakis, D. Krizanc, and J. Urrutia, "Maximal length common non-intersecting paths". Proc. Eighth Canadian Conference on Computational Geometry, August 1996, Ottawa, 180-189.

Chenier, C., J. Urrutia and N. Zaguia, "Scheduling trees with communication delays in linear time". ORDER (1995).

Boland R. P. and J. Urrutia, "Separating families of points on the plane". Information Processing Letters. (1995) 53: 177-183.

Kranakis, E., D. Krizanc and J. Urrutia, "Implicit routing and shortest path information". SIROCCO, Olimpiad, Grecia, 1995. International Informatics Series 2, pp 101-112.(141398 bytes), (40 k).

Estivill-Castro, V., J. O'Rourke, J. Urrutia and D. Xu, "Illumination of polygons with vertex floodlights". Information Processing Letters (1995) 56, Vol. 1, pp 62-73. (51 k).

Estivill-Castro, V. and J. Urrutia, "Two-Floodlight Illumination of Convex Polygons". Proc. Fourth Workshop on Algorithms and Data Structures, Springer Verlag (1995). Lecture Notes in Computer Science 955: 62-73. (1,214,175 bytes).

Urrutia, J., "Iluminando poligonos con reflectores". Proc. VI Encuentro de Geometria Computacional, F. Hurtado, ed. Barcelona, Spain, June 1995, 59-72. In Spanish.

Abello, J., V. Estivill-Castro, T. Shermer and J. Urrutia, "Illuminating with orthogonal floodlights". Algorithms and Computations (Cairns, 1995), 362-371, Lecture Notes in Computer Sci., 1004, Springer, Berlin, 1995.

Chen, D., V. Estivill-Castro and J. Urrutia, "Optimal guarding of polygons and monotone chains". Proc. Seventh Canadian Conference on Computational Geometry, August 1995, 133-138.

Czyzowicz, J, E. Rivera-Campo, J. Urrutia and J. Zaks, "Guarding rectangular art galleries". Discrete Mathematics (1994) 50: 149-157.

Kranakis, E., D. Krizanc and J. Urrutia, "On the number of directions in visibility representations of graphs". Proc. Int. Workshop on Graph Drawings, Lecture Notes in Computer Science (1994) 894:167-176.

Belleville, P., P. Bose, J. Czyzowicz, J. Urrutia and J. Zaks, "K-guarding polygons on the plane". Proc. of the Sixth Canadian Conference in Computational Geometry, (1994) 381-386.

Czyzowicz, J., E. Rivera-Campo and J. Urrutia, "Separation of convex sets". Discrete Applied Mathematics, 51, (1994), 325-328.

Czyzowicz, J., E. Rivera-Campo and J. Urrutia, "Illuminating rectangles and triangles in the plane". Journal of Combinatorial Theory, Ser. B. (1993) 57: 1-17.

Czyzowicz, J., E. Rivera-Campo and J. Urrutia, "Optimal floodlight illumination of stages". Proc. of the Fifth Canadian Conference in Computational Geometry, (1993) 393-398.

Czyzowicz, J., E. Rivera Campo, J. Urrutia and J. Zaks, "Separating convex sets on the plane". Discrete and Computational Geometry (1992)7:189-195.

Foldes, S, .I. Rival and J. Urrutia "Light sources, obstructions and spherical orders". Discrete Mathematics (1992) 102: 13-24.

Nowakowski, R., I. Rival and J. Urrutia, "Lattices contained in planar orders are planar". Algebra Universalis (1992) 29: 580-588.

Al-Thukair, F., A. Pelc, I. Rival and J. Urrutia, "Motion planning, two-directional point representations and ordered sets". Siam Journal on Discrete Mathematics (1991) 4, 151-163.

Czyzowicz, J., Egyed, P., Everett, H., Rappaport, D., Shermer, T., Souvaine, D., Toussaint, G., and Urrutia, J. "The Aquarium Keeper's Problem". In SODA '91: Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms (Philadelphia, PA, USA, 1991), Society for Industrial and Applied Mathematics, pp. 459-464.

Czyzowicz, J., I. Rival and J. Urrutia, "Galleries and light matchings: Fat cooperative guards". Contemporary Mathematics (1991) 119: 21-28.

Czyzowicz, J., A. Pelc, I. Rival and J. Urrutia, "Crooked diagrams with few slopes". Order (1990) 7: 133-143.

Akiyama, J. and J. Urrutia, "Simple alternating path problem". Discrete Math. (1990) 84: 101-103. A very preliminary version of the published one (better).

Nowakowski, R., I. Rival and J. Urrutia, "Representing orders on the plane by translating points and lines". Discrete Applied Mathematics (1990) 27, no. 1-2, pp. 147-156.

Akiyama, J. and J. Urrutia, "A note on balanced colourings for lattice points". Discrete Math. (1990) 83: 123-126.

Czyzowicz, J., E. Rivera-Campo, J. Urrutia and J. Zaks, "Guarding convex sets on the plane" Proc. of the Second Canadian Conference in Computational Geometry, (1990) 265-268.

Urrutia, J., "Partial orders and Euclidean geometry". Algorithms and Order, I. Rival, ed., Reidel Pub. (1989) 387-434.

Barany, I., J. Schmerl, S. J. Sidney and J. Urrutia, "A combinatorial result on balls and points". Discrete and Computational Geometry (1989) 4: 259-262.

Santoro, N., J. B. Sidney and J. Urrutia, "Geometric containment and partial orders" SIAM J. Discrete Mathematics (1989) 2: 245-254.

Rival, I. and J. Urrutia, "Representing orders by translating convex figures in the plane" Order 4 (1988) 319-339.

Neumann-Lara, V. and J. Urrutia, "A combinatorial result on points and circles". Discrete Math. 69 (1988) 173-178.

Atallah, M.J., G.K.Manacher and J. Urrutia, "Finding a minimum independent dominating set in a permutation graph". Discr. Appl. Math. 21, 177-183, 1988.

Sidney, S.J., J.B. Sidney, and J. Urrutia, "Circle orders, n-gon orders and the crossing number of a partial order". Order 5 (1988) 1-10.

Santoro, N. and J. Urrutia, "Angle orders, regular n-gon orders and the crossing number of a partial order". Order 4 (1987) 209-220.

Van Leeuwen, J., N. Santoro, J. Urrutia and S. Zaks, "Guessing games and distributed computations in synchronous networks". Lecture Notes in Computer Science 267, ICALP (1987) 347-356.

Santoro, N., J. Urrutia and S. Zaks, "Sense of direction and communication complexity in distributed algorithms". Distributed Algorithms on Graphs, E. Gafny and N. Santoro (eds.), (1986) 123-132, Carleton University Press.

Sidney, J.B. and J. Urrutia, "The communication complexity hierarchy in distributed computing". Distributed Algorithms on Graphs E. Gafny and N. Santoro (eds.), (1986), Carleton University Press.

J. Urrutia, "A containment result on points and circles". Preprint. Feb. 2004.