### Page Content

## List of all publications

## 2016

**Skutella, M.**.

**A note on the ring loading problem**.

*SIAM Journal on Discrete Mathematics*, Vol. 30, pp. 327–342, 2016.

**Skutella, M., Sviridenko, M. and Uetz, M.**.

**Unrelated Machine Scheduling with Stochastic Processing Times**.

*Mathematics of Operations Research*, Vol. 41, pp. 851–864, 2016.

**Skutella, M. and Verschae, J.**.

**Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures**.

*Mathematics of Operations Research*, Vol. 41, pp. 991–1021, 2016.

## 2015

**Groß, M. and Skutella, M.**.

**A tight bound on the speed-up through storage for quickest multi-commodity flows**.

*Operation Research Letters*, Vol. 43, pp. 93–95, 2015.

**Bjelde, A., Fischer, F. and Klimm, M.**.

**Impartial Selection and the Power of Up to Two Choices**.

In *Proceedings of the 11th Conference on Web and Internet Economics (WINE)*, 2015.

**Harks, T. and Klimm, M.**.

**Bottleneck Routing with Elastic Demands**.

In *Proceedings of the 11th Conference on Web and Internet Economics (WINE)*, 2015.

**Harks, T. and Klimm, M.**.

**Equilibria in a Class of Aggregative Location Games**.

*Journal of Mathematical Economics*, Vol. 61, pp. 211-220, 2015.

**Gellert, T. J.**.

**Scheduling Rail-mounted Cranes**.

Doctoral thesis, TU Berlin, 2015.

**Rezapour, M.**.

**Network Design with Facility Location**.

Doctoral thesis, TU Berlin, 2015.

**Arulselvan, A., Groß, M. and Skutella, M.**.

**Graph Orientation and Flows Over Time**.

*Networks*, Vol. 66, pp. 196-209, 2015.

**Arulselvan, A., Maurer, O. and Skutella, M.**.

**An incremental algorithm for the uncapacitated facility location problem**.

*Networks*, Vol. 65, pp. 306-311, 2015.

**Chen, L., Megow, N., Rischke, R., Stougie, L. and Verschae, J.**.

**Optimal Algorithms and a PTAS for Cost-Aware Scheduling**.

In *Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science (MFCS'15)*, pp. 211–222, 2015.

**Chen, L., Megow, N., Rischke, R. and Stougie, L.**.

**Stochastic and Robust Scheduling in the Cloud**.

In *Proceedings of the 18th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'15)*, pp. 175–186, 2015.

**Disser, Y., Feldmann, A., Klimm, M. and Mihalák, M.**.

**Improving the Hk-bound on the price of stability in undirected Shapley network design games**.

*Theoretical Computer Science*, Vol. 562, pp. 557–564, 2015.

**Kappmeier, J.-P. W.**.

**Generalizations of Flows over Time with Applications in Evacuation Optimization**.

Doctoral thesis, TU Berlin, 2015.

**Megow, N., Meißner, J. and Skutella, M.**.

**Randomization Helps Computing a Minimum Spanning Tree Under Uncertainty**.

In *Proceedings of the European Symposium on Algorithms (ESA)*, 2015.

**Correa, J. and Megow, N.**.

**Clique partitioning with value-monotone submodular cost**.

*Discrete Optimization*, Vol. 15, pp. 26-36, 2015.

**Skutella, M.**.

**A note on the ring loading problem**.

*Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)*, pp. 37-46, 2015.

**Disser, Y. and Skutella, M.**.

**The Simplex Algorithm is NP-mighty**.

In *Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)*, pp. 858-872, 2015.

**Matuschke, J., Skutella, M. and Soto, J.**.

**Robust randomized matchings**.

*Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015)*, pp. 1904-1915, 2015.

**Höhn, W. and Jacobs, T.**.

**On the performance of Smith's rule in single-machine scheduling with nonlinear cost**.

*ACM Transactions on Algorithms*, Vol. 11, pp. Article 25, 2015.

**Chalopin, J., Das, S., Disser, Y., Mihalák, M. and Widmayer, P.**.

**Mapping Simple Polygons: The Power of telling Convex from Reflex**.

*ACM Transactions on Algorithms*, Vol. 11, pp. 33(16), 2015.

**Disser, Y., Klimm, M. and Lübbecke, E.**.

**Scheduling Bidirectional Traffic on a Path**.

In *Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP)*, pp. 406-418, 2015.

**Montanari, S., Mihalák, M. and Disser, Y.**.

**Max Shortest Path for Imprecise Points**.

In *Proceedings of the 31st European Workshop on Computational Geometry (EuroCG)*, 2015.
to appear.

**Böhmova, K., Disser, Y., Kravina, E., Mihalák, M. and Widmayer, P.**.

**Interval Selection on Unrelated Machines**.

In *Proceedings of the 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP)*, 2015.
to appear.

**Dereniowski, D., Disser, Y., Kosowski, A., Pająk, D. and Uznański, P.**.

**Fast collaborative graph exploration**.

*Information and Computation*, Vol. 243, pp. 37–49, 2015. to appear.

**Eisenbrand, F., Moran, S., Pinchasi, R. and Skutella, M.**.

**Node-balancing by edge-increments**.

