Christoph Dürr
Publications
Publications
|
|
Randomized Binary and Tree Search Under Pressure52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), Jul 2025, Aarhus (Denmark), Denmark. pp.1-19, ⟨10.4230/LIPIcs.ICALP.2025.41⟩ |
|
|
Cascading CMA-ES Instances for Generating Input-diverse Solution BatchesProc. of the Genetic and Evolutionary Computation Conference (GECCO, Companion material, BBOB workshop), ACM, Jul 2025, Malaga, Spain. ⟨10.1145/3712255.3734304⟩ |
|
|
Scenario-Based Robust Optimization of Tree Structures39th Annual AAAI Conference on Artificial Intelligence (AAAI-25), Feb 2025, Philadelphia (PA), United States. ⟨10.1609/aaai.v39i25.34894⟩ |
|
|
Contract Scheduling with Distributional and Multiple AdviceThe 33rd International Joint Conference in Artificial Intelligence (IJCAI-24), Aug 2024, Jeju Island, South Korea. pp.3652-3660, ⟨10.24963/ijcai.2024/404⟩ |
|
|
Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms38th Conference on Neural Information Processing Systems, (NeurIPS 2024), Dec 2024, Vancouver, BC, Canada |
|
|
Non-monotone DR-submodular Maximization over General Convex SetsTwenty-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⟩ |
|
|
Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty29th Annual European Symposium on Algorithms (ESA 2021), Sep 2021, Lisboa, Portugal. pp.10:1--10:18, ⟨10.4230/LIPIcs.ESA.2021.10⟩ |
|
|
Online Computation with Untrusted Advice11th Innovations in Theoretical Computer Science Conference (ITCS 2020), Jan 2020, Seattle, United States. pp.52:1--52:15, ⟨10.4230/LIPIcs.ITCS.2020.52⟩ |
|
|
Best-Of-Two-Worlds Analysis of Online Search36th 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⟩ |
Online Maximum Matching with Recourse43rd 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⟩ |
|
|
|
Scheduling with Explorable Uncertainty9th Innovations in Theoretical Computer Science Conference (ITCS 2018), Jan 2018, Cambridge, United States. pp.30:1--30:14, ⟨10.4230/LIPIcs.ITCS.2018.30⟩ |
An Adversarial Model for Scheduling with TestingWorkshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), Jun 2017, Seeon, Germany. pp.68--70 |
|
|
|
Online Algorithms for Multi-Level AggregationThe 24th European Symposium on Algorithms (ESA), Aug 2016, Aarhus, Denmark |
|
|
The expanding search ratio of a graphThe 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⟩ |
|
|
On the Power of Advice and Randomization for Online Bipartite MatchingThe 24th European Symposium on Algorithms (ESA), Aug 2016, Aarhus, Denmark |
|
|
Competitive Strategies for Online Clique ClusteringThe 9th International Conference on Algorithms and Complexity (CIAC), May 2015, Paris, France. pp.101-113, ⟨10.1007/978-3-319-18173-8_7⟩ |
Online Bin Packing with Advice of Small SizeAlgorithms and Data Structures, Aug 2015, Victoria, Canada. pp.40-53, ⟨10.1007/978-3-319-21840-3_4⟩ |
|
|
|
Order constraints for single machine scheduling with non-linear cost16th Workshop on Algorithm Engineering and Experiments (ALENEX 2014), Jan 2014, Portland, United States. pp.98-111, ⟨10.1137/1.9781611973198.10⟩ |
Tutoriel : Gestion de tampon en ligneROADEF - 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 |
|
|
|
Mechanism design for aggregating energy consumption and quality of service in speed scaling schedulingWINE 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⟩ |
The Wide Partition Conjecture and the Atom Problem in Discrete TomographyThe 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⟩ |
|
Approximating the Throughput by Coolest First SchedulingWAOA 2012 - 10th International Workshop on Approximation and Online Algorithms, Sep 2012, Ljubljana, Slovenia. pp.187-200, ⟨10.1007/978-3-642-38016-7_16⟩ |
|
|
|
Smooth inequalities and equilibrium inefficiency in scheduling games8th 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⟩ |
Algorithms for Temperature-Aware Task Scheduling in Microprocessor SystemsAlgorithmic Aspects in Information and Management,, Jun 2008, China. pp.120-130 |
|
|
|
Finding total unimodularity in optimization problems solved by linear programs2006, pp.315-326, ⟨10.1007/11841036_30⟩ |
Competitive Analysis of Scheduling Algorithms for Aggregated LinksProceedings of Latin American Theoretical INformatics (LATIN), Mar 2006, Valdivia, Chile, pp.617--628 |
|
Finding total unimodularity in optimization problems solved by linear programsProc. of the 14th Annual European Symposium on Algorithms (ESA)},, Sep 2006, Zürich, pp.315-326 |
|
Quantum Query Complexity in Computational GeometryConference on Quantum Information and Computation IV by The International Society for Optical Engineering (SPIE), 2006, SPIE |
|
Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow-TimeMAPSP 2005 - 7th workshop on Models and Algorithms for Planning and Scheduling Problems, Jun 2005, Siena, Italy. pp.36-38 |
Competitive Programming in Python, 128 Algorithms to Develop your Coding Skills2021 |
|
書名:培養與鍛鍊程式設計的邏輯腦:程式設計大賽的128個進階技巧(使用Python)2019, 978-986-434-383-6 |
|
高效算法2018, 9787115480859 |
|
Programmation efficaceellipses, 2016, 9782340-010055 |
|
|
Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms2025 |
|
|
On price-induced minmax matchings2023 |
|
|
Speed scaling with power down scheduling for agreeable deadlines2011 |
|
|
Tomographie discrète, calcul quantique et ordonnancementAutre [cs.OH]. Université Paris Sud - Paris XI, 2006 |