Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs. - Sven Oliver Krumke; Peter Merz; Tim Nonner; Katharina Rupp (OPODIS, 2007)

Latency Constrained Aggregation in Chain Networks Admits a PTAS. - Tim Nonner; Alexander Souza (AAIM, 2009)

A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines. - Tim Nonner; Alexander Souza (COCOA, 2009)

Approximating the Joint replenishment Problem with Deadlines. - Tim Nonner; Alexander Souza (Discret. Math. Algorithms Appl., 2009)

SRPT is 1.86-Competitive for Completion Time Scheduling. - Christine Chung 001; Tim Nonner; Alexander Souza (SODA, 2010)

Approximation in batch and multiprocessor scheduling. - Tim Nonner (2010)

Optimal Algorithms for Train Shunting and Relaxed List Update Problems. - Tim Nonner; Alexander Souza (ATMOS, 2012)

Polynomial-Time Approximation Schemes for Shortest Path with Alternatives. - Tim Nonner (ESA, 2012)

An Efficient Polynomial-Time Approximation Scheme for the Joint Replenishment Problem. - Tim Nonner; Maxim Sviridenko (IPCO, 2013)

Shortest Path with Alternatives for Uniform Arrival Times: Algorithms and Experiments. - Tim Nonner; Marco Laumanns (ATMOS, 2014)

Stochastic Travel Planning for Unreliable Public Transportation Systems. - Tim Nonner; Adi Botea; Marco Laumanns (ERCIM News, 2014)

The Bell Is Ringing in Speed-Scaled Multiprocessor Scheduling. - Gero Greiner; Tim Nonner; Alexander Souza (Theory Comput. Syst., 2014)

PTAS for Densest k-Subgraph in Interval Graphs. - Tim Nonner (Algorithmica, 2016)

Capacitated Max-Batching with interval graph compatibilities. - Tim Nonner (Theor. Comput. Sci., 2016)

Clique Clustering Yields a PTAS for Max-Coloring Interval Graphs. - Tim Nonner (Algorithmica, 2018)