TU Berlin

Prof. Dr. Martin SkutellaVeröffentlichungen

Inhalt des Dokuments

zur Navigation

Publikationen

Eisenbrand, Friedrich and Grandoni, Fabrizio and Oriolo, Gianpaolo and Skutella, Martin.
New Approaches for Virtual Private Network Design.
In Caires, Luís and Italiano, Giuseppe F. and Monteiro, Lu'\is and Palamidessi, Catuscia and Yung, Moti, eds. Automata, Languages and Programming, Lecture Notes in Computer Science, 3580: 1151–1162. Springer, 2005.


Eisenbrand, Friedrich and Hähnle, Nicolai and Niemeier, Martin and Skutella, Martin and Verschae, José and Wiese, Andreas.
Scheduling periodic tasks in a hard real-time environment.
In Abramsky, Samson and Gavoille, Cyril and Kirchner, Claude and Meyer auf der Heide, Friedhelm and Spirakis, Paul G., eds. Automata, Languages and Programming (ICALP 2010), Lecture Notes in Computer Science, 6198: 299–311. Springer, 2010.

Link zur Publikation

Eisenbrand, Friedrich and Karrenbauer, Andreas and Skutella, Martin and Xu, Chihao.
Multiline Addressing by Network Flow.
In Azar, Yossi and Erlebach, Thomas, eds. Algorithms – ESA '06, Lecture Notes in Computer Science, 4168: 744–755. Springer, 2006.


Eisenbrand, Friedrich and Kesavan, Karthikeyan and Mattikalli, Raju S. and Niemeier, Martin and Nordsieck, Arnold W. and Skutella, Martin and Verschae, José and Wiese, Andreas.
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods.
In de Berg, Mark and Meyer, Ulrich, eds. Algorithms – ESA '10, Lecture Notes in Computer Science, 6346: 11–22. Springer, 2010.

Link zur Publikation

Epstein, Leah and Levin, Asaf and Marchetti-Spaccamela, Alberto and Megow, Nicole and Mestre, Julián and Skutella, Martin and Stougie, Leen.
Universal sequencing on a single machine.
In Eisenbrand, Friedrich and Shepherd, Bruce, eds. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, 6080: 230–243. Springer, 2010.

Link zur Publikation

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 zur Publikation

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 zur Publikation Link zur Originalpublikation

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 zur Originalpublikation

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 zur Publikation

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

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe