Jorge Urrutia - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line SegmentJurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani. adhoc-now 2010: 29-42 [doi]

Triangulations with many points of even degreeJorge Urrutia, Canek Peláez, Adriana Ramírez-Viguer. cccg 2010: 103-106 [doi]

2009

Compatible geometric matchingsOswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood. comgeo, 42(6-7):617-626, 2009. [doi]

Empty monochromatic trianglesOswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Jorge Urrutia. comgeo, 42(9):934-938, 2009. [doi]

Bichromatic separability with two boxes: A general approachC. CortÃ©s, JosÃ© Miguel DÃaz-BÃ¡Ã±ez, P. PÃ©rez-Lantero, Carlos Seara, Jorge Urrutia, Inmaculada Ventura. jal, 64(2-3):79-88, 2009. [doi]

On Minimizing the Maximum Sensor Movement for Barrier Coverage of a Line SegmentJurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Ioannis Lambadaris, Lata Narayanan, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia, Mohammadreza Yazdani. adhoc-now 2009: 194-212 [doi]

On Polygons Enclosing Point Sets IIFerran Hurtado, Criel Merino, D. Oliveros, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura. gc, 25(3):327-339, 2009. [doi]

On the Chromatic Number of some Flip GraphsRuy Fabila Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, David R. Wood, Jorge Urrutia. dmtcs, 11(2):47-56, 2009. [doi]

Matching Points with SquaresBernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia. dcg, 41(1):77-95, 2009. [doi]

2008

Augmenting the connectivity of geometric graphsManuel Abellanas, Alfredo García Olaverri, Ferran Hurtado, Javier Tejel, Jorge Urrutia. comgeo, 40(3):220-230, 2008. [doi]

Compatible Geometric MatchingsOswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood. endm, 31:201-206, 2008. [doi]

Empty Monochromatic TrianglesOswin Aichholzer, Ruy Fabila Monroy, David Flores-Peñaloza, Thomas Hackl, Clemens Huemer, Jorge Urrutia. cccg 2008:

A note on harmonic subgraphs in labelled geometric graphsGabriela Araujo, József Balogh, Ruy Fabila Monroy, Gelasio Salazar, Jorge Urrutia. ipl, 105(3):98-102, 2008. [doi]

Covering point sets with two disjoint disks or squaresSergio Cabello, José Miguel Díaz-Báñez, Carlos Seara, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura. comgeo, 40(3):195-206, 2008. [doi]

Local 7-Coloring for Planar Subgraphs of Unit Disk GraphsJurek Czyzowicz, Stefan Dobrev, H. González-Aguilar, Rastislav Kralovic, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia. tamc 2008: 170-181 [doi]

Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware NodesJurek Czyzowicz, Stefan Dobrev, Thomas Fevens, H. González-Aguilar, Evangelos Kranakis, Jaroslav Opatrny, Jorge Urrutia. latin 2008: 158-169 [doi]

Computing shortest heterochromatic monotone routesJosé Miguel Díaz-Báñez, G. Hernández, D. Oliveros, A. Ramírez-Vigueras, Joan Antoni Sellarès, Jorge Urrutia, Inmaculada Ventura. orl, 36(6):684-687, 2008. [doi]

Memory Requirements for Local Geometric Routing and Traversal in DigraphsMaia Fraser, Evangelos Kranakis, Jorge Urrutia. cccg 2008:

2007

2006

2005

Games on triangulationsOswin Aichholzer, David Bremner, Erik D. Demaine, Ferran Hurtado, Evangelos Kranakis, Hannes Krasser, Suneeta Ramaswami, Saurabh Sethia, Jorge Urrutia. TCS, 343(1-2):42-71, 2005. [doi]

On the chromatic number of some geometric type Kneser graphsGabriela Araujo, Adrian Dumitrescu, Ferran Hurtado, Marc Noy, Jorge Urrutia. comgeo, 32(1):59-69, 2005. [doi]

Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk GraphEdgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Héctor Tejeda, Jorge Urrutia. opodis 2006: 235-245 [doi]

Covering point sets with two convex objectsJosÃ© Miguel DÃaz-BÃ¡Ã±ez, Carlos Seara, Joan Antoni SellarÃ¨s, Jorge Urrutia, Inmaculada Ventura. ewcg 2005: 179-182 [doi]

Distributed Dynamic Storage in Wireless NetworksConstantinos Georgiou, Evangelos Kranakis, Ricardo Marcelín-Jiménez, Sergio Rajsbaum, Jorge Urrutia. ijdsn, 1(3&4):355-371, 2005. [doi]

