default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosé Verschae
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]José Correa, Tobias Harks, Anja Schedel, José Verschae:
Equilibrium Dynamics in Market Games with Exchangeable and Divisible Resources. SODA 2024: 547-568- [i19]Christoph Dürr, Arturo Merino, José A. Soto, José Verschae:
Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds. CoRR abs/2404.17214 (2024) - [i18]Agustín Caracci, Christoph Dürr, José Verschae:
Randomized Binary and Tree Search under Pressure. CoRR abs/2406.06468 (2024) - 2023
- [j16]José Verschae
, Matías Villagra, Léonard von Niederhäusern:
On the geometry of symmetry breaking inequalities. Math. Program. 197(2): 693-719 (2023) - [c22]Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae:
Optimizing Low Dimensional Functions over the Integers. IPCO 2023: 115-126 - [i17]Daniel Dadush, Arthur Léonard, Lars Rohwedder, José Verschae:
Optimizing Low Dimensional Functions over the Integers. CoRR abs/2303.02474 (2023) - 2022
- [j15]Andrés Fielbaum, Ignacio Morales, José Verschae:
A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems. SIAM J. Discret. Math. 36(4): 2889-2915 (2022) - [c21]Lin Chen, Liangde Tao, José Verschae:
Tight running times for minimum <italic>ℓq</italic>-norm load balancing: beyond exponential dependencies on 1/<italic>∊</italic>. SODA 2022: 275-315 - 2021
- [j14]Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie, José Verschae:
Optimal algorithms for scheduling under time-of-use tariffs. Ann. Oper. Res. 304(1): 85-107 (2021) - [c20]José Verschae, Matías Villagra, Léonard von Niederhäusern:
On the Geometry of Symmetry Breaking Inequalities. IPCO 2021: 73-88 - [i16]Lin Chen, Liangde Tao, José Verschae:
Tight running times for minimum 𝓁p-norm load balancing: beyond exponential dependencies on 1/ε. CoRR abs/2107.06261 (2021) - [i15]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) - 2020
- [j13]Klaus Jansen, Kim-Manuel Klein, José Verschae:
Closing the Gap for Makespan Scheduling via Sparsification Techniques. Math. Oper. Res. 45(4): 1371-1392 (2020) - [j12]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) - [j11]Waldo Gálvez, José A. Soto, José Verschae:
Symmetry Exploitation for Online Machine Covering with Bounded Migration. ACM Trans. Algorithms 16(4): 43:1-43:22 (2020) - [c19]Andrés Fielbaum, Ignacio Morales, José Verschae:
A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems. ICALP 2020: 46:1-46:15 - [i14]José Verschae, Matías Villagra, Léonard von Niederhäusern:
On the geometry of symmetry breaking inequalities. CoRR abs/2011.09641 (2020)
2010 – 2019
- 2019
- [c18]Jannik Matuschke, Ulrike Schmidt-Kraepelin, José Verschae:
Maintaining Perfect Matchings at Low Cost. ICALP 2019: 82:1-82:14 - [c17]Victor Verdugo, José Verschae:
Breaking Symmetries to Rescue Sum of Squares: The Case of Makespan Scheduling. IPCO 2019: 427-441 - [i13]Andrés Fielbaum, Ignacio Morales, José Verschae:
A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems. CoRR abs/1912.12151 (2019) - 2018
- [j10]Nicole Megow, José Verschae:
Dual Techniques for Scheduling on a Machine with Varying Speed. SIAM J. Discret. Math. 32(3): 1541-1571 (2018) - [c16]Waldo Gálvez, José A. Soto, José Verschae:
Symmetry Exploitation for Online Machine Covering with Bounded Migration. ESA 2018: 32:1-32:14 - [c15]Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae:
A Local-Search Algorithm for Steiner Forest. ITCS 2018: 31:1-31:17 - [c14]Rodrigo A. Carrasco, Kirk Pruhs, Cliff Stein, José Verschae:
The Online Set Aggregation Problem. LATIN 2018: 245-259 - [i12]Victor Verdugo, José Verschae:
Breaking symmetries to rescue Sum of Squares: The case of makespan scheduling. CoRR abs/1811.08539 (2018) - [i11]Jannik Matuschke, Ulrike Schmidt-Kraepelin, José Verschae:
Maintaining Perfect Matchings at Low Cost. CoRR abs/1811.10580 (2018) - [i10]Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie, José Verschae:
Optimal Algorithms for Scheduling under Time-of-Use Tariffs. CoRR abs/1811.12657 (2018) - 2017
- [j9]S. Thomas McCormick, Britta Peis, José Verschae, Andreas Wierz:
Primal-Dual Algorithms for Precedence Constrained Covering Problems. Algorithmica 78(3): 771-787 (2017) - [j8]Maurice Cheung, Julián Mestre, David B. Shmoys, José Verschae:
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. SIAM J. Discret. Math. 31(2): 825-838 (2017) - [c13]Antonios Antoniadis, Ruben Hoeksma, Julie Meißner, José Verschae, Andreas Wiese:
A QPTAS for the General Scheduling Problem with Identical Release Dates. ICALP 2017: 31:1-31:14 - [i9]Britta Peis, José Verschae, Andreas Wierz:
The Primal-Dual Greedy Algorithm for Weighted Covering Problems. CoRR abs/1704.08522 (2017) - [i8]Martin Groß, Anupam Gupta, Amit Kumar, Jannik Matuschke, Daniel R. Schmidt, Melanie Schmidt, José Verschae:
A Local-Search Algorithm for Steiner Forest. CoRR abs/1707.02753 (2017) - 2016
- [j7]Martin Skutella, José Verschae:
Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures. Math. Oper. Res. 41(3): 991-1021 (2016) - [j6]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) - [j5]Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese:
The Power of Recourse for Online MST and TSP. SIAM J. Comput. 45(3): 859-880 (2016) - [c12]Andreas S. Schulz, José Verschae:
Min-Sum Scheduling Under Precedence Constraints. ESA 2016: 74:1-74:13 - [c11]Klaus Jansen, Kim-Manuel Klein, José Verschae:
Closing the Gap for Makespan Scheduling via Sparsification Techniques. ICALP 2016: 72:1-72:13 - [r1]José Verschae:
Robust Scheduling Algorithms. Encyclopedia of Algorithms 2016: 1863-1865 - [i7]Klaus Jansen, Kim-Manuel Klein, José Verschae:
Closing the Gap for Makespan Scheduling via Sparsification Techniques. CoRR abs/1604.07153 (2016) - [i6]Waldo Gálvez, José A. Soto, José Verschae:
Symmetry exploitation for Online Machine Covering with Bounded Migration. CoRR abs/1612.01829 (2016) - [i5]Maurice Cheung, Julián Mestre, David B. Shmoys, José Verschae:
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. CoRR abs/1612.03339 (2016) - 2015
- [j4]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) - [c10]Lin Chen, Nicole Megow, Roman Rischke, Leen Stougie, José Verschae:
Optimal Algorithms and a PTAS for Cost-Aware Scheduling. MFCS (2) 2015: 211-222 - 2014
- [j3]José Verschae, Andreas Wiese:
On the configuration-LP for scheduling on unrelated machines. J. Sched. 17(4): 371-383 (2014) - [c9]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 - 2013
- [c8]Nicole Megow, José Verschae:
Dual Techniques for Scheduling on a Machine with Varying Speed. ICALP (1) 2013: 745-756 - [c7]Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott, José Verschae:
How to Pack Your Items When You Have to Buy Your Knapsack. MFCS 2013: 62-73 - 2012
- [j2]José R. Correa, Martin Skutella, José Verschae:
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders. Math. Oper. Res. 37(2): 379-398 (2012) - [c6]Nicole Megow, Martin Skutella, José Verschae, Andreas Wiese:
The Power of Recourse for Online MST and TSP. ICALP (1) 2012: 689-700 - [i4]Nicole Megow, José Verschae:
Scheduling on a machine with varying speed: Minimizing cost and energy via dual schedules. CoRR abs/1211.6216 (2012) - 2011
- [j1]Friedrich Eisenbrand, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese:
Real-time Avionics Optimization. it Inf. Technol. 53(6): 274-279 (2011) - [c5]José Verschae, Andreas Wiese:
On the Configuration-LP for Scheduling on Unrelated Machines. ESA 2011: 530-542 - 2010
- [c4]Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S. Mattikalli, Martin Niemeier, Arnold W. Nordsieck, Martin Skutella, José Verschae, Andreas Wiese:
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods. ESA (1) 2010: 11-22 - [c3]Martin Skutella, José Verschae:
A Robust PTAS for Machine Covering and Packing. ESA (1) 2010: 36-47 - [c2]Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese:
Scheduling Periodic Tasks in a Hard Real-Time Environment. ICALP (1) 2010: 299-311 - [i3]Friedrich Eisenbrand, Nicolai Hähnle, Martin Niemeier, Martin Skutella, José Verschae, Andreas Wiese:
Scheduling periodic tasks in a hard real-time environment. Scheduling 2010 - [i2]José Verschae, Andreas Wiese:
On the Configuration-LP for Scheduling on Unrelated Machines. CoRR abs/1011.4957 (2010)
2000 – 2009
- 2009
- [c1]José R. Correa, Martin Skutella, José Verschae:
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders. APPROX-RANDOM 2009: 84-97 - [i1]Martin Skutella, José Verschae:
A Robust PTAS for the Parallel Machine Covering Problem. Models and Algorithms for Optimization in Logistics 2009
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 2025-01-21 00:01 CET 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:
