default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuis Barba
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i29]Niket Patel, Luis Salamanca, Luis Barba:
Bridging the Gap: Addressing Discrepancies in Diffusion Model Training for Classifier-Free Guidance. CoRR abs/2311.00938 (2023)- 2022
- [j23]Luis Barba, Otfried Cheong, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot:
Weight balancing on boundaries. J. Comput. Geom. 13(1): 1-12 (2022) - [c30]Yatin Dandi, Luis Barba, Martin Jaggi:
Implicit Gradient Alignment in Distributed and Federated Learning. AAAI 2022: 6454-6462 - 2021
- [i28]Yatin Dandi, Luis Barba, Martin Jaggi:
Implicit Gradient Alignment in Distributed and Federated Learning. CoRR abs/2106.13897 (2021) - [i27]Denys Pushkin, Luis Barba:
Multilayer Lookahead: a Nested Version of Lookahead. CoRR abs/2110.14254 (2021) - 2020
- [j22]Eunjin Oh, Luis Barba, Hee-Kap Ahn
:
The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon. Algorithmica 82(5): 1434-1473 (2020) - [j21]Bahareh Banyassady, Luis Barba, Wolfgang Mulzer:
Time-space trade-offs for computing Euclidean minimum spanning trees. J. Comput. Geom. 11(1): 525-547 (2020) - [c29]Tao Lin, Sebastian U. Stich, Luis Barba, Daniil Dmitriev, Martin Jaggi:
Dynamic Model Pruning with Feedback. ICLR 2020 - [i26]Tao Lin, Sebastian U. Stich, Luis Barba, Daniil Dmitriev, Martin Jaggi:
Dynamic Model Pruning with Feedback. CoRR abs/2006.07253 (2020)
2010 – 2019
- 2019
- [j20]Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot:
Dynamic Graph Coloring. Algorithmica 81(4): 1319-1341 (2019) - [j19]Luis Barba, Malte Milatz, Jerri Nummenpalo, Xiaoming Sun, Antonis Thomas, Jialin Zhang, Zhijie Zhang:
The Complexity of Optimization on Grids. Algorithmica 81(9): 3494-3518 (2019) - [j18]Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon:
Subquadratic Algorithms for Algebraic 3SUM. Discret. Comput. Geom. 61(4): 698-734 (2019) - [c28]Luis Barba:
Optimal Algorithm for Geodesic Farthest-Point Voronoi Diagrams. SoCG 2019: 12:1-12:14 - [c27]Luis Barba, Wolfgang Mulzer:
Asymmetric Convex Intersection Testing. SOSA 2019: 9:1-9:14 - [i25]Luis Barba, Alexander Pilz, Patrick Schnider:
Sharing a pizza: bisecting masses with two cuts. CoRR abs/1904.02502 (2019) - 2018
- [j17]Davood Bakhshesh, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, Mohammad Farshi, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao graphs. Comput. Geom. 67: 42-52 (2018) - [j16]Oswin Aichholzer, Luis Barba, Thomas Hackl, Alexander Pilz, Birgit Vogtenhuber:
Linear transformation distance for bichromatic matchings. Comput. Geom. 68: 77-88 (2018) - [j15]Luis Barba, Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Ruy Fabila Monroy, Edel Pérez-Castillo:
Corrigendum to 'Asymmetric polygons with maximum area' [European Journal of Operational Research 248 (2016) 1123-1131]. Eur. J. Oper. Res. 266(1): 391 (2018) - [c26]Bahareh Banyassady, Luis Barba, Wolfgang Mulzer:
Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees. LATIN 2018: 108-119 - [c25]Luis Barba, Michael Hoffmann, Matias Korman, Alexander Pilz:
Convex Hulls in Polygonal Domains. SWAT 2018: 8:1-8:13 - [i24]Eunjin Oh, Luis Barba, Hee-Kap Ahn:
The Geodesic Farthest-point Voronoi Diagram in a Simple Polygon. CoRR abs/1802.06223 (2018) - [i23]Luis Barba, Wolfgang Mulzer:
Asymmetric Convex Intersection Testing. CoRR abs/1808.06460 (2018) - [i22]Luis Barba:
Geodesic farthest-point Voronoi diagram in linear time. CoRR abs/1809.01481 (2018) - 2017
- [j14]Luis Barba, Frank Duque, Ruy Fabila Monroy, Carlos Hidalgo-Toscano:
Drawing the Horton set in an integer grid of minimum size. Comput. Geom. 63: 10-19 (2017) - [j13]Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman:
Incremental Voronoi Diagrams. Discret. Comput. Geom. 58(4): 822-848 (2017) - [j12]Luis Barba, William Evans, Michael Hoffmann, Vincent Kusters, Maria Saumell, Bettina Speckmann:
Column planarity and partially-simultaneous geometric embedding. J. Graph Algorithms Appl. 21(6): 983-1002 (2017) - [c24]Luis Barba, Patrick Schnider:
Sharing a Pizza: Bisecting Masses with Two Cuts. CCCG 2017: 174-178 - [c23]Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon:
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. SoCG 2017: 13:1-13:15 - [c22]Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot:
Dynamic Graph Coloring. WADS 2017: 97-108 - [i21]Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot:
Dynamic Graph Coloring. CoRR abs/1708.09080 (2017) - [i20]Bahareh Banyassady, Luis Barba, Wolfgang Mulzer:
Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees. CoRR abs/1712.06431 (2017) - 2016
- [j11]Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh:
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. Discret. Comput. Geom. 56(4): 836-859 (2016) - [j10]Luis Barba, Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Ruy Fabila Monroy, Edel Pérez-Castillo:
Asymmetric polygons with maximum area. Eur. J. Oper. Res. 248(3): 1123-1131 (2016) - [c21]Luis Barba, Malte Milatz, Jerri Nummenpalo, Antonis Thomas:
Deterministic Algorithms for Unique Sink Orientations of Grids. COCOON 2016: 357-369 - [c20]Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman:
Incremental Voronoi diagrams. SoCG 2016: 15:1-15:16 - [c19]Eunjin Oh, Luis Barba, Hee-Kap Ahn:
The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon. SoCG 2016: 56:1-56:15 - [i19]Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman:
Incremental Voronoi Diagrams. CoRR abs/1603.08485 (2016) - [i18]Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon:
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. CoRR abs/1612.02384 (2016) - 2015
- [j9]Luis Barba, Matias Korman, Stefan Langerman, Kunihiko Sadakane, Rodrigo I. Silveira:
Space-Time Trade-offs for Stack-Based Algorithms. Algorithmica 72(4): 1097-1129 (2015) - [j8]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Reprint of: Theta-3 is connected. Comput. Geom. 48(5): 407-414 (2015) - [j7]Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine:
Bichromatic compatible matchings. Comput. Geom. 48(8): 622-633 (2015) - [j6]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin:
Compatible Connectivity Augmentation of Planar Disconnected Graphs. Discret. Comput. Geom. 54(2): 459-480 (2015) - [j5]Greg Aloupis, Luis Barba, Jean-Lou De Carufel, Stefan Langerman, Diane L. Souvaine:
Isoperimetric Enclosures. Graphs Comb. 31(2): 361-392 (2015) - [j4]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia:
New and improved spanning ratios for Yao graphs. J. Comput. Geom. 6(2): 19-53 (2015) - [c18]Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh:
A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon. SoCG 2015: 209-223 - [c17]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin:
Compatible Connectivity-Augmentation of Planar Disconnected Graphs. SODA 2015: 1602-1615 - [c16]Luis Barba, Stefan Langerman:
Optimal detection of intersections between convex polyhedra. SODA 2015: 1641-1654 - [i17]Hee-Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, Eunjin Oh:
A linear-time algorithm for the geodesic center of a simple polygon. CoRR abs/1501.00561 (2015) - [i16]Luis Barba, Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Ruy Fabila Monroy, Edel Pérez-Castillo:
Asymmetric polygons with maximum area. CoRR abs/1501.07721 (2015) - [i15]Luis Barba, Frank Duque, Ruy Fabila Monroy, Carlos Hidalgo-Toscano:
Drawing the Horton Set in an Integer Grid of Minimum Size. CoRR abs/1506.05505 (2015) - [i14]Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang:
Weight Balancing on Boundaries and Skeletons. CoRR abs/1511.04123 (2015) - 2014
- [j3]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. Comput. Geom. 47(9): 910-917 (2014) - [j2]Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira:
Computing a visibility polygon using few variables. Comput. Geom. 47(9): 918-926 (2014) - [c15]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao Graphs. CCCG 2014 - [c14]Luis Barba, Frank Duque, Ruy Fabila Monroy, Carlos Hidalgo-Toscano:
Drawing the Horton Set in an Integer Grid of Minimun Size. CCCG 2014 - [c13]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Wah Loon Keng, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot, Ge Xia:
New and Improved Spanning Ratios for Yao Graphs. SoCG 2014: 30 - [c12]Oswin Aichholzer, Luis Barba, Thomas Hackl, Alexander Pilz, Birgit Vogtenhuber:
Linear transformation distance for bichromatic matchings. SoCG 2014: 154 - [c11]Luis Barba, Otfried Cheong, Jean-Lou De Carufel, Michael Gene Dobbins, Rudolf Fleischer, Akitoshi Kawamura, Matias Korman, Yoshio Okamoto, János Pach, Yuan Tang, Takeshi Tokuyama, Sander Verdonschot, Tianhao Wang:
Weight Balancing on Boundaries and Skeletons. SoCG 2014: 436 - [c10]Luis Barba, Prosenjit Bose, Stefan Langerman:
Optimal Algorithms for Constrained 1-Center Problems. LATIN 2014: 84-95 - [i13]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. CoRR abs/1404.7186 (2014) - [i12]Luis Barba, Pat Morin:
Top-Down Skiplists. CoRR abs/1407.7917 (2014) - [i11]Greg Aloupis, Luis Barba, Paz Carmi, Vida Dujmovic, Fabrizio Frati, Pat Morin:
Compatible Connectivity-Augmentation of Planar Disconnected Graphs. CoRR abs/1408.2436 (2014) - [i10]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Mirela Damian, Rolf Fagerberg, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Continuous Yao Graphs. CoRR abs/1408.4099 (2014) - 2013
- [j1]Ruy Fabila Monroy, Luis Felipe Barba Flores, Dolores Lara, Jesús Leaños, Cynthia A. Rodríguez Villalobos, Gelasio Salazar, Francisco Zaragoza:
The Erdős-Sós Conjecture for Geometric Graphs. Discret. Math. Theor. Comput. Sci. 15(1): 93-100 (2013) - [c9]Oswin Aichholzer, Sang Won Bae, Luis Barba, Prosenjit Bose, Matias Korman, André van Renssen, Perouz Taslakian, Sander Verdonschot:
Theta-3 is connected. CCCG 2013 - [c8]Luis Barba, Alexis Beingessner, Prosenjit Bose, Michiel H. M. Smid:
Computing Covers of Plane Forests. CCCG 2013 - [c7]Luis Barba, Stephane Durocher, Robert Fraser, Ferran Hurtado, Saeed Mehrabi, Debajyoti Mondal, Jason Morrison, Matthew Skala, Mohammad Abdul Wahid:
On k-Enclosing Objects in a Coloured Point Set. CCCG 2013 - [c6]Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine:
Bichromatic compatible matchings. SoCG 2013: 267-276 - [c5]Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Kunihiko Sadakane:
Space-Time Trade-offs for Stack-Based Algorithms. STACS 2013: 281-292 - [c4]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen, Sander Verdonschot:
On the Stretch Factor of the Theta-4 Graph. WADS 2013: 109-120 - [i9]Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen, Sander Verdonschot:
On the stretch factor of the Theta-4 graph. CoRR abs/1303.5473 (2013) - [i8]Luis Barba, Prosenjit Bose, Mirela Damian, Rolf Fagerberg, Joseph O'Rourke, André van Renssen, Perouz Taslakian, Sander Verdonschot:
New and Improved Spanning Ratios for Yao Graphs. CoRR abs/1307.5829 (2013) - [i7]Luis Barba, Alexis Beingessner, Prosenjit Bose, Michiel H. M. Smid:
Computing Covers of Plane Forests. CoRR abs/1311.4860 (2013) - [i6]Oswin Aichholzer, Luis Barba, Thomas Hackl, Alexander Pilz, Birgit Vogtenhuber:
Linear transformation distance for bichromatic matchings. CoRR abs/1312.0884 (2013) - [i5]Luis Barba, Stefan Langerman:
Detecting intersections between convex polyhedra. CoRR abs/1312.1001 (2013) - 2012
- [c3]Luis Felipe Barba Flores:
Disk Constrained 1-Center Queries. CCCG 2012: 107-112 - [c2]Luis Felipe Barba Flores, Stefan Langerman, Greg Aloupis:
Circle Separability Queries in Logarithmic Time. CCCG 2012: 113-118 - [i4]Greg Aloupis, Luis Barba, Stefan Langerman:
Circle separability queries in logarithmic time. CoRR abs/1203.6266 (2012) - [i3]Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine:
Bichromatic compatible matchings. CoRR abs/1207.2375 (2012) - [i2]Luis Barba, Matias Korman, Stefan Langerman, Kunihiko Sadakane, Rodrigo I. Silveira:
Space-Time Trade-offs for Stack-Based Algorithms. CoRR abs/1208.3663 (2012) - 2011
- [c1]Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira:
Computing the Visibility Polygon Using Few Variables. ISAAC 2011: 70-79 - [i1]Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira:
Computing a visibility polygon using few variables. CoRR abs/1111.3584 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
