direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Publications

2010

Eisenbrand, Friedrich and Hähnle, Nicolai and Niemeier, Martin and Skutella, Martin and Verschae, José and Wiese, Andreas.
Scheduling periodic tasks in a hard real-time environment.
In Abramsky, Samson and Gavoille, Cyril and Kirchner, Claude and Meyer auf der Heide, Friedhelm and Spirakis, Paul G., eds. Automata, Languages and Programming (ICALP 2010), Lecture Notes in Computer Science, 6198: 299–311. Springer, 2010.

Link to publication

Eisenbrand, Friedrich and Kesavan, Karthikeyan and Mattikalli, Raju S. and Niemeier, Martin and Nordsieck, Arnold W. and Skutella, Martin and Verschae, José and Wiese, Andreas.
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods.
In de Berg, Mark and Meyer, Ulrich, eds. Algorithms – ESA '10, Lecture Notes in Computer Science, 6346: 11–22. Springer, 2010.

Link to publication

Epstein, Leah and Levin, Asaf and Marchetti-Spaccamela, Alberto and Megow, Nicole and Mestre, Julián and Skutella, Martin and Stougie, Leen.
Universal sequencing on a single machine.
In Eisenbrand, Friedrich and Shepherd, Bruce, eds. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, 6080: 230–243. Springer, 2010.

Link to publication

Peis, Britta and Skutella, Martin and Wiese, Andreas.
Packet Routing: Complexity and Algorithms.
In Bampis, Evripidis and Jansen, Klaus, eds. Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 2009. Revised Papers, Lecture Notes in Computer Science, 5893: 217–228. Springer, 2010.

Link to publication

Skutella, Martin and Peis, Britta and Wiese, Andreas.
Packet Routing on the Grid.
In Lopez-Ortiz, Alejandro, eds. Theoretical Informatics, 9th Latin American Symposium, LATIn 2010, Oaxaca, Mexico, Lecture Notes in Computer Science, Springer, 6034:  120-130. , 2010.


Reichel, Joachim and Skutella, Martin.
Evolutionary Algorithms and Matroid Optimization Problems.
Algorithmica, 57: 187–206, 2010.

Link to publication

Schmidt, Melanie and Skutella, Martin.
Earliest Arrival Flows in Networks with Multiple Sinks.
Electronic Notes in Discrete Mathematics, 36: 607–614, 2010. ISCO 2010 – International Symposium on Combinatorial Optimization.

Link to publication

Skutella, Martin and Verschae, José.
A Robust PTAS for Machine Covering and Packing.
In de Berg, Mark and Meyer, Ulrich, eds. Algorithms – ESA '10, Lecture Notes in Computer Science, 6346: 36–47. Springer, 2010.

Link to publication

Skutella, Martin and Weber, Alexia.
On the dominant of the s-t-cut polytope.
Mathematical Programming, 124: 441–454, 2010.

Link to publication

2011

Dressler, Daniel and Flötteröd, Gunnar and Lämmel, Gregor and Nagel, Kai and Skutella, Martin.
Optimal Evacuation Solutions for Large-Scale Scenarios.
In Hu, Bo and Morasch, Karl and Pickl, Stefan and Siegle, Markus, eds. Operations Research Proceedings 2010,  239–244. Springer, 2011.


Dressler, Daniel and Skutella, Martin.
An FPTAS for Flows over Time with Aggregated Arc Capacities.
In Jansen, Klaus and Solis-Oba, Roberto, eds. Approximation and Online Algorithms, 8th International Workshop, WAOA 2010, Liverpool, United Kingdom, September 2010. Revised Papers, Lecture Notes in Computer Science, 6534: 106–117. Springer, 2011.

Link to publication

Schmidt, Melanie and Skutella, Martin.
Earliest arrival flows in networks with multiple sinks.
Discrete Applied Mathematics, 2011. http://www.sciencedirect.com/science/article/pii/S0166218X11003593.

Link to publication Link to original publication

Koch, Ronald and Nasrabadi, Ebrahim and Skutella, Martin.
Continuous and discrete flows over time.
Mathematical Methods of Operations Research, 2011. To appear.

Link to publication

Koch, Ronald and Skutella, Martin.
Nash Equilibria and the Price of Anarchy for Flows Over Time.
Theory of Computing Systems, 49: 71–97, 2011.

Link to publication

Neumann, Frank and Reichel, Joachim and Skutella, Martin.
Computing Minimum Cuts by Randomized Search Heuristics.
Algorithmica, 59: 323–342, 2011.

Link to publication

Skutella, Katharina and Skutella, Martin.
Minimum Spanning Trees – Sometimes Greed Pays Off.
In Vöcking, Berthold and Alt, Helmut and Dietzfelbinger, Martin and Reischuk, Rüdiger and Scheideler, Christian and Vollmer, Heribert and Wagner, Dorothea, eds. Algorithms Unplugged,  325–331. Springer, 2011.


Skutella, Martin and Welz, Wolfgang.
Route Planning for Robot Systems.
In Hu, Bo and Morasch, Karl and Pickl, Stefan and Siegle, Markus, eds. Operations Research Proceedings 2010,  307–312. Springer, 2011.


2012

Megow, Nicole and Skutella, Martin and Verschae, Jose and Wiese, Andreas.
The Power of Recourse for Online MST and TSP.
In Proceedings of the 39th International Colloquium on Automata, Languages and Programming (ICALP 2012), Lecture Notes in Computer Science, 7391:  689–-700. Springer, 2012.

Link to publication Link to original publication

Groß, Martin and Skutella, Martin.
Generalized Maximum Flows over Time.
In Persiano, P. and Solis-Oba, R., eds. Proceedings of the 9th Workshop on Approximation and Online Algorithms (WAOA), Lecture Notes in Computer Science, 7164:  247–260. Springer, 2012.


Epstein, Leah and Levin, Asaf and Mestre, Julian and Marchetti-Spaccamela, Alberto and Megow, Nicole and Skutella, Martin and Stougie, Leen.
Universal sequencing on a single unreliable machine.
SIAM Journal on Computing, 41: 565-586, 2012.

Link to publication Link to original publication

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

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions

This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.