default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVictor Verdugo
Person information
- affiliation: University of O'Higgins, Chile
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Johannes Brustle, José Correa, Paul Duetting
, Victor Verdugo:
The Competition Complexity of Dynamic Pricing. Math. Oper. Res. 49(3): 1986-2008 (2024)- [j10]Claire Mathieu, Victor Verdugo:
Apportionment with parity constraints. Math. Program. 203(1): 135-168 (2024) - [j9]Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo:
A 2-approximation for the bounded treewidth sparsest cut problem in sfFPT Time. Math. Program. 206(1): 479-495 (2024) - [c16]Javier Marinkovic, José A. Soto, Victor Verdugo:
Online Combinatorial Assignment in Independence Systems. IPCO 2024: 294-308 - [i15]Johannes Brustle, José Correa, Paul Dütting, Tomer Ezra, Michal Feldman, Victor Verdugo:
The Competition Complexity of Prophet Inequalities. CoRR abs/2402.11084 (2024) - [i14]José Correa, Paul Gölz, Ulrike Schmidt-Kraepelin, Jamie Tucker-Foltz, Victor Verdugo:
Monotone Randomized Apportionment. CoRR abs/2405.03687 (2024) - [i13]Johannes Brustle, Sebastian Perez-Salazar, Victor Verdugo:
Splitting Guarantees for Prophet Inequalities via Nonlinear Systems. CoRR abs/2406.17767 (2024) - [i12]Sebastian Perez-Salazar, Victor Verdugo:
Optimal Guarantees for Online Selection Over Time. CoRR abs/2408.11224 (2024) - 2023
- [i11]Javier Marinkovic, José A. Soto, Victor Verdugo:
Online Combinatorial Assignment in Independence Systems. CoRR abs/2311.00890 (2023) - 2022
- [c15]Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo:
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. IPCO 2022: 112-125 - [c14]Waldo Gálvez, Víctor Verdugo:
Approximation Schemes for Packing Problems with ℓ p-norm Diversity Constraints. LATIN 2022: 204-221 - [c13]Johannes Brustle, José Correa, Paul Dütting, Victor Verdugo:
The Competition Complexity of Dynamic Pricing. EC 2022: 303-320 - 2021
- [j8]José A. Soto, Abner Turkieltaub, Victor Verdugo:
Strong Algorithms for the Ordinal Matroid Secretary Problem. Math. Oper. Res. 46(2): 642-673 (2021) - [c12]Javier Cembrano, José Correa, Gonzalo Díaz, Victor Verdugo:
Proportional Apportionment: A Case Study From the Chilean Constitutional Convention. EAAMO 2021: 3:1-3:9 - [c11]Sebastian Perez-Salazar, Alfredo Torrico, Victor Verdugo:
Preserving Diversity when Partitioning: A Geometric Approach. EAAMO 2021: 15:1-15:11 - [c10]José Correa, Dana Pizarro, Victor Verdugo:
Optimal Revenue Guarantees for Pricing in Large Markets. SAGT 2021: 221-235 - [c9]Javier Cembrano, José Correa, Victor Verdugo:
Multidimensional Apportionment through Discrepancy Theory. EC 2021: 287-288 - [i10]Sebastian Perez-Salazar, Alfredo Torrico, Victor Verdugo:
Preserving Diversity when Partitioning: A Geometric Approach. CoRR abs/2107.04674 (2021) - [i9]Alejandro Jofré, Angel Pardo, David Salas, Victor Verdugo, José Verschae:
The Convergence Rates of Blockchain Mining Games: A Markovian Approach. CoRR abs/2107.08077 (2021) - [i8]Claire Mathieu, Victor Verdugo:
Apportionment with Parity Constraints. CoRR abs/2108.04137 (2021) - [i7]Vincent Cohen-Addad, Tobias Mömke, Victor Verdugo:
A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time. CoRR abs/2111.06163 (2021) - 2020
- [j7]Victor Verdugo, José Verschae, Andreas Wiese:
Breaking symmetries to rescue sum of squares in the case of makespan scheduling. Math. Program. 183(1): 583-618 (2020) - [j6]Hans Raj Tiwary, Victor Verdugo, Andreas Wiese:
On the extension complexity of scheduling polytopes. Oper. Res. Lett. 48(4): 472-479 (2020) - [c8]Benoît Groz, Frederik Mallmann-Trenn, Claire Mathieu, Victor Verdugo:
Skyline Computation with Noisy Comparisons. IWOCA 2020: 289-303
2010 – 2019
- 2019
- [j5]José Correa, Patricio Foncea, Dana Pizarro, Victor Verdugo:
From pricing to prophets, and back! Oper. Res. Lett. 47(1): 25-29 (2019) - [c7]Victor Verdugo, José Verschae:
Breaking Symmetries to Rescue Sum of Squares: The Case of Makespan Scheduling. IPCO 2019: 427-441 - [i6]Hans Raj Tiwary, Victor Verdugo, Andreas Wiese:
On the extension complexity of scheduling. CoRR abs/1902.10271 (2019) - 2018
- [b1]Victor Verdugo:
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). University of Chile, Santiago, Chile, 2018 - [j4]Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese:
Semidefinite and linear programming integrality gaps for scheduling identical machines. Math. Program. 172(1-2): 231-248 (2018) - [c6]José A. Soto, Abner Turkieltaub, Victor Verdugo:
Strong Algorithms for the Ordinal Matroid Secretary Problem. SODA 2018: 715-734 - [i5]José A. Soto, Abner Turkieltaub, Victor Verdugo:
Strong Algorithms for the Ordinal Matroid Secretary Problem. CoRR abs/1802.01997 (2018) - [i4]Victor Verdugo, José Verschae:
Breaking symmetries to rescue Sum of Squares: The case of makespan scheduling. CoRR abs/1811.08539 (2018) - 2017
- [c5]Varun Kanade, Frederik Mallmann-Trenn, Victor Verdugo:
Brief Announcement: How Large is your Graph? PODC 2017: 195-197 - [c4]Sanjoy K. Baruah, Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Victor Verdugo:
A scheduling model inspired by control theory. RTNS 2017: 78-87 - [c3]Varun Kanade, Frederik Mallmann-Trenn, Victor Verdugo:
How Large Is Your Graph?. DISC 2017: 34:1-34:16 - [i3]Varun Kanade, Frederik Mallmann-Trenn, Victor Verdugo:
How large is your graph? CoRR abs/1702.03959 (2017) - [i2]Frederik Mallmann-Trenn, Claire Mathieu, Victor Verdugo:
Skyline Computation with Noisy Comparisons. CoRR abs/1710.02058 (2017) - 2016
- [j3]José Correa, Victor Verdugo, José Verschae:
Splitting versus setup trade-offs for scheduling to minimize weighted completion time. Oper. Res. Lett. 44(4): 469-473 (2016) - [c2]Adam Kurpisz, Monaldo Mastrolilli, Claire Mathieu, Tobias Mömke, Victor Verdugo, Andreas Wiese:
Semidefinite and Linear Programming Integrality Gaps for Scheduling Identical Machines. IPCO 2016: 152-163 - 2015
- [j2]José Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Víctor Verdugo, José Verschae:
Strong LP formulations for scheduling splittable jobs on unrelated machines. Math. Program. 154(1-2): 305-328 (2015) - [j1]Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Víctor Verdugo, Anke van Zuylen:
Split scheduling with uniform setup times. J. Sched. 18(2): 119-129 (2015) - 2014
- [c1]José R. Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Victor Verdugo, José Verschae:
Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines. IPCO 2014: 249-260 - 2012
- [i1]Frans Schalekamp, René Sitters, Suzanne van der Ster, Leen Stougie, Victor Verdugo, Anke van Zuylen:
Split Scheduling with Uniform Setup Times. CoRR abs/1212.1754 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