In **Bansal, Nikhil and Finocchi, Irene (ed.)**, *Algorithms – ESA 2015*, pp. 450-458, Springer, 2015.

**Fischer, F. and Klimm, M.**.

**Optimal Impartial Selection**.

*SIAM Journal on Computing*, Vol. 44, pp. 1263-1285, 2015.

**Bansal, N., Gupta, A., Krishnaswamy, R., Pruhs, K., Schewior, K. and Stein, C.**.

**A 2-Competitive algorithm for Online Convex Optimization with Switching Costs**.

In *Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)*, pp. 96–109, 2015.

**Harks, T., Kleinert, I., Klimm, M. and Möhring, R. H.**.

**Computing network tolls with support constraints**.

*Networks*, Vol. 65, pp. 262-285, 2015.

**Klimm, M. and Schmand, D.**.

**Sharing non-anonymous costs of multiple resources optimally**.

In *Proceedings of the 9th International Conference on Algorithms and Complexity (CIAC)*, pp. 274-287, 2015.

**Sanità, Laura and Skutella, Martin (ed.)**,

**Approximation and Online Algorithms – 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers**.

Proceedings, Lecture Notes in Computer Science, Vol. 9499, Springer, 2015.

**Skutella, M.**.

**Convex Quadratic Programming in Scheduling**.

In **Schulz, Aandreas S. and Skutella, Martin and Stiller, Sebastian and Wagner, Dorothea (ed.)**, *Gems of Combinatorial Optimization and Graph Algorithms*, pp. 125–132, Springer, 2015.

**Schulz, Aandreas S. and Skutella, Martin and Stiller, Sebastian and Wagner, Dorothea (ed.)**,

**Gems of Combinatorial Optimization and Graph Algorithms**.

Book, Springer, 2015.

## 2014

**Harks, T., Hoefer, M., Schewior, K. and Skopalik, A.**.

**Routing games with progressive filling**.

In *Proceedings of the International Conference on Computer Communications (INFOCOM)*, pp. 352-360, 2014.

**Correa, J., Marchetti-Spaccamela, A., Matuschke, J., Stougie, L., Svensson, O., Verdugo, V. and Verschae, J.**.

**Strong LP formulations for scheduling splittable jobs on unrelated machines**.

In *Integer Programming and Combinatorial Optimization (IPCO 2014)*, pp. 249-260, Springer, 2014.

**Groß, M.**.

**Approximation Algorithms for Complex Network Flow Over Time Problems**.

Doctoral thesis, TU Berlin, 2014.

**Rischke, R.**.

**Two-Stage Robust Combinatorial Optimization with Priced Scenarios**.

In *Operations Research Proceedings 2013 - Selected Papers of the International Conference on Operations Research (OR'13)*, pp. 377–382, 2014.

**Hansknecht, C., Klimm, M. and Skopalik, A.**.

**Approximate pure Nash equilibria in weighted congestion games**.

In **Klaus Jansen and Jos'e Rolim and Nikhil Devanur and Cristopher Moore (ed.)**, *Proceedings of the 17th Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX)*, pp. 242 – 257, 2014.

**Adjiashvili, D., Stiller, S. and Zenklusen, R.**.

**Bulk-Robust combinatorial optimization**.

*Mathematical Programming*, pp. 1-30, 2014.

**Schmidt, M. and Skutella, M.**.

**Earliest Arrival Flows in Networks with Multiple Sinks**.

*Discrete Applied Mathematics*, Vol. 164, pp. 320-327, 2014.

**Caprara, A., Galli, L., Stiller, S. and Toth, P.**.

**Delay-Robust Event Scheduling**.

*Operations Research*, Vol. 62, pp. 274-283, 2014.

**Mittal, S., Schulz, A. and Stiller, S.**.

**Robust appointment scheduling**.

In *Proceedings of APPROX 2014*, 2014.
to appear.

**Megow, N. and Vredeveld, T.**.

**A Tight 2-Approximation for Preemptive Stochastic Scheduling**.

*Mathematics of Operations Research*, Vol. 39, pp. 1297-1310, 2014.

**Günther, E., König, F. G. and Megow, N.**.

**Scheduling and Packing Malleable and Parallel Tasks with Precedence Constraints of Bounded Width**.

*Journal of Combinatorial Optimization*, Vol. 27, pp. 164-181, 2014.

**Welz, W.**.

**Robot Tour Planning with High Determination Costs**.

Doctoral thesis, TU Berlin, 2014.

**Disser, Y., Megow, N., Klimm, M. and Stiller, S.**.

**Packing a Knapsack of Unknown Capacity**.

In *Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS)*, pp. 276–287, 2014.

**Arulselvan, A., Groß, M. and Skutella, M.**.

**Graph Orientation and Flows Over Time**.

In **Ahn, Hee-Kap and Shin, Chan-Su (ed.)**, *Algorithms and Computation*, Lecture Notes in Computer Science, Vol. 8889, pp. 741–752, Springer International Publishing, 2014.

**Harks, T. and Klimm, M.**.

**Multimarket oligopolies with restricted market access**.

In *Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)*, pp. 182-193, 2014.

**Cseh, Á. and Skutella, M.**.

**Paths to stable allocations**.

*Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT)*, 2014.