Fanny Dufossé, Christoph Dürr, Noël Nadal, Denis Trystram, Óscar Vásquez. Scheduling with a processing time oracle. Applied Mathematical Modelling, Elsevier, 2022, 104, pp.701-720. ⟨10.1016/j.apm.2021.12.020⟩. ⟨hal-03523262⟩

Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, et al.. New results on multi-level aggregation. Theoretical Computer Science, Elsevier, 2021, 861, pp.133-143. ⟨10.1016/j.tcs.2021.02.016⟩. ⟨hal-03377715⟩

Christoph Dürr, Shahin Kamali. Randomized Two-Valued Bounded Delay Online Buffer Management. Operations Research Letters, Elsevier, 2021, 49 (2), pp.246-249. ⟨10.1016/j.orl.2021.01.010⟩. ⟨hal-02558500v2⟩

Marek Chrobak, Christoph Dürr, Aleksander Fabijan, Bengt Nilsson. Online Clique Clustering. Algorithmica, Springer Verlag, 2020, 82 (4), pp.938-965. ⟨10.1007/s00453-019-00625-1⟩. ⟨hal-02980446⟩

Spyros Angelopoulos, Christoph Dürr, Shendan Jin. Online maximum matching with recourse. Journal of Combinatorial Optimization, Springer Verlag, 2020, 40 (4), pp.974-1007. ⟨10.1007/s10878-020-00641-w⟩. ⟨hal-02986679⟩

Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, et al.. Online algorithms for multilevel aggregation. Operations Research, INFORMS, 2020, 68 (1), pp.214--232. ⟨10.1287/opre.2019.1847⟩. ⟨hal-02682005⟩

Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner. An Adversarial Model for Scheduling with Testing. Algorithmica, Springer Verlag, 2020, ⟨10.1007/s00453-020-00742-2⟩. ⟨hal-02980512⟩

Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter. The expanding search ratio of a graph. Discrete Applied Mathematics, Elsevier, 2019, 260, pp.51-65. ⟨10.1016/j.dam.2019.01.039⟩. ⟨hal-02163336⟩

Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc Renault, Adi Rosén. Online Bin Packing with Advice of Small Size. Theory of Computing Systems, Springer Verlag, 2018, 62 (8), pp.2006-2034. ⟨10.1007/s00224-018-9862-5⟩. ⟨hal-02074062⟩

Christoph Dürr, Łukasz Jeż, Óscar Vásquez. Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling. Theoretical Computer Science, Elsevier, 2017, 695, pp.28-41. ⟨10.1016/j.tcs.2017.07.020⟩. ⟨hal-02074089⟩

Spyros Angelopoulos, Diogo Arsénio, Christoph Dürr. Infinite linear programming and online searching with turn cost. Theoretical Computer Science, Elsevier, 2017, ⟨10.1016/j.tcs.2017.01.013⟩. ⟨hal-01452876⟩

Christoph Dürr, Zdenek Hanzalek, Christian Konrad, Yasmina Seddik, René Sitters, et al.. The triangle scheduling problem. Journal of Scheduling, Springer Verlag, 2017, ⟨10.1007/s10951-017-0533-1⟩. ⟨hal-01524866⟩

Nikhil Bansal, Christoph Dürr, Nguyen kim Thang, Óscar Carlos Vásquez Pérez. The local–global conjecture for scheduling with non-linear cost. Journal of Scheduling, Springer Verlag, 2017, 20 (3), pp.239--254. ⟨10.1007/s10951-015-0466-5⟩. ⟨hal-01259845⟩

Spyros Angelopoulos, Diogo Arsenio, Christoph Dürr, Alejandro López-Ortiz. Multi-processor Search and Scheduling Problems with Setup Cost. Theory of Computing Systems, Springer Verlag, 2016, ⟨10.1007/s00224-016-9691-3⟩. ⟨hal-01362937⟩

Odile Bellenguez-Morineau, Marek Chrobak, Christoph Dürr, Damien Prot. A Note on NP-Hardness of Preemptive Mean Flow-Time Scheduling for Parallel Machines. Journal of Scheduling, Springer Verlag, 2015, 18 (3), pp.299-304. ⟨10.1007/s10951-014-0380-2⟩. ⟨hal-01154423⟩

