Strong LP formulations for scheduling splittable jobs on unrelated machines. - José Correa 001; Alberto Marchetti-Spaccamela; Jannik Matuschke; Leen Stougie; Ola Svensson; Víctor Verdugo; José Verschae (Math. Program., 2015)

Split scheduling with uniform setup times. - Frans Schalekamp; René Sitters; Suzanne van der Ster; Leen Stougie; Víctor Verdugo; Anke van Zuylen (J. Sched., 2015)

Splitting versus setup trade-offs for scheduling to minimize weighted completion time. - José Correa 001; Victor Verdugo; José Verschae (Oper. Res. Lett., 2016)

Brief Announcement: How Large is your Graph? - Varun Kanade; Frederik Mallmann-Trenn; Victor Verdugo (PODC, 2017)

A scheduling model inspired by control theory. - Sanjoy K. Baruah; Vincenzo Bonifaci; Alberto Marchetti-Spaccamela; Victor Verdugo (RTNS, 2017)

How Large Is Your Graph?. - Varun Kanade; Frederik Mallmann-Trenn; Victor Verdugo (DISC, 2017)

Skyline Computation with Noisy Comparisons. - Frederik Mallmann-Trenn; Claire Mathieu; Victor Verdugo (CoRR, 2017)

Semidefinite and linear programming integrality gaps for scheduling identical machines. - Adam Kurpisz; Monaldo Mastrolilli; Claire Mathieu; Tobias Mömke; Victor Verdugo; Andreas Wiese (Math. Program., 2018)

Convex and online optimization : applications to scheduling and selection problems. (Optimisation convexe et en ligne : applications aux problèmes de planification et de sélection). - Victor Verdugo (2018)

Breaking Symmetries to Rescue Sum of Squares: The Case of Makespan Scheduling. - Victor Verdugo; José Verschae (IPCO, 2019)

On the extension complexity of scheduling. - Hans Raj Tiwary; Victor Verdugo; Andreas Wiese (CoRR, 2019)

From pricing to prophets, and back! - José Correa 001; Patricio Foncea; Dana Pizarro; Victor Verdugo (Oper. Res. Lett., 2019)

Skyline Computation with Noisy Comparisons. - Benoît Groz; Frederik Mallmann-Trenn; Claire Mathieu; Victor Verdugo (IWOCA, 2020)

Breaking symmetries to rescue sum of squares in the case of makespan scheduling. - Victor Verdugo; José Verschae; Andreas Wiese (Math. Program., 2020)

On the extension complexity of scheduling polytopes. - Hans Raj Tiwary; Victor Verdugo; Andreas Wiese (Oper. Res. Lett., 2020)

Proportional Apportionment: A Case Study From the Chilean Constitutional Convention. - Javier Cembrano; José Correa 001; Gonzalo Díaz; Victor Verdugo (EAAMO, 2021)

Preserving Diversity when Partitioning: A Geometric Approach. - Sebastian Perez-Salazar; Alfredo Torrico; Victor Verdugo (EAAMO, 2021)

Optimal Revenue Guarantees for Pricing in Large Markets. - José Correa 001; Dana Pizarro; Victor Verdugo (SAGT, 2021)

Multidimensional Apportionment through Discrepancy Theory. - Javier Cembrano; José Correa 001; Victor Verdugo (EC, 2021)

The Convergence Rates of Blockchain Mining Games: A Markovian Approach. - Alejandro Jofré; Angel Pardo; David Salas; Victor Verdugo; José Verschae (CoRR, 2021)

Strong Algorithms for the Ordinal Matroid Secretary Problem. - José A. Soto; Abner Turkieltaub; Victor Verdugo (Math. Oper. Res., 2021)

A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. - Vincent Cohen-Addad; Tobias Mömke; Victor Verdugo (IPCO, 2022)

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

Online Combinatorial Assignment in Independence Systems. - Javier Marinkovic; José A. Soto; Victor Verdugo (IPCO, 2024)

Monotone Randomized Apportionment. - José Correa 001; Paul Gölz; Ulrike Schmidt-Kraepelin; Jamie Tucker-Foltz; Victor Verdugo (EC, 2024)

The Competition Complexity of Prophet Inequalities. - Johannes Brustle; José Correa 001; Paul Dütting; Tomer Ezra; Michal Feldman; Victor Verdugo (EC, 2024)

Splitting Guarantees for Prophet Inequalities via Nonlinear Systems. - Johannes Brustle; Sebastian Perez-Salazar; Victor Verdugo (CoRR, 2024)

Optimal Guarantees for Online Selection Over Time. - Sebastian Perez-Salazar; Victor Verdugo (CoRR, 2024)

Proportionality in Multiple Dimensions to Design Electoral Systems. - Javier Cembrano; José Correa 001; Gonzalo Díaz; Victor Verdugo (CoRR, 2024)

The Competition Complexity of Dynamic Pricing. - Johannes Brustle; José Correa 001; Paul Duetting; Victor Verdugo (Math. Oper. Res., 2024)

Apportionment with parity constraints. - Claire Mathieu; Victor Verdugo (Math. Program., 2024)

A 2-approximation for the bounded treewidth sparsest cut problem in sfFPT Time. - Vincent Cohen-Addad; Tobias Mömke; Victor Verdugo (Math. Program., 2024)

Matroid Secretary via Labeling Schemes. - Kristóf Bérczi; Vasilis Livanos; José A. Soto; Victor Verdugo (IPCO, 2025)

Near-feasible Fair Allocations in Two-sided Markets. - Javier Cembrano; Andrés Moraga; Victor Verdugo (EC, 2025)

New Combinatorial Insights for Monotone Apportionment. - Javier Cembrano; José Correa 001; Ulrike Schmidt-Kraepelin; Alexandros Tsigonias-Dimitriadis; Victor Verdugo (SODA, 2025)

Prophet upper bounds for online matching and auctions. - José A. Soto; Victor Verdugo (Oper. Res. Lett., 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)

Posted Pricing and Competition in Large Markets. - José Correa 001; Vasilis Livanos; Dana Pizarro; Victor Verdugo (CoRR, 2025)