Waldo Gálvez

According to our database, Waldo Gálvez authored at least 17 papers between 2016 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms.

Susanne Albers, Waldo Gálvez, Ömer Behic Özdemir

CoRR, August, 2025

A Dynamic Programming Framework for Generating Approximately Diverse and Optimal Solutions.

Waldo Gálvez, Mayank Goswami, Arturo Merino, GiBeom Park, Meng-Tsung Tsai, Victor Verdugo

CoRR, January, 2025

Computing Diverse and Nice Triangulations.

Waldo Gálvez, Mayank Goswami, Arturo Merino, GiBeom Park, Meng-Tsung Tsai

Proceedings of the Fundamentals of Computation Theory - 25th International Symposium, 2025

Improved Approximation Guarantees for Advertisement Placement.

Waldo Gálvez, Roberto Oliva, Victor Verdugo

Proceedings of the Approximation, 2025

2023

Node Connectivity Augmentation of Highly Connected Graphs.

Waldo Gálvez, Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità

CoRR, 2023

2022

A 3-Approximation Algorithm for Maximum Independent Set of Rectangles.

Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Approximation Schemes for Packing Problems with ℓ _p-norm Diversity Constraints.

Waldo Gálvez, Víctor Verdugo

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

A 4-Approximation Algorithm for Maximum Independent Set of Rectangles.

Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese

CoRR, 2021

Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle.

Waldo Gálvez, Francisco Sanhueza-Matamala, José A. Soto

Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

Machine Covering in the Random-Order Model.

Susanne Albers, Waldo Gálvez, Maximilian Janke

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More.

Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese

Proceedings of the 37th International Symposium on Computational Geometry, 2021

Approximation Algorithms for Demand Strip Packing.

Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi

Proceedings of the Approximation, 2021

2020

A Tight (3/2+ε) Approximation for Skewed Strip Packing.

Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau

Proceedings of the Approximation, 2020

2019

On the Cycle Augmentation Problem: Hardness and Approximation Algorithms.

Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat

Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

2018

Symmetry Exploitation for Online Machine Covering with Bounded Migration.

Waldo Gálvez, José A. Soto, José Verschae

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Approximating Geometric Knapsack via L-Packings.

Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

Improved Pseudo-Polynomial-Time Approximation for Strip Packing.

Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan

Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016