direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments



Skutella, Martin.
An Introduction to Network Flows Over Time.
In Cook, William and Lovász, László and Vygen, Jens, eds. Research Trends in Combinatorial Optimization,  451–482. Springer, 2009.

Link zur Publikation


Biermann, Dirk and Surmann, Tobias and Sacharow, Alexei and Skutella, Martin and Theile, Madeleine.
Automated analysis of the form error caused by springback in metal sheet forming.
In Bouzakis, Konstantinos-Dionysios, eds. Proceedings of the 3rd International Conference on Manufacturing Engineering, 1.-3. October 2008, Kallithea of Chalkidiki, Greece,  737–746. , 2008.

Link zur Publikation

Grandoni, Fabrizio and Kaibel, Volker and Oriolo, Gianpaolo and Skutella, Martin.
A short proof of the VPN tree routing conjecture on ring networks.
Operations Research Letters, 36: 361–365, 2008.

Link zur Publikation

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

Link zur Publikation

Martens, Maren and Skutella, Martin.
A Network Flow Problem with Unit Path Capacities and Related Packing and Covering Problems.
In Yang, Boting and Du, Ding-Zhu and Wang, Cao An, eds. Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications, Lecture Notes in Computer Science, 5165:  180–189. Springer, 2008.

Neumann, Frank and Reichel, Joachim and Skutella, Martin.
Computing Minimum Cuts by Randomized Search Heuristics.
In Proceedings of the 10th Genetic and Evolutionary Computation Conference,  779–787. , 2008.

Skutella, Katharina and Skutella, Martin.
Minimal aufspannende Bäume – Wenn das Naheliegende das Beste ist....
In Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk, Karl Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea, eds. Taschenbuch der Algorithmen,  353–360. Springer, 2008. In German.

Link zur Publikation


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 zur Publikation

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

Link zur Publikation

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

Link zur Publikation

Hall, Alex and Langkau, Katharina and Skutella, Martin.
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.
Algorithmica, 47: 299–321, 2007.

Link zur Publikation

Martens, Maren and Salazar, Fernanda and Skutella, Martin.
Convex Combinations of Single Source Unsplittable Flows.
In Arge, Lars and Welzl, Emo, eds. Algorithms – ESA '07, Lecture Notes in Computer Science, 4698: 395–406. Springer, 2007.

Link zur Publikation

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


Arkin, Esther M. and Bender, Michael A. and Fekete, Sándor P. and Mitchell, Joseph S. B. and Skutella, Martin.
The freeze-tag problem: How to wake up a swarm of robots.
Algorithmica, 46: 193-221, 2006.

Link zur Publikation

Baier, Georg and Erlebach, Thomas and Hall, Alex and Köhler, Ekkehard and Schilling, Heiko and Skutella, Martin.
Length-Bounded Cuts and Flows.
In Bugliesi, Michele and Preneel, Bart and Sassone, Vladimiro and Wegener, Ingo, eds. Automata, Languages and Programming, Lecture Notes in Computer Science, 4051: 679–690. Springer, 2006.

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.