José Verschae

Orcid: 0000-0002-2049-6467

According to our database1, José Verschae authored at least 37 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Equilibrium Dynamics in Market Games with Exchangeable and Divisible Resources.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
On the geometry of symmetry breaking inequalities.
Math. Program., February, 2023

Optimizing Low Dimensional Functions over the Integers.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022
A Water-Filling Primal-Dual Algorithm for Approximating NonLinear Covering Problems.
SIAM J. Discret. Math., December, 2022

Tight running times for minimum <italic>ℓ<sub>q</sub></italic>-norm load balancing: beyond exponential dependencies on 1/<italic>∊</italic>.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

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

Tight running times for minimum 𝓁<sub>p</sub>-norm load balancing: beyond exponential dependencies on 1/ε.
CoRR, 2021

Optimal algorithms for scheduling under time-of-use tariffs.
Ann. Oper. Res., 2021

2020
Symmetry Exploitation for Online Machine Covering with Bounded Migration.
ACM Trans. Algorithms, 2020

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

Closing the Gap for Makespan Scheduling via Sparsification Techniques.
Math. Oper. Res., 2020

A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

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

Maintaining Perfect Matchings at Low Cost.
Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018
Dual Techniques for Scheduling on a Machine with Varying Speed.
SIAM J. Discret. Math., 2018

The Online Set Aggregation Problem.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

A Local-Search Algorithm for Steiner Forest.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017
A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems.
SIAM J. Discret. Math., 2017

The Primal-Dual Greedy Algorithm for Weighted Covering Problems.
CoRR, 2017

Primal-Dual Algorithms for Precedence Constrained Covering Problems.
Algorithmica, 2017

A QPTAS for the General Scheduling Problem with Identical Release Dates.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Robust Scheduling Algorithms.
Encyclopedia of Algorithms, 2016

The Power of Recourse for Online MST and TSP.
SIAM J. Comput., 2016

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

Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures.
Math. Oper. Res., 2016

Min-Sum Scheduling Under Precedence Constraints.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

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

Optimal Algorithms and a PTAS for Cost-Aware Scheduling.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

2014
On the configuration-LP for scheduling on unrelated machines.
J. Sched., 2014

2013
How to Pack Your Items When You Have to Buy Your Knapsack.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2012
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders.
Math. Oper. Res., 2012

Scheduling on a machine with varying speed: Minimizing cost and energy via dual schedules
CoRR, 2012

2011
Real-time Avionics Optimization.
it Inf. Technol., 2011

2010
A Robust PTAS for Machine Covering and Packing.
Proceedings of the Algorithms, 2010

Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods.
Proceedings of the Algorithms, 2010

Scheduling periodic tasks in a hard real-time environment.
Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

2009
A Robust PTAS for the Parallel Machine Covering Problem.
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009


  Loading...