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