See also my dbpl or google scholar page.

JOURNALS

Accepted

• Identifying outbreaks in sewer networks: An adaptive sampling scheme under network’s uncertainty. Proceedings of the National Academy of Science (PNAS). 121(14):e2316616121. With J Baboun, I Beaudry, L Castro, F Gutierrez, A Jara, and B Rubio (2024). [pnas][pdf]

• On the Geometry of Symmetry Breaking Inequalities. Mathematical Programming. 197(2): 693-719.  With M. Villagra and L.  von Niederhäusern (2023). (Preeliminary version in IPCO '21) [arxiv][SpringerShareIT] 

• A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems. SIAM Journal on Discrete Mathematics. DOI: 10.1137/21M1459964. With A. Fielbaum and I. Morales (2022).  (Preeliminary version in ICALP 2020) [sidma][pdf]

• Optimal algorithms for scheduling under time-of-use tariffs. Annals of Operations Research. DOI: 10.1007/s10479-021-04059-3. With L. Chen, N. Megow, R. Rischke and L. Stougie (2021). [pdf][anor]

• Symmetry Exploitation for Online Machine Covering with Bounded Migration. ACM Transactions on Algorithms. Vol 16, Article 43. With W. Galvez and J. Soto (2020). (Preeliminary version in ESA '18) [arxiv][talg]

• Breaking symmetries to rescue SoS: The case of makespan scheduling. Mathematical Programming. 183: 583-618. With V. Verdugo and A. Wiese (2020). (Preeliminary version in IPCO '19) [arxiv][SpringerSharedIT]

• Closing the Gap for Makespan Scheduling via Sparsification Techniques. Mathematics of Operations Research. 45:1193-1620. With K-M. Klein, K. Jansen (2020). (Preeliminary version in ICALP '16) [arxiv][mor]

• Dual techniques for scheduling on a machine with varying speed. SIAM Journal on Discrete Mathematics. 32:1541-1571. With N. Megow (2018). (Preeliminary version in ICALP '13) [pdf][sidma]

• A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling Problems. SIAM Journal on Discrete Mathematics. 31:825–838. With M. Cheung, J. Mestre, and D. B. Shmoys (2017). [pdf][sidma]

• Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures. Mathematics of Operations Research, 41:991–1021. With M. Skutella (2016). (Preeliminary version in ESA '10) [mor]

• The Power of Recourse for Online MST and TSP.  SIAM Journal on Computing. 45:859-880. With N. Megow, M. Skutella, and A. Wiese (2016). (Preeliminary version in ICALP '12) [pdf]

• Splitting versus setup trade-offs for scheduling to minimize weighted completion time. Operations Research Letters. 44:469–473. With J. Correa and V. Verdugo (2016). [pdf]

• Primal-Dual Algorithms for Precedence Constrained Covering Problems. Algorithmica. 78:771-787. With S. T. McCormick, B. Peis, and A. Wierz (2016). [pdf]

• Strong LP formulations for scheduling splittable jobs on unrelated machines. Mathematical Programming - Series B, 154:305–328. With J. R. Correa, A. Marchetti-Spaccamela, J. Matuschke, O. Svensson, L. Stougie, and V. Verdugo (2015). (Preeliminary version in IPCO '14) [pdf]

• On the configuration-LP for scheduling on unrelated machines. Journal of Scheduling, 7:371–383. With A Wiese (2014). (Preeliminary version in ESA '11) [pdf]

• The power of preemption on unrelated machines and applications to scheduling orders. Mathematics of Operations Research, 37:379–398. With J. R. Correa and M. Skutella (2012). (Preeliminary version in APPROX '09)

CONFERENCE PROCEEDINGS

• Equilibrium Dynamics in Market Games with Exchangeable and Divisible Resources. ACM-SIAM Symposium on Algorithms (SODA 2024), to appear. With J. Correa, T. Harks, and A. Schedel.

• Optimizing Low Dimensional Functions over the Integers. Conference on Integer Programming and Combinatorial Optimization (IPCO 2023), 115–126. With D. Dadush, A. Léonard, and L. Rohwedder.

• Tight running times for minimum l_q-norm load balancing: beyond exponential dependencies on 1/\epsilon. Symposium on Discrete Algorithms (SODA 2022), 275–315. With Lin Chen and Liangde Tao. [arxiv][soda]

• On the geometry of symmetry breaking inequalities. Integer Programming and Combinatorial Optimization (IPCO 2021), 73–88. With M. Villagra and L.  von Niederhäusern. [pdf] [arxiv]

• A Water-Filling Primal-Dual Algorithm for Approximating Non-Linear Covering Problems. Automata, Languages and Programming (ICALP 2020), 46:1--46:15. With A. Fielbaum and I. Morales. [drops]

• Maintaining Perfect Matchings at Low Cost. Automata, Languages and Programming (ICALP 2019), 82:1–82:14. With J. Matuschke and U. Schmidt-Kraepelin. [doi] [pdf]

• Breaking symmetries to rescue SoS: The case of makespan scheduling. Integer Programming and Combinatorial Optimization (IPCO 2019). 427-441. With V. Verdugo. 

• A Local-Search Algorithm for Steiner Forest. ITCS 2018. 31:1-31:17. With M. Groß, A. Gupta, A. Kumar, J. Matuschke, D. R. Schmidt, M. Schmidt.

• Symmetry exploitation for Online Machine Covering with Bounded Migration. ESA 2018, 32:1-32:14. With W. Galvez, J. Soto.

• The Online Set Aggregation Problem. LATIN 2018. LNCS 10807, 245-259. With R. Carrasco, K. Pruhs, C. Stein. 

• A QPTAS for the general scheduling problem with identical release dates. The 44rd International Colloquium on Automata, Languages and Programming (ICALP 2017). 31:1--31:14, With A. Antoniadis, R. Hoeksma, J. Meissner, and A. Wiese. [pdf]

• Min-sum scheduling under precedence constraints. Algorithms - Proceedings of the 24th Annual European Symposium (ESA 2016). 74:1-74:13. With A. Schulz. [pdf]

• Closing the Gap for Makespan Scheduling via Sparsification Techniques. The 43rd International Colloquium on Automata, Languages and Programming (ICALP 2016). 72:1-72:13. With K. Jansen and K.-M. Klein. [pdf] [arxiv version]

• Optimal Algorithms and a PTAS for Cost-Aware Scheduling. Mathematical Foundations of Computer Science (MFCS 2015), 211-222. With L. Chen, N. Megow, R. Rischke, L. Stougie. (2015).

• Strong LP formulations for scheduling splittable jobs on unrelated machines. Integer Programming and Combinatorial Optimization (IPCO 2014), 249-260. With J. R. Correa, A. Marchetti-Spaccamela, J. Matuschke, O. Svensson, L. Stougie, and V. Verdugo (2014). [pdf]

• Dual techniques for scheduling on a machine with varying speed. Automata, Languages and Programming (ICALP 2013). Springer, 745–786. With N. Megow (2013). [pdf] [arxiv version]

• How to pack your items when you have to buy your knapsack. Mathematical Foundations of Computer Science (MFCS 2013). Springer, 62–73. With A. Antoniadis, C.-C. Huang, and S. Ott (2013). [pdf]

• The power of recourse for online MST and TSP. Automata, Languages and Programming (ICALP 2012). Springer, 689–700. With N. Megow, M. Skutella, and A. Wiese (2012). [pdf] 

• On the configuration-LP for scheduling on unrelated machines. Algorithms - ESA '11,  530-542. With A. Wiese (2011). [pdf]

• Scheduling periodic tasks in a hard real-time environment. Automata, Languages and Programming (ICALP 2010). Springer, 299–311. With F. Eisenbrand, N. Hähnle, M. Niemeier, M. Skutella,  and A. Wiese (2010). [pdf]

• Solving an avionics real-time scheduling problem by advanced IP-methods. Algorithms – ESA '10. Springer, 11–22. With F. Eisenbrand, K. Kesavan, R. S. Mattikalli, M. Niemeier, A. W. Nordsieck, M. Skutella, and A. Wiese (2010). [pdf]

• A robust PTAS for machine covering and packing. Algorithms – ESA '10. Springer, 36–47. Joint with M. Skutella (2010). [pdf]

• The power of preemption on unrelated machines and applications to scheduling orders.  APPROX-RANDOM '09, 84-97. With J. R. Correa and M. Skutella (2009). [pdf]

Others

Dissemination Articles

Real-time Avionics Optimization. it - Information Technology 53:274--279. With F. Eisenbrand, M. Niemeier, M. Skutella, and A. Wiese (2011).

Thesis

The power of recourse in online optimization: Robust solutions for scheduling, matroid and MST problems. Phd thesis, TU Berlin (2012). Advisor: M. Skutella. 

Preprints

Short note on scheduling on a single machine with one non-availability period. Matheon Preprint, 2008. With N. Megow. [pdf]