WG
Académico · Postgrado UdeC
WALDO ELÍAS GÁLVEZ VERDUGO
Magíster en Ciencias de la Ingeniería, mención Matemáticas Aplicadas
Universidad de Chile
wgalvez@udec.cl-
Computing Diverse and Nice Triangulations
LECTURE NOTES IN COMPUTER SCIENCE 2026 ARTÍCULO CONFERENCIA_REV SCOPUS AUTOR
-
A (2 + E)-Approximation Algorithm for Maximum Independent Set of Rectangles
ACM TRANSACTIONS ON ALGORITHMS 2026 ARTÍCULO WOS - SCOPUS AUTOR
-
Improved Approximation Guarantees for Advertisement Placement
LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS, LIPICS 2025 ARTÍCULO CONFERENCIA_REV WOS - SCOPUS AUTOR
-
On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms
PROCEDIA COMPUTER SCIENCE 2025 ARTÍCULO CONFERENCIA_REV SCOPUS AUTOR
-
Machine Covering in the Random-Order Model
ALGORITHMICA 2023 ARTÍCULO WOS - SCOPUS AUTOR
-
A Tight (3/2+e)-Approximation for Skewed Strip Packing
ALGORITHMICA 2023 ARTÍCULO WOS - SCOPUS AUTOR
-
Approximation Schemes for Packing Problems with lp-norm Diversity Constraints
LECTURE NOTES IN COMPUTER SCIENCE 2022 ARTÍCULO CONFERENCIA_REV SCOPUS AUTOR
-
A 3-Approximation Algorithm for Maximum Independent Set of Rectangles
SIN REVISTA 2022 ARTÍCULO CONFERENCIA_LIBRO AUTOR -
Approximation Algorithms for Vertex-Connectivity Augmentation on the Cycle
LECTURE NOTES IN COMPUTER SCIENCE 2021 ARTÍCULO CONFERENCIA_REV SCOPUS AUTOR
-
Improved Approximation Algorithms for 2-Dimensional Knapsack: Packing into Multiple L-Shapes, Spirals, and More
LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS, LIPICS 2021 ARTÍCULO CONFERENCIA_REV WOS - SCOPUS AUTOR
-
Approximation Algorithms for Demand Strip Packing
LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS, LIPICS 2021 ARTÍCULO CONFERENCIA_REV WOS - SCOPUS AUTOR
-
Machine Covering in the Random-Order Model
LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS, LIPICS 2021 ARTÍCULO CONFERENCIA_REV WOS - SCOPUS AUTOR
-
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms
THEORY OF COMPUTING SYSTEMS 2021 ARTÍCULO WOS - SCOPUS AUTOR
-
Approximating Geometric Knapsack via L-packings
ACM TRANSACTIONS ON ALGORITHMS 2021 ARTÍCULO WOS - SCOPUS AUTOR
-
On the Cycle Augmentation Problem: Hardness and Approximation Algorithms
LECTURE NOTES IN COMPUTER SCIENCE 2020 ARTÍCULO CONFERENCIA_REV SCOPUS AUTOR
-
A Tight (3/2+e) Approximation for Skewed Strip Packing
LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS, LIPICS 2020 ARTÍCULO CONFERENCIA_REV WOS - SCOPUS AUTOR
-
Symmetry Exploitation for Online Machine Covering with Bounded Migration
ACM TRANSACTIONS ON ALGORITHMS 2020 ARTÍCULO WOS - SCOPUS AUTOR
-
Symmetry Exploitation for Online Machine Covering with Bounded Migration
LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS, LIPICS 2018 ARTÍCULO CONFERENCIA_REV WOS - SCOPUS AUTOR
-
Approximating Geometric Knapsack via L-packings
ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE - PROCEEDINGS 2017 ARTÍCULO CONFERENCIA_REV WOS - SCOPUS AUTOR
-
Improved pseudo-polynomial-time approximation for strip packing
LEIBNIZ INTERNATIONAL PROCEEDINGS IN INFORMATICS, LIPICS 2016 ARTÍCULO CONFERENCIA_REV WOS - SCOPUS AUTOR