My publications as of 17 February 2016.

Currently under review.

Dynamic graph coloring.
L. Barba, J. Cardinal, M. Korman, S. Langerman, A. van Renssen, M. Roeloffzen, and S. Verdonschot.
Submitted to the 43rd International Colloquium on Automata, Languages and Programming.

A lower bound for deterministic asynchronous rendez-vous on the line.
L. Barba, P. Bose, J. de Carufel, S. Langerman, and A. Por.
Submitted to the 35th ACM Symposium on Principles of Distributed Computing.

A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon.
H. Ahn, L. Barba, P. Bose, J. de Carufel, M. Korman, and E. Oh.
Submitted to Discrete and Computational Geometry.

Linear transformation distance for bichromatic matchings.
O. Aichholzer, L. Barba, T. Hackl, A. Pilz, and B. Vogtenhuber.
Submitted to Computational Geometry, Theory and Applications. Special Issue in Memoriam: Ferran Hurtado.


Journal papers.

Asymmetric polygons with maximum area.
L. Barba, L. Caraballo, D. Jose-Miguel, R. Fabila-Monroy, and E. Perez.
Accepted to European Journal of Operational Research.

Compatible connectivity-augmentation of planar disconnected graphs.
G. Aloupis, L. Barba, P. Carmi, V. Dujmovi\'c, F. Frati, and P. Morin.
Accepted to Discrete and Computational Geometry.

Space-time trade-offs for stack-based algorithms.
L. Barba, M. Korman, S. Langerman, K. Sadakane, and R. Silveira.
Published in Algorithmica.

Theta-3 is connected.
O. Aichholzer, S. Bae, L. Barba, P. Bose, M. Korman, A. van Renssen, P. Taslakian, and S. Verdonschot.
Published in Computational Geometry, Theory and Applications.

Bichromatic compatible matchings.
G. Aloupis, L. Barba, S. Langerman, and D. Souvaine.
Published in Computational Geometry, Theory and Applications.

Isoperimetric enclosures.
G. Aloupis, L. Barba, J. de Carufel, S. Langerman, and D. Souvaine.
Published in Graph and Combinatorics.

The Erdös-Sós conjecture for geometric graphs.
L. Barba, R. Fabila-Monroy, D. Lara, J. Lea\~nos, C. Rodr\'iguez, G. Salazar, and F. Zaragoza.
Published in Discrete Mathematics and Theoretical Computer Science.

Computing the visibility polygon using few variables.
L. Barba, M. Korman, S. Langerman, and R. Silveira.
Published in Computational Geometry, Theory and Applications.


Conference papers.

The farthest-point geodesic voronoi diagram of points on the boundary of a simple polygon.
H. Ahn, L. Barba, and E. Oh.
Accepted to the 32st Symposium on Computational Geometry.

Incremental voronoi diagrams.
S. Allen, L. Barba, J. Iacono, and S. Langerman.
Accepted to the 32st Symposium on Computational Geometry.

A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon.
H. Ahn, L. Barba, P. Bose, J. de Carufel, M. Korman, and E. Oh.
In Proceedings of the 31st Symposium on Computational Geometry, volume 34, pages 209-223, 2015.

Column planarity and partial simultaneous geometric embedding for outerplanar graphs.
L. Barba, M. Hoffmann, and V. Kusters.
In Proceedings of the European Workshop on Computational Geometry, EuroCG'15. 2015.

Compatible connectivity-augmentation of planar disconnected graphs.
G. Aloupis, L. Barba, P. Carmi, V. Dujmovi\'c, F. Frati, and P. Morin.
In Proceedings of the 26th ACM-SIAM Symposium on Discrete Algorithms, pages 1602-1615, 2015.

Optimal detection of intersections between convex polyhedra.
L. Barba and S. Langerman.
In Proceedings of the 26th ACM-SIAM Symposium on Discrete Algorithms, pages 1641-1654, 2015.

Drawing the horton set in an integer grid of minimun size.
L. Barba, F. Duque, R. Fabila-Monroy, and C. Hidalgo-Toscano.
In Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG'14. August 2014.

Continuous Yao graphs.
L. Barba, P. Bose, J. de Carufel, M. Damian, R. Fagerberg, A. van Renssen, P. Taslakian, and S. Verdonschot.
In Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG'14. August 2014.

Linear transformation distance for bichromatic matchings.
O. Aichholzer, L. Barba, T. Hackl, A. Pilz, and B. Vogtenhuber.
In Proceedings of the 30th Symposium on Computational Geometry, SoCG'14, page 154, 2014.