Christoph Dürr, Łukasz Jeż, Óscar Carlos Vásquez Pérez. Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption. Discrete Applied Mathematics, Elsevier, 2015, 196, pp.20-27. ⟨10.1016/j.dam.2014.08.001⟩. ⟨hal-01185108⟩

Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jeż, et al.. Collecting Weighted Items from a Dynamic Queue. Algorithmica, Springer Verlag, 2013, 65 (1), pp.60-94. ⟨10.1007/s00453-011-9574-6⟩. ⟨hal-01185281⟩

Marcin Bienkowski, Marek Chrobak, Christoph Dürr, Mathilde Hurand, Artur Jeż, et al.. A $\Phi$-Competitive Algorithm for Collecting Items with Increasing Weights from a Dynamic Queue. Theoretical Computer Science, Elsevier, 2013, 475, pp.92-102. ⟨10.1016/j.tcs.2012.12.046⟩. ⟨hal-01185279⟩

Philippe Baptiste, Marek Chrobak, Christoph Dürr. Polynomial Time Algorithms for Minimum Energy Scheduling. ACM Transactions on Algorithms, Association for Computing Machinery, 2012, 8 (3), pp.26. ⟨10.1145/2229163.2229170⟩. ⟨hal-01185275⟩

Christoph Dürr, Łukasz Jeż, Nguyen Kim Thang. Online Scheduling of Bounded Length Jobs to Maximize Throughput. Journal of Scheduling, Springer Verlag, 2012, 15 (5), pp.653-664. ⟨10.1007/s10951-011-0233-1⟩. ⟨hal-01185266⟩

Marek Chrobak, Christoph Dürr, Flavio Guíñez, Antoni Lozano, Nguyen Kim Thang. Tile Packing Tomography is {NP}-hard. Algorithmica, Springer Verlag, 2012, 64 (2), pp.267-278. ⟨10.1007/s00453-011-9498-1⟩. ⟨hal-01185268⟩

Evripidis Bampis, Christoph Dürr, Fadi Kacem, Ioannis Z. Milis. Speed scaling with power down scheduling for agreeable deadlines. Sustainable Computing : Informatics and Systems, Elsevier, 2012, 2 (4), pp.184--189. ⟨10.1016/j.suscom.2012.10.003⟩. ⟨hal-00868700⟩

Christoph Dürr, Flavio Guíñez, Martín Matamala. Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography. SIAM Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2012, 26 (1), pp.330-352. ⟨10.1137/100799733⟩. ⟨hal-01185264⟩

Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger. The interval ordering problem. Discrete Applied Mathematics, Elsevier, 2012, 160 (7-8), pp.1094-1103. ⟨10.1016/j.dam.2011.12.020⟩. ⟨hal-01185265⟩

Marek Chrobak, Christoph Dürr, Mathilde Hurand, Julien Robert. Algorithms for temperature-aware task scheduling in microprocessor systems. Sustainable Computing : Informatics and Systems, Elsevier, 2011, 1 (3), pp.241-247. ⟨10.1016/j.suscom.2011.05.009⟩. ⟨hal-01185277⟩

Johanne Cohen, Christoph Dürr, Nguyen Kim Thang. Non-clairvoyant Scheduling Games. Theory of Computing Systems, Springer Verlag, 2011, 49 (1), pp.3-23. ⟨10.1007/s00224-011-9316-9⟩. ⟨hal-01185242⟩

Christoph Dürr, Mathilde Hurand. Finding total unimodularity in optimization problems solved by linear programs. Algorithmica, Springer Verlag, 2011, 59 (2), pp.256-268. ⟨10.1007/s00453-009-9310-7⟩. ⟨hal-01185243⟩

Konstantin Artiouchine, Philippe Baptiste, Christoph Dürr. Runway scheduling with holding loop. European Journal of Operational Research, Elsevier, 2007, European Journal of Operational Research. ⟨inria-00123706⟩