On Convex Quadrangulations of Point Sets on the PlaneV. M. Heredia, Jorge Urrutia. cjcdgcgt 2007: 38-46 [doi]

On plane spanning trees and cycles of multicolored point sets with few intersectionsMikio Kano, Criel Merino, Jorge Urrutia. ipl, 93(6):301-306, 2005. [doi]

On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point SetsCriel Merino, Gelasio Salazar, Jorge Urrutia. gc, 21(3):333-341, 2005. [doi]

Graham triangulations and triangulations with a center are hamiltoneanRuy Fabila Monroy, Jorge Urrutia. ipl, 93(6):295-299, 2005. [doi]

::::In memoriam:::: In memory of Professor Victor Neumann-LaraJorge Urrutia. gc, 21(3):289-291, 2005. [doi]

Routing in Wireless Networks and Local Solutions for Global ProblemsJorge Urrutia. adhoc-now 2005: 3 [doi]

2004

A Problem on Hinged Dissections with ColoursJin Akiyama, Ferran Hurtado, Criel Merino, Jorge Urrutia. gc, 20(2):145-159, 2004. [doi]

Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc NetworksPaul Boone, Edgar Chávez, Lev Gleitzky, Evangelos Kranakis, Jaroslav Opatrny, Gelasio Salazar, Jorge Urrutia. sirocco 2004: 23-34 [doi]

Traversal of a quasi-planar subdivision without using mark bitsEdgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia. join, 5(4):395-407, 2004. [doi]

Traversal of a Quasi-Planar Subdivision without Using Mark BitsEdgar Chávez, Jaroslav Opatrny, Stefan Dobrev, Ladislav Stacho, Evangelos Kranakis, Jorge Urrutia. ipps 2004: [doi]

Route Discovery with Constant Memory in Oriented Planar Geometric NetworksEdgar Chávez, Stefan Dobrev, Evangelos Kranakis, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia. algosensors 2004: 147-156 [doi]

Coverage and Connectivity in Networks with Directional SensorsEvangelos Kranakis, Danny Krizanc, Jorge Urrutia. europar 2004: 917-924 [doi]

A Note on Convex Decompositions of a Set of Points in the PlaneVictor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia. gc, 20(2):223-231, 2004. [doi]

Matching Points with Circles and SquaresBernardo M. Ábrego, Esther M. Arkin, Silvia Fernández-Merchant, Ferran Hurtado, Mikio Kano, Joseph S. B. Mitchell, Jorge Urrutia. jcdcg 2005: 1-15 [doi]

2003

2002

2001

2000

Universal Measuring Devices without GradationsJin Akiyama, Hiroshi Fukuda, Gisaku Nakamura, Toshinori Sakai, Jorge Urrutia, Carlos Zamora-Cura. jcdcg 2001: 31-40 [doi]

Sequentially Divisible Dissections of Simple PolygonsJin Akiyama, Toshinori Sakai, Jorge Urrutia. jcdcg 2001: 53-66 [doi]

Computing Largest Circles Separating Two Sets of SegmentsJean-Daniel Boissonnat, Jurek Czyzowicz, Olivier Devillers, Jorge Urrutia, Mariette Yvinec. ijcga, 10(1):41-53, 2000.

Circular Ray Shooting: Slower but SurerRalph P. Boland, Jorge Urrutia. cccg 2000: [doi]

Polygon Area ProblemsRalph P. Boland, Jorge Urrutia. cccg 2000: [doi]

Guarding the Convex Subsets of a Point-setJurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia. cccg 2000: [doi]

On the chromatic number of tree graphsVladimir Estivill-Castro, Marc Noy, Jorge Urrutia. DM, 223(1-3):363-366, 2000. [doi]

1999

Routing with guaranteed delivery in ad hoc wireless networksProsenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge Urrutia. dialm 1999: 48-55 [doi]

Domino tilings of orthogonal polygonsGyörgy Csizmadia, Jurek Czyzowicz, Leszek Gasieniec, Evangelos Kranakis, Jorge Urrutia. cccg 1999: [doi]

Immobilizing a ShapeJurek Czyzowicz, Ivan Stojmenovic, Jorge Urrutia. ijcga, 9(2):181, 1999.

Dissections, cuts and triangulationsJurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia. cccg 1999: [doi]

Flipping Edges in TriangulationsFerran Hurtado, Marc Noy, Jorge Urrutia. dcg, 22(3):333-346, 1999. [doi]

Isomorphic Triangulations with Small Number of Steiner PointsEvangelos Kranakis, Jorge Urrutia. ijcga, 9(2):171, 1999.

Compass routing on geometric networksEvangelos Kranakis, Harvinder Singh, Jorge Urrutia. cccg 1999: [doi]

The Number of Geometric Bistellar Neighbors of a TriangulationJesús A. De Loera, Francisco Santos, Jorge Urrutia. dcg, 21(1):131-142, 1999. [doi]

EditorialKurt Mehlhorn, Jörg-Rüdiger Sack, Jorge Urrutia. comgeo, 12(3-4):153-154, 1999.

A note on covering the edges of a graph with bondsVictor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia. DM, 197-198:633-636, 1999. [doi]

Some Problems in Distributed Computational GeometrySergio Rajsbaum, Jorge Urrutia. sirocco 1999: 223-248

1998

Illumination of Orthogonal Polygons with Orthogonal FloodlightsJames Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia. ijcga, 8(1):25-38, 1998.

Perfect divisions of a cakeJin Akiyama, Gisaku Nakamura, Eduardo Rivera-Campo, Jorge Urrutia. cccg 1998: [doi]

Radial Perfect Partitions of Convex Sets in the PlaneJin Akiyama, Atsushi Kaneko, Mikio Kano, Gisaku Nakamura, Eduardo Rivera-Campo, Shin-ichi Tokunaga, Jorge Urrutia. jcdcg 2000: 1-13

Optimal Floodlight Illumination of StagesFelipe Contreras, Jurek Czyzowicz, Eduardo Rivera-Campo, Jorge Urrutia. compgeom 1998: 409-410 [doi]

Illuminating triangles and quadrilaterals with vertex floodlightsFelipe Contreras, Jurek Czyzowicz, Nicolas Fraiji, Jorge Urrutia. cccg 1998: [doi]

On measuring areas of polygonsJurek Czyzowicz, F. Contreras-Alcalá, Jorge Urrutia. cccg 1998: [doi]

A Simple Proof of the Representation of Bipartite Planar Graphs as the Contact Graphs of Orthogonal Straight Line SegmentsJurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia. ipl, 66(3):125-126, 1998. [doi]

Parallel edge flippingFerran Hurtado, Marc Noy, Jorge Urrutia. cccg 1998: [doi]

Efficient Regular Polygon DissectionsEvangelos Kranakis, Danny Krizanc, Jorge Urrutia. jcdcg 2000: 172-187

1997

A Combinatorial Property of Convex SetsManuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia. dcg, 17(3):307-318, 1997. [doi]

Planar Stage Graphs: Characterizations and ApplicationsFrank Bauernöppel, Evangelos Kranakis, Danny Krizanc, Anil Maheshwari, Jörg-Rüdiger Sack, Jorge Urrutia. TCS, 175(2):239-255, 1997. [doi]

The Floodlight ProblemProsenjit Bose, Leonidas J. Guibas, Anna Lubiw, Mark H. Overmars, Diane L. Souvaine, Jorge Urrutia. ijcga, 7(1/2):153-163, 1997.

Domino tilings and two-by-two squaresJurek Czyzowicz, Evangelos Kranakis, Jorge Urrutia. cccg 1997:

Discrete Realizations of Contact and Intersection GraphsJurek Czyzowicz, Evangelos Kranakis, Danny Krizanc, Jorge Urrutia. gd 1997: 359-370

Stage-graph RepresentationsEvangelos Kranakis, Danny Krizanc, Anil Maheshwari, Marc Noy, Jörg-Rüdiger Sack, Jorge Urrutia. DAM, 75(1):71-80, 1997. [doi]

The VC-dimension of Set Systems Defined by GraphsEvangelos Kranakis, Danny Krizanc, Berthold Ruf, Jorge Urrutia, Gerhard J. Woeginger. DAM, 77(3):237-257, 1997. [doi]

Efficient Distributed Selection with Bounded MessagesAlberto Negro, Nicola Santoro, Jorge Urrutia. tpds, 8(4):397-401, 1997. [doi]

On the number of internal and external visibility edges of polygonsJorge Urrutia. cccg 1997:

1996

Onion PolygonizationsManuel Abellanas, Jesus Garcia-Lopez, Gregorio Hernández-Peñalver, Ferran Hurtado, Oriol Serra, Jorge Urrutia. ipl, 57(3):165-173, 1996. [doi]

On circles containing the maximum number of pointsJin Akiyama, Y. Ishigami, Masatsugu Urabe, Jorge Urrutia. DM, 151(1-3):15-18, 1996. [doi]

Hiding points in arrangements of segmentsFerran Hurtado, Oriol Serra, Jorge Urrutia. DM, 162(1-3):187-197, 1996. [doi]

Flipping Edges in TriangulationsFerran Hurtado, Marc Noy, Jorge Urrutia. compgeom 1996: 214-223 [doi]

PreviousNext