Christoph Dürr

Publications

Article dans une revue (36)

Online Computation with Untrusted Advice Spyros Angelopoulos,Christoph Dürr,Shendan Jin,Shahin Kamali,Marc Renault Journal of Computer and System Sciences, 2024, 144, pp.103545. ⟨10.1016/j.jcss.2024.103545⟩ Article dans une revue hal-04549692v1
Best-of-both-Worlds Analysis of Online Search Spyros Angelopoulos,Christoph Dürr,Shendan Jin Algorithmica, 2023, ⟨10.1007/s00453-023-01165-5⟩ Article dans une revue hal-04248729v1
Scheduling with a processing time oracle Fanny Dufossé,Christoph Dürr,Noël Nadal,Denis Trystram,Óscar Vásquez Applied Mathematical Modelling, 2022, 104, pp.701-720. ⟨10.1016/j.apm.2021.12.020⟩ Article dans une revue hal-03523262v1
Evaluation des variétés nouvelles pour un usage en interculture : identification et choix des indicateurs, des méthodes transférables et des outils expérimentaux adaptés aux cultures intermédiaires. Leclercq Denis,Patrick Bagot,Pierre Bourdon,Romain Crignon,Christoph Dürret al. Innovations Agronomiques, 2021, 84, pp.203-216. ⟨10.15454/pbx3-tv87⟩ Article dans une revue hal-03641609v1
New results on multi-level aggregation Marcin Bienkowski,Martin Böhm,Jaroslaw Byrka,Marek Chrobak,Christoph Dürret al. Theoretical Computer Science, 2021, 861, pp.133-143. ⟨10.1016/j.tcs.2021.02.016⟩ Article dans une revue hal-03377715v1
Randomized Two-Valued Bounded Delay Online Buffer Management Christoph Dürr,Shahin Kamali Operations Research Letters, 2021, 49 (2), pp.246-249. ⟨10.1016/j.orl.2021.01.010⟩ Article dans une revue hal-02558500v2
An Adversarial Model for Scheduling with Testing Christoph Dürr,Thomas Erlebach,Nicole Megow,Julie Meissner Algorithmica, 2020, ⟨10.1007/s00453-020-00742-2⟩ Article dans une revue hal-02980512v1
Online maximum matching with recourse Spyros Angelopoulos,Christoph Dürr,Shendan Jin Journal of Combinatorial Optimization, 2020, 40 (4), pp.974-1007. ⟨10.1007/s10878-020-00641-w⟩ Article dans une revue hal-02986679v1
Online algorithms for multilevel aggregation Marcin Bienkowski,Martin Böhm,Jaroslaw Byrka,Marek Chrobak,Christoph Dürret al. Operations Research, 2020, 68 (1), pp.214--232. ⟨10.1287/opre.2019.1847⟩ Article dans une revue hal-02682005v1
Online Clique Clustering Marek Chrobak,Christoph Dürr,Aleksander Fabijan,Bengt Nilsson Algorithmica, 2020, 82 (4), pp.938-965. ⟨10.1007/s00453-019-00625-1⟩ Article dans une revue hal-02980446v1
The expanding search ratio of a graph Spyros Angelopoulos,Christoph Dürr,Thomas Lidbetter Discrete Applied Mathematics, 2019, 260, pp.51-65. ⟨10.1016/j.dam.2019.01.039⟩ Article dans une revue hal-02163336v1
Online Bin Packing with Advice of Small Size Spyros Angelopoulos,Christoph Dürr,Shahin Kamali,Marc Renault,Adi Rosén Theory of Computing Systems, 2018, 62 (8), pp.2006-2034. ⟨10.1007/s00224-018-9862-5⟩ Article dans une revue hal-02074062v1
Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling Christoph Dürr,Łukasz Jeż,Óscar Vásquez Theoretical Computer Science, 2017, 695, pp.28-41. ⟨10.1016/j.tcs.2017.07.020⟩ Article dans une revue hal-02074089v1
The triangle scheduling problem Christoph Dürr,Zdenek Hanzalek,Christian Konrad,Yasmina Seddik,René Sitterset al. Journal of Scheduling, 2017, ⟨10.1007/s10951-017-0533-1⟩ Article dans une revue hal-01524866v1
The local–global conjecture for scheduling with non-linear cost Nikhil Bansal,Christoph Dürr,Nguyen kim Thang,Óscar Carlos Vásquez Pérez Journal of Scheduling, 2017, 20 (3), pp.239--254. ⟨10.1007/s10951-015-0466-5⟩ Article dans une revue hal-01259845v1
Infinite linear programming and online searching with turn cost Spyros Angelopoulos,Diogo Arsénio,Christoph Dürr Theoretical Computer Science, 2017, ⟨10.1016/j.tcs.2017.01.013⟩ Article dans une revue hal-01452876v1
Multi-processor Search and Scheduling Problems with Setup Cost Spyros Angelopoulos,Diogo Arsenio,Christoph Dürr,Alejandro López-Ortiz Theory of Computing Systems, 2016, ⟨10.1007/s00224-016-9691-3⟩ Article dans une revue hal-01362937v1
Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption Christoph Dürr,Łukasz Jeż,Óscar Carlos Vásquez Pérez Discrete Applied Mathematics, 2015, 196, pp.20-27. ⟨10.1016/j.dam.2014.08.001⟩ Article dans une revue hal-01185108v1
A Note on NP-Hardness of Preemptive Mean Flow-Time Scheduling for Parallel Machines Odile Bellenguez-Morineau,Marek Chrobak,Christoph Dürr,Damien Prot Journal of Scheduling, 2015, 18 (3), pp.299-304. ⟨10.1007/s10951-014-0380-2⟩ Article dans une revue hal-01154423v1
A $\Phi$-Competitive Algorithm for Collecting Items with Increasing Weights from a Dynamic Queue Marcin Bienkowski,Marek Chrobak,Christoph Dürr,Mathilde Hurand,Artur Jeżet al. Theoretical Computer Science, 2013, 475, pp.92-102. ⟨10.1016/j.tcs.2012.12.046⟩ Article dans une revue hal-01185279v1
Collecting Weighted Items from a Dynamic Queue Marcin Bienkowski,Marek Chrobak,Christoph Dürr,Mathilde Hurand,Artur Jeżet al. Algorithmica, 2013, 65 (1), pp.60-94. ⟨10.1007/s00453-011-9574-6⟩ Article dans une revue hal-01185281v1
Speed scaling with power down scheduling for agreeable deadlines Evripidis Bampis,Christoph Dürr,Fadi Kacem,Ioannis Z. Milis Sustainable Computing : Informatics and Systems, 2012, 2 (4), pp.184--189. ⟨10.1016/j.suscom.2012.10.003⟩ Article dans une revue hal-00868700v1
The interval ordering problem Christoph Dürr,Maurice Queyranne,Frits C. R. Spieksma,Fabrice Talla Nobibon,Gerhard J. Woeginger Discrete Applied Mathematics, 2012, 160 (7-8), pp.1094-1103. ⟨10.1016/j.dam.2011.12.020⟩ Article dans une revue hal-01185265v1
Tile Packing Tomography is {NP}-hard Marek Chrobak,Christoph Dürr,Flavio Guíñez,Antoni Lozano,Nguyen Kim Thang Algorithmica, 2012, 64 (2), pp.267-278. ⟨10.1007/s00453-011-9498-1⟩ Article dans une revue hal-01185268v1
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography Christoph Dürr,Flavio Guíñez,Martín Matamala SIAM Journal on Discrete Mathematics, 2012, 26 (1), pp.330-352. ⟨10.1137/100799733⟩ Article dans une revue hal-01185264v1
Online Scheduling of Bounded Length Jobs to Maximize Throughput Christoph Dürr,Łukasz Jeż,Nguyen Kim Thang Journal of Scheduling, 2012, 15 (5), pp.653-664. ⟨10.1007/s10951-011-0233-1⟩ Article dans une revue hal-01185266v1
Polynomial Time Algorithms for Minimum Energy Scheduling Philippe Baptiste,Marek Chrobak,Christoph Dürr ACM Transactions on Algorithms, 2012, 8 (3), pp.26. ⟨10.1145/2229163.2229170⟩ Article dans une revue hal-01185275v1
Finding total unimodularity in optimization problems solved by linear programs Christoph Dürr,Mathilde Hurand Algorithmica, 2011, 59 (2), pp.256-268. ⟨10.1007/s00453-009-9310-7⟩ Article dans une revue hal-01185243v1
Non-clairvoyant Scheduling Games Johanne Cohen,Christoph Dürr,Nguyen Kim Thang Theory of Computing Systems, 2011, 49 (1), pp.3-23. ⟨10.1007/s00224-011-9316-9⟩ Article dans une revue hal-01185242v1
Algorithms for temperature-aware task scheduling in microprocessor systems Marek Chrobak,Christoph Dürr,Mathilde Hurand,Julien Robert Sustainable Computing : Informatics and Systems, 2011, 1 (3), pp.241-247. ⟨10.1016/j.suscom.2011.05.009⟩ Article dans une revue hal-01185277v1
Runway scheduling with holding loop Konstantin Artiouchine,Philippe Baptiste,Christoph Dürr European Journal of Operational Research, 2007, European Journal of Operational Research Article dans une revue inria-00123706v1
The Complexity of Mean Flow Time Scheduling Problems with Release Times Philippe Baptiste,Peter Brucker,Marek Chrobak,Christoph Dürr,Svetlana A. Kravchenkoet al. Journal of Scheduling, 2007, 10 (2), pp.139-146. ⟨10.1007/s10951-006-0006-4⟩ Article dans une revue istex inria-00123665v1
Quantum Query Complexity of Some Graph Problems Christoph Dürr,Mark Heiligman,Peter Hoyer,Mehdi Mhalla SIAM Journal on Computing, 2006, 35 (6), pp.1310-1328. ⟨10.1137/050644719⟩ Article dans une revue hal-04647999v1
Quantum query complexity of some graph problems Christoph Dürr,Mark Heiligman,Peter Høyer,Mehdi Mhalla SIAM Journal on Computing, 2006, 35 (6), pp.1310-1328 Article dans une revue inria-00123645v1
Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput Philippe Baptiste,Marek Chrobak,Christoph Dürr,Jawor,Nodari Vakhania Operations Research Letters, 2004, Operations Research Letters, 32 (3), pp.258--264 Article dans une revue inria-00124160v1
Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput Philippe Baptiste,Marek Chrobak,Christoph Dürr,Wojciech Jawor,Nodari Vakhania Operations Research Letters, 2004, 32,No.3, pp.258-264 Article dans une revue hal-00012905v1