Philippe Baptiste, Peter Brucker, Marek Chrobak, Christoph Dürr, Svetlana Kravchenko, et al.. The Complexity of Mean Flow Time Scheduling Problems with Release Times. Journal of Scheduling, Springer Verlag, 2007, 10 (2), pp.139-146. ⟨10.1007/s10951-006-0006-4⟩. ⟨inria-00123665⟩

Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla. Quantum query complexity of some graph problems. SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2006, 35 (6), pp.1310-1328. ⟨inria-00123645⟩

Philippe Baptiste, Marek Chrobak, Christoph Dürr, Jawor, Nodari Vakhania. Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput. Operations Research Letters, Elsevier, 2004, Operations Research Letters, 32 (3), pp.258--264. ⟨inria-00124160⟩

Philippe Baptiste, Marek Chrobak, Christoph Dürr, Wojciech Jawor, Nodari Vakhania. Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput. Operations Research Letters, Elsevier, 2004, 32,No.3, pp.258-264. ⟨hal-00012905⟩

Christoph Dürr, Kim Thang Nguyen, Abhinav Srivastav, Léo 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 , Jan 2021, Yokohama, Japan. pp.2148--2154, ⟨10.24963/ijcai.2020/297⟩. ⟨hal-02980471⟩

Evripidis Bampis, Christoph Dürr, Thomas Erlebach, Murilo Santos de Lima, Nicole Megow, et al.. Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty. 29th Annual European Symposium on Algorithms (ESA 2021), Sep 2021, Lisboa, Portugal. pp.10:1--10:18, ⟨10.4230/LIPIcs.ESA.2021.10⟩. ⟨hal-03377705⟩

Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Shendan Jin, Marc Renault. Online Computation with Untrusted Advice. 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⟩. ⟨hal-02500370⟩

Spyros Angelopoulos, Christoph Dürr, Shendan Jin. Best-Of-Two-Worlds Analysis of Online Search. 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⟩. ⟨hal-02163346⟩

Christoph Dürr, Thomas Erlebach, Nicole Megow, Julie Meißner. Scheduling with Explorable Uncertainty. 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⟩. ⟨hal-02074087⟩

Spyros Angelopoulos, Christoph Dürr, Shendan Jin. Online Maximum Matching with Recourse. 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⟩. ⟨hal-02986916⟩

Christoph Dürr, Thomas Erlebach, Nicole Megow, Meißner Julie. An Adversarial Model for Scheduling with Testing. Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), Jun 2017, Seeon, Germany. pp.68--70. ⟨hal-01545658⟩

Christoph Dürr, Christian Konrad, Marc Renault. On the Power of Advice and Randomization for Online Bipartite Matching. The 24th European Symposium on Algorithms (ESA), Aug 2016, Aarhus, Denmark. ⟨hal-01344050⟩

Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter. The expanding search ratio of a graph. 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⟩. ⟨hal-01344126⟩

Marcin Bienkowski, Martin Böhm, Jaroslaw Byrka, Marek Chrobak, Christoph Dürr, et al.. Online Algorithms for Multi-Level Aggregation. The 24th European Symposium on Algorithms (ESA), Aug 2016, Aarhus, Denmark. ⟨hal-01344102⟩

Marek Chrobak, Christoph Dürr, Bengt Nilsson. Competitive Strategies for Online Clique Clustering. The 9th International Conference on Algorithms and Complexity (CIAC), May 2015, Paris, France. pp.101-113, ⟨10.1007/978-3-319-18173-8_7⟩. ⟨hal-01206282⟩

Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc Renault, Adi Rosén. Online Bin Packing with Advice of Small Size. Algorithms and Data Structures, Aug 2015, Victoria, Canada. pp.40-53, ⟨10.1007/978-3-319-21840-3_4⟩. ⟨hal-01196948⟩

Christoph Dürr. Tutoriel : Gestion de tampon en ligne. 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. ⟨hal-00946278⟩

Christoph Dürr, Oscar Carlos Vasquez Perez. Order constraints for single machine scheduling with non-linear cost. 16th Workshop on Algorithm Engineering and Experiments (ALENEX 2014), Jan 2014, Portland, United States. pp.98-111, ⟨10.1137/1.9781611973198.10⟩. ⟨hal-00908203⟩

Christoph Dürr, Łukasz Jeż, Oscar Carlos Vasquez Perez. Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling. 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⟩. ⟨hal-00907832⟩

