Christoph Dürr

According to our database1, Christoph Dürr authored at least 100 papers between 1996 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
The triangle scheduling problem.
J. Scheduling, 2018

Preface of STACS 2016 Special Issue.
Theory Comput. Syst., 2018

Online Bin Packing with Advice of Small Size.
Theory Comput. Syst., 2018

Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption.
CoRR, 2018

Online Maximum Matching with Recourse.
CoRR, 2018

Online Maximum Matching with Recourse.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Scheduling with Explorable Uncertainty.
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

Infinite linear programming and online searching with turn cost.
Theor. Comput. Sci., 2017

The local-global conjecture for scheduling with non-linear cost.
J. Scheduling, 2017

Multi-processor Search and Scheduling Problems with Setup Cost.
Theory Comput. Syst., 2017

Scheduling with Explorable Uncertainty.
CoRR, 2017

2016
On the Power of Advice and Randomization for Online Bipartite Matching.
CoRR, 2016

The triangle scheduling problem.
CoRR, 2016

The expanding search ratio of a graph.
CoRR, 2016

The Expanding Search Ratio of a Graph.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

On the Power of Advice and Randomization for Online Bipartite Matching.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Online Algorithms for Multi-Level Aggregation.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015
A note on NP-hardness of preemptive mean flow-time scheduling for parallel machines.
J. Scheduling, 2015

Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption.
Discrete Applied Mathematics, 2015

Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling.
CoRR, 2015

Online Algorithms for Multi-Level Aggregation.
CoRR, 2015

Online Bin Packing with Advice of Small Size.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Competitive Strategies for Online Clique Clustering.
Proceedings of the Algorithms and Complexity - 9th International Conference, 2015

2014
Preface of STACS 2012 Special Issue.
Theory Comput. Syst., 2014

Approximation Algorithms for Clique Clustering.
CoRR, 2014

A Note on NP-Hardness of Preemptive Mean Flow-Time Scheduling for Parallel Machines.
CoRR, 2014

Order constraints for single machine scheduling with non-linear cost.
Proceedings of the 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, 2014

2013
A ϕ-competitive algorithm for collecting items with increasing weights from a dynamic queue.
Theor. Comput. Sci., 2013

Preface of Special Issue on Theoretical Aspects of Computer Science.
Theory Comput. Syst., 2013

The Wide Partition Conjecture and the Atom Problem in Discrete Tomography.
Electronic Notes in Discrete Mathematics, 2013

Order constraints for single machine scheduling with non-linear cost
CoRR, 2013

Collecting Weighted Items from a Dynamic Queue.
Algorithmica, 2013

Mechanism Design for Aggregating Energy Consumption and Quality of Service in Speed Scaling Scheduling.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

2012
Polynomial-time algorithms for minimum energy scheduling.
ACM Trans. Algorithms, 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. Discrete Math., 2012

Online scheduling of bounded length jobs to maximize throughput.
J. Scheduling, 2012

The interval ordering problem.
Discrete Applied Mathematics, 2012

Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games
CoRR, 2012

Tile-Packing Tomography Is NP-hard.
Algorithmica, 2012

Smooth Inequalities and Equilibrium Inefficiency in Scheduling Games.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Approximating the Throughput by Coolest First Scheduling.
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
Non-clairvoyant Scheduling Games.
Theory Comput. Syst., 2011

The interval ordering problem
CoRR, 2011

Speed scaling with power down scheduling for agreeable deadlines
CoRR, 2011

Non-clairvoyant Scheduling Games
CoRR, 2011

Finding Total Unimodularity in Optimization Problems Solved by Linear Programs.
Algorithmica, 2011

Frontmatter, Table of Contents, Preface, Conference Organization.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2010
Polynomial Time Algorithms for Minimum Energy Scheduling.
Proceedings of the Scheduling, 14.02. - 19.02.2010, 2010

Tile-Packing Tomography Is \mathbbNP{\mathbb{NP}}-hard.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2009
Tile Packing Tomography is NP-hard
CoRR, 2009

Polynomial Time Algorithms for Minimum Energy Scheduling
CoRR, 2009

Reconstructing 3-colored grids from horizontal and vertical projections is NP-hard
CoRR, 2009

Online Scheduling of Bounded Length Jobs to Maximize Throughput
CoRR, 2009

Online Scheduling of Bounded Length Jobs to Maximize Throughput.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Collecting weighted items from a dynamic queue.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Non-clairvoyant Scheduling Games.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard.
Proceedings of the Algorithms, 2009

2008
Runway sequencing with holding patterns.
European Journal of Operational Research, 2008

Generalized Whac-a-Mole
CoRR, 2008

Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems
CoRR, 2008

Competitive Analysis of Scheduling Algorithms for Aggregated Links.
Algorithmica, 2008

Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
The complexity of mean flow time scheduling problems with release times.
J. Scheduling, 2007

Nash equilibria in Voronoi games on graphs
CoRR, 2007

Nash Equilibria in Voronoi Games on Graphs.
Proceedings of the Algorithms, 2007

Polynomial Time Algorithms for Minimum Energy Scheduling.
Proceedings of the Algorithms, 2007

2006
Quantum Query Complexity of Some Graph Problems.
SIAM J. Comput., 2006

A Note on Scheduling Equal-Length Jobs to Maximize Throughput.
J. Scheduling, 2006

The Complexity of Mean Flow Time Scheduling Problems with Release Times
CoRR, 2006

Finding total unimodularity in optimization problems solved by linear programs
CoRR, 2006

Competitive Analysis of Scheduling Algorithms for Aggregated Links.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

Finding Total Unimodularity in Optimization Problems Solved by Linear Programs.
Proceedings of the Algorithms, 2006

Tomographie discrète, calcul quantique et ordonnancement. (Discrete tomography, quantum computation and scheduling).
, 2006

2005
Quantum Algorithms for Element Distinctness.
SIAM J. Comput., 2005

2004
Cellular automata and communication complexity.
Theor. Comput. Sci., 2004

Preemptive scheduling of equal-length jobs to maximize weighted throughput.
Oper. Res. Lett., 2004

A Note on Scheduling Equal-Length Jobs to Maximize Throughput
CoRR, 2004

Preemptive Multi-Machine Scheduling of Equal-Length Jobs to Minimize the Average Flow Time
CoRR, 2004

Quantum Query Complexity of Some Graph Problems.
Proceedings of the Automata, Languages and Programming: 31st International Colloquium, 2004

2003
Tiling with bars under tomographic constraints.
Theor. Comput. Sci., 2003

On tiling under tomographic constraints.
Theor. Comput. Sci., 2003

2002
A Decision Procedure for Unitary Linear Quantum Cellular Automata.
SIAM J. Comput., 2002

Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput
CoRR, 2002

Cellular automata and communication complexity
CoRR, 2002

2001
Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms.
Theor. Comput. Sci., 2001

A Note on Tiling under Tomographic Constraints
CoRR, 2001

Quantum Algorithms for Element Distinctness.
Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001

1999
Reconstructing hv-Convex Polyominoes from Orthogonal Projections.
Inf. Process. Lett., 1999

A decision procedure for well-formed linear quantum cellular automata
CoRR, 1999

Reconstructing hv-Convex Polyominoes from Orthogonal Projections
CoRR, 1999

Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms
CoRR, 1999

Tiling with bars under tomographic constraints
CoRR, 1999

1998
Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1997
A decision procedure for well-formed linear quantum cellular automata.
Random Struct. Algorithms, 1997

1996
A Quantum Algorithm for Finding the Minimum
CoRR, 1996

A decision procedure for unitary linear quantum cellular automata
CoRR, 1996

A Decision Procedure for Well-Formed Linear Quantum Cellular Automata.
Proceedings of the STACS 96, 1996

A Decision Procedure for Unitary Linear Quantum Cellular Automata.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996


  Loading...