Waldo Gálvez

Publication Activity (10 Years)

Years Active: 2016-2023
Publications (10 Years): 25

Top Topics

Highly Connected

Approximation Algorithms

Top Venues

ACM Trans. Algorithms

Publications

Susanne Albers, Waldo Gálvez, Maximilian Janke
Machine Covering in the Random-Order Model. Algorithmica 85 (6) (2023)
Waldo Gálvez, Dylan Hyatt-Denesik, Afrouz Jabal Ameli, Laura Sanità
Node Connectivity Augmentation of Highly Connected Graphs. CoRR (2023)
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau
A Tight (3/2+ε )-Approximation for Skewed Strip Packing. Algorithmica 85 (10) (2023)
Waldo Gálvez, Víctor Verdugo
-norm Diversity Constraints. LATIN (2022)
Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles. SODA (2022)
Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Sandy Heydrich, Arindam Khan, Andreas Wiese
Approximating Geometric Knapsack via L-packings. ACM Trans. Algorithms 17 (4) (2021)
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi
Approximation Algorithms for Demand Strip Packing. APPROX-RANDOM (2021)
Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. CoRR (2021)
Waldo Gálvez, Francisco Sanhueza-Matamala, José A. Soto
Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle. WAOA (2021)
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. Theory Comput. Syst. 65 (6) (2021)
Waldo Gálvez, Francisco Sanhueza-Matamala, José A. Soto
Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle. CoRR (2021)
Susanne Albers, Waldo Gálvez, Maximilian Janke
Machine Covering in the Random-Order Model. ISAAC (2021)
Waldo Gálvez, Fabrizio Grandoni, Arindam Khan, Diego Ramírez-Romero, Andreas Wiese
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More. SoCG (2021)
Waldo Gálvez, Arindam Khan, Mathieu Mari, Tobias Mömke, Madhusudhan Reddy Pittu, Andreas Wiese
A 4-Approximation Algorithm for Maximum Independent Set of Rectangles. CoRR (2021)
Susanne Albers, Waldo Gálvez, Maximilian Janke
Machine Covering in the Random-Order Model. CoRR (2021)
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Kamyar Khodamoradi
Approximation Algorithms for Demand Strip Packing. CoRR (2021)
Waldo Gálvez, José A. Soto, José Verschae
Symmetry Exploitation for Online Machine Covering with Bounded Migration. ACM Trans. Algorithms 16 (4) (2020)
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Klaus Jansen, Arindam Khan, Malin Rau
A Tight (3/2+ε) Approximation for Skewed Strip Packing. APPROX-RANDOM (2020)
Waldo Gálvez, Fabrizio Grandoni, Afrouz Jabal Ameli, Krzysztof Sornat
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms. WAOA (2019)
Waldo Gálvez, José A. Soto, José Verschae
Symmetry Exploitation for Online Machine Covering with Bounded Migration. ESA (2018)
Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan
Improved Pseudo-Polynomial-Time Approximation for Strip Packing. CoRR (2018)
Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
Approximating Geometric Knapsack via L-Packings. FOCS (2017)
Waldo Gálvez, Fabrizio Grandoni, Sandy Heydrich, Salvatore Ingala, Arindam Khan, Andreas Wiese
Approximating Geometric Knapsack via L-packings. CoRR (2017)
Waldo Gálvez, Fabrizio Grandoni, Salvatore Ingala, Arindam Khan
Improved Pseudo-Polynomial-Time Approximation for Strip Packing. FSTTCS (2016)
Waldo Gálvez, José A. Soto, José Verschae
Symmetry exploitation for Online Machine Covering with Bounded Migration. CoRR (2016)