Luis Barba

According to our database1, Luis Barba authored at least 44 papers between 2012 and 2019.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Subquadratic Algorithms for Algebraic 3SUM.
Discrete & Computational Geometry, 2019

Sharing a pizza: bisecting masses with two cuts.
CoRR, 2019

The Complexity of Optimization on Grids.
Algorithmica, 2019

Dynamic Graph Coloring.
Algorithmica, 2019

Asymmetric Convex Intersection Testing.
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Optimal Algorithm for Geodesic Farthest-Point Voronoi Diagrams.
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Corrigendum to 'Asymmetric polygons with maximum area' [European Journal of Operational Research 248 (2016) 1123-1131].
European Journal of Operational Research, 2018

Geodesic farthest-point Voronoi diagram in linear time.
CoRR, 2018

The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon.
CoRR, 2018

Continuous Yao graphs.
Comput. Geom., 2018

Linear transformation distance for bichromatic matchings.
Comput. Geom., 2018

Convex Hulls in Polygonal Domains.
Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017
Column planarity and partially-simultaneous geometric embedding.
J. Graph Algorithms Appl., 2017

Incremental Voronoi Diagrams.
Discrete & Computational Geometry, 2017

Drawing the Horton set in an integer grid of minimum size.
Comput. Geom., 2017

Subquadratic Algorithms for Algebraic Generalizations of 3SUM.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Sharing a Pizza: Bisecting Masses with Two Cuts.
Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016
Asymmetric polygons with maximum area.
European Journal of Operational Research, 2016

A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon.
Discrete & Computational Geometry, 2016

The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Deterministic Algorithms for Unique Sink Orientations of Grids.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015
New and improved spanning ratios for Yao graphs.
JoCG, 2015

Isoperimetric Enclosures.
Graphs and Combinatorics, 2015

Compatible Connectivity Augmentation of Planar Disconnected Graphs.
Discrete & Computational Geometry, 2015

Bichromatic compatible matchings.
Comput. Geom., 2015

Reprint of: Theta-3 is connected.
Comput. Geom., 2015

Space-Time Trade-offs for Stack-Based Algorithms.
Algorithmica, 2015

Optimal detection of intersections between convex polyhedra.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014
Top-Down Skiplists.
CoRR, 2014

Computing a visibility polygon using few variables.
Comput. Geom., 2014

Theta-3 is connected.
Comput. Geom., 2014

Optimal Algorithms for Constrained 1-Center Problems.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Weight Balancing on Boundaries and Skeletons.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Drawing the Horton Set in an Integer Grid of Minimun Size.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Continuous Yao Graphs.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
The Erdős-Sós Conjecture for Geometric Graphs.
Discrete Mathematics & Theoretical Computer Science, 2013

Detecting intersections between convex polyhedra.
CoRR, 2013

New and Improved Spanning Ratios for Yao Graphs.
CoRR, 2013

On the Stretch Factor of the Theta-4 Graph.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

On k-Enclosing Objects in a Coloured Point Set.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Computing Covers of Plane Forests.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Circle Separability Queries in Logarithmic Time.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

Disk Constrained 1-Center Queries.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012


  Loading...