Víctor Verdugo

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
The competition complexity of prophet inequalities Mathematics of Operations Research	2026-03-20	Paper
The competition complexity of dynamic pricing Mathematics of Operations Research	2024-11-07	Paper
A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} time Mathematical Programming. Series A. Series B	2024-08-20	Paper
Apportionment with parity constraints Mathematical Programming. Series A. Series B	2024-02-21	Paper
Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints LATIN 2022: Theoretical Informatics	2023-07-26	Paper
How large is your graph?	2023-02-03	Paper
Skyline Computation with Noisy Comparisons Lecture Notes in Computer Science	2022-10-13	Paper
A 2-approximation for the bounded treewidth sparsest cut problem in \textsf{FPT} Time (available as arXiv preprint)	2022-08-16	Paper
Optimal revenue guarantees for pricing in large markets (available as arXiv preprint)	2022-06-01	Paper
Strong algorithms for the ordinal matroid secretary problem Mathematics of Operations Research	2021-07-15	Paper
On the extension complexity of scheduling polytopes Operations Research Letters	2021-04-07	Paper
Breaking symmetries to rescue sum of squares in the case of makespan scheduling Mathematical Programming. Series A. Series B	2020-08-28	Paper
From pricing to prophets, and back! Operations Research Letters	2020-02-10	Paper
Breaking symmetries to rescue sum of squares: the case of makespan scheduling Lecture Notes in Computer Science	2020-02-06	Paper
Semidefinite and linear programming integrality gaps for scheduling identical machines Mathematical Programming. Series A. Series B	2018-10-26	Paper
Strong algorithms for the ordinal matroid secretary problem	2018-03-15	Paper
Strong algorithms for the ordinal matroid secretary problem (available as arXiv preprint)	2018-03-15	Paper
Splitting versus setup trade-offs for scheduling to minimize weighted completion time Operations Research Letters	2018-02-06	Paper
Brief announcement: How large is your graph? Proceedings of the ACM Symposium on Principles of Distributed Computing	2017-10-11	Paper
Semidefinite and linear programming integrality gaps for scheduling identical machines Integer Programming and Combinatorial Optimization	2016-08-10	Paper
Strong LP formulations for scheduling splittable jobs on unrelated machines Mathematical Programming. Series A. Series B	2015-12-09	Paper
Split scheduling with uniform setup times Journal of Scheduling	2015-04-24	Paper
Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines Integer Programming and Combinatorial Optimization	2014-06-02	Paper

Research outcomes over time

This page was built for person: Víctor Verdugo