TU Berlin

Prof. Dr. Martin Skutella Publications

Page Content

to Navigation

Publications

O

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


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.


P

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.


Skutella, Martin.
A note on the ring loading problem.
Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015) 37-46, 2015.


Cseh, Ágnes and Skutella, Martin.
Paths to stable allocations.
Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014.

Link to original publication

S

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.


Eisenbrand, Friedrich and Grandoni, Fabrizio and Oriolo, Gianpaolo and Skutella, Martin.
New Approaches for Virtual Private Network Design.
SIAM Journal on Computing, 37: 706–721, 2007.

Link to publication

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 to publication Link to original publication

Fleischer, Lisa and Skutella, Martin.
Quickest Flows Over Time.
SIAM Journal on Computing, 36: 1600–1630, 2007.

Link to publication

Epstein, Leah and Levin, Asaf and Mestre, Julian and Marchetti-Spaccamela, Alberto and Megow, Nicole and Skutella, Martin and Stougie, Leen.
Universal sequencing on a single unreliable machine.
SIAM Journal on Computing, 41: 565-586, 2012.

Link to publication Link to original publication

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 to publication

Skutella, Martin and Uetz, Marc.
Stochastic machine scheduling with precedence constraints.
SIAM Journal on Computing, 34: 788–802, 2005.

Link to publication

Goemans, Michel X. and Queyranne, Maurice and Schulz, Andreas S. and Skutella, Martin and Wang, Yaoguang.
Single machine scheduling with release dates.
SIAM Journal on Discrete Mathematics, 15: 165–192, 2002.

Link to publication

Skutella, Martin.
A note on the ring loading problem.
SIAM Journal on Discrete Mathematics, 30: 327–342, 2016.


Schulz, Andreas S. and Skutella, Martin.
Scheduling Unrelated Machines by Randomized Rounding.
SIAM Journal on Discrete Mathematics, 15: 450–469, 2002.

Link to publication

Köhler, Ekkehard and Skutella, Martin.
Flows over time with load-dependent transit times.
SIAM Journal on Optimization, 15: 1185–1202, 2005.

Link to publication

T

Hall, Alex and Hippler, Steffen and Skutella, Martin.
Multicommodity Flows Over Time: Efficient Algorithms and Complexity.
Theoretical Computer Science, 379: 387–404, 2007.

Link to publication

Koch, Ronald and Skutella, Martin.
Nash Equilibria and the Price of Anarchy for Flows Over Time.
Theory of Computing Systems, 49: 71–97, 2011.

Link to publication

Koch, Ronald and Skutella, Martin and Spenke, Ines.
Maximum k-Splittable s,t-Flows.
Theory of Computing Systems, 43: 56–66, 2008.

Link to publication

Ziemke, Theresa and Sering, Leon and Vargas Koch, Laura and Zimmer, Max and Nagel, Kai and Skutella, Martin.
Flows Over Time as Continuous Limits of Packet-Based Network Simulations.
Transportation Research Procedia, 52: 123–130, 2021.


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