Communication dans un congrès (30)

Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms Spyros Angelopoulos,Christoph Dürr,Georgii Melidi The 14th International Conference on Learning Representations (ICLR), Apr 2026, Rio De Janeiro, Brazil Communication dans un congrès hal-05267722v1
Randomized Binary and Tree Search Under Pressure Agustín Caracci,Christoph Dürr,José Verschae 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), Jul 2025, Aarhus (Denmark), Denmark. pp.1-19, ⟨10.4230/LIPIcs.ICALP.2025.41⟩ Communication dans un congrès hal-05184552v1
Cascading CMA-ES Instances for Generating Input-diverse Solution Batches Maria Laura Santoni,Christoph Dürr,Carola Doerr,Mike Preuss,Elena Raponi Proc. of the Genetic and Evolutionary Computation Conference (GECCO, Companion material, BBOB workshop), ACM, Jul 2025, Malaga, Spain. ⟨10.1145/3712255.3734304⟩ Communication dans un congrès hal-05171403v1
Contract Scheduling with Distributional and Multiple Advice Spyros Angelopoulos,Marcin Bienkowski,Christoph Dürr,Bertrand Simon The 33rd International Joint Conference in Artificial Intelligence (IJCAI-24), Aug 2024, Jeju Island, South Korea. pp.3652-3660, ⟨10.24963/ijcai.2024/404⟩ Communication dans un congrès hal-04550239v1
Scenario-Based Robust Optimization of Tree Structures Spyros Angelopoulos,Christoph Dürr,Alex Elenter,Georgii Melidi 39th Annual AAAI Conference on Artificial Intelligence (AAAI-25), Feb 2025, Philadelphia (PA), United States. ⟨10.1609/aaai.v39i25.34894⟩ Communication dans un congrès hal-04682036v1
Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms Alex Elenter,Spyros Angelopoulos,Christoph Dürr,Yanni Lefki 38th Conference on Neural Information Processing Systems, (NeurIPS 2024), Dec 2024, Vancouver, BC, Canada Communication dans un congrès hal-04682030v1
Non-monotone DR-submodular Maximization over General Convex Sets Christoph Dürr,Kim Thang Nguyen,Abhinav Srivastav,Léo Tible Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}, Jan 2021, Yokohama, Japan. pp.2148--2154, ⟨10.24963/ijcai.2020/297⟩ Communication dans un congrès hal-02980471v1
Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty Evripidis Bampis,Christoph Dürr,Thomas Erlebach,Murilo Santos de Lima,Nicole Megowet al. 29th Annual European Symposium on Algorithms (ESA 2021), Sep 2021, Lisboa, Portugal. pp.10:1--10:18, ⟨10.4230/LIPIcs.ESA.2021.10⟩ Communication dans un congrès hal-03377705v1
Online Computation with Untrusted Advice Spyros Angelopoulos,Christoph Dürr,Shahin Kamali,Shendan Jin,Marc Renault 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), Jan 2020, Seattle, United States. pp.52:1--52:15, ⟨10.4230/LIPIcs.ITCS.2020.52⟩ Communication dans un congrès hal-02500370v1
Best-Of-Two-Worlds Analysis of Online Search Spyros Angelopoulos,Christoph Dürr,Shendan Jin 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Mar 2019, Berlin, Germany. pp.7:1--7:17, ⟨10.4230/LIPIcs.STACS.2019.7⟩ Communication dans un congrès hal-02163346v1
Online Maximum Matching with Recourse Spyros Angelopoulos,Christoph Dürr,Shendan Jin 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Aug 2018, Liverpool, United Kingdom. pp.8:1--8:15, ⟨10.4230/LIPIcs.MFCS.2018.8⟩ Communication dans un congrès hal-02986916v1
Scheduling with Explorable Uncertainty Christoph Dürr,Thomas Erlebach,Nicole Megow,Julie Meissner 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), Jan 2018, Cambridge, United States. pp.30:1--30:14, ⟨10.4230/LIPIcs.ITCS.2018.30⟩ Communication dans un congrès hal-02074087v1
An Adversarial Model for Scheduling with Testing Christoph Dürr,Thomas Erlebach,Nicole Megow,Meissner Julie Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), Jun 2017, Seeon, Germany. pp.68--70 Communication dans un congrès hal-01545658v1
Online Algorithms for Multi-Level Aggregation Marcin Bienkowski,Martin Böhm,Jaroslaw Byrka,Marek Chrobak,Christoph Dürret al. The 24th European Symposium on Algorithms (ESA), Aug 2016, Aarhus, Denmark Communication dans un congrès hal-01344102v1
The expanding search ratio of a graph Spyros Angelopoulos,Christoph Dürr,Thomas Lidbetter The 33rd Symposium on Theoretical Aspects of Computer Science (STACS), Nicolas Ollinger and Heribert Vollmer, Feb 2016, Orléans, France. pp.4:1--9:14, ⟨10.4230/LIPIcs.STACS.2016.9⟩ Communication dans un congrès hal-01344126v1
On the Power of Advice and Randomization for Online Bipartite Matching Christoph Dürr,Christian Konrad,Marc Renault The 24th European Symposium on Algorithms (ESA), Aug 2016, Aarhus, Denmark Communication dans un congrès hal-01344050v1
Competitive Strategies for Online Clique Clustering Marek Chrobak,Christoph Dürr,Bengt Nilsson The 9th International Conference on Algorithms and Complexity (CIAC), May 2015, Paris, France. pp.101-113, ⟨10.1007/978-3-319-18173-8_7⟩ Communication dans un congrès hal-01206282v1
Online Bin Packing with Advice of Small Size Spyros Angelopoulos,Christoph Dürr,Shahin Kamali,Marc Renault,Adi Rosén Algorithms and Data Structures, Aug 2015, Victoria, Canada. pp.40-53, ⟨10.1007/978-3-319-21840-3_4⟩ Communication dans un congrès hal-01196948v1
Tutoriel : Gestion de tampon en ligne Christoph Dürr ROADEF - 15ème congrès annuel de la Société française de recherche opérationnelle et d'aide à la décision, Société française de recherche opérationnelle et d'aide à la décision, Feb 2014, Bordeaux, France Communication dans un congrès hal-00946278v1
Order constraints for single machine scheduling with non-linear cost Christoph Dürr,Oscar Carlos Vasquez Perez 16th Workshop on Algorithm Engineering and Experiments (ALENEX 2014), Jan 2014, Portland, United States. pp.98-111, ⟨10.1137/1.9781611973198.10⟩ Communication dans un congrès hal-00908203v1
Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling Christoph Dürr,Łukasz Jeż,Oscar Carlos Vasquez Perez WINE 2013: The 9th Conference on Web and Internet Economics, Dec 2013, Cambridge, MA, United States. pp.134-145, ⟨10.1007/978-3-642-45046-4_12⟩ Communication dans un congrès hal-00907832v1
The Wide Partition Conjecture and the Atom Problem in Discrete Tomography Christoph Dürr,Flavio Guíñez The VII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Apr 2013, Playa del Carmen, Mexico. pp.351-356, ⟨10.1016/j.endm.2013.10.055⟩ Communication dans un congrès hal-01222524v1
Approximating the Throughput by Coolest First Scheduling Christoph Dürr,Ioannis Milis,Julien Robert,Georgios Zois WAOA 2012 - 10th International Workshop on Approximation and Online Algorithms, Sep 2012, Ljubljana, Slovenia. pp.187-200, ⟨10.1007/978-3-642-38016-7_16⟩ Communication dans un congrès istex hal-00841914v1
Smooth inequalities and equilibrium inefficiency in scheduling games Johanne Cohen,Christoph Dürr,Kim Thang Nguyen 8th International Workshop on Internet and Network Economics (WINE 2012), Dec 2012, Liverpool, United Kingdom. pp.350--363, ⟨10.1007/978-3-642-35311-6_26⟩ Communication dans un congrès hal-00820139v1
Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems Christoph Dürr,Marek Chrobak,Mathilde Hurand Algorithmic Aspects in Information and Management,, Jun 2008, China. pp.120-130 Communication dans un congrès hal-00477094v1
Finding total unimodularity in optimization problems solved by linear programs Christoph Dürr,Mathilde Hurand 2006, pp.315-326, ⟨10.1007/11841036_30⟩ Communication dans un congrès hal-00111233v1
Competitive Analysis of Scheduling Algorithms for Aggregated Links Wojciech Jawor,Marek Chrobak,Christoph Dürr Proceedings of Latin American Theoretical INformatics (LATIN), Mar 2006, Valdivia, Chile, pp.617--628 Communication dans un congrès inria-00123683v1
Finding total unimodularity in optimization problems solved by linear programs Christoph Dürr,Mathilde Hurand Proc. of the 14th Annual European Symposium on Algorithms (ESA)},, Sep 2006, Zürich, pp.315-326 Communication dans un congrès inria-00123679v1
Quantum Query Complexity in Computational Geometry Abhinav Bahadur,Christoph Dürr,Raghav Kulkarni,Thibault Lafaye Conference on Quantum Information and Computation IV by The International Society for Optical Engineering (SPIE), 2006, SPIE Communication dans un congrès inria-00123655v1
Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow-Time Philippe Baptiste,Marek Chrobak,Christoph Dürr,Francis Sourd MAPSP 2005 - 7th workshop on Models and Algorithms for Planning and Scheduling Problems, Jun 2005, Siena, Italy. pp.36-38 Communication dans un congrès hal-01416717v1

