| 2008 |
|---|
| 129 | EE | Jurek Czyzowicz,
Stefan Dobrev,
Thomas Fevens,
H. González-Aguilar,
Evangelos Kranakis,
Jaroslav Opatrny,
Jorge Urrutia:
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes.
LATIN 2008: 158-169 |
| 128 | EE | Jurek Czyzowicz,
Stefan Dobrev,
H. González-Aguilar,
Rastislav Kralovic,
Evangelos Kranakis,
Jaroslav Opatrny,
Ladislav Stacho,
Jorge Urrutia:
Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs.
TAMC 2008: 170-181 |
| 127 | EE | Gabriela Araujo,
József Balogh,
Ruy Fabila Fabila Monroy,
Gelasio Salazar,
Jorge Urrutia:
A note on harmonic subgraphs in labelled geometric graphs.
Inf. Process. Lett. 105(3): 98-102 (2008) |
| 2007 |
|---|
| 126 | EE | Jurek Czyzowicz,
Stefan Dobrev,
Evangelos Kranakis,
Jaroslav Opatrny,
Jorge Urrutia:
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs.
SIROCCO 2007: 195-207 |
| 125 | EE | Luis Montejano,
Jorge Urrutia:
Paths of Trains with Two-Wheeled Cars.
Discrete & Computational Geometry 38(1): 99-110 (2007) |
| 124 | EE | Jesus Leaños,
Mario Lomelí,
Criel Merino,
Gelasio Salazar,
Jorge Urrutia:
Simple Euclidean Arrangements with No (>= 5)-Gons.
Discrete & Computational Geometry 38(3): 595-603 (2007) |
| 123 | EE | Jorge Urrutia:
Local solutions for global problems in wireless networks.
J. Discrete Algorithms 5(3): 395-407 (2007) |
| 2006 |
|---|
| 122 | EE | Edgar Chávez,
Stefan Dobrev,
Evangelos Kranakis,
Jaroslav Opatrny,
Ladislav Stacho,
Jorge Urrutia:
Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges.
LATIN 2006: 286-297 |
| 121 | EE | Criel Merino,
Gelasio Salazar,
Jorge Urrutia:
On the length of longest alternating paths for multicoloured point sets in convex position.
Discrete Mathematics 306(15): 1791-1797 (2006) |
| 120 | EE | Edgar Chávez,
Stefan Dobrev,
Evangelos Kranakis,
Jaroslav Opatrny,
Ladislav Stacho,
Jorge Urrutia:
Route discovery with constant memory in oriented planar geometric networks.
Networks 48(1): 7-15 (2006) |
| 2005 |
|---|
| 119 | EE | Jorge Urrutia:
Routing in Wireless Networks and Local Solutions for Global Problems.
ADHOC-NOW 2005: 3 |
| 118 | EE | V. M. Heredia,
Jorge Urrutia:
On Convex Quadrangulations of Point Sets on the Plane.
CJCDGCGT 2005: 38-46 |
| 117 | EE | Edgar Chávez,
Stefan Dobrev,
Evangelos Kranakis,
Jaroslav Opatrny,
Ladislav Stacho,
Héctor Tejeda,
Jorge Urrutia:
Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph.
OPODIS 2005: 235-245 |
| 116 | EE | Gabriela Araujo,
Adrian Dumitrescu,
Ferran Hurtado,
Marc Noy,
Jorge Urrutia:
On the chromatic number of some geometric type Kneser graphs.
Comput. Geom. 32(1): 59-69 (2005) |
| 115 | EE | Jorge Urrutia:
In memoriam In memory of Professor Victor Neumann-Lara.
Graphs and Combinatorics 21(3): 289-291 (2005) |
| 114 | EE | Criel Merino,
Gelasio Salazar,
Jorge Urrutia:
On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets.
Graphs and Combinatorics 21(3): 333-341 (2005) |
| 113 | EE | Ruy Fabila Monroy,
Jorge Urrutia:
Graham triangulations and triangulations with a center are hamiltonean.
Inf. Process. Lett. 93(6): 295-299 (2005) |
| 112 | EE | Mikio Kano,
Criel Merino,
Jorge Urrutia:
On plane spanning trees and cycles of multicolored point sets with few intersections.
Inf. Process. Lett. 93(6): 301-306 (2005) |
| 111 | EE | Oswin Aichholzer,
David Bremner,
Erik D. Demaine,
Ferran Hurtado,
Evangelos Kranakis,
Hannes Krasser,
Suneeta Ramaswami,
Saurabh Sethia,
Jorge Urrutia:
Games on triangulations.
Theor. Comput. Sci. 343(1-2): 42-71 (2005) |
| 2004 |
|---|
| 110 | EE | Edgar Chávez,
Stefan Dobrev,
Evangelos Kranakis,
Jaroslav Opatrny,
Ladislav Stacho,
Jorge Urrutia:
Route Discovery with Constant Memory in Oriented Planar Geometric Networks.
ALGOSENSORS 2004: 147-156 |
| 109 | EE | Evangelos Kranakis,
Danny Krizanc,
Jorge Urrutia:
Coverage and Connectivity in Networks with Directional Sensors.
Euro-Par 2004: 917-924 |
| 108 | EE | Edgar Chávez,
Jaroslav Opatrny,
Stefan Dobrev,
Ladislav Stacho,
Evangelos Kranakis,
Jorge Urrutia:
Traversal of a Quasi-Planar Subdivision without Using Mark Bits.
IPDPS 2004 |
| 107 | EE | Bernardo M. Ábrego,
Esther M. Arkin,
Silvia Fernández-Merchant,
Ferran Hurtado,
Mikio Kano,
Joseph S. B. Mitchell,
Jorge Urrutia:
Matching Points with Circles and Squares.
JCDCG 2004: 1-15 |
| 106 | EE | Paul Boone,
Edgar Chávez,
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.
SIROCCO 2004: 23-34 |
| 105 | EE | Jin Akiyama,
Ferran Hurtado,
Criel Merino,
Jorge Urrutia:
A Problem on Hinged Dissections with Colours.
Graphs and Combinatorics 20(2): 145-159 (2004) |
| 104 | EE | Victor Neumann-Lara,
Eduardo Rivera-Campo,
Jorge Urrutia:
A Note on Convex Decompositions of a Set of Points in the Plane.
Graphs and Combinatorics 20(2): 223-231 (2004) |
| 103 | EE | Edgar Chávez,
Stefan Dobrev,
Evangelos Kranakis,
Jaroslav Opatrny,
Ladislav Stacho,
Jorge Urrutia:
Traversal of a quasi-planar subdivision without using mark bits.
Journal of Interconnection Networks 5(4): 395-407 (2004) |
| 2003 |
|---|
| 102 | EE | Ralph P. Boland,
Jorge Urrutia:
Partitioning Polygons into Tree Monotone and -monotone Subpolygons.
ICCSA (3) 2003: 903-912 |
| 101 | EE | Kiyoshi Hosono,
Ferran Hurtado,
Masatsugu Urabe,
Jorge Urrutia:
On a Triangle with the Maximum Area in a Planar Point Set.
IJCCGGT 2003: 102-107 |
| 100 | EE | Jesus Leaños,
Criel Merino,
Gelasio Salazar,
Jorge Urrutia:
Spanning Trees of Multicoloured Point Sets with Few Intersections.
IJCCGGT 2003: 113-122 |
| 99 | EE | Jin Akiyama,
Koichi Hirata,
Mari-Jo P. Ruiz,
Jorge Urrutia:
Flat 2-Foldings of Convex Polygons.
IJCCGGT 2003: 14-24 |
| 98 | EE | Toshinori Sakai,
Chie Nara,
Jorge Urrutia:
Equal Area Polygons in Convex Bodies.
IJCCGGT 2003: 146-158 |
| 97 | EE | Jérôme Galtier,
Ferran Hurtado,
Marc Noy,
Stephane Perennes,
Jorge Urrutia:
Simultaneous Edge Flipping in Triangulations.
Int. J. Comput. Geometry Appl. 13(2): 113-133 (2003) |
| 2002 |
|---|
| 96 | EE | Chie Nara,
Toshinori Sakai,
Jorge Urrutia:
Maximal Number of Edges in Geometric Graphs without Convex Polygons.
JCDCG 2002: 215-220 |
| 95 | EE | Oswin Aichholzer,
David Bremner,
Erik D. Demaine,
Ferran Hurtado,
Evangelos Kranakis,
Hannes Krasser,
Suneeta Ramaswami,
Saurabh Sethia,
Jorge Urrutia:
Playing with Triangulations.
JCDCG 2002: 22-37 |
| 94 | EE | Jorge Urrutia:
Open Problems in Computational Geometry.
LATIN 2002: 4-11 |
| 2001 |
|---|
| 93 | EE | Ralph P. Boland,
Jorge Urrutia:
A simpler circular ray shooting algorithm.
CCCG 2001: 37-40 |
| 92 | EE | Ralph P. Boland,
Jorge Urrutia:
Finding the largest axis aligned rectangle in a polygon in o(n log n) time.
CCCG 2001: 41-44 |
| 91 | | Evangelos Kranakis,
Danny Krizanc,
Anil Maheshwari,
Jörg-Rüdiger Sack,
Jorge Urrutia:
Ray shooting from convex ranges.
Discrete Applied Mathematics 108(3): 259-267 (2001) |
| 90 | EE | Zhicheng Gao,
Jorge Urrutia,
Jianyu Wang:
Diagonal Flips in Labelled Planar Triangulations.
Graphs and Combinatorics 17(4): 647-657 (2001) |
| 89 | | Prosenjit Bose,
Pat Morin,
Ivan Stojmenovic,
Jorge Urrutia:
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks.
Wireless Networks 7(6): 609-616 (2001) |
| 2000 |
|---|
| 88 | EE | Ralph P. Boland,
Jorge Urrutia:
Circular Ray Shooting: Slower but Surer.
CCCG 2000 |
| 87 | EE | Jurek Czyzowicz,
Evangelos Kranakis,
Jorge Urrutia:
Guarding the Convex Subsets of a Point-set.
CCCG 2000 |
| 86 | EE | Ralph P. Boland,
Jorge Urrutia:
Polygon Area Problems.
CCCG 2000 |
| 85 | EE | Jin Akiyama,
Hiroshi Fukuda,
Gisaku Nakamura,
Toshinori Sakai,
Jorge Urrutia,
Carlos Zamora-Cura:
Universal Measuring Devices without Gradations.
JCDCG 2000: 31-40 |
| 84 | EE | Jin Akiyama,
Toshinori Sakai,
Jorge Urrutia:
Sequentially Divisible Dissections of Simple Polygons.
JCDCG 2000: 53-66 |
| 83 | EE | Vladimir Estivill-Castro,
Marc Noy,
Jorge Urrutia:
On the chromatic number of tree graphs.
Discrete Mathematics 223(1-3): 363-366 (2000) |
| 82 | | Jean-Daniel Boissonnat,
Jurek Czyzowicz,
Olivier Devillers,
Jorge Urrutia,
Mariette Yvinec:
Computing Largest Circles Separating Two Sets of Segments.
Int. J. Comput. Geometry Appl. 10(1): 41-53 (2000) |
| 1999 |
|---|
| 81 | EE | Evangelos Kranakis,
Harvinder Singh,
Jorge Urrutia:
Compass routing on geometric networks.
CCCG 1999 |
| 80 | EE | Jurek Czyzowicz,
Evangelos Kranakis,
Jorge Urrutia:
Dissections, cuts and triangulations.
CCCG 1999 |
| 79 | EE | György Csizmadia,
Jurek Czyzowicz,
Leszek Gasieniec,
Evangelos Kranakis,
Jorge Urrutia:
Domino tilings of orthogonal polygons.
CCCG 1999 |
| 78 | EE | Prosenjit Bose,
Pat Morin,
Ivan Stojmenovic,
Jorge Urrutia:
Routing with guaranteed delivery in ad hoc wireless networks.
DIAL-M 1999: 48-55 |
| 77 | | Sergio Rajsbaum,
Jorge Urrutia:
Some Problems in Distributed Computational Geometry.
SIROCCO 1999: 223-248 |
| 76 | EE | Jean-Daniel Boissonnat,
Jurek Czyzowicz,
Olivier Devillers,
Jorge Urrutia,
Mariette Yvinec:
Computing largest circles separating two sets of segments
CoRR cs.CG/9909005: (1999) |
| 75 | | Kurt Mehlhorn,
Jörg-Rüdiger Sack,
Jorge Urrutia:
Editorial.
Comput. Geom. 12(3-4): 153-154 (1999) |
| 74 | EE | Jesús A. De Loera,
Francisco Santos,
Jorge Urrutia:
The Number of Geometric Bistellar Neighbors of a Triangulation.
Discrete & Computational Geometry 21(1): 131-142 (1999) |
| 73 | EE | Ferran Hurtado,
Marc Noy,
Jorge Urrutia:
Flipping Edges in Triangulations.
Discrete & Computational Geometry 22(3): 333-346 (1999) |
| 72 | EE | Victor Neumann-Lara,
Eduardo Rivera-Campo,
Jorge Urrutia:
A note on covering the edges of a graph with bonds.
Discrete Mathematics 197-198: 633-636 (1999) |
| 71 | | Evangelos Kranakis,
Jorge Urrutia:
Isomorphic Triangulations with Small Number of Steiner Points.
Int. J. Comput. Geometry Appl. 9(2): 171- (1999) |
| 70 | | Jurek Czyzowicz,
Ivan Stojmenovic,
Jorge Urrutia:
Immobilizing a Shape.
Int. J. Comput. Geometry Appl. 9(2): 181- (1999) |
| 1998 |
|---|
| 69 | EE | Felipe Contreras,
Jurek Czyzowicz,
Nicolas Fraiji,
Jorge Urrutia:
Illuminating triangles and quadrilaterals with vertex floodlights.
CCCG 1998 |
| 68 | EE | Jurek Czyzowicz,
F. Contreras-Alcalá,
Jorge Urrutia:
On measuring areas of polygons.
CCCG 1998 |
| 67 | EE | Ferran Hurtado,
Marc Noy,
Jorge Urrutia:
Parallel edge flipping.
CCCG 1998 |
| 66 | EE | Jin Akiyama,
Gisaku Nakamura,
Eduardo Rivera-Campo,
Jorge Urrutia:
Perfect divisions of a cake.
CCCG 1998 |
| 65 | | Jin Akiyama,
Atsushi Kaneko,
Mikio Kano,
Gisaku Nakamura,
Eduardo Rivera-Campo,
Shin-ichi Tokunaga,
Jorge Urrutia:
Radial Perfect Partitions of Convex Sets in the Plane.
JCDCG 1998: 1-13 |
| 64 | | Evangelos Kranakis,
Danny Krizanc,
Jorge Urrutia:
Efficient Regular Polygon Dissections.
JCDCG 1998: 172-187 |
| 63 | EE | Felipe Contreras,
Jurek Czyzowicz,
Eduardo Rivera-Campo,
Jorge Urrutia:
Optimal Floodlight Illumination of Stages.
Symposium on Computational Geometry 1998: 409-410 |
| 62 | EE | Jurek Czyzowicz,
Evangelos Kranakis,
Jorge Urrutia:
A Simple Proof of the Representation of Bipartite Planar Graphs as the Contact Graphs of Orthogonal Straight Line Segments.
Inf. Process. Lett. 66(3): 125-126 (1998) |
| 61 | | James Abello,
Vladimir Estivill-Castro,
Thomas C. Shermer,
Jorge Urrutia:
Illumination of Orthogonal Polygons with Orthogonal Floodlights.
Int. J. Comput. Geometry Appl. 8(1): 25-38 (1998) |
| 1997 |
|---|
| 60 | | Jurek Czyzowicz,
Evangelos Kranakis,
Jorge Urrutia:
Domino tilings and two-by-two squares.
CCCG 1997 |
| 59 | | Jorge Urrutia:
On the number of internal and external visibility edges of polygons.
CCCG 1997 |
| 58 | | Jurek Czyzowicz,
Evangelos Kranakis,
Danny Krizanc,
Jorge Urrutia:
Discrete Realizations of Contact and Intersection Graphs.
Graph Drawing 1997: 359-370 |
| 57 | EE | Manuel Abellanas,
Gregorio Hernández-Peñalver,
Rolf Klein,
Victor Neumann-Lara,
Jorge Urrutia:
A Combinatorial Property of Convex Sets.
Discrete & Computational Geometry 17(3): 307-318 (1997) |
| 56 | EE | Evangelos Kranakis,
Danny Krizanc,
Anil Maheshwari,
Marc Noy,
Jörg-Rüdiger Sack,
Jorge Urrutia:
Stage-graph Representations.
Discrete Applied Mathematics 75(1): 71-80 (1997) |
| 55 | EE | Evangelos Kranakis,
Danny Krizanc,
Berthold Ruf,
Jorge Urrutia,
Gerhard J. Woeginger:
The VC-dimension of Set Systems Defined by Graphs.
Discrete Applied Mathematics 77(3): 237-257 (1997) |
| 54 | EE | Alberto Negro,
Nicola Santoro,
Jorge Urrutia:
Efficient Distributed Selection with Bounded Messages.
IEEE Trans. Parallel Distrib. Syst. 8(4): 397-401 (1997) |
| 53 | | Prosenjit Bose,
Leonidas J. Guibas,
Anna Lubiw,
Mark H. Overmars,
Diane L. Souvaine,
Jorge Urrutia:
The Floodlight Problem.
Int. J. Comput. Geometry Appl. 7(1/2): 153-163 (1997) |
| 52 | EE | Frank Bauernöppel,
Evangelos Kranakis,
Danny Krizanc,
Anil Maheshwari,
Jörg-Rüdiger Sack,
Jorge Urrutia:
Planar Stage Graphs: Characterizations and Applications.
Theor. Comput. Sci. 175(2): 239-255 (1997) |
| 1996 |
|---|
| 51 | | Jean-Daniel Boissonnat,
Jurek Czyzowicz,
Olivier Devillers,
Jorge Urrutia,
Mariette Yvinec:
Computing Largest Circles Separating Two Sets of Segments.
CCCG 1996: 173-178 |
| 50 | | Jurek Czyzowicz,
Evangelos Kranakis,
Danny Krizanc,
Jorge Urrutia:
Maximal Length Common Non-intersecting Paths.
CCCG 1996: 185-189 |
| 49 | | Netzahualcoyotl Castañeda,
Jorge Urrutia:
Straight Line Embeddings of Planar Graphs on Point Sets.
CCCG 1996: 312-318 |
| 48 | EE | Ferran Hurtado,
Marc Noy,
Jorge Urrutia:
Flipping Edges in Triangulations.
Symposium on Computational Geometry 1996: 214-223 |
| 47 | EE | Jin Akiyama,
Y. Ishigami,
Masatsugu Urabe,
Jorge Urrutia:
On circles containing the maximum number of points.
Discrete Mathematics 151(1-3): 15-18 (1996) |
| 46 | EE | Ferran Hurtado,
Oriol Serra,
Jorge Urrutia:
Hiding points in arrangements of segments.
Discrete Mathematics 162(1-3): 187-197 (1996) |
| 45 | EE | Manuel Abellanas,
Jesus Garcia-Lopez,
Gregorio Hernández-Peñalver,
Ferran Hurtado,
Oriol Serra,
Jorge Urrutia:
Onion Polygonizations.
Inf. Process. Lett. 57(3): 165-173 (1996) |
| 1995 |
|---|
| 44 | | Frank Bauernöppel,
Evangelos Kranakis,
Danny Krizanc,
Anil Maheshwari,
Marc Noy,
Jörg-Rüdiger Sack,
Jorge Urrutia:
Optimal Shooting: Characterizations and Applications.
ICALP 1995: 220-231 |
| 43 | | James Abello,
Vladimir Estivill-Castro,
Thomas C. Shermer,
Jorge Urrutia:
Illumination with Orthogonal Floodlights.
ISAAC 1995: 362-371 |
| 42 | | Evangelos Kranakis,
Danny Krizanc,
Jorge Urrutia:
Implicit Routing and Shortest Path Information (Extended Abstract).
SIROCCO 1995: 101-112 |
| 41 | EE | Manuel Abellanas,
Gregorio Hernández-Peñalver,
Rolf Klein,
Victor Neumann-Lara,
Jorge Urrutia:
Voronoi Diagrams and Containment of Families of Convex Sets on the Plane.
Symposium on Computational Geometry 1995: 71-78 |
| 40 | | Vladimir Estivill-Castro,
Jorge Urrutia:
Two-Floodlight Illumination of Convex Polygons.
WADS 1995: 62-73 |
| 39 | | Evangelos Kranakis,
Danny Krizanc,
Berthold Ruf,
Jorge Urrutia,
Gerhard J. Woeginger:
VC-Dimensions for Graphs (Extended Abstract).
WG 1995: 1-13 |
| 38 | EE | Jurek Czyzowicz,
Eduardo Rivera-Campo,
Jorge Urrutia,
Joseph Zaks:
On illuminating line segments in the plane.
Discrete Mathematics 137(1-3): 147-153 (1995) |
| 37 | EE | Ralph P. Boland,
Jorge Urrutia:
Separating Collections of Points in Euclidean Spaces.
Inf. Process. Lett. 53(4): 177-183 (1995) |
| 36 | EE | Ralph P. Boland,
Jorge Urrutia:
Corrigendum: Separating Collections of Points in Euclidean Spaces.
Inf. Process. Lett. 54(6): 359 (1995) |
| 35 | EE | Vladimir Estivill-Castro,
Joseph O'Rourke,
Jorge Urrutia,
Dianna Xu:
Illumination of Polygons with Vertex Lights.
Inf. Process. Lett. 56(1): 9-13 (1995) |
| 1994 |
|---|
| 34 | | Patrice Belleville,
Prosenjit Bose,
Jurek Czyzowicz,
Jorge Urrutia,
Joseph Zaks:
K-Guarding Polygons on the Plane.
CCCG 1994: 381-386 |
| 33 | | Vladimir Estivill-Castro,
Jorge Urrutia:
Optimal Floodlight Illumination of Orthogonal Art Galleries.
CCCG 1994: 81-86 |
| 32 | | Evangelos Kranakis,
Danny Krizanc,
Jorge Urrutia:
On the Number of Directions in Visibility Representations.
Graph Drawing 1994: 167-176 |
| 31 | | Jurek Czyzowicz,
Eduardo Rivera-Campo,
Nicola Santoro,
Jorge Urrutia,
Joseph Zaks:
Guarding rectangular art galleries.
Discrete Applied Mathematics 50(2): 149-157 (1994) |
| 30 | EE | Jurek Czyzowicz,
Eduardo Rivera-Campo,
Jorge Urrutia:
Separation of Convex Sets.
Discrete Applied Mathematics 51(3): 325-328 (1994) |
| 29 | EE | Fanica Gavril,
Jorge Urrutia:
Intersection Graphs of Concatenable Subtrees of Graphs.
Discrete Applied Mathematics 52(2): 195-209 (1994) |
| 1993 |
|---|
| 28 | | Jurek Czyzowicz,
Eduardo Rivera-Campo,
Jorge Urrutia:
Optimal Floodlight Illumination of Stages.
CCCG 1993: 393-398 |
| 27 | | Prosenjit Bose,
Leonidas J. Guibas,
Anna Lubiw,
Mark H. Overmars,
Diane L. Souvaine,
Jorge Urrutia:
The Floodlight Problem.
CCCG 1993: 399-404 |
| 26 | | Manuel Abellanas,
Jesus Garcia-Lopez,
Gregorio Hernández-Peñalver,
Ferran Hurtado,
Oriol Serra,
Jorge Urrutia:
Updating Polygonizations.
Comput. Graph. Forum 12(3): 143-152 (1993) |
| 25 | EE | Jurek Czyzowicz,
Eduardo Rivera-Campo,
Jorge Urrutia:
Illuminating Rectangles and Triangles in the Plane.
J. Comb. Theory, Ser. B 57(1): 1-17 (1993) |
| 1992 |
|---|
| 24 | | Jurek Czyzowicz,
Eduardo Rivera-Campo,
Jorge Urrutia:
Separating Convex Sets in the Plane.
Discrete & Computational Geometry 7: 189-195 (1992) |
| 23 | EE | Stephan Foldes,
Ivan Rival,
Jorge Urrutia:
Light sources, obstructions and spherical orders.
Discrete Mathematics 102(1): 13-23 (1992) |
| 22 | EE | Ivan Rival,
Jorge Urrutia:
Representing orders by moving figures in space.
Discrete Mathematics 109(1-3): 255-263 (1992) |
| 21 | | Jorge Urrutia,
Fanica Gavril:
An Algorithm for Fraternal Orientation of Graphs.
Inf. Process. Lett. 41(5): 271-274 (1992) |
| 20 | | Binay K. Bhattacharya,
Jirel Czyzowicz,
Peter Egyed,
Godfried T. Toussaint,
Ivan Stojmenovic,
Jorge Urrutia:
Computing shortest transversals of sets.
Int. J. Comput. Geometry Appl. 2(4): 417-442 (1992) |
| 1991 |
|---|
| 19 | | Jirel Czyzowicz,
Peter Egyed,
Hazel Everett,
David Rappaport,
Thomas C. Shermer,
Diane L. Souvaine,
Godfried T. Toussaint,
Jorge Urrutia:
The Aquarium Keeper's Problem.
SODA 1991: 459-464 |
| 18 | EE | Binay K. Bhattacharya,
Jurek Czyzowicz,
Peter Egyed,
Ivan Stojmenovic,
Godfried T. Toussaint,
Jorge Urrutia:
Computing Shortest Transversals of Sets (Extended Abstract).
Symposium on Computational Geometry 1991: 71-80 |
| 17 | | Jurek Czyzowicz,
Ivan Stojmenovic,
Jorge Urrutia:
Immobilizing a Polytope.
WADS 1991: 214-227 |
| 16 | | Jurek Czyzowicz,
Eduardo Rivera-Campo,
Nicola Santoro,
Jorge Urrutia,
Joseph Zaks:
Tight Bounds for the Rectangualr Art Gallery Problem.
WG 1991: 105-112 |
| 15 | | Fawzi Al-Thukair,
Andrzej Pelc,
Ivan Rival,
Jorge Urrutia:
Motion Planning, Two-Directional Point Representations, and Ordered Sets.
SIAM J. Discrete Math. 4(2): 151-163 (1991) |
| 1990 |
|---|
| 14 | EE | Jin Akiyama,
Jorge Urrutia:
A note on balanced colourings for lattice points.
Discrete Mathematics 83(1): 123-126 (1990) |
| 13 | EE | Jin Akiyama,
Jorge Urrutia:
Simple alternating path problem.
Discrete Mathematics 84(1): 101-103 (1990) |
| 1989 |
|---|
| 12 | | Jurek Czyzowicz,
Ivan Rival,
Jorge Urrutia:
Galleries, Light Matchings and Visibility Graphs.
WADS 1989: 316-324 |
| 11 | | Imre Bárány,
James H. Schmerl,
Stuart J. Sidney,
Jorge Urrutia:
A Combinatorial Result About Points and Balls in Euclidean Space.
Discrete & Computational Geometry 4: 259-262 (1989) |
| 10 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney,
Jorge Urrutia:
Geometric Containment and Partial Orders.
SIAM J. Discrete Math. 2(2): 245-254 (1989) |
| 1988 |
|---|
| 9 | | Nicola Santoro,
Stuart J. Sidney,
Jorge Urrutia:
Geometric Containment, Common Roots of Polynomials and Partial Orders.
STACS 1988: 292-300 |
| 8 | EE | Victor Neumann-Lara,
Jorge Urrutia:
A combinatorial result on points and circles on the plane.
Discrete Mathematics 69(2): 173-178 (1988) |
| 1987 |
|---|
| 7 | | Jan van Leeuwen,
Nicola Santoro,
Jorge Urrutia,
Shmuel Zaks:
Guessing Games and Distributed Computations in Synchronous Networks.
ICALP 1987: 347-356 |
| 6 | | Alberto Negro,
Nicola Santoro,
Jorge Urrutia:
On the Packet Complexity of Distributed Selection.
WDAG 1987: 108-115 |
| 5 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney,
Jorge Urrutia:
Geometric Containment and Vector Dominance.
Theor. Comput. Sci. 53: 345-352 (1987) |
| 1986 |
|---|
| 4 | EE | Victor Neumann-Lara,
Nicola Santoro,
Jorge Urrutia:
Uniquely colourable m-dichromatic oriented graphs.
Discrete Mathematics 62(1): 65-70 (1986) |
| 1985 |
|---|
| 3 | | Nicola Santoro,
Jeffrey B. Sidney,
Stuart J. Sidney,
Jorge Urrutia:
Geometric Containment is not Reducible to Pareto Dominance.
STACS 1985: 322-327 |
| 1984 |
|---|
| 2 | EE | Victor Neumann-Lara,
Jorge Urrutia:
Vertex critical r-dichromatic tournaments.
Discrete Mathematics 49(1): 83-87 (1984) |
| 1983 |
|---|
| 1 | EE | Martin Charles Golumbic,
Doron Rotem,
Jorge Urrutia:
Comparability graphs and intersection graphs.
Discrete Mathematics 43(1): 37-46 (1983) |
