TU Berlin

Prof. Dr. Martin SkutellaVeröffentlichungen

Inhalt des Dokuments

zur Navigation

Publikationen

A

Afrati, Foto and Bampis, Evripidis and Chekuri, Chandra and Karger, David and Kenyon, Claire and Khanna, Sanjeev and Milis, Ioannis and Queyranne, Maurice and Skutella, Martin and Stein, Cliff and Sviridenko, Maxim.
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.
In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science,  32–43. New York City, NY, 1999.

Link zur Publikation

Althaus, Ernst and Funke, Stefan and Har-Peled, Sariel and Könemann, Jochen and Ramos, Edgar A. and Skutella, Martin.
Approximating k-Hop Minimum-Spanning Trees.
Operations Research Letters, 33: 115–120, 2005.

Link zur Publikation

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

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.
In Proceedings of the 13th Annual ACM–SIAM Symposium on Discrete Algorithms,  568–577. San Francisco, CA, 2002.


Arulselvan, Ashwin and Groß, Martin and Skutella, Martin.
Graph Orientation and Flows Over Time.
Networks, 66: 196-209, 2015.


Arulselvan, Ashwin and Maurer, Olaf and Skutella, Martin.
An incremental algorithm for the uncapacitated facility location problem.
Networks, 65: 306-311, 2015.


Arulselvan, Ashwin and Groß, Martin and Skutella, Martin.
Graph Orientation and Flows Over Time.
In Ahn, Hee-Kap and Shin, Chan-Su, eds. Algorithms and Computation, Lecture Notes in Computer Science, 8889:  741–752. Springer International Publishing, 2014.

Link zur Originalpublikation

B

Baier, Georg and Erlebach, Thomas and Hall, Alex and Köhler, Ekkehard and Kolman, Petr and Pangr\?ac, Ond\vrej and Schilling, Heiko and Skutella, Martin.
Length-Bounded Cuts and Flows.
ACM Transactions on Algorithms, 7: 4, 2010.

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.


Baier, Georg and Köhler, Ekkehard and Skutella, Martin.
On the k-splittable flow problem.
In Möhring, Rolf H. and Raman, Rajeev, eds. Algorithms – ESA '02, Lecture Notes in Computer Science, 2461: 101–113. Springer, 2002.


Baier, Georg and Köhler, Ekkehard and Skutella, Martin.
On the k-splittable flow problem.
Algorithmica, 42: 231–248, 2005.

Link zur Publikation

Baumann, Nadine and Skutella, Martin.
Solving Evacuation Problems Efficiently: Earliest Arrival Flows with Multiple Sources.
Mathematics of Operations Research, 34: 499–512, 2009.

Link zur Publikation

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


Becchetti, Luca and Korteweg, Peter and Marchetti-Spaccamela, Alberto and Skutella, Martin and Stougie, Leen and Vitaletti, Andrea.
Latency Constrained Aggregation in Sensor Networks.
In Azar, Yossi and Erlebach, Thomas, eds. Algorithms – ESA '06, Lecture Notes in Computer Science, 4168: 88–99. Springer, 2006.


Becchetti, Luca and Korteweg, Peter and Marchetti-Spaccamela, Alberto and Skutella, Martin and Stougie, Leen and Vitaletti, Andrea.
Latency Constrained Aggregation in Sensor Networks.
ACM Transactions on Algorithms, 6: 13:1–13:20, 2009.

Link zur Publikation

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

Direktzugang

Schnellnavigation zur Seite über Nummerneingabe