Christoph Dürr
Orcid: 0000-0001-8103-5333Affiliations:
- CNRS, Sorbonne University, Paris, France
- École Polytechnique, Paris, France (former)
According to our database1,
Christoph Dürr
authored at least 78 papers
between 1996 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
9
10
5
2
3
5
2
3
4
1
2
2
4
6
3
3
1
2
1
3
2
1
2
1
1
1
1
1
1
1
1
2
1
1
3
1
1
2
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
On csauthors.net:
Bibliography
2024
CoRR, 2024
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024
2023
2021
Proceedings of the 29th Annual European Symposium on Algorithms, 2021
2020
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020
2019
CoRR, 2019
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019
2018
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018
2017
Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling.
Theor. Comput. Sci., 2017
Theor. Comput. Sci., 2017
Theory Comput. Syst., 2017
2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
Proceedings of the 24th Annual European Symposium on Algorithms, 2016
2015
J. Sched., 2015
Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption.
Discret. Appl. Math., 2015
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015
2014
Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014
2013
A <i>ϕ</i>-competitive algorithm for collecting items with increasing weights from a dynamic queue.
Theor. Comput. Sci., 2013
Theory Comput. Syst., 2013
Electron. Notes Discret. Math., 2013
2012
ACM Trans. Algorithms, 2012
Sustain. Comput. Informatics Syst., 2012
Reconstructing 3-Colored Grids from Horizontal and Vertical Projections is NP-Hard: A Solution to the 2-Atom Problem in Discrete Tomography.
SIAM J. Discret. Math., 2012
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012
Proceedings of the Approximation and Online Algorithms - 10th International Workshop, 2012
Frontmatter, Foreword, Conference Organization, External Reviewers, Table of Contents.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012
2011
Sustain. Comput. Informatics Syst., 2011
Algorithmica, 2011
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011
2010
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010
2009
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009
Proceedings of the Algorithms, 2009
2008
Algorithmica, 2008
2007
J. Sched., 2007
2006
Tomographie discrète, calcul quantique et ordonnancement. (Discrete tomography, quantum computation and scheduling).
, 2006
2005
2004
Oper. Res. Lett., 2004
Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time
CoRR, 2004
2003
2002
SIAM J. Comput., 2002
2001
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms.
Theor. Comput. Sci., 2001
1999
Inf. Process. Lett., 1999
1997
Random Struct. Algorithms, 1997
1996