TU Berlin

Prof. Dr. Martin SkutellaVeröffentlichungen

Inhalt des Dokuments

zur Navigation

Publikationen

P

Peis, Britta and Skutella, Martin and Wiese, Andreas.
Throughput Maximization for Periodic Packet Routing on Trees and Grids.
In Jansen, Klaus and Solis-Oba, Roberto, eds. Approximation and Online Algorithms, 8th International Workshop, WAOA 2009, Lecture Notes in Computer Science, Springer, 6534:  213-224. , 2010.


Peis, Britta and Skutella, Martin and Wiese, Andreas.
Packet Routing: Complexity and Algorithms.
In Bampis, Evripidis and Jansen, Klaus, eds. Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, Lecture Notes in Computer Science, Springer, 5893:  217–228. , 2010.


Peis, Britta and Skutella, Martin and Wiese, Andreas.
Packet Routing: Complexity and Algorithms.
In Bampis, Evripidis and Jansen, Klaus, eds. Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 2009. Revised Papers, Lecture Notes in Computer Science, 5893: 217–228. Springer, 2010.

Link zur Publikation

N

Neumann, Frank and Polyakovskiy, Sergey and Skutella, Martin and Stougie, Leen and Wu, Junhua.
A Fully Polynomial Time Approximation Scheme for Packing While Traveling.
In Disser, Yann and Verykios, Vassilios S., eds. Algorithmic Aspects of Cloud Computing – Fourth International Workshop, ALGOCLOUD 2018, Lecture Notes in Computer Science, 11409: 59–72. Springer, 2018.


Neumann, Frank and Reichel, Joachim and Skutella, Martin.
Computing Minimum Cuts by Randomized Search Heuristics.
Algorithmica, 59: 323–342, 2011.

Link zur Publikation

Neumann, Frank and Reichel, Joachim and Skutella, Martin.
Computing Minimum Cuts by Randomized Search Heuristics.
In Proceedings of the 10th Genetic and Evolutionary Computation Conference,  779–787. , 2008.


M

Möhring, Rolf H. and Skutella, Martin and Stork, Frederik.
Scheduling with AND/OR Precedence Constraints.
SIAM Journal on Computing, 33: 393–415, 2004.

Link zur Publikation

Möhring, Rolf H. and Skutella, Martin and Stork, Frederik.
Forcing Relations for AND/OR Precedence Constraints.
In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms,  235–236. San Francisco, CA, 2000.


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.


Megow, Nicole and Skutella, Martin and Verschae, José and Wiese, Andreas.
The Power of Recourse for Online MST and TSP.
SIAM Journal on Computing, 45: 859-880, 2016.


Megow, Nicole and Meißner, Julie and Skutella, Martin.
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty.
SIAM Journal on Computing 1217 - 1240, 2017.

Link zur Publikation Link zur Originalpublikation

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

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

Matuschke, Jannik and McCormick, S. Thomas and Oriolo, Gianpaolo and Peis, Britta and Skutella, Martin.
Protection of flows under targeted attacks.
Operations Research Letters, 45: 53-59, 2017.


Matuschke, Jannik and Skutella, Martin and Soto, José.
Robust randomized matchings.
Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015) 1904-1915, 2015.


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