Waldo Gálvez

Orcid: 0000-0002-6395-3322

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms.
CoRR, August, 2025

A Dynamic Programming Framework for Generating Approximately Diverse and Optimal Solutions.
CoRR, January, 2025

Computing Diverse and Nice Triangulations.
Proceedings of the Fundamentals of Computation Theory - 25th International Symposium, 2025

Improved Approximation Guarantees for Advertisement Placement.
Proceedings of the Approximation, 2025

2023
Node Connectivity Augmentation of Highly Connected Graphs.
CoRR, 2023

2022
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Approximation Schemes for Packing Problems with ℓ <sub>p</sub>-norm Diversity Constraints.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

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

Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle.
Proceedings of the Approximation and Online Algorithms - 19th International Workshop, 2021

Machine Covering in the Random-Order Model.
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.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

Approximation Algorithms for Demand Strip Packing.
Proceedings of the Approximation, 2021

2020
A Tight (3/2+ε) Approximation for Skewed Strip Packing.
Proceedings of the Approximation, 2020

2019
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms.
Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

2018
Symmetry Exploitation for Online Machine Covering with Bounded Migration.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Approximating Geometric Knapsack via L-Packings.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
Improved Pseudo-Polynomial-Time Approximation for Strip Packing.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016


  Loading...