Luis Barba

From MaRDI portal
Person:494796

Available identifiers

zbMath Open barba.luis-felipeMaRDI QIDQ494796

List of research outcomes





PublicationDate of PublicationType
Asymmetric convex intersection testing2024-08-26Paper
https://portal.mardi4nfdi.de/entity/Q50889392022-07-18Paper
Weight balancing on boundaries2022-05-18Paper
Time-space trade-offs for computing Euclidean minimum spanning trees2021-01-12Paper
The geodesic farthest-point Voronoi diagram in a simple polygon2020-04-01Paper
Time-space trade-offs for computing Euclidean minimum spanning trees2020-02-12Paper
The complexity of optimization on grids2019-08-20Paper
Subquadratic algorithms for algebraic 3SUM2019-05-21Paper
Dynamic graph coloring2019-04-25Paper
Drawing the Horton set in an integer grid of minimum size2018-11-01Paper
Subquadratic algorithms for algebraic generalizations of 3SUM2018-08-13Paper
Corrigendum to ``Asymmetric polygons with maximum area2018-05-30Paper
Weight Balancing on Boundaries and Skeletons2018-04-23Paper
New and improved spanning ratios for Yao graphs2018-04-23Paper
Linear transformation distance for bichromatic matchings2018-04-23Paper
Linear transformation distance for bichromatic matchings2018-02-19Paper
Continuous Yao graphs2018-02-12Paper
The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon2018-01-30Paper
Incremental Voronoi diagrams2018-01-30Paper
Incremental Voronoi diagrams2018-01-11Paper
https://portal.mardi4nfdi.de/entity/Q53686892017-10-10Paper
Optimal detection of intersections between convex polyhedra2017-10-05Paper
Compatible connectivity-augmentation of planar disconnected graphs2017-10-05Paper
Dynamic graph coloring2017-09-22Paper
New and improved spanning ratios for Yao graphs2017-03-30Paper
Space-time trade-offs for stack-based algorithms2017-01-30Paper
A linear-time algorithm for the geodesic center of a simple polygon2016-12-20Paper
Asymmetric polygons with maximum area2016-10-07Paper
Deterministic algorithms for unique sink orientations of grids2016-09-02Paper
Compatible connectivity augmentation of planar disconnected graphs2015-12-02Paper
Space-time trade-offs for stack-based algorithms2015-09-02Paper
Bichromatic compatible matchings2015-07-27Paper
Isoperimetric enclosures2015-05-22Paper
Reprint of: Theta-3 is connected2015-04-27Paper
Bichromatic compatible matchings2015-02-17Paper
Theta-3 is connected2014-08-13Paper
Computing a visibility polygon using few variables2014-08-13Paper
Optimal algorithms for constrained 1-center problems2014-03-31Paper
The Erdős-Sós conjecture for geometric graphs2014-02-14Paper
On edge-disjoint empty triangles of point sets2013-09-25Paper
On the stretch factor of the theta-4 graph2013-08-12Paper
Computing the visibility polygon using few variables2011-12-16Paper

Research outcomes over time

This page was built for person: Luis Barba