Ouvrages (4)

Competitive Programming in Python, 128 Algorithms to Develop your Coding Skills Christoph Dürr,Jill-Jênn Vie 2021 Ouvrages hal-03745227v1
書名：培養與鍛鍊程式設計的邏輯腦：程式設計大賽的128個進階技巧(使用Python) Christoph Dürr,Jill-Jênn Vie 2019, 978-986-434-383-6 Ouvrages hal-03377773v1
高效算法 Christoph Dürr,Jill-Jênn Vie 2018, 9787115480859 Ouvrages hal-03377766v1
Programmation efficace Christoph Dürr,Jill-Jênn Vie ellipses, 2016, 9782340-010055 Ouvrages hal-01344395v1

Pré-publication, Document de travail (2)

On price-induced minmax matchings Christoph Dürr,Mathieu Mari,Ulrike Schmidt-Kraepelin 2023 Pré-publication, Document de travail hal-04263984v1
Speed scaling with power down scheduling for agreeable deadlines Evripidis Bampis,Christoph Dürr,Fadi Kacem,Ioannis Milis 2011 Pré-publication, Document de travail hal-02535594v1

HDR (1)

Tomographie discrète, calcul quantique et ordonnancement Christoph Dürr Autre [cs.OH]. Université Paris Sud - Paris XI, 2006 HDR tel-00111205v1