direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationsliste

T

Harks, T., Matuschke, J. and König, F. G..
Approximation Algorithms for Capacitated Location Routing.
Transportation Science, Vol. 47, pp. 3-22, 2013.

Link zur Publikation Link zur Originalpublikation


Harks, T., König, F., Matuschke, J., Richter, A. and Schulz, J..
An integrated approach to tactical transportion planning in logistics networks.
Transportation Science, 2014. To appear.


Ziemke, T., Sering, L., Vargas Koch, L., Zimmer, M., Nagel, K. and Skutella, M..
Flows Over Time as Continuous Limits of Packet-Based Network Simulations.
Transportation Research Procedia, Vol. 52, pp. 123–130, 2021.


Bonifaci, V., Chan, H.-L., Marchetti-Spaccamela, A. and Megow, N..
Algorithms and Complexity for Periodic Real-Time Scheduling.
Transactions on Algorithms, Vol. 9, pp. 601-619, 2012.

Link zur Publikation Link zur Originalpublikation


t

Kranakis, E. and Wiese, A..
Local PTAS for Independent Set and Vertex Cover in Location Aware UDGs.
In Distributed Computing in Sensor Systems (DCOSS 2008), pp. 415–431, Springer, 2008.


Kranakis, E. and Wiese, A..
Local PTAS for Dominating and Connected Dominating Set in Location Aware UDGs.
In Approximation and Online Algorithms (WAOA 2008), pp. 227-240, Springer, 2008.


T

Harks, T., Klimm, M. and Möhring, R. H..
Characterizing the Existence of Potential Functions in Weighted Congestion Games.
Theory of Computing Systems, Vol. 49, pp. 46 – 70, 2011.


Koch, R. and Skutella, M..
Nash Equilibria and the Price of Anarchy for Flows Over Time.
Theory of Computing Systems, Vol. 49, pp. 71–97, 2011.

Link zur Publikation


Koch, R., Skutella, M. and Spenke, I..
Maximum k-Splittable s,t-Flows.
Theory of Computing Systems, Vol. 43, pp. 56–66, 2008.

Link zur Publikation


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


Disser, Y., Ghosh, S. K., Mihalák, M. and Widmayer, P..
Mapping a polygon with holes using a compass.
Theoretical Computer Science, Vol. 553, pp. 106–113, 2014.

Link zur Publikation


Megow, N., Mehlhorn, K. and Schweitzer, P..
Online graph exploration: New results on old and new algorithms.
Theoretical Computer Science, Vol. 463, pp. 62-72, 2012. Special Issue on Theory and Applications of Graph Searching Problems.

Link zur Publikation Link zur Originalpublikation


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.


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


S

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


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


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


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


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.


P

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

Link zur Originalpublikation


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.


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.


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


O

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


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


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.




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


Zusatzinformationen / Extras