Reichel, J. and Skutella, M..
Evolutionary Algorithms and Matroid Optimization Problems.
In Proceedings of the 9th Genetic and Evolutionary Computation Conference, pp. 947–954, 2007.

Bley, A..
Inapproximability Results for the Inverse Shortest Paths Problem with Integer Lengths and Unique Shortest Paths.
Networks, Vol. 50, pp. 29-36, 2007.

Link zur Publikation

Bley, A..
Routing and Capacity Optimization for IP Networks.
In Operations Research Proceedings 2007: Selected Papers of the Annual International Conference of the German Operations Research Society, Saarbrücken, Germany, pp. 9–16, Springer, 2007.

Link zur Publikation

Bley, A..
Routing and Capacity Optimization for IP Networks.
Doctoral thesis, TU Berlin, 2007.

Link zur Publikation

Arkin, E. M., Bender, M. A., Fekete, S. P., Mitchell, J. S. B. and Skutella, M..
The freeze-tag problem: How to wake up a swarm of robots.
Algorithmica, Vol. 46, pp. 193-221, 2006.

Link zur Publikation

Baier, G., Erlebach, T., Hall, A., Köhler, E., Schilling, H. and Skutella, M..
Length-Bounded Cuts and Flows.
In Bugliesi, Michele and Preneel, Bart and Sassone, Vladimiro and Wegener, Ingo (ed.), Automata, Languages and Programming, pp. 679–690, Springer, 2006.

Korach, E., Peis, B. and Thánh, N..
Subgraph Characterization of Red/Blue-Split Graphs and König-Egerváry Graphs.
In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, ACM Press, pp. 842-850, 2006.

Baumann, N. and Skutella, M..
Solving Evacuation Problems Efficiently: Earliest Arrival Flows with Multiple Sources.
In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 399–408, Berkeley, CA, 2006.

Hochstättler, W., Nickel, R. and Peis, B..
Two disjoint negative cycles in a signed graph.
In Faigle, Ulrich and Hurink, Johann and Schrader, Rainer and Schultz, Rüdiger (ed.), Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Lambrecht, Germany, pp. 107-111, 2006.

Becchetti, L., Korteweg, P., Marchetti-Spaccamela, A., Skutella, M., Stougie, L. and Vitaletti, A..
Latency Constrained Aggregation in Sensor Networks.
In Azar, Yossi and Erlebach, Thomas (ed.), Algorithms – ESA '06, pp. 88–99, Springer, 2006.

Peis, B..
Structure Analysis of Some Generalizations of Matchings and Matroids Under Algorithmic Aspects.
Doctoral thesis, Universiät zu Köln, 2006.

Neumann, G., Tammer, C., Weinkauf, R. and Welz, W..
A GIS-based Decision Support for Multicriteria Location-Routing Problems.
In Küfer, Karl-Heinz and Rommelfanger, Heinrich and Tammer, Christiane and Winkler, Kristin (ed.), Multicriteria Decision Making and Fuzzy Systems. Theory, Methods and Applications, pp. 157-173, Aachen: Shaker Verlag, 2006.

Eisenbrand, F., Karrenbauer, A., Skutella, M. and Xu, C..
Multiline Addressing by Network Flow.
In Azar, Yossi and Erlebach, Thomas (ed.), Algorithms – ESA '06, pp. 744–755, Springer, 2006.

Spenke, I..
Complexity and Approximation of Static k-Splittable Flows and Dynamic Grid Flows.
Doctoral thesis, TU Berlin, 2006.

Megow, N..
Coping with Incomplete Information in Scheduling - Stochastic and Online Models.
Doctoral thesis, TU Berlin, 2006.

Link zur Publikation

Schilling, H..
Route Assignment Problems in Large Networks.
Doctoral thesis, TU Berlin, 2006.

Link zur Publikation

Liebchen, C..
Periodic Timetable Optimization in Public Transport.
Doctoral thesis, TU Berlin, 2006.

Megow, N., Uetz, M. and Vredeveld, T..
Models and Algorithms for Stochastic Online Scheduling.
Mathematics of Operations Research, Vol. 31, pp. 513–525, 2006.

Link zur Publikation Link zur Originalpublikation

