You can also check my Google Scholar, DBLP, and ORCID.

Submitted

• Improved Approximation Guarantees for Advertisement Placement. W. Gálvez, R. Oliva, V. Verdugo. Submitted, 2025. [LIPIcs] 
• Near-feasible Fair Allocations in Two-sided Markets. J. Cembrano, A. Moraga, V. Verdugo. Submitted, 2025. [Arxiv] 
• A Dynamic Programming Framework for Generating Approximately Diverse and Optimal Solutions.  W. Gálvez, M. Goswami, A. Merino, G. Park, M. Tsai, V. Verdugo. Submitted, 2025. [Arxiv]  
• Posted Pricing and Competition in Large Markets. J. Correa, V. Livanos, D. Pizarro, V. Verdugo. Submitted, 2025. [Arxiv] 
• Mean-Field Concentration of Opinion Dynamics in Random Graphs. J. Gutiérrez, D. Salas, V. Verdugo. Submitted, 2024. [Arxiv]  
• Optimal Guarantees for Online Selection over Time. S. Perez-Salazar,  V. Verdugo. Submitted, 2024. [Arxiv] 
• Approximation Schemes for Packing Problems with Lp-norm Diversity Constraints. W. Gálvez, V. Verdugo. Submitted, 2024. [PDF]
  
  

Journal articles

• Monotone Randomized Apportionment.  J. Correa,  P. Gölz, U. Schmidt-Kraepelin, J. Tucker-Foltz, V. Verdugo. Minor revision, Operations Research, 2025. [Arxiv]   
• New Combinatorial Insights for Monotone Apportionment. J. Correa, J. Cembrano, U. Schmidt-Kraepelin, A. Tsigonias-Dimitriadis, V. Verdugo. Mathematics of Operations Research, 2025. [Arxiv]
• Proportionality in Multiple Dimensions to Design Electoral Systems. J. Cembrano, J. Correa, G. Díaz, V. Verdugo. Social Choice and Welfare, 2025. [Arxiv] 
• Prophet Upper Bounds for Online Matching and Auctions. J. Soto , V. Verdugo. Operations Research Letters, 2025 [Arxiv]  
• Online Combinatorial Assignment in Independence Systems. J. Marinkovic, J. Soto, V. Verdugo. Mathematical Programming, 2025 [MathProg] [Arxiv]
• Splitting Guarantees for Prophet Inequalities via Nonlinear Systems. J. Brustle, S. Perez-Salazar, V. Verdugo. Mathematics of Operations Research, 2025. [MathOR] [Arxiv] 
• The Competition Complexity of Prophet Inequalities. J. Brustle, J. Correa,  P. Dütting, T. Ezra, M. Feldman, V. Verdugo. Mathematics of Operations Research, 2025. [Arxiv]
• A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. V. Cohen-Addad, T. Mömke, V. Verdugo.  Mathematical Programming, 2024. [MathProg] [Arxiv] 
• The Competition Complexity of Dynamic Pricing. J. Brustle, J. Correa, P. Dütting, V. Verdugo. Mathematics of Operations Research, 2024. [MathOR]
• Apportionment with Parity Constraints. C. Mathieu, V. Verdugo. Mathematical Programming, 2024. [Arxiv] [MathProg]  
• Multidimensional Political Apportionment. J. Cembrano, J. Correa, V. Verdugo. Proceedings of the National Academy of Sciences of the USA (PNAS), 2022. [PNAS] [SSRN]     
• Strong Algorithms for the Ordinal Matroid Secretary Problem. J. Soto, A. Turkieltaub, V. Verdugo.  Mathematics of Operations Research, 2021. [MathOR] [Arxiv]
• Breaking Symmetries to Rescue Sum of Squares in the Case of Makespan Scheduling. V. Verdugo, J. Verschae, A. Wiese. Mathematical Programming, 2020. [MathProg] [Arxiv]
• On the Extension Complexity of Scheduling. H. Raj Tiwary, V. Verdugo, A. Wiese. Operations Research Letters, 2020. [Arxiv] [ORL] 
• From Pricing to Prophets and Back! J. Correa, P. Foncea, D. Pizarro, V. Verdugo. Operations Research Letters, 2019. [ORL]  
• Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines.  A. Kurpisz, M. Mastrolilli, C. Mathieu, T. Mömke, A. Wiese, V. Verdugo. Mathematical Programming, 2017. [MathProg] 
• Splitting Versus Setup Trade-offs for Scheduling to Minimize Weighted Completion Times. J. Correa, J. Verschae, V. Verdugo. Operations Research Letters, 2016. [ORL]
• Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines. J. Correa, A. Marchetti-Spaccamela, J. Matuschke, L. Stougie, O. Svensson, J. Verschae, V. Verdugo. Mathematical Programming, 2015. [MathProg] 
• Split Scheduling with Uniform Setup Times. F. Schalekamp, R. Sitters, S. van der Ster, L. Stougie, A. van Zuylen, V. Verdugo. Journal of Scheduling, 2015. [JSched][Arxiv]              

