| 2013 | ||
|---|---|---|
| j88 | Sergey Bereg, José Miguel Díaz-Báñez, Dolores Lara, Pablo Pérez-Lantero, Carlos Seara, Jorge Urrutia: On the coarseness of bicolored point sets. Comput. Geom. 46(1): 65-77 (2013) | |
| c80 | Stefan Dobrev, Stephane Durocher, Mohsen Eftekhari Hesari, Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc, Lata Narayanan, Jaroslav Opatrny, Sunil M. Shende, Jorge Urrutia: Complexity of Barrier Coverage with Relocatable Sensors in the Plane. CIAC 2013: 170-182 | |
| 2012 | ||
| j87 | Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia: On k-convex polygons. Comput. Geom. 45(3): 73-87 (2012) | |
| j86 | Boris Aronov, Delia Garijo, Yurai Núñez Rodríguez, David Rappaport, Carlos Seara, Jorge Urrutia: Minimizing the error of linear separators on linearly inseparable data. Discrete Applied Mathematics 160(10-11): 1441-1452 (2012) | |
| j85 | Crevel Bautista-Santiago, José Miguel Díaz-Báñez, Ruy Fabila Monroy, David Flores-Peñaloza, Dolores Lara, Jorge Urrutia: Covering moving points with anchored disks. European Journal of Operational Research 216(2): 278-285 (2012) | |
| j84 | Ruy Fabila Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, Jorge Urrutia, David R. Wood: Token Graphs. Graphs and Combinatorics 28(3): 365-380 (2012) | |
| j83 | José Miguel Díaz-Báñez, Ruy Fabila Monroy, David Flores-Peñaloza, Marco A. Heredia, Jorge Urrutia: Min-energy broadcast in mobile ad hoc networks with restricted motion. J. Comb. Optim. 24(4): 413-426 (2012) | |
| c79 | Evangelos Kranakis, Fraser MacQuarie, Oscar Morales Ponce, Jorge Urrutia: Uninterrupted Coverage of a Planar Region with Rotating Directional Antennae. ADHOC-NOW 2012: 56-68 | |
| c78 | ||
| c77 | ||
| i6 | Crevel Bautista-Santiago, Javier Cano, Ruy Fabila Monroy, David Flores-Peñaloza, Hernán González-Aguilar, Dolores Lara, Eliseo Sarmiento, Jorge Urrutia: On the Connectedness and Diameter of a Geometric Johnson Graph. CoRR abs/1202.3455 (2012) | |
| i5 | Francisco Escalona, Ruy Fabila Monroy, Jorge Urrutia: Hamiltonian Tetrahedralizations with Steiner Points. CoRR abs/1210.5484 (2012) | |
| i4 | Oswin Aichholzer, Ruy Fabila Monroy, Thomas Hackl, Clemens Huemer, Jorge Urrutia: Empty Monochromatic Simplices. CoRR abs/1210.7043 (2012) | |
| 2011 | ||
| j82 | Crevel Bautista-Santiago, José Miguel Díaz-Báñez, Dolores Lara, Pablo Pérez-Lantero, Jorge Urrutia, Inmaculada Ventura: Computing optimal islands. Oper. Res. Lett. 39(4): 246-251 (2011) | |
| j81 | Jurek Czyzowicz, Stefan Dobrev, Hernán González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia: Local 7-coloring for planar subgraphs of unit disk graphs. Theor. Comput. Sci. 412(18): 1696-1704 (2011) | |
| j80 | Sergio Rajsbaum, Jorge Urrutia: Some problems in distributed computational geometry. Theor. Comput. Sci. 412(41): 5760-5770 (2011) | |
| c76 | Canek Peláez, José Miguel Díaz-Báñez, Marco A. Heredia, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura: Convex blocking and partial orders on the plane. CCCG 2011 | |
| c75 | Giovanni Viglietta, Nadia Benbernou, Erik D. Demaine, Martin L. Demaine, Anastasia Kurdia, Joseph O'Rourke, Godfried T. Toussaint, Jorge Urrutia: Edge-guarding Orthogonal Polyhedra. CCCG 2011 | |
| c74 | Birgit Vogtenhuber, Oswin Aichholzer, Ruy Fabila Monroy, Clemens Huemer, Jorge Urrutia, Marco A. Heredia, Hernán González-Aguilar, Thomas Hackl, Pavel Valtr: On k-Gons and k-Holes in Point Sets. CCCG 2011 | |
| c73 | Javier Cano, Csaba D. Tóth, Jorge Urrutia: Upper Bound Constructions for Untangling Planar Geometric Graphs. Graph Drawing 2011: 290-295 | |
| 2010 | ||
| c72 | Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani: On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment. ADHOC-NOW 2010: 29-42 | |
| c71 | Jorge Urrutia, Canek Peláez, Adriana Ramírez-Viguer: Triangulations with many points of even degree. CCCG 2010: 103-106 | |
| c70 | Toshinori Sakai, Jorge Urrutia: Monotonic Polygons and Paths in Weighted Point Sets. CGGA 2010: 164-175 | |
| i3 | Oswin Aichholzer, Franz Aurenhammer, Erik D. Demaine, Ferran Hurtado, Pedro Ramos, Jorge Urrutia: On k-Convex Polygons. CoRR abs/1007.3607 (2010) | |
| 2009 | ||
| j79 | Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood: Compatible geometric matchings. Comput. Geom. 42(6-7): 617-626 (2009) | |
| j78 | Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Jorge Urrutia: Empty monochromatic triangles. Comput. Geom. 42(9): 934-938 (2009) | |
| j77 | Bernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia: Matching Points with Squares. Discrete & Computational Geometry 41(1): 77-95 (2009) | |
| j76 | Ruy Fabila Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, David R. Wood, Jorge Urrutia: On the Chromatic Number of some Flip Graphs. Discrete Mathematics & Theoretical Computer Science 11(2): 47-56 (2009) | |
| j75 | Ferran Hurtado, Criel Merino, Deborah Oliveros, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura: On Polygons Enclosing Point Sets II. Graphs and Combinatorics 25(3): 327-339 (2009) | |
| j74 | C. Cortés, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara, Jorge Urrutia, Inmaculada Ventura: Bichromatic separability with two boxes: A general approach. J. Algorithms 64(2-3): 79-88 (2009) | |
| c69 | Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani: On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line Segment. ADHOC-NOW 2009: 194-212 | |
| 2008 | ||
| j73 | Sergio Cabello, José Miguel Díaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura: Covering point sets with two disjoint disks or squares. Comput. Geom. 40(3): 195-206 (2008) | |
| j72 | Manuel Abellanas, Alfredo García Olaverri, Ferran Hurtado, Javier Tejel, Jorge Urrutia: Augmenting the connectivity of geometric graphs. Comput. Geom. 40(3): 220-230 (2008) | |
| j71 | Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood: Compatible Geometric Matchings. Electronic Notes in Discrete Mathematics 31: 201-206 (2008) | |
| j70 | Gabriela Araujo, József Balogh, Ruy Fabila Monroy, Gelasio Salazar, Jorge Urrutia: A note on harmonic subgraphs in labelled geometric graphs. Inf. Process. Lett. 105(3): 98-102 (2008) | |
| j69 | José Miguel Díaz-Báñez, Gregorio Hernández-Peñalver, Deborah Oliveros, A. Ramírez-Vigueras, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura: Computing shortest heterochromatic monotone routes. Oper. Res. Lett. 36(6): 684-687 (2008) | |
| j68 | Jin Akiyama, Hiroshi Fukuda, Chie Nara, Toshinori Sakai, Jorge Urrutia: Universal Measuring Boxes with Triangular Bases. The American Mathematical Monthly 115(3): 195-201 (2008) | |
| c68 | Oswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Jorge Urrutia: Empty Monochromatic Triangles. CCCG 2008 | |
| c67 | Maia Fraser, Evangelos Kranakis, Jorge Urrutia: Memory Requirements for Local Geometric Routing and Traversal in Digraphs. CCCG 2008 | |
| c66 | Jurek Czyzowicz, Stefan Dobrev, Thomas Fevens, Hernán 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 | |
| c65 | Jurek Czyzowicz, Stefan Dobrev, Hernán 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 | |
| 2007 | ||
| j67 | Luis Montejano, Jorge Urrutia: Paths of Trains with Two-Wheeled Cars. Discrete & Computational Geometry 38(1): 99-110 (2007) | |
| j66 | Jesús 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) | |
| j65 | Jorge Urrutia: Local solutions for global problems in wireless networks. J. Discrete Algorithms 5(3): 395-407 (2007) | |
| c64 | 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 | |
| 2006 | ||
| j64 | 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) | |
| j63 | 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) | |
| c63 | 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 | |
| 2005 | ||
| j62 | 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) | |
| j61 | Jorge Urrutia: In memoriam In memory of Professor Victor Neumann-Lara. Graphs and Combinatorics 21(3): 289-291 (2005) | |
| j60 | 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) | |
| j59 | Constantinos Georgiou, Evangelos Kranakis, Ricardo Marcelín-Jiménez, Sergio Rajsbaum, Jorge Urrutia: Distributed Dynamic Storage in Wireless Networks. IJDSN 1(3&4): 355-371 (2005) | |
| j58 | Ruy Fabila Monroy, Jorge Urrutia: Graham triangulations and triangulations with a center are hamiltonean. Inf. Process. Lett. 93(6): 295-299 (2005) | |
| j57 | 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) | |
| j56 | 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) | |
| c62 | Jorge Urrutia: Routing in Wireless Networks and Local Solutions for Global Problems. ADHOC-NOW 2005: 3 | |
| c61 | V. M. Heredia, Jorge Urrutia: On Convex Quadrangulations of Point Sets on the Plane. CJCDGCGT 2005: 38-46 | |
| c60 | 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 | |
| i2 | José Miguel Díaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura: Covering point sets with two convex objects. EuroCG 2005: 179-182 | |
| 2004 | ||
| j55 | Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia: A note on minimally 3-connected graphs. Discussiones Mathematicae Graph Theory 24(1): 115-123 (2004) | |
| j54 | Jin Akiyama, Ferran Hurtado, Criel Merino, Jorge Urrutia: A Problem on Hinged Dissections with Colours. Graphs and Combinatorics 20(2): 145-159 (2004) | |
| j53 | 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) | |
| j52 | 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) | |
| c59 | 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 | |
| c58 | Evangelos Kranakis, Danny Krizanc, Jorge Urrutia: Coverage and Connectivity in Networks with Directional Sensors. Euro-Par 2004: 917-924 | |
| c57 | 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 | |
| c56 | 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 | |
| c55 | 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 | |
| 2003 | ||
| j51 | 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) | |
| c54 | Ralph P. Boland, Jorge Urrutia: Partitioning Polygons into Tree Monotone and -monotone Subpolygons. ICCSA (3) 2003: 903-912 | |
| c53 | Jin Akiyama, Koichi Hirata, Mari-Jo P. Ruiz, Jorge Urrutia: Flat 2-Foldings of Convex Polygons. IJCCGGT 2003: 14-24 | |
| c52 | Kiyoshi Hosono, Ferran Hurtado, Masatsugu Urabe, Jorge Urrutia: On a Triangle with the Maximum Area in a Planar Point Set. IJCCGGT 2003: 102-107 | |
| c51 | Jesús Leaños, Criel Merino, Gelasio Salazar, Jorge Urrutia: Spanning Trees of Multicoloured Point Sets with Few Intersections. IJCCGGT 2003: 113-122 | |
| c50 | Toshinori Sakai, Chie Nara, Jorge Urrutia: Equal Area Polygons in Convex Bodies. IJCCGGT 2003: 146-158 | |
| 2002 | ||
| c49 | 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 | |
| c48 | Chie Nara, Toshinori Sakai, Jorge Urrutia: Maximal Number of Edges in Geometric Graphs without Convex Polygons. JCDCG 2002: 215-220 | |
| c47 | ||
| 2001 | ||
| j50 | 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) | |
| j49 | Zhicheng Gao, Jorge Urrutia, Jianyu Wang: Diagonal Flips in Labelled Planar Triangulations. Graphs and Combinatorics 17(4): 647-657 (2001) | |
| j48 | Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge Urrutia: Routing with Guaranteed Delivery in Ad Hoc Wireless Networks. Wireless Networks 7(6): 609-616 (2001) | |
| c46 | ||
| c45 | Ralph P. Boland, Jorge Urrutia: Finding the largest axis aligned rectangle in a polygon in o(n log n) time. CCCG 2001: 41-44 | |
| 2000 | ||
| j47 | Vladimir Estivill-Castro, Marc Noy, Jorge Urrutia: On the chromatic number of tree graphs. Discrete Mathematics 223(1-3): 363-366 (2000) | |
| j46 | 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) | |
| c44 | ||
| c43 | ||
| c42 | Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia: Guarding the Convex Subsets of a Point-set. CCCG 2000 | |
| c41 | Jin Akiyama, Hiroshi Fukuda, Gisaku Nakamura, Toshinori Sakai, Jorge Urrutia, Carlos Zamora-Cura: Universal Measuring Devices without Gradations. JCDCG 2000: 31-40 | |
| c40 | Jin Akiyama, Toshinori Sakai, Jorge Urrutia: Sequentially Divisible Dissections of Simple Polygons. JCDCG 2000: 53-66 | |
| 1999 | ||
| j45 | ||
| j44 | 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) | |
| j43 | Ferran Hurtado, Marc Noy, Jorge Urrutia: Flipping Edges in Triangulations. Discrete & Computational Geometry 22(3): 333-346 (1999) | |
| j42 | 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) | |
| j41 | Evangelos Kranakis, Jorge Urrutia: Isomorphic Triangulations with Small Number of Steiner Points. Int. J. Comput. Geometry Appl. 9(2): 171-180 (1999) | |
| j40 | Jurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia: Immobilizing a Shape. Int. J. Comput. Geometry Appl. 9(2): 181-206 (1999) | |
| c39 | György Csizmadia, Jurek Czyzowicz, Leszek Gasieniec, Evangelos Kranakis, Jorge Urrutia: Domino tilings of orthogonal polygons. CCCG 1999 | |
| c38 | ||
| c37 | Evangelos Kranakis, Harvinder Singh, Jorge Urrutia: Compass routing on geometric networks. CCCG 1999 | |
| c36 | Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge Urrutia: Routing with guaranteed delivery in ad hoc wireless networks. DIAL-M 1999: 48-55 | |
| c35 | Sergio Rajsbaum, Jorge Urrutia: Some Problems in Distributed Computational Geometry. SIROCCO 1999: 223-248 | |
| i1 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec: Computing largest circles separating two sets of segments. CoRR cs.CG/9909005 (1999) | |
| 1998 | ||
| j39 | 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) | |
| j38 | 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) | |
| c34 | Jin Akiyama, Gisaku Nakamura, Eduardo Rivera-Campo, Jorge Urrutia: Perfect divisions of a cake. CCCG 1998 | |
| c33 | Felipe Contreras, Jurek Czyzowicz, Nicolas Fraiji, Jorge Urrutia: Illuminating triangles and quadrilaterals with vertex floodlights. CCCG 1998 | |
| c32 | ||
| c31 | ||
| c30 | Felipe Contreras, Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia: Optimal Floodlight Illumination of Stages. Symposium on Computational Geometry 1998: 409-410 | |
| c29 | 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 | |
| c28 | Evangelos Kranakis, Danny Krizanc, Jorge Urrutia: Efficient Regular Polygon Dissections. JCDCG 1998: 172-187 | |
| 1997 | ||
| j37 | 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) | |
| j36 | 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) | |
| j35 | 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) | |
| j34 | 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) | |
| j33 | 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) | |
| j32 | Alberto Negro, Nicola Santoro, Jorge Urrutia: Efficient Distributed Selection with Bounded Messages. IEEE Trans. Parallel Distrib. Syst. 8(4): 397-401 (1997) | |
| c27 | Jurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia: Domino tilings and two-by-two squares. CCCG 1997 | |
| c26 | ||
| c25 | Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia: Discrete Realizations of Contact and Intersection Graphs. Graph Drawing 1997: 359-370 | |
| 1996 | ||
| j31 | Jin Akiyama, Y. Ishigami, Masatsugu Urabe, Jorge Urrutia: On circles containing the maximum number of points. Discrete Mathematics 151(1-3): 15-18 (1996) | |
| j30 | Ferran Hurtado, Oriol Serra, Jorge Urrutia: Hiding points in arrangements of segments. Discrete Mathematics 162(1-3): 187-197 (1996) | |
| j29 | 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) | |
| c24 | Jean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec: Computing Largest Circles Separating Two Sets of Segments. CCCG 1996: 173-178 | |
| c23 | Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia: Maximal Length Common Non-intersecting Paths. CCCG 1996: 185-189 | |
| c22 | Netzahualcoyotl Castañeda, Jorge Urrutia: Straight Line Embeddings of Planar Graphs on Point Sets. CCCG 1996: 312-318 | |
| c21 | Ferran Hurtado, Marc Noy, Jorge Urrutia: Flipping Edges in Triangulations. Symposium on Computational Geometry 1996: 214-223 | |
| 1995 | ||
| j28 | Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks: On illuminating line segments in the plane. Discrete Mathematics 137(1-3): 147-153 (1995) | |
| j27 | Ralph P. Boland, Jorge Urrutia: Separating Collections of Points in Euclidean Spaces. Inf. Process. Lett. 53(4): 177-183 (1995) | |
| j26 | Ralph P. Boland, Jorge Urrutia: Corrigendum: Separating Collections of Points in Euclidean Spaces. Inf. Process. Lett. 54(6): 359 (1995) | |
| j25 | Vladimir Estivill-Castro, Joseph O'Rourke, Jorge Urrutia, Dianna Xu: Illumination of Polygons with Vertex Lights. Inf. Process. Lett. 56(1): 9-13 (1995) | |
| c20 | 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 | |
| c19 | 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 | |
| c18 | James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia: Illumination with Orthogonal Floodlights. ISAAC 1995: 362-371 | |
| c17 | Evangelos Kranakis, Danny Krizanc, Jorge Urrutia: Implicit Routing and Shortest Path Information (Extended Abstract). SIROCCO 1995: 101-112 | |
| c16 | Vladimir Estivill-Castro, Jorge Urrutia: Two-Floodlight Illumination of Convex Polygons. WADS 1995: 62-73 | |
| c15 | Evangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger: VC-Dimensions for Graphs (Extended Abstract). WG 1995: 1-13 | |
| 1994 | ||
| j24 | Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro, Jorge Urrutia, Joseph Zaks: Guarding rectangular art galleries. Discrete Applied Mathematics 50(2): 149-157 (1994) | |
| j23 | Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia: Separation of Convex Sets. Discrete Applied Mathematics 51(3): 325-328 (1994) | |
| j22 | Fanica Gavril, Jorge Urrutia: Intersection Graphs of Concatenable Subtrees of Graphs. Discrete Applied Mathematics 52(2): 195-209 (1994) | |
| j21 | Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia, Joseph Zaks: Protecting convex sets. Graphs and Combinatorics 10(2-4): 311-321 (1994) | |
| c14 | Vladimir Estivill-Castro, Jorge Urrutia: Optimal Floodlight Illumination of Orthogonal Art Galleries. CCCG 1994: 81-86 | |
| c13 | Patrice Belleville, Prosenjit Bose, Jurek Czyzowicz, Jorge Urrutia, Joseph Zaks: K-Guarding Polygons on the Plane. CCCG 1994: 381-386 | |
| c12 | Evangelos Kranakis, Danny Krizanc, Jorge Urrutia: On the Number of Directions in Visibility Representations. Graph Drawing 1994: 167-176 | |
| 1993 | ||
| j20 | 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) | |
| j19 | Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia: Illuminating Rectangles and Triangles in the Plane. J. Comb. Theory, Ser. B 57(1): 1-17 (1993) | |
| c11 | Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia: Optimal Floodlight Illumination of Stages. CCCG 1993: 393-398 | |
| c10 | Prosenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia: The Floodlight Problem. CCCG 1993: 399-404 | |
| 1992 | ||
| j18 | Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia: Separating Convex Sets in the Plane. Discrete & Computational Geometry 7: 189-195 (1992) | |
| j17 | Stephan Foldes, Ivan Rival, Jorge Urrutia: Light sources, obstructions and spherical orders. Discrete Mathematics 102(1): 13-23 (1992) | |
| j16 | Ivan Rival, Jorge Urrutia: Representing orders by moving figures in space. Discrete Mathematics 109(1-3): 255-263 (1992) | |
| j15 | 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) | |
| j14 | Jorge Urrutia, Fanica Gavril: An Algorithm for Fraternal Orientation of Graphs. Inf. Process. Lett. 41(5): 271-274 (1992) | |
| 1991 | ||
| j13 | 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) | |
| c9 | 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 | |
| c8 | 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 | |
| c7 | ||
| c6 | Jurek Czyzowicz, Eduardo Rivera-Campo, Nicola Santoro, Jorge Urrutia, Joseph Zaks: Tight Bounds for the Rectangualr Art Gallery Problem. WG 1991: 105-112 | |
| 1990 | ||
| j12 | Richard J. Nowakowski, Ivan Rival, Jorge Urrutia: Representing orders on the plane by translating points and lines. Discrete Applied Mathematics 27(1-2): 147-156 (1990) | |
| j11 | Jin Akiyama, Jorge Urrutia: A note on balanced colourings for lattice points. Discrete Mathematics 83(1): 123-126 (1990) | |
| j10 | Jin Akiyama, Jorge Urrutia: Simple alternating path problem. Discrete Mathematics 84(1): 101-103 (1990) | |
| 1989 | ||
| j9 | 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) | |
| j8 | Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia: Geometric Containment and Partial Orders. SIAM J. Discrete Math. 2(2): 245-254 (1989) | |
| c5 | Jurek Czyzowicz, Ivan Rival, Jorge Urrutia: Galleries, Light Matchings and Visibility Graphs. WADS 1989: 316-324 | |
| 1988 | ||
| j7 | Mikhail J. Atallah, Glenn K. Manacher, Jorge Urrutia: Finding a minimum independent dominating set in a permutation graph. Discrete Applied Mathematics 21(3): 177-183 (1988) | |
| j6 | Victor Neumann-Lara, Jorge Urrutia: A combinatorial result on points and circles on the plane. Discrete Mathematics 69(2): 173-178 (1988) | |
| c4 | Nicola Santoro, Stuart J. Sidney, Jorge Urrutia: Geometric Containment, Common Roots of Polynomials and Partial Orders. STACS 1988: 292-300 | |
| 1987 | ||
| j5 | Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia: Geometric Containment and Vector Dominance. Theor. Comput. Sci. 53: 345-352 (1987) | |
| c3 | Jan van Leeuwen, Nicola Santoro, Jorge Urrutia, Shmuel Zaks: Guessing Games and Distributed Computations in Synchronous Networks. ICALP 1987: 347-356 | |
| c2 | Alberto Negro, Nicola Santoro, Jorge Urrutia: On the Packet Complexity of Distributed Selection. WDAG 1987: 108-115 | |
| 1986 | ||
| j4 | Victor Neumann-Lara, Nicola Santoro, Jorge Urrutia: Uniquely colourable m-dichromatic oriented graphs. Discrete Mathematics 62(1): 65-70 (1986) | |
| 1985 | ||
| c1 | Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia: Geometric Containment is not Reducible to Pareto Dominance. STACS 1985: 322-327 | |
| 1984 | ||
| j3 | Victor Neumann-Lara, Jorge Urrutia: Vertex critical r-dichromatic tournaments. Discrete Mathematics 49(1): 83-87 (1984) | |
| 1983 | ||
| j2 | Martin Charles Golumbic, Doron Rotem, Jorge Urrutia: Comparability graphs and intersection graphs. Discrete Mathematics 43(1): 37-46 (1983) | |
| 1982 | ||
| j1 | ||
Data released under the ODC-BY 1.0 license — See also our legal information page