Megow, N. and Vredeveld, T..
Approximation in Preemptive Stochastic Online Scheduling.
In Proceedings of 14th European Symposium on Algorithms (ESA'06), Lecture Notes in Computer Science, Vol. 4168, pp. 516–527, Springer, 2006.

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

Heinz, S., Krumke, S. O., Megow, N., Rambau, J., Tuchscherer, A. and Vredeveld, T..
The Online Target Date Assignment Problem.
In Approximation and Online Algorithms (WAOA'05), Lecture Notes in Computer Science, Vol. 3879, pp. 192-205, Springer, 2006.

Link zur Publikation Link zur Originalpublikation

Koch, R., Skutella, M. and Spenke, I..
Approximation and Complexity of k-Splittable Flows.
In Erlebach, Thomas and Persiano, Giuseppe (ed.), Proceedings of the Third International Workshop on Approximation and Online Algorithms, pp. 244–257, Springer, 2006.

Martens, M. and Skutella, M..
Length-Bounded and Dynamic k-Splittable Flows.
In Haasis, Hans-Dietrich and Kopfer, Herbert and Schönberger, Jörn (ed.), Operations Research Proceedings 2005, pp. 297–302, Springer, 2006.

Link zur Publikation

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

Link zur Publikation

Skutella, M..
List Scheduling in Order of α-Points on a Single Machine.
In Bampis, Evripidis and Jansen, Klaus and Kenyon, Claire (ed.), Efficient Approximation and Online Algorithms: Recent Progress on Classical Combinatorial Optimization Problems and New Applications, pp. 250–291, Springer, 2006.

Link zur Publikation

Bley, A. and Koch, T..
Integer Programming Approaches to Access and Backbone IP-Network Planning.
In Modeling, Simulation and Optimization of Complex Processes: Proceedings of the 3rd International Conference on High Performance Scientific Computing, Hanoi, Vietnam, pp. 87–110, Springer, 2006.

Link zur Publikation

Bley, A., Kupzog, F. and Zymolka, A..
Auslegung heterogener Kommunikationsnetze nach Performance und Wirtschaftlichkeit.
In Proceedings of the 11th Kasseler Symposium Energie-Systemtechnik: Energie und Kommunikation, Kassel, Germany, pp. 84–97, ISET Kassel, 2006.

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

Baier, G., Köhler, E. and Skutella, M..
On the k-splittable flow problem.
Algorithmica, Vol. 42, pp. 231–248, 2005.

Link zur Publikation

Eisenbrand, F., Grandoni, F., Oriolo, G. and Skutella, M..
New Approaches for Virtual Private Network Design.
In Caires, Luís and Italiano, Giuseppe F. and Monteiro, Lu'\is and Palamidessi, Catuscia and Yung, Moti (ed.), Automata, Languages and Programming, pp. 1151–1162, Springer, 2005.

Megow, N., Uetz, M. and Vredeveld, T..
Stochastic Online Scheduling on Parallel Machines.
In Approximation and Online Algorithms (WAOA'04), Lecture Notes in Computer Science, Vol. 3351, pp. 167-180, Springer, 2005.

Link zur Publikation Link zur Originalpublikation

Baumann, N. and Stiller, S..
Network Analysis: Methodological Foundations.
In Ulrik Brandes and Thomas Erlebach (ed.), Network Analysis, Lecture Notes in Computer Science, Vol. 3418, pp. 341-372, Springer, 2005.

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

König, F. G..
Verkehrsoptimierung unter Routennebenbedingungen mit Lagrange-Relaxation und Schnittebenenverfahren.
Diploma thesis, Technische Universität Berlin, 2005. Supervisor: Rolf H. Möhring. Won the GOR-Diplomarbeitspreis 2006 (Master Thesis Award of the German Association for Operations Research). In German.

Katriel, I., Kutz, M. and Skutella, M..
Reachability Substitutes for Planar Digraphs.
Preprint MPI-I-2005-1-002, Max-Planck-Institut für Informatik, 2005.

Link zur Publikation

Magnanti, T. L., Sivaraman, R. and Skutella, M..
Linear Programming, Quickest Flows, and Time Cost Trade-offs.
In Proceedings of the 2nd International Network Optimization Conference, 2005.

Link zur Publikation

Bley, A..
Finding Small Administrative Lengths for Shortest Path Routing.
In Proceedings of the 2nd International Network Optimization Conference (INOC 2005), Lisbon, Portugal, pp. 121–128, 2005.

Bley, A..
On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem.
In Integer Programming and Combinatorial Optimization: Proceedings of the 11th Conference on Integer Programming and Combinatorial Optimization (IPCO 2005), Berlin, Germany, LNCS, pp. 97–110, Springer, 2005.

Bley, A. and Pattloch, M..
Modellierung und Optimierung der X-WiN Plattform.
DFN-Mitteilungen, Vol. 67, pp. 4–7, 2005.

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

Bosio, D., D., C., Groep, D., Guy, L., Reale, M., Salomoni, D., Templon, J. and Theile, M..
Distributed Testing Infrastructure and Processes for the EGEE Grid Middleware.
In Computing in High Energy and Nuclear Physics Conference (CHEP), pp. 754–757, 2004.

Goemans, M. X. and Skutella, M..
Cooperative facility location games.
Journal of Algorithms, Vol. 50, pp. 194–214, 2004.

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

Krumke, S. O., Megow, N. and Vredeveld, T..
How to Whack Moles.
In Approximation and Online Algorithms (WAOA'03), Lecture Notes in Computer Science, Vol. 2909, pp. 192–205, Springer, 2004.

Megow, N. and Schulz, A. S..
Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms.
In Approximation and Online Algorithms (WAOA'03), Lecture Notes in Computer Science, Vol. 2909, pp. 227–234, Springer, 2004.

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

Martens, M. and Skutella, M..
Flows on Few Paths: Algorithms and Lower Bounds.
In Albers, Susanne and Radzik, Tomasz (ed.), Algorithms – ESA '04, pp. 520–531, Springer, 2004.

Sanders, P., Sivadasan, N. and Skutella, M..
Online Scheduling with Bounded Migration.
In Diaz, Josep and Karhumäki, Juhani and Lepistö, Arto and Sannella, Donald (ed.), Automata, Languages and Programming, pp. 1111–1122, Springer, 2004.

Bley, A., Koch, T. and Wessäly, R..
Large-scale Hierarchical Networks: How to Compute an Optimal Architecture?..
In H. Kaindl (ed.), Proceedings of the 8th International Telecommunications Network Strategy and Planning Symposium (NETWORKS 2004), Vienna, Austria, pp. 429–434, VDE Verlag, 2004.

Link zur Publikation

Bley, A., Koster, A. M., Wessäly, R. and Zymolka, A..
Kostenoptimierung mit Garantie: Konfiguration und Design von Transportnetzen.
In Proceedings of the 6th ITG-Fachtagung Photonische Netze, Leipzig, Germany, VDE Verlag, 2004.

Link zur Publikation