Improved Pseudo-Polynomial-Time Approximation for Strip Packing. - Waldo Gálvez; Fabrizio Grandoni 001; Salvatore Ingala; Arindam Khan 001 (FSTTCS, 2016)

Approximating Geometric Knapsack via L-Packings. - Waldo Gálvez; Fabrizio Grandoni 001; Sandy Heydrich; Salvatore Ingala; Arindam Khan 001; Andreas Wiese (FOCS, 2017)

Symmetry Exploitation for Online Machine Covering with Bounded Migration. - Waldo Gálvez; José A. Soto; José Verschae (ESA, 2018)

On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. - Waldo Gálvez; Fabrizio Grandoni 001; Afrouz Jabal Ameli; Krzysztof Sornat (WAOA, 2019)

A Tight (3/2+ε) Approximation for Skewed Strip Packing. - Waldo Gálvez; Fabrizio Grandoni 001; Afrouz Jabal Ameli; Klaus Jansen; Arindam Khan 001; Malin Rau (APPROX-RANDOM, 2020)

Approximation Algorithms for Demand Strip Packing. - Waldo Gálvez; Fabrizio Grandoni 001; Afrouz Jabal Ameli; Kamyar Khodamoradi (APPROX-RANDOM, 2021)

Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. - Waldo Gálvez; Fabrizio Grandoni 001; Arindam Khan 001; Diego Ramírez-Romero; Andreas Wiese (SoCG, 2021)

Machine Covering in the Random-Order Model. - Susanne Albers; Waldo Gálvez; Maximilian Janke (ISAAC, 2021)

Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle. - Waldo Gálvez; Francisco Sanhueza-Matamala; José A. Soto (WAOA, 2021)

A 4-Approximation Algorithm for Maximum Independent Set of Rectangles. - Waldo Gálvez; Arindam Khan 001; Mathieu Mari; Tobias Mömke; Madhusudhan Reddy Pittu; Andreas Wiese (CoRR, 2021)

Approximation Schemes for Packing Problems with ℓ p-norm Diversity Constraints. - Waldo Gálvez; Víctor Verdugo (LATIN, 2022)

A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. - Waldo Gálvez; Arindam Khan 001; Mathieu Mari; Tobias Mömke; Madhusudhan Reddy Pittu; Andreas Wiese (SODA, 2022)

Node Connectivity Augmentation of Highly Connected Graphs. - Waldo Gálvez; Dylan Hyatt-Denesik; Afrouz Jabal Ameli; Laura Sanità (CoRR, 2023)

Improved Approximation Guarantees for Advertisement Placement. - Waldo Gálvez; Roberto Oliva; Victor Verdugo (APPROX/RANDOM, 2025)

Computing Diverse and Nice Triangulations. - Waldo Gálvez; Mayank Goswami 001; Arturo Merino; GiBeom Park; Meng-Tsung Tsai (FCT, 2025)

A Dynamic Programming Framework for Generating Approximately Diverse and Optimal Solutions. - Waldo Gálvez; Mayank Goswami 001; Arturo Merino; GiBeom Park; Meng-Tsung Tsai; Victor Verdugo (CoRR, 2025)

On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms. - Susanne Albers; Waldo Gálvez; Ömer Behic Özdemir (CoRR, 2025)