direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments



Marchetti-Spaccamela, Alberto and Megow, Nicole and Schlöter, Jens and Skutella, Martin and Stougie, Leen.
On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems.
In Proceedings of the 34th IEEE International Parallel and Distributed Processing Symposium, . , 2020.

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.


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.

Burlacu, Robert and Egger, Herbert and Groß, Martin and Martin, Alexander and Pfetsch, Marc E. and Schewe, Lars and Sirvent, Mathias and Skutella, Martin.
Maximizing the storage capacity of gas networks: a global MINLP approach.
Optimization and Engineering, 20: 543-–573, 2019.


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.


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.

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

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.

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe

Diese Seite verwendet Matomo für anonymisierte Webanalysen. Mehr Informationen und Opt-Out-Möglichkeiten unter Datenschutz.