Weight balancing on boundaries and skeletons.
L. Barba, J. de Carufel, O. Cheong, M. Dobbins, R. Fleischer, A. Kawamura, M. Korman, Y. Okamoto, J. Pach, Y. Tang, T. Tokuyama, S. Verdonschot, and T. Wang.
In Proceedings of the 30th Symposium on Computational Geometry, SoCG'14. 2014.

New and improved spanning ratios for Yao graphs.
L. Barba, P. Bose, M. Damian, R. Fagerberg, W. Keng, J. O'Rourke, A. van Renssen, P. Taslakian, S. Verdonschot, and G. Xia.
In Proceedings of the 30th Symposium on Computational Geometry, SoCG'14. 2014.

Optimal algorithms for constrained 1-center problems.
L. Barba, P. Bose, and S. Langerman.
In Proceedings of the 11th Latin American Theoretical INformatics Symposium, LATIN'14, pages (84-95), March 2014.

Isoperimetric enclosures.
G. Aloupis, L. Barba, J. de Carufel, S. Langerman, and D. Souvaine.
In Proceedings of the 1st Mexican Conference on Discrete Mathematics and Computational Geometry, MCDMCG'13, pages 47-56, November 2013.

Theta-3 is connected.
O. Aichholzer, S. Bae, L. Barba, P. Bose, M. Korman, A. van Renssen, P. Taslakian, and S. Verdonschot.
In Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG'13, pages 205-210, August 2013.

Computing covers of plane forests.
L. Barba, A. Beingessner, P. Bose, and M. Smid.
In Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG'13, pages 217-222, August 2013.

On $k$-enclosing objects in a coloured point set.
L. Barba, S. Durocher, R. Fraser, F. Hurtado, S. Mehrabi, D. Mondal, J. Morrison, M. Skala, and M. Wahid.
In Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG'13, pages 229-234, August 2013.

On the stretch factor of the theta-4 graph.
L. Barba, P. Bose, J. de Carufel, A. van Renssen, and S. Verdonschot.
In Proceedings of the 13th Algorithms and Data Structures Symposium, WADS'13, pages 109-120, August 2013.

Bichromatic compatible matchings.
G. Aloupis, L. Barba, S. Langerman, and D. Souvaine.
In Proceedings of the 29th Symposium on Computational Geometry, SoCG'13, pages 267-276, June 2013.

Space-time trade-offs for stack-based algorithms.
L. Barba, M. Korman, S. Langerman, K. Sadakane, and R. Silveira.
In Proceedings of the 30th Symposium on Theoretical Aspects of Computer Science, STACS'13, pages 281-292, February-March 2013.

Circle separability queries in logarithmic time.
G. Aloupis, L. Barba, and S. Langerman.
In Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG'12, pages 121-125, August 2012.

Disk constrained 1-center queries.
L. Barba.
In Proceedings of the 24th Canadian Conference on Computational Geometry, CCCG'12, pages 15-19, August 2012.

The Erdös-Sós conjecture for geometric graphs.
L. Barba, R. Fabila-Monroy, D. Lara, J. Lea\~nos, C. Rodr\'iguez, G. Salazar, and F. Zaragoza.
In Proceedings of the European Workshop on Computational Geometry, EuroCG'12. March 2012.

Computing the visibility polygon using few variables.
L. Barba, M. Korman, S. Langerman, and R. Silveira.
In Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC'11), pages 70-79. Yokohama, Japan, 2011.
On edge-disjoint empty triangles of point sets.
L. Barba, J. Cano, J. Urrutia, and T. Sakai.
In Proceedings of the XIV Spanish Meeting on Computational Geometry, EGC 2011, pages 15-18, July 2011.

Dynamic circle separability between convex polygons.
L. Barba and J. Urrutia.
In Proceedings of the XIV Spanish Meeting on Computational Geometry, EGC 2011, pages 43-46, June 2011.


Pending submission.

Top-down skiplists.
L. Barba and P. Morin.
Available in ArXiv.


Chapters in Books.

On edge-disjoint empty triangles of point sets.
L. Barba, J. Cano, J. Urrutia, and T. Sakai.
In Pach, J., editor, Thirty Essays on Geometric Graph Theory, Algorithms and Combinatorics. Springer, 2012.


Theses.

Problemas de proximidad sobre objetos geométricos en el plano (On proximity problems of geometric objects in the plane).
L. Barba.
Master's thesis, Universidad Nacional Autónoma de México, 2011.

Algoritmos de optimización sobre trayectorias monótonas en gráficas coloreadas por aristas (Optimization algorithms on montone paths in edge-colored graphs).
L. Barba.
Master's thesis, Universidad Nacional Autónoma de México, 2009.