Publications
Below you can find a list of my publications. A similar list can also be found on DBLP or on Google Scholar.
Note: In the field of Theoretical Computer Science, publications in conference proceedings are valued comparably high to those in journals; Anyway, I am usually preparing journal versions of my conference papers. Authors are commonly listed simply in alphabetical order.
Journal articles
A Tight (3/2+epsilon) Approximation for Skewed Strip Packing. Algorithmica. Joint work with Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan and Malin Rau (2023). [Algorithmica]
Machine Covering in the Random-Order Model. Algorithmica. Special Issue on Algorithms and Computation 2021. Joint work with Susanne Albers and Maximilian Janke (2022). [Algorithmica]
Approximating Geometric Knapsack via L-packings. ACM Transactions on Algorithms. Vol 17, Article 33. Joint work with Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan and Andreas Wiese (2021). [TALG]
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. Theory of Computing Systems. Special Issue on Approximation and Online Algorithms 2019. Joint work with Fabrizio Grandoni, Afrouz Jabal Ameli and Krzysztof Sornat (2021). [TOCS]
Symmetry Exploitation for Online Machine Covering with Bounded Migration. ACM Transactions on Algorithms. Vol 16, Article 43. Joint work with Jose A. Soto and José Verschae (2020). [TALG]
Conference Proceedings
Approximation Schemes for Packing problems with Lp-norm Diversity constraints. LATIN 2022, 204-221. Joint work with Víctor Verdugo. [LATIN version] [PDF] [Slides]
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. SODA 2022, 894--905. Joint work with Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy, and Andreas Wiese. [SODA version] [arXiv version]
Machine Covering in the Random-Order Model. ISAAC 2021, 52:1--52:16. Joint work with Susanne Albers and Maximilian Janke. [PDF] [arXiv version]
Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle. WAOA 2021, 1--22. Joint work with Francisco Sanhueza-Matamala and José A. Soto. [WAOA version] [arXiv version] [Presentation (by Francisco Sanhueza-Matamala)]
Approximation Algorithms for Demand Strip Packing. APPROX 2021, 20:1--20:24. Joint work with Fabrizio Grandoni, Afrouz Jabal Ameli, and Kamyar Khodamoradi. [PDF] [arXiv version] [Presentation] [Slides]
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. SoCG 2021, 39:1--39:17. Joint work with Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, and Andreas Wiese. [PDF] [arXiv version]
An extended talk I gave about this work at the AGCO Seminar - Chile can be found here.
A Tight (3/2+ε) Approximation for Skewed Strip Packing. APPROX 2020, 44:1--44:18. Joint work with Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, and Malin Rau. [PDF] [Presentation (by Afrouz Jabal Ameli)]
An extended talk I gave about this work at the Bin Packing Seminar Series can be found here.
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. WAOA 2019, 138--153. Joint work with Fabrizio Grandoni, Afrouz Jabal Ameli, and Krzysztof Sornat. [PDF] [Slides]
Symmetry exploitation for Online Machine Covering with Bounded Migration. ESA 2018, 32:1--32:14. Joint work with Jose A. Soto and José Verschae. [PDF] [arXiv version] [Slides]
A preliminary version of this work was published at MAPSP 2015. [Proceedings]
Approximating Geometric Knapsack via L-packings. FOCS 2017, 260--271. Joint work with Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, and Andreas Wiese. [PDF] [arXiv version] [HALG 2018 poster] [HALG 2018 slides]
Improved Pseudo-polynomial-time approximation for Strip Packing. FSTTCS 2016, 9:1--9:14. Joint work with Fabrizio Grandoni, Salvatore Ingala, and Arindam Khan. [PDF] [arXiv version]
Preprints
Node Connectivity Augmentation of Highly Connected Graphs. Joint work with Dylan Hyatt-Denesik, Afrouz Jabal Ameli, and Laura Sanità. [arXiv]
A (2+ε)-Approximation Algorithm for Maximum Independent Set of Rectangles. Joint work with Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy, and Andreas Wiese. [arXiv]
Theses
Approximation algorithms for two-dimensional geometric packing problems. PhD Thesis, IDSIA and USI-SUPSI (2019). Advisor: Prof. Fabrizio Grandoni. [Link]
Algoritmos en Línea para Problemas de Balanceamiento Robusto. Master's Thesis, Universidad de Chile (2015). Advisor: Prof. José Verschae. [PDF (in Spanish)]