The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jorge Urrutia: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jorge Urrutia
    Routing in Wireless Networks and Local Solutions for Global Problems. [Citation Graph (0, 0)][DBLP]
    ADHOC-NOW, 2005, pp:3- [Conf]
  2. 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]
  3. Jin Akiyama, Gisaku Nakamura, Eduardo Rivera-Campo, Jorge Urrutia
    Perfect divisions of a cake. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  4. 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]
  5. Ralph P. Boland, Jorge Urrutia
    Circular Ray Shooting: Slower but Surer. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  6. Ralph P. Boland, Jorge Urrutia
    Polygon Area Problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  7. Ralph P. Boland, Jorge Urrutia
    A simpler circular ray shooting algorithm. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:37-40 [Conf]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. Felipe Contreras, Jurek Czyzowicz, Nicolas Fraiji, Jorge Urrutia
    Illuminating triangles and quadrilaterals with vertex floodlights. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  13. 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]
  14. Jurek Czyzowicz, F. Contreras-Alcalá, Jorge Urrutia
    On measuring areas of polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  15. 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]
  16. Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia
    Guarding the Convex Subsets of a Point-set. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  17. Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia
    Domino tilings and two-by-two squares. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  18. Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia
    Dissections, cuts and triangulations. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  19. Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia
    Optimal Floodlight Illumination of Stages. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:393-398 [Conf]
  20. Vladimir Estivill-Castro, Jorge Urrutia
    Optimal Floodlight Illumination of Orthogonal Art Galleries. [Citation Graph (0, 0)][DBLP]
    CCCG, 1994, pp:81-86 [Conf]
  21. Ferran Hurtado, Marc Noy, Jorge Urrutia
    Parallel edge flipping. [Citation Graph (0, 0)][DBLP]
    CCCG, 1998, pp:- [Conf]
  22. Evangelos Kranakis, Harvinder Singh, Jorge Urrutia
    Compass routing on geometric networks. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  23. Jorge Urrutia
    On the number of internal and external visibility edges of polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  24. 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]
  25. 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]
  26. 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]
  27. Ferran Hurtado, Marc Noy, Jorge Urrutia
    Flipping Edges in Triangulations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:214-223 [Conf]
  28. 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]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. 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]
  39. Evangelos Kranakis, Danny Krizanc, Jorge Urrutia
    Efficient Regular Polygon Dissections. [Citation Graph (0, 0)][DBLP]
    JCDCG, 1998, pp:172-187 [Conf]
  40. 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]
  41. 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]
  42. 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]
  43. 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]
  44. 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]
  45. Jin Akiyama, Toshinori Sakai, Jorge Urrutia
    Sequentially Divisible Dissections of Simple Polygons. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:53-66 [Conf]
  46. 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]
  47. Toshinori Sakai, Chie Nara, Jorge Urrutia
    Equal Area Polygons in Convex Bodies. [Citation Graph (0, 0)][DBLP]
    IJCCGGT, 2003, pp:146-158 [Conf]
  48. 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]
  49. Jorge Urrutia
    Open Problems in Computational Geometry. [Citation Graph (0, 0)][DBLP]
    LATIN, 2002, pp:4-11 [Conf]
  50. 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]
  51. 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]
  52. 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]
  53. Sergio Rajsbaum, Jorge Urrutia
    Some Problems in Distributed Computational Geometry. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1999, pp:223-248 [Conf]
  54. 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]
  55. 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]
  56. 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]
  57. Jurek Czyzowicz, Ivan Rival, Jorge Urrutia
    Galleries, Light Matchings and Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:316-324 [Conf]
  58. Jurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia
    Immobilizing a Polytope. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:214-227 [Conf]
  59. Vladimir Estivill-Castro, Jorge Urrutia
    Two-Floodlight Illumination of Convex Polygons. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:62-73 [Conf]
  60. Alberto Negro, Nicola Santoro, Jorge Urrutia
    On the Packet Complexity of Distributed Selection. [Citation Graph (0, 0)][DBLP]
    WDAG, 1987, pp:108-115 [Conf]
  61. 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]
  62. 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]
  63. 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]
  64. 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]
  65. 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]
  66. 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]
  67. 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]
  68. 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]
  69. 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]
  70. 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]
  71. 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]
  72. 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]
  73. 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]
  74. 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]
  75. 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]
  76. 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]
  77. 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]
  78. 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]
  79. 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]
  80. 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]
  81. 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]
  82. 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]
  83. 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]
  84. 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]
  85. 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]
  86. 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]
  87. 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]
  88. 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]
  89. 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]
  90. 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]
  91. 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]
  92. 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]
  93. 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]
  94. 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]
  95. 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]
  96. 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]
  97. 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]
  98. 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]
  99. 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]
  100. 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]
  101. 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]
  102. 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]
  103. 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]
  104. 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]
  105. 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]
  106. 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]
  107. 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]
  108. 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]
  109. 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]
  110. 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]
  111. 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]
  112. 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]
  113. 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]
  114. 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]
  115. 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]
  116. 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]
  117. 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]
  118. 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]
  119. 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]
  120. Jin Akiyama, Jorge Urrutia
    Simple alternating path problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:1, pp:101-103 [Journal]
  121. 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]
  122. 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]
  123. 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]
  124. 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]

  125. On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. [Citation Graph (, )][DBLP]


  126. On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment. [Citation Graph (, )][DBLP]


  127. Memory Requirements for Local Geometric Routing and Traversal in Digraphs. [Citation Graph (, )][DBLP]


  128. Empty Monochromatic Triangles. [Citation Graph (, )][DBLP]


  129. Triangulations with many points of even degree. [Citation Graph (, )][DBLP]


  130. Covering point sets with two convex objects. [Citation Graph (, )][DBLP]


  131. Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes. [Citation Graph (, )][DBLP]


  132. Local 7-Coloring for Planar Subgraphs of Unit Disk Graphs. [Citation Graph (, )][DBLP]


  133. Augmenting the connectivity of geometric graphs. [Citation Graph (, )][DBLP]


  134. Covering point sets with two disjoint disks or squares. [Citation Graph (, )][DBLP]


  135. Empty monochromatic triangles. [Citation Graph (, )][DBLP]


  136. Compatible geometric matchings. [Citation Graph (, )][DBLP]


  137. On k-Convex Polygons [Citation Graph (, )][DBLP]


  138. Finding a minimum independent dominating set in a permutation graph. [Citation Graph (, )][DBLP]


  139. Representing orders on the plane by translating points and lines. [Citation Graph (, )][DBLP]


  140. Matching Points with Squares. [Citation Graph (, )][DBLP]


  141. Simple Euclidean Arrangements with No (>= 5)-Gons. [Citation Graph (, )][DBLP]


Search in 0.251secs, Finished in 0.255secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002