Conference proceedings

• Online Proportional Apportionment (J. Cembrano, J. Correa, S. Griesbach, V. Verdugo), SODA 2026.
• Improved Approximation Guarantees for Advertisement Placement. W. Gálvez, R. Oliva, V. Verdugo. APPROX 2025. [APPROX] 
• Near-feasible Fair Allocations in Two-sided Markets. J. Cembrano, A. Moraga, V. Verdugo, EC 2025. [Arxiv] 
• Matroid Secretary via Labeling Schemes. K. Bérczi, V. Livanos, J. Soto, V. Verdugo. IPCO 2025. [Arxiv]  
• New Combinatorial Insights for Monotone Apportionment. J. Correa, J. Cembrano, U. Schmidt-Kraepelin, A. Tsigonias-Dimitriadis, V. Verdugo. SODA 2025. [Arxiv] [SODA]  
• Online Combinatorial Assignment in Independence Systems. J. Marinkovic, J. Soto, V. Verdugo. IPCO 2024 [MathProg] [Arxiv] [IPCO] 
• Splitting Guarantees for Prophet Inequalities via Nonlinear Systems. J. Brustle, S. Perez-Salazar, V. Verdugo. WINE 2024. [MathOR] [Arxiv] 
• Optimal Guarantees for Online Selection over Time. S. Perez-Salazar,  V. Verdugo. WINE 2024. [Arxiv]
• The Competition Complexity of Prophet Inequalities. J. Brustle, J. Correa,  P. Dütting, T. Ezra, M. Feldman, V. Verdugo. EC 2024. [Arxiv] [EC]  
• Monotone Randomized Apportionment.  J. Correa,  P. Gölz, U. Schmidt-Kraepelin, J. Tucker-Foltz, V. Verdugo. EC 2024. [Arxiv] [EC]   
• A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. V. Cohen-Addad, T. Mömke, V. Verdugo. IPCO 2022. [MathProg]   [Arxiv] 
• The Competition Complexity of Dynamic Pricing. J. Brustle, J. Correa, P. Dütting, V. Verdugo. EC 2022. [MathOR] [EC]  
• Multidimensional Political Apportionment. J. Cembrano, J. Correa, V. Verdugo. EC 2021. [PNAS] [SSRN] [EC]      
• Approximation Schemes for Packing Problems with Lp-norm Diversity Constraints. W. Gálvez, V. Verdugo. LATIN 2022. [PDF] 
• Preserving Diversity when Partitioning: A Geometric Approach. S. Pérez-Salazar, A. Torrico, V. Verdugo. EAAMO 2021 [Arxiv] 
• Proportional Apportionment: A Case Study From the Chilean Constitutional Convention. J. Cembrano, J. Correa, G. Díaz, V. Verdugo. EAAMO 2021 [Arxiv] [EAAMO]
• Optimal Revenue Guarantees for Pricing in Large Markets. J. Correa, D. Pizarro, V. Verdugo.  SAGT 2021 [SAGT]  
• Strong Algorithms for the Ordinal Matroid Secretary Problem. J. Soto, A. Turkieltaub, V. Verdugo.  SODA 2018. [MathOR] [Arxiv] [SODA] 
• Breaking Symmetries to Rescue Sum of Squares in the Case of Makespan Scheduling. V. Verdugo, J. Verschae, A. Wiese. IPCO 2019. [MathProg] [Arxiv] [IPCO] 
• Skyline Computation Under Noisy Comparisons. B. Groz, C. Mathieu, F. Mallmann-Trenn, V. Verdugo. IWOCA 2020 [Arxiv] [IWOCA] 
• Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines.  A. Kurpisz, M. Mastrolilli, C. Mathieu, T. Mömke, A. Wiese, V. Verdugo. IPCO 2016. [MathProg] [IPCO] 
• A Scheduling Model Inspired by Control Theory. S. Baruah, V. Bonifaci, A. Marchetti-Spaccamela, V. Verdugo. RTNS 2017 [RTNS] 
• How Large is Your Graph? V. Kanade, F. Mallmann-Trenn, V. Verdugo. DISC 2017, PODC 2017 (brief announcement) [Arxiv] [DISC] [PODC]          
• Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines. J. Correa, A. Marchetti-Spaccamela, J. Matuschke, L. Stougie, O. Svensson, J. Verschae, V. Verdugo. IPCO 2014 [IPCO] [MathProg] 

Theses