Director of research Team : RO Sorbonne Université - LIP6 Boîte courrier 169 Couloir 26-00, Étage 4, Bureau 417 4 place Jussieu 75252 PARIS CEDEX 05 FRANCE Tel: +33 1 44 27 87 39 https://webia.lip6.fr/~durrc/
Three past PhD students (2014 - 2022) at Sorbonne University
2022
SAULPIC David : Algorithmes d'Approximation et Sketches Pour les Problèmes de Clustering.
2020
JIN Shendan : Algorithmes en ligne avec re-optimisation.
2014
VÁSQUEZ PÉREZ Óscar Carlos : Minimisation de l'énergie et conception d'algorithmes avec une approche théorie des jeux.
Two past Postdoc (2014 - 2022) at Sorbonne University
S. Angelopoulos, Ch. Dürr, Sh. Jin, Sh. Kamali, M. Renault : “Online Computation with Untrusted Advice”, Journal of Computer and System Sciences, vol. 144, pp. 103545, (Elsevier) (2024)
S. Angelopoulos, Ch. Dürr, A. Elenter, G. Melidi : “Scenario-Based Robust Optimization of Tree Structures”, 39th Annual AAAI Conference on Artificial Intelligence (AAAI-25), Philadelphia (PA), United States (2024)
S. Angelopoulos, M. Bienkowski, Ch. Dürr, B. Simon : “Contract Scheduling with Distributional and Multiple Advice”, Proceedings of the 33rd International Joint Conference in Artificial Intelligence (IJCAI-24), Jeju Island, Korea, Republic of (2024)
F. Dufossé, Ch. Dürr, N. Nadal, D. Trystram, Ó. Vásquez : “Scheduling with a processing time oracle”, Applied Mathematical Modelling, vol. 104, pp. 701-720, (Elsevier) (2022)
2021
E. Bampis, Ch. Dürr, Th. Erlebach, M. Santos De Lima, N. Megow, J. Schlöter : “Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty”, 29th Annual European Symposium on Algorithms (ESA 2021), vol. 204, Leibniz International Proceedings in Informatics (LIPIcs), Lisboa, Portugal, pp. 10:1-10:18, (Schloss Dagstuhl -- Leibniz-Zentrum für Informatik) (2021)
M. Bienkowski, M. Böhm, J. Byrka, M. Chrobak, Ch. Dürr, L. Folwarczný, Ł. Jeż, J. Sgall, N. Thang, P. Veselý : “New results on multi-level aggregation”, Theoretical Computer Science, vol. 861, pp. 133-143, (Elsevier) (2021)
Ch. Dürr, K. Nguyen, A. Srivastav, L. Tible : “Non-monotone DR-submodular Maximization over General Convex Sets”, Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}, Yokohama, Japan, pp. 2148-2154, (International Joint Conferences on Artificial Intelligence Organization) (2021)
2020
S. Angelopoulos, Ch. Dürr, Sh. Jin : “Online maximum matching with recourse”, Journal of Combinatorial Optimization, vol. 40 (4), pp. 974-1007, (Springer Verlag) (2020)
M. Chrobak, Ch. Dürr, A. Fabijan, B. Nilsson : “Online Clique Clustering”, Algorithmica, vol. 82 (4), pp. 938-965, (Springer Verlag) (2020)
M. Bienkowski, M. Böhm, J. Byrka, M. Chrobak, Ch. Dürr, L. Folwarczný, T. Jez, J. Sgall, K. Nguyen, P. Veselý : “Online algorithms for multilevel aggregation”, Operations Research, vol. 68 (1), pp. 214-232, (INFORMS) (2020)
S. Angelopoulos, Ch. Dürr, Sh. Kamali, Sh. Jin, M. Renault : “Online Computation with Untrusted Advice”, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), vol. 151, Leibniz International Proceedings in Informatics (LIPIcs), Seattle, United States, pp. 52:1-52:15, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) (2020)
S. Angelopoulos, Ch. Dürr, Th. Lidbetter : “The expanding search ratio of a graph”, Discrete Applied Mathematics, vol. 260, pp. 51-65, (Elsevier) (2019)
S. Angelopoulos, Ch. Dürr, Sh. Jin : “Best-Of-Two-Worlds Analysis of Online Search”, 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), vol. 126, Leibniz International Proceedings in Informatics (LIPIcs), Berlin, Germany, pp. 7:1-7:17, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) (2019)
2018
S. Angelopoulos, Ch. Dürr, Sh. Kamali, M. Renault, A. Rosén : “Online Bin Packing with Advice of Small Size”, Theory of Computing Systems, vol. 62 (8), pp. 2006-2034, (Springer Verlag) (2018)
S. Angelopoulos, Ch. Dürr, Sh. Jin : “Online Maximum Matching with Recourse”, 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), vol. 117, Leibniz International Proceedings in Informatics (LIPIcs), Liverpool, United Kingdom, pp. 8:1-8:15 (2018)
Ch. Dürr, J.‑J. Vie : “高效算法”, (ISBN: 9787115480859) (2018)
Ch. Dürr, Th. Erlebach, N. Megow, J. Meissner : “Scheduling with Explorable Uncertainty”, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), vol. 94, Leibniz International Proceedings in Informatics (LIPIcs), Cambridge, United States, pp. 30:1-30:14, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) (2018)
Ch. Dürr, Th. Erlebach, N. Megow, M. Julie : “An Adversarial Model for Scheduling with Testing”, Proceedings of the 13th Workshop on Models and Algorithms for Planning and Scheduling Problems, Seeon, Germany, pp. 68-70 (2017)
Ch. Dürr, Z. Hanzalek, Ch. Konrad, Y. Seddik, R. Sitters, O. Vasquez Perez, Gerhard J. Woeginger : “The triangle scheduling problem”, Journal of Scheduling, (Springer Verlag) (2017)
M. Bienkowski, M. Böhm, J. Byrka, M. Chrobak, Ch. Dürr, L. Folwarczný, Ł. Jeż, J. Sgall, K. Nguyen, P. Veselý : “Online Algorithms for Multi-Level Aggregation”, Proc. of the 24th European Symposium on Algorithms (ESA), Aarhus, Denmark (2016)
S. Angelopoulos, Ch. Dürr, Th. Lidbetter : “The expanding search ratio of a graph”, Proc. of the 33rd Symposium on Theoretical Aspects of Computer Science (STACS), vol. 47, Leibniz International Proceedings in Informatics (LIPIcs), Orléans, France, pp. 4:1-9:14, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) (2016)
S. Angelopoulos, Ch. Dürr, Sh. Kamali, M. Renault, A. Rosén : “Online Bin Packing with Advice of Small Size”, Algorithms and Data Structures, vol. 9214, Lecture Notes in Computer Science, Victoria, Canada, pp. 40-53, (Springer) (2015)
Ch. Dürr, W. Thomas : “STACS 2012 Special Issue”, Symposium on Theoretical Aspects of Computer Science (STACS), vol. 55 (4), Theory of Computing Systems, Paris, France, (Springer) (2014)
Ch. Dürr : “Tutoriel : Gestion de tampon en ligne”, ROADEF - 15e congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Bordeaux, France (2014)
M. Bienkowski, M. Chrobak, Ch. Dürr, M. Hurand, A. Jeż, Ł. Jeż, G. Stachowiak : “Collecting Weighted Items from a Dynamic Queue”, Algorithmica, vol. 65 (1), pp. 60-94, (Springer Verlag) (2013)
M. Chrobak, Ch. Dürr, F. Guíñez, A. Lozano, N. Thang : “Tile Packing Tomography is {NP}-hard”, Algorithmica, vol. 64 (2), pp. 267-278, (Springer Verlag) (2012)
Ch. Dürr, M. Queyranne, Frits C. R. Spieksma, F. Nobibon, Gerhard J. Woeginger : “The interval ordering problem”, Discrete Applied Mathematics, vol. 160 (7-8), pp. 1094-1103, (Elsevier) (2012)