Christoph Dürr, Flavio Guíñez. The Wide Partition Conjecture and the Atom Problem in Discrete Tomography. 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⟩. ⟨hal-01222524⟩

Christoph Dürr, Ioannis Milis, Julien Robert, Georgios Zois. Approximating the Throughput by Coolest First Scheduling. 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⟩. ⟨hal-00841914⟩

Johanne Cohen, Christoph Dürr, Kim Thang Nguyen. Smooth inequalities and equilibrium inefficiency in scheduling games. 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⟩. ⟨hal-00820139⟩

Christoph Dürr, Marek Chrobak, Mathilde Hurand. Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems. Algorithmic Aspects in Information and Management,, Jun 2008, China. pp.120-130. ⟨hal-00477094⟩

Wojciech Jawor, Marek Chrobak, Christoph Dürr. Competitive Analysis of Scheduling Algorithms for Aggregated Links. Proceedings of Latin American Theoretical INformatics (LATIN), Mar 2006, Valdivia, Chile, pp.617--628. ⟨inria-00123683⟩

Christoph Dürr, Mathilde Hurand. Finding total unimodularity in optimization problems solved by linear programs. Proc. of the 14th Annual European Symposium on Algorithms (ESA)},, Sep 2006, Zürich, pp.315-326. ⟨inria-00123679⟩

Abhinav Bahadur, Christoph Dürr, Raghav Kulkarni, Thibault Lafaye. Quantum Query Complexity in Computational Geometry. Conference on Quantum Information and Computation IV by The International Society for Optical Engineering (SPIE), 2006, SPIE. ⟨inria-00123655⟩

Christoph Dürr, Mathilde Hurand. Finding total unimodularity in optimization problems solved by linear programs. 2006, pp.315-326, ⟨10.1007/11841036_30⟩. ⟨hal-00111233⟩

Christoph Dürr, Jill-Jênn Vie. Competitive Programming in Python: 128 Algorithms to Develop your Coding Skills. Cambridge University Press, 2020, 9781108716826. ⟨hal-03377761⟩

Christoph Dürr, Jill-Jênn Vie. 書名：培養與鍛鍊程式設計的邏輯腦：程式設計大賽的128個進階技巧(使用Python). 2019, 978-986-434-383-6. ⟨hal-03377773⟩

Christoph Dürr, Jill-Jênn Vie. 高效算法. 2018, 9787115480859. ⟨hal-03377766⟩

Christoph Dürr, Jill-Jênn Vie. Programmation efficace : 128 algorithmes qu'il faut avoir compris et codes en Python au cours de sa vie. ellipses, 2016, 9782340-010055. ⟨hal-01344395⟩

Christoph Dürr, Wilke Thomas. STACS 2012 Special Issue. Symposium on Theoretical Aspects of Computer Science (STACS), Feb 2012, Paris, France. 55 (4), Springer, 2014, Theory of Computing Systems, ⟨10.1007/s00224-013-9530-8⟩. ⟨hal-01517122⟩

Christoph Dürr, Thomas Schwentick. Special Issue on Theoretical Aspects of Computer Science. Symposium on Theoretical Aspects of Computer Science (STACS), Mar 2011, Dortmund, Germany. 53 (2), Springer, 2013, Theory of Computing Systems, ⟨10.1007/s00224-013-9467-y⟩. ⟨hal-01517125⟩

Christoph Dürr, Thomas Wilke. Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). France. 2012, Leibniz International Proceedings in Informatics (LIPIcs), ⟨10.4230/LIPIcs.STACS.2012.i⟩. ⟨hal-01517141⟩

Christoph Dürr, Thomas Schwentick. Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011) . Symposium on Theoretical Aspects of Computer Science (STACS), Mar 2011, Dortmund, Germany. 9, Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2011, Leibniz International Proceedings in Informatics (LIPIcs), 978-3-939897-25-5. ⟨hal-01517143⟩

Evripidis Bampis, Christoph Dürr, Fadi Kacem, Ioannis Milis. Speed scaling with power down scheduling for agreeable deadlines. 2011. ⟨hal-02535594⟩

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