TU Berlin

Prof. Dr. Martin Skutella Publications

Page Content

to Navigation

Publications

Fleischer, Lisa and Skutella, Martin.
The quickest multicommodity flow problem.
In Cook, William J. and Schulz, Andreas S., eds. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, 2337: 36–53. Springer, 2002.


Fleischer, Lisa and Skutella, Martin.
Minimum Cost Flows Over Time without Intermediate Storage.
In Proceedings of the 14th Annual ACM–SIAM Symposium on Discrete Algorithms,  66–75. Baltimore, MD, 2003.


Megow, Nicole and Meißner, Julie and Skutella, Martin.
Randomization Helps Computing a Minimum Spanning Tree Under Uncertainty.
In Proceedings of the European Symposium on Algorithms (ESA), . , 2015.

Link to publication

Schlöter, Miriam and Skutella, Martin.
Fast and Memory-Efficient Algorithms for Evacuation Problems.
In Klein, Philip N., eds. Proceedings of the 28th Annual ACM–SIAM Symposium on Discrete Algorithms,  821-840. SIAM, 2017.


Megow, Nicole and Skutella, Martin and Verschae, Jose and Wiese, Andreas.
The Power of Recourse for Online MST and TSP.
In Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), Lecture Notes in Computer Science, 7391:  689–-700. Springer, 2012.

Link to publication Link to original publication

Klimm, Max and Pfetsch, Marc E. and Raber, Rico and Skutella, Martin.
Packing under Convex Quadratic Constraints.
In Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science . Springer, 2020.


Morell, Sarah and Skutella, Martin.
Single source unsplittable flows with arc-wise lower and upper bounds.
In Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science . Springer, 2020.


Goemans, Michel X. and Skutella, Martin.
Cooperative facility location games.
In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms,  76–85. San Francisco, CA, 2000.


Jäger, Sven and Skutella, Martin.
Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling.
In Niedermeier, Rolf and Vallée, Brigitte, eds. 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Leibniz International Proceedings in Informatics (LIPIcs), 96:  43:1–43:14. Dagstuhl, GermanySchloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018.

Link to original publication

Gröpl, Clemens and Skutella, Martin.
Parallel Repetition of MIP(2,1) Systems.
In Mayr, Ernst W. and Prömel, Hans Jürgen and Steger, Angelika, eds. Lectures on Proof Verification and Approximation Algorithms, Lecture Notes in Computer Science, 1367: 161–177. Springer, 1998.

Link to publication

Groß, Martin and Skutella, Martin.
Generalized Maximum Flows over Time.
In Persiano, P. and Solis-Oba, R., eds. Proceedings of the 9th Workshop on Approximation and Online Algorithms (WAOA), Lecture Notes in Computer Science, 7164:  247–260. Springer, 2012.


Hall, Alex and Hippler, Steffen and Skutella, Martin.
Multicommodity Flows Over Time: Efficient Algorithms and Complexity.
In Baeten, Jos C. M. and Lenstra, Jan Karel and Parrow, Joachim and Woeginger, Gerhard J., eds. Automata, Languages and Programming, Lecture Notes in Computer Science, 2719: 397–409. Springer, 2003.


Hall, Alex and Langkau, Katharina and Skutella, Martin.
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.
In Arora, Sanjeev and Jansen, Klaus and Rolim, José D. P. and Sahai, Amit, eds. Approximation, Randomization, and Combinatorial Optimization, Lecture Notes in Computer Science, 2764: 71–82. Springer, 2003.


Disser, Yann and Skutella, Martin.
The Simplex Algorithm is NP-mighty.
In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA),  858-872. , 2015.

Link to publication

Arulselvan, Ashwin and Groß, Martin and Skutella, Martin.
Graph Orientation and Flows Over Time.
In Ahn, Hee-Kap and Shin, Chan-Su, eds. Algorithms and Computation, Lecture Notes in Computer Science, 8889:  741–752. Springer International Publishing, 2014.

Link to original publication

Hoogeveen, Han and Skutella, Martin and Woeginger, Gerhard J..
Preemptive scheduling with rejection.
In Mike Paterson, eds. Algorithms – ESA '00, Lecture Notes in Computer Science, 1879: 268–277. Springer, 2000.


Köhler, Ekkehard and Langkau, Katharina and Skutella, Martin.
Time-Expanded Graphs for Flow-Dependent Transit Times.
In Möhring, Rolf H. and Raman, Rajeev, eds. Algorithms – ESA '02, Lecture Notes in Computer Science, 2461: 599–611. Springer, 2002.

Link to publication

Köhler, Ekkehard and Möhring, Rolf H. and Skutella, Martin.
Traffic networks and flows over time.
In Lerner, Jürgen and Wagner, Dorothea and Zweig, Katharina A., eds. Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation, Lecture Notes in Computer Science, 5515: 166–196. Springer, 2009.

Link to publication

Köhler, Ekkehard and Skutella, Martin.
Flows over time with load-dependent transit times.
In Proceedings of the 13th Annual ACM–SIAM Symposium on Discrete Algorithms,  174–183. San Francisco, CA, 2002.


Skutella, Martin and Sviridenko, Maxim and Uetz, Marc.
Stochastic scheduling on unrelated machines.
In Mayr, E. W. and Portier, N., eds. Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science, Leibniz International Proceedings in Informatics, 25:  639-650. Dagstuhl Publishing, 2014.


Copyright notice

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe