Nombre de documents

39


Article dans une revue20 documents

  • Nikhil Bansal, Christoph Dürr, Nguyen kim Thang, Óscar C. Vásquez. The local–global conjecture for scheduling with non-linear cost. Journal of Scheduling, Springer Verlag, 2016, pp.1-16. <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>
  • 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>
  • 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>
  • 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>
  • 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>
  • 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>
  • 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>
  • 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>
  • 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>
  • 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>
  • 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, pp.184--189. <10.1016/j.suscom.2012.10.003>. <hal-00868700>
  • Marek Chrobak, Christoph Dürr, Mathilde Hurand, Julien Robert. Algorithms for temperature-aware task scheduling in microprocessor systems. Sustainable Computing, 2011, 1 (3), pp.241-247. <10.1016/j.suscom.2011.05.009>. <hal-01185277>
  • 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>
  • 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>
  • 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 A. Kravchenko, et al.. The Complexity of Mean Flow Time Scheduling Problems with Release Times. Journal of Scheduling, Springer Verlag, 2007, <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>

Communication dans un congrès16 documents

  • 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. Proc. of the 24th European Symposium on Algorithms (ESA), 2016, <http://conferences.au.dk/algo16/esa/>. <hal-01344102>
  • Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter. The expanding search ratio of a graph. The 33rd Symposium on Theoretical Aspects of Computer Science (STACS), Feb 2016, Orléans, France. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Proc. of the 33rd Symposium on Theoretical Aspects of Computer Science (STACS), 47, pp.4:1--9:14, Leibniz International Proceedings in Informatics (LIPIcs). <http://www.univ-orleans.fr/lifo/events/STACS2016/>. <10.4230/LIPIcs.STACS.2016.9>. <hal-01344126>
  • 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. Proc. of the 24th European Symposium on Algorithms (ESA), 2016, <http://conferences.au.dk/algo16/esa/>. <hal-01344050>
  • 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. Springer, 9214, pp.40-53, Lecture Notes in Computer Science. <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, 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. SIAM, pp.98-111, 2014, <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. Springer, 8289, pp.134-145, 2013, Lecture Notes in Computer Science. <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. 44, pp.351-356, Electronic Notes in Discrete Mathematics. <10.1016/j.endm.2013.10.055>. <hal-01222524>
  • 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. 7695, pp.350--363, 2012, Lecture Notes in Computer Science. <10.1007/978-3-642-35311-6_26>. <hal-00820139>
  • 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. Springer, Approximation and Online Algorithms, pp.187-200, 2012, <10.1007/978-3-642-38016-7_16>. <hal-00841914>
  • 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, 2008. <hal-00477094>
  • Christoph Dürr, Mathilde Hurand. Finding total unimodularity in optimization problems solved by linear programs. 2006, Springer series Lecture Notes in Computer Science, pp.315-326, 2006, <10.1007/11841036_30>. <hal-00111233>
  • 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, 2006. <inria-00123683>
  • Christoph Dürr, Mathilde Hurand. Finding total unimodularity in optimization problems solved by linear programs. Azar Y., Erlebach T. Proc. of the 14th Annual European Symposium on Algorithms (ESA)},, Sep 2006, Zürich, Springer-Verlag, 4168 (4168), pp.315-326, 2006, Lecture Notes in Computer Science; 14th Annual European Symposium on Algorithms (ESA 2006). <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, 2006. <inria-00123655>

Ouvrage (y compris édition critique et traduction)1 document

  • 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>

Pré-publication, Document de travail1 document

  • Philippe Baptiste, Marek Chrobak, Christoph Dürr, Francis Sourd. Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time. 2004. <hal-00012906>

HDR1 document

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