direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Publications

C

Cseh, Ágnes and Skutella, Martin.
Paths to stable allocations.
International Journal of Game Theory, 48: 835–862, 2019.


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

Link to original publication

Cseh, Ágnes and Matuschke, Jannik and Skutella, Martin.
Stable Flows over Time.
Algorithms, 6: 532–545, 2013.

Link to publication Link to original publication

D

Disser, Yann and Skutella, Martin.
The Simplex Algorithm Is NP-Mighty.
ACM Transactions on Algorithms, 15: 5:1–5:19, 2019.


Disser, Yann and Skutella, Martin.
The Simplex Algorithm is NP-mighty.
In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA),  858-872. , 2015.

Link to publication

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 Groß, Martin and Kappmeier, Jan-Philipp and Kelter, Timon and Kulbatzki, Joscha and Plümpe, Daniel and Schlechter, Gordon and Schmidt, Melanie and Skutella, Martin and Temme, Sylvie.
On the use of network flow techniques for assigning evacuees to exits.
In Hoogendoorn, S.P. and Pel, A.J. and Taylor, M.A.P. and Mahmassani, H., eds. Proceedings of the International Conference on Evacuation Modeling and Management, Procedia Engineering, 3:  205–215. Elsevier Ltd, 2010.

Link to original publication

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

E

Eisenbrand, Friedrich and Grandoni, Fabrizio and Oriolo, Gianpaolo and Skutella, Martin.
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, eds. Automata, Languages and Programming, Lecture Notes in Computer Science, 3580: 1151–1162. Springer, 2005.


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 to publication

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 Karrenbauer, Andreas and Skutella, Martin and Xu, Chihao.
Multiline Addressing by Network Flow.
In Azar, Yossi and Erlebach, Thomas, eds. Algorithms – ESA '06, Lecture Notes in Computer Science, 4168: 744–755. Springer, 2006.


Eisenbrand, Friedrich and Karrenbauer, Andreas and Skutella, Martin and Xu, Chihao.
Multiline Addressing by Network Flow.
Algorithmica, 53: 583–596, 2009.

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

Eisenbrand, Friedrich and Moran, Shay and Pinchasi, Rom and Skutella, Martin.
Node-balancing by edge-increments.
In Bansal, Nikhil and Finocchi, Irene, eds. Algorithms – ESA 2015, Lecture Notes in Computer Science, 9294: 450-458. Springer, 2015.


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

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

F

Fekete, Sándor P. and Skutella, Martin and Woeginger, Gerhard J..
The complexity of economic equilibria for house allocation markets.
Information Processing Letters, 88: 219–223, 2003.

Link to publication

Fleischer, Lisa and Skutella, Martin.
The quickest multicommodity flow problem.
In Cook, William J. and Schulz, Andreas S., eds. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, 2337: 36–53. Springer, 2002.


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

Link to 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.