Victor Verdugo

Orcid: 0000-0003-0817-7356

Affiliations:
  • University of O'Higgins, Chile


According to our database1, Victor Verdugo authored at least 27 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Apportionment with parity constraints.
Math. Program., January, 2024

The Competition Complexity of Prophet Inequalities.
CoRR, 2024

2023
Online Combinatorial Assignment in Independence Systems.
CoRR, 2023

2022
The Competition Complexity of Dynamic Pricing.
Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

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

A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021
Strong Algorithms for the Ordinal Matroid Secretary Problem.
Math. Oper. Res., 2021

The Convergence Rates of Blockchain Mining Games: A Markovian Approach.
CoRR, 2021

Multidimensional Apportionment through Discrepancy Theory.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Optimal Revenue Guarantees for Pricing in Large Markets.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Preserving Diversity when Partitioning: A Geometric Approach.
Proceedings of the EAAMO 2021: ACM Conference on Equity and Access in Algorithms, Mechanisms, and Optimization, Virtual Event, USA, October 5, 2021

Proportional Apportionment: A Case Study From the Chilean Constitutional Convention.
Proceedings of the EAAMO 2021: ACM Conference on Equity and Access in Algorithms, Mechanisms, and Optimization, Virtual Event, USA, October 5, 2021

2020
On the extension complexity of scheduling polytopes.
Oper. Res. Lett., 2020

Breaking symmetries to rescue sum of squares in the case of makespan scheduling.
Math. Program., 2020

Skyline Computation with Noisy Comparisons.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

2019
From pricing to prophets, and back!
Oper. Res. Lett., 2019

On the extension complexity of scheduling.
CoRR, 2019

Breaking Symmetries to Rescue Sum of Squares: The Case of Makespan Scheduling.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

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).
PhD thesis, 2018

Semidefinite and linear programming integrality gaps for scheduling identical machines.
Math. Program., 2018

2017
Skyline Computation with Noisy Comparisons.
CoRR, 2017

How Large Is Your Graph?.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

A scheduling model inspired by control theory.
Proceedings of the 25th International Conference on Real-Time Networks and Systems, 2017

Brief Announcement: How Large is your Graph?
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

2016
Splitting versus setup trade-offs for scheduling to minimize weighted completion time.
Oper. Res. Lett., 2016

2015
Split scheduling with uniform setup times.
J. Sched., 2015

Strong LP formulations for scheduling splittable jobs on unrelated machines.
Math. Program., 2015


  Loading...