Tim Nonner

Orcid: 0000-0001-7638-5689

According to our database1, Tim Nonner authored at least 15 papers between 2007 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2018
Clique Clustering Yields a PTAS for Max-Coloring Interval Graphs.
Algorithmica, 2018

2016
Capacitated Max-Batching with interval graph compatibilities.
Theor. Comput. Sci., 2016

PTAS for Densest k-Subgraph in Interval Graphs.
Algorithmica, 2016

2014
The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling.
Theory Comput. Syst., 2014

Stochastic Travel Planning for Unreliable Public Transportation Systems.
ERCIM News, 2014

Shortest Path with Alternatives for Uniform Arrival Times: Algorithms and Experiments.
Proceedings of the 14th Workshop on Algorithmic Approaches for Transportation Modelling, 2014

2013
An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2013

2012
Polynomial-Time Approximation Schemes for Shortest Path with Alternatives.
Proceedings of the Algorithms - ESA 2012, 2012

Optimal Algorithms for Train Shunting and Relaxed List Update Problems.
Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modelling, 2012

2010
Approximation in batch and multiprocessor scheduling.
PhD thesis, 2010

SRPT is 1.86-Competitive for Completion Time Scheduling.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
Approximating the Joint replenishment Problem with Deadlines.
Discret. Math. Algorithms Appl., 2009

A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines.
Proceedings of the Combinatorial Optimization and Applications, 2009

Latency Constrained Aggregation in Chain Networks Admits a PTAS.
Proceedings of the Algorithmic Aspects in Information and Management, 2009

2007
Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007


  Loading...