direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationsliste

N

Arulselvan, A., Maurer, O. and Skutella, M..
An incremental algorithm for the uncapacitated facility location problem.
Networks, Vol. 65, pp. 306-311, 2015.


Groß, M., Pfetsch, M. E., Schewe, L., Schmidt, M. and Skutella, M..
Algorithmic results for potential-based flows: Easy and hard cases.
Networks, Vol. 73, pp. 306–324, 2019.


Büsing, C. and Stiller, S..
Line planning, path constrained network flow, and inapproximability.
Networks, Vol. 57, pp. 106-113, 2011.


Martens, M. and Skutella, M..
Flows on Few Paths: Algorithms and Lower Bounds.
Networks, Vol. 48, pp. 68–76, 2006.

Link zur Publikation



Bley, A..
Approximability of Unsplittable Shortest Path Routing Problems.
Networks, Vol. 54, pp. 23–46, 2009. Short version appeared in Proceedings of IPCO 2005..

Link zur Publikation


Harks, T., Kleinert, I., Klimm, M. and Möhring, R. H..
Computing network tolls with support constraints.
Networks, Vol. 65, pp. 262-285, 2015.


O

Groß, M. and Skutella, M..
A tight bound on the speed-up through storage for quickest multi-commodity flows.
Operation Research Letters, Vol. 43, pp. 93–95, 2015.

Link zur Originalpublikation


Caprara, A., Galli, L., Stiller, S. and Toth, P..
Delay-Robust Event Scheduling.
Operations Research, Vol. 62, pp. 274-283, 2014.

Link zur Publikation


Bertsimas, D., Nasrabadi, E. and Stiller, S..
Robust and Adaptive Network Flows.
Operations Research, Vol. 61, pp. 1218-1242, 2013.

Link zur Publikation




Althaus, E., Funke, S., Har-Peled, S., Könemann, J., Ramos, E. A. and Skutella, M..
Approximating k-Hop Minimum-Spanning Trees.
Operations Research Letters, Vol. 33, pp. 115–120, 2005.

Link zur Publikation


Matuschke, J., McCormick, S., Oriolo, G., Peis, B. and Skutella, M..
Protection of flows under targeted attacks.
Operations Research Letters, Vol. 45, pp. 53-59, 2017.


Grandoni, F., Kaibel, V., Oriolo, G. and Skutella, M..
A short proof of the VPN tree routing conjecture on ring networks.
Operations Research Letters, Vol. 36, pp. 361–365, 2008.

Link zur Publikation


Megow, N. and Schulz, A. S..
On-line scheduling to minimize average completion time revisited.
Operations Research Letters, Vol. 32, pp. 485-490, 2004.

Link zur Publikation Link zur Originalpublikation


Salazar, F. and Skutella, M..
Single-source k-splittable min-cost flows.
Operations Research Letters, Vol. 37, pp. 71–74, 2009.

Link zur Publikation


Groß, M., Pfetsch, M. E. and Skutella, M..
On the Complexity of Instationary Gas Flows.
Operations Research Letters, Vol. 46, pp. 286-290, 2018.


Burlacu, R., Egger, H., Groß, M., Martin, A., Pfetsch, M. E., Schewe, L., Sirvent, M. and Skutella, M..
Maximizing the storage capacity of gas networks: a global MINLP approach.
Optimization and Engineering, Vol. 20, pp. 543-–573, 2019.


Gellert, T., Höhn, W. and Möhring, R. H..
Sequencing and scheduling for filling lines in dairy production.
Optimization Letters, Vol. 5, pp. 491–504, 2011. Special issue of SEA 2011.

Link zur Originalpublikation


Froyland, G., Koch, T., Megow, N., Duane, E. and Wren, H..
Optimizing the Landside Operation of a Container Terminal.
OR Spectrum, Vol. 30, pp. 53-75, 2008.

Link zur Publikation


P

Wilms, J., Disser, Y., Alber, G. and Percival, I. C..
Local Realism, Detection Efficiencies, and Probability Polytopes.
Physical Review A, Vol. 73, pp. 032116(8), 2008.

Link zur Publikation


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


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


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

Link zur Originalpublikation


R

Baruah, S. K., Bonifaci, V., Marchetti-Spaccamela, A. and Stiller, S..
Improved multiprocessor global schedulability analysis.
Real-Time Systems, Vol. 46, pp. 3-24, 2010.


S

Megow, N., Skutella, M., Verschae, J. and Wiese, A..
The Power of Recourse for Online MST and TSP.
SIAM Journal on Computing, Vol. 45, pp. 859-880, 2016.


Eisenbrand, F., Grandoni, F., Oriolo, G. and Skutella, M..
New Approaches for Virtual Private Network Design.
SIAM Journal on Computing, Vol. 37, pp. 706–721, 2007.

Link zur Publikation


Megow, N., Meißner, J. and Skutella, M..
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty.
SIAM Journal on Computing, pp. 1217 - 1240, 2017.

Link zur Publikation Link zur Originalpublikation


Fleischer, L. and Skutella, M..
Quickest Flows Over Time.
SIAM Journal on Computing, Vol. 36, pp. 1600–1630, 2007.

Link zur Publikation


Epstein, L., Levin, A., Mestre, J., Marchetti-Spaccamela, A., Megow, N., Skutella, M. and Stougie, L..
Universal sequencing on a single unreliable machine.
SIAM Journal on Computing, Vol. 41, pp. 565-586, 2012.

Link zur Publikation Link zur Originalpublikation


Möhring, R. H., Skutella, M. and Stork, F..
Scheduling with AND/OR Precedence Constraints.
SIAM Journal on Computing, Vol. 33, pp. 393–415, 2004.

Link zur Publikation


Fischer, F. and Klimm, M..
Optimal Impartial Selection.
SIAM Journal on Computing, Vol. 44, pp. 1263-1285, 2015.

Link zur Publikation


Skutella, M. and Uetz, M..
Stochastic machine scheduling with precedence constraints.
SIAM Journal on Computing, Vol. 34, pp. 788–802, 2005.

Link zur Publikation


Goemans, M. X., Queyranne, M., Schulz, A. S., Skutella, M. and Wang, Y..
Single machine scheduling with release dates.
SIAM Journal on Discrete Mathematics, Vol. 15, pp. 165–192, 2002.

Link zur Publikation


Bernstein, A., Däubel, K., Disser, Y., Klimm, M., Mütze, T. and Smolny, F..
Distance-Preserving Graph Contractions.
SIAM Journal on Discrete Mathematics, Vol. 33, pp. 1607-1636, 2019.

Link zur Originalpublikation


Skutella, M..
A note on the ring loading problem.
SIAM Journal on Discrete Mathematics, Vol. 30, pp. 327–342, 2016.


Schulz, A. S. and Skutella, M..
Scheduling Unrelated Machines by Randomized Rounding.
SIAM Journal on Discrete Mathematics, Vol. 15, pp. 450–469, 2002.

Link zur Publikation


Felsner, S., Kleist, L., Mütze, T. and Sering, L..
Rainbow Cycles in Flip Graphs.
SIAM Journal on Discrete Mathematics, Vol. 34, pp. 1-39, 2020.

Link zur Originalpublikation


Köhler, E. and Skutella, M..
Flows over time with load-dependent transit times.
SIAM Journal on Optimization, Vol. 15, pp. 1185–1202, 2005.

Link zur Publikation


Berger, A., Hoffmann, R., Lorenz, U. and Stiller, S..
Online railway delay management: Hardness, simulation and computation.
Simulation, Vol. 87, pp. 616-629, 2011.


T

Bley, A., Koster, A. M., Kröller, A., Wessäly, R. and Zymolka, A..
Kosten- und Qualitätsoptimierung in Kommunikationsnetzen.
Tele-Kommunikation Aktuell, Vol. 07/08, 2003.

Link zur Publikation


Bley, A., Martens, M., Menne, U. and Wessäly, R..
Integrated optimization of aggregation and core for varying NGN architectures.
Telecommunication Systems, 2011. To appear.


Disser, Y., Feldmann, A., Klimm, M. and Mihalák, M..
Improving the Hk-bound on the price of stability in undirected Shapley network design games.
Theoretical Computer Science, Vol. 562, pp. 557–564, 2015.

Link zur Publikation


Doerr, B., Eremeev, A. V., Neumann, F., Theile, M. and Thyssen, C..
Evolutionary Algorithms and Dynamic Programming.
Theoretical Computer Science, Vol. (to appear), 2011.

Link zur Publikation


Bilò, D., Disser, Y., Mihalák, M., Suri, S., Vicari, E. and Widmayer, P..
Reconstructing Visibility Graphs with Simple Robots.
Theoretical Computer Science, Vol. 444, pp. 52–59, 2012.

Link zur Publikation


Gutiérrez, S., Krumke, S. O., Megow, N. and Vredeveld, T..
How to whack moles.
Theoretical Computer Science, Vol. 361, pp. 329–341, 2006.

Link zur Publikation Link zur Originalpublikation


Chan, H.-L., Megow, N., Sitters, R. and van Stee, R..
The offline sorting buffer problem is NP-hard.
Theoretical Computer Science, Vol. 423, pp. 11–18, 2012.

Link zur Publikation Link zur Originalpublikation


Hall, A., Hippler, S. and Skutella, M..
Multicommodity Flows Over Time: Efficient Algorithms and Complexity.
Theoretical Computer Science, Vol. 379, pp. 387–404, 2007.

Link zur Publikation


Kappmeier, J.-P. W., Matuschke, J. and Peis, B..
Abstract flows over time: A first step towards solving dynamic packing problems.
Theoretical Computer Science, Vol. 544, pp. 74-85, 2014.

Link zur Publikation Link zur Originalpublikation


Zusatzinformationen / Extras