Luis Barba

CoRR, 2023

2022

Weight balancing on boundaries.

[BibT_eX]

[DOI]

J. Comput. Geom., 2022

Implicit Gradient Alignment in Distributed and Federated Learning.

[BibT_eX]

[DOI]

Yatin Dandi

Martin Jaggi

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Multilayer Lookahead: a Nested Version of Lookahead.

[BibT_eX]

[DOI]

Denys Pushkin

CoRR, 2021

2020

Time-space trade-offs for computing Euclidean minimum spanning trees.

[BibT_eX]

[DOI]

Bahareh Banyassady

Wolfgang Mulzer

J. Comput. Geom., 2020

The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon.

[BibT_eX]

[DOI]

Eunjin Oh

Hee-Kap Ahn

Algorithmica, 2020

Dynamic Model Pruning with Feedback.

[BibT_eX]

[DOI]

Proceedings of the 8th International Conference on Learning Representations, 2020

2019

Subquadratic Algorithms for Algebraic 3SUM.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2019

Sharing a pizza: bisecting masses with two cuts.

[BibT_eX]

[DOI]

Alexander Pilz

Patrick Schnider

CoRR, 2019

The Complexity of Optimization on Grids.

[BibT_eX]

[DOI]

Algorithmica, 2019

Dynamic Graph Coloring.

[BibT_eX]

[DOI]

Algorithmica, 2019

Asymmetric Convex Intersection Testing.

[BibT_eX]

[DOI]

Wolfgang Mulzer

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

Optimal Algorithm for Geodesic Farthest-Point Voronoi Diagrams.

[BibT_eX]

[DOI]

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].

[BibT_eX]

[DOI]

Luis Evaristo Caraballo

José Miguel Díaz-Báñez

Edel Pérez-Castillo

Eur. J. Oper. Res., 2018

Geodesic farthest-point Voronoi diagram in linear time.

[BibT_eX]

[DOI]

CoRR, 2018

Continuous Yao graphs.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Linear transformation distance for bichromatic matchings.

[BibT_eX]

[DOI]

Comput. Geom., 2018

Convex Hulls in Polygonal Domains.

[BibT_eX]

[DOI]

Proceedings of the 16th Scandinavian Symposium and Workshops on Algorithm Theory, 2018

2017

Column planarity and partially-simultaneous geometric embedding.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2017

Incremental Voronoi Diagrams.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

Drawing the Horton set in an integer grid of minimum size.

[BibT_eX]

[DOI]

Frank Duque

Carlos Hidalgo-Toscano

Comput. Geom., 2017

Subquadratic Algorithms for Algebraic Generalizations of 3SUM.

[BibT_eX]

[DOI]

Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Sharing a Pizza: Bisecting Masses with Two Cuts.

[BibT_eX]

Patrick Schnider

Proceedings of the 29th Canadian Conference on Computational Geometry, 2017

2016

Asymmetric polygons with maximum area.

[BibT_eX]

[DOI]

Luis Evaristo Caraballo

José Miguel Díaz-Báñez

Edel Pérez-Castillo

Eur. J. Oper. Res., 2016

A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2016

The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon.

[BibT_eX]

[DOI]

Eunjin Oh

Hee-Kap Ahn

Proceedings of the 32nd International Symposium on Computational Geometry, 2016

Deterministic Algorithms for Unique Sink Orientations of Grids.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016

2015

New and improved spanning ratios for Yao graphs.

[BibT_eX]

[DOI]

J. Comput. Geom., 2015

Isoperimetric Enclosures.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Compatible Connectivity Augmentation of Planar Disconnected Graphs.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Bichromatic compatible matchings.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Reprint of: Theta-3 is connected.

[BibT_eX]

[DOI]

Comput. Geom., 2015

Space-Time Trade-offs for Stack-Based Algorithms.

[BibT_eX]

[DOI]

Algorithmica, 2015

Optimal detection of intersections between convex polyhedra.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Top-Down Skiplists.

[BibT_eX]

[DOI]

Pat Morin

CoRR, 2014

Computing a visibility polygon using few variables.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Theta-3 is connected.

[BibT_eX]

[DOI]

Comput. Geom., 2014

Optimal Algorithms for Constrained 1-Center Problems.

[BibT_eX]

[DOI]

Prosenjit Bose

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Weight Balancing on Boundaries and Skeletons.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Drawing the Horton Set in an Integer Grid of Minimun Size.

[BibT_eX]

[DOI]

Frank Duque

Carlos Hidalgo-Toscano

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Continuous Yao Graphs.

[BibT_eX]

[DOI]

Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013

The Erdős-Sós Conjecture for Geometric Graphs.

[BibT_eX]

[DOI]

Cynthia A. Rodríguez Villalobos

Luis Felipe Barba Flores

Dolores Lara

Jesús Leaños

Gelasio Salazar

Francisco Zaragoza

Discret. Math. Theor. Comput. Sci., 2013

Detecting intersections between convex polyhedra.

[BibT_eX]

[DOI]

CoRR, 2013

New and Improved Spanning Ratios for Yao Graphs.

[BibT_eX]

[DOI]

CoRR, 2013

On the Stretch Factor of the Theta-4 Graph.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

On k-Enclosing Objects in a Coloured Point Set.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Computing Covers of Plane Forests.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Circle Separability Queries in Logarithmic Time.

[BibT_eX]

[DOI]

Luis Felipe Barba Flores