TU Berlin

Prof. Dr. Martin SkutellaVeröffentlichungen

Inhalt des Dokuments

zur Navigation

Publikationen

2016

Skutella, Martin and Sviridenko, Maxim and Uetz, Marc.
Unrelated Machine Scheduling with Stochastic Processing Times.
Mathematics of Operations Research, 41: 851–864, 2016.


Skutella, Martin and Verschae, José.
Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures.
Mathematics of Operations Research, 41: 991–1021, 2016.



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.


2017

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

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.


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.


2018

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.


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

Matusche, Jannik and Skutella, Martin, and Soto, José.
Robust randomized matchings.
Mathematics of Operations Research, 43: 675-692, 2018.


Groß, Martin and Pfetsch, Marc E. and Skutella, Martin.
On the Complexity of Instationary Gas Flows.
Operations Research Letters, 46: 286-290, 2018.


Sering, Leon and Skutella, Martin.
Multi-Source Multi-Sink Nash Flows Over Time.
In Borndörfer, R. and Storandt, S., eds. Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018), OASICS, 65:  12:1-12:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.

Link zur Originalpublikation

2019

Cseh, Ágnes and Skutella, Martin.
Paths to stable allocations.
International Journal of Game Theory, 48: 835–862, 2019.


Groß, Martin and Pfetsch, Marc E. and Schewe, Lars and Schmidt, Martin and Skutella, Martin.
Algorithmic results for potential-based flows: Easy and hard cases.
Networks, 73: 306–324, 2019.


Disser, Yann and Skutella, Martin.
The Simplex Algorithm Is NP-Mighty.
ACM Transactions on Algorithms, 15: 5:1–5:19, 2019.


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