Jorge Urrutia
Orcid: 0000-0002-4158-5979Affiliations:
- University of Ottawa, Ontario, Canada
According to our database1,
Jorge Urrutia
authored at least 239 papers
between 1981 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2024
Graphs Comb., February, 2024
2023
Separating bichromatic point sets in the plane by restricted orientation convex hulls.
J. Glob. Optim., April, 2023
2022
Optimal placement of base stations in border surveillance using limited capacity drones.
Theor. Comput. Sci., 2022
Inf. Process. Lett., 2022
Optimal Placement of Base Stations in Border Surveillance using Limited Capacity Drones.
CoRR, 2022
2021
Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations.
J. Glob. Optim., 2021
Comput. Geom., 2021
Proceedings of the Algorithms and Discrete Applied Mathematics, 2021
2020
Theor. Comput. Sci., 2020
J. Inf. Process., 2020
Tight Bounds for Illuminating and Covering of Orthotrees with Vertex Lights and Vertex Beacons.
Graphs Comb., 2020
CoRR, 2020
Appl. Math. Comput., 2020
Proceedings of the LATIN 2020: Theoretical Informatics, 2020
Minimizing The Maximum Distance Traveled To Form Patterns With Systems of Mobile Robots.
Proceedings of the 32nd Canadian Conference on Computational Geometry, 2020
2019
Theory Comput. Syst., 2019
On Almost Empty Monochromatic Triangles and Convex Quadrilaterals in Colored Point Sets.
Graphs Comb., 2019
Cross-sections of line configurations in R3 and (<i>d</i> - 2)-flat configurations in Rd.
Comput. Geom., 2019
2018
Inf. Process. Lett., 2018
Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018
2017
Beacon Coverage in Orthogonal Polyhedra.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017
Planarity Preserving Augmentation of Topological and Geometric Plane Graphs to Meet Parity Constraints.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017
2016
J. Comb. Optim., 2016
Discret. Comput. Geom., 2016
Minimizing the Solid Angle Sum of Orthogonal Polyhedra and Guarding them with π/2-Edge Guards.
Proceedings of the 28th Canadian Conference on Computational Geometry, 2016
2015
Theor. Comput. Sci., 2015
Discret. Appl. Math., 2015
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015
2014
SIAM J. Discret. Math., 2014
Int. J. Comput. Geom. Appl., 2014
Int. J. Comput. Geom. Appl., 2014
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014
2013
Graphs Comb., 2013
Electron. Notes Discret. Math., 2013
Discret. Math. Theor. Comput. Sci., 2013
Comput. Geom., 2013
2012
J. Comb. Optim., 2012
Discret. Appl. Math., 2012
Proceedings of the Fun with Algorithms - 6th International Conference, 2012
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012
Proceedings of the Ad-hoc, Mobile, and Wireless Networks - 11th International Conference, 2012
2011
On the Heaviest Increasing or Decreasing Subsequence of a Permutation, and Paths and Matchings on Weighted Point Sets.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011
2010
Proceedings of the Computational Geometry, Graphs and Applications, 2010
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010
Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 9th International Conference, 2010
2009
Theor. Comput. Sci., 2009
Discret. Math. Theor. Comput. Sci., 2009
Proceedings of the Ad-Hoc, Mobile and Wireless Networks, 8th International Conference, 2009
2008
Local Algorithms for Dominating and Connected Dominating Sets of Unit Disk Graphs with Location Aware Nodes.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008
Memory Requirements for Local Geometric Routing and Traversal in Digraphs.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008
2007
J. Discrete Algorithms, 2007
2006
Networks, 2006
On the length of longest alternating paths for multicoloured point sets in convex position.
Discret. Math., 2006
Local Construction of Planar Spanners in Unit Disk Graphs with Irregular Transmission Ranges.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006
2005
Inf. Process. Lett., 2005
On plane spanning trees and cycles of multicolored point sets with few intersections.
Inf. Process. Lett., 2005
Int. J. Distributed Sens. Networks, 2005
On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets.
Graphs Comb., 2005
Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005
Proceedings of the Discrete Geometry, 2005
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, 4th International Conference, 2005
2004
J. Interconnect. Networks, 2004
Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks.
Proceedings of the Structural Information and Communication Complexity, 2004
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004
Proceedings of the Euro-Par 2004 Parallel Processing, 2004
2003
Proceedings of the Combinatorial Geometry and Graph Theory, 2003
Proceedings of the Combinatorial Geometry and Graph Theory, 2003
Proceedings of the Combinatorial Geometry and Graph Theory, 2003
Proceedings of the Combinatorial Geometry and Graph Theory, 2003
Proceedings of the Computational Science and Its Applications, 2003
2002
Proceedings of the LATIN 2002: Theoretical Informatics, 2002
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002
2001
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001
2000
Int. J. Comput. Geom. Appl., 2000
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2000
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000
Proceedings of the Handbook of Computational Geometry, 2000
1999
Int. J. Comput. Geom. Appl., 1999
Discret. Comput. Geom., 1999
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999
1998
A Simple Proof of the Representation of Bipartite Planar Graphs as the Contact Graphs of Orthogonal Straight Line Segments.
Inf. Process. Lett., 1998
Int. J. Comput. Geom. Appl., 1998
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 1998
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
Proceedings of the 10th Canadian Conference on Computational Geometry, 1998
1997
IEEE Trans. Parallel Distributed Syst., 1997
Proceedings of the Graph Drawing, 5th International Symposium, 1997
On the number of internal and external visibility edges of polygons.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997
Domino tilings and two-by-two squares.
Proceedings of the 9th Canadian Conference on Computational Geometry, 1997
1996
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996
1995
Inf. Process. Lett., 1995
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995
Implicit Routing and Shortest Path Information (Extended Abstract).
Proceedings of the Structure, Information and Communication Complexity, 1995
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995
Proceedings of the 7th Canadian Conference on Computational Geometry, 1995
1994
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994
Optimal Floodlight Illumination of Orthogonal Art Galleries.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994
K-Guarding Polygons on the Plane.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994
1993
Optimal Floodlight Illumination of Stages.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993
1992
1991
SIAM J. Discret. Math., 1991
Proceedings of the 17th International Workshop, 1991
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991
1990
Discret. Appl. Math., 1990
1989
Discret. Comput. Geom., 1989
Proceedings of the Algorithms and Data Structures, 1989
1988
Discret. Appl. Math., 1988
Proceedings of the STACS 88, 1988
1987
Proceedings of the Distributed Algorithms, 1987
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987
1986
Integer Sets with Distinct Sums and Differences and Carrier Frequency Assignments for Nonlinear Repeaters.
IEEE Trans. Commun., 1986
1985
Proceedings of the STACS 85, 1985
1984
1983
1982
1981