direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationsliste

D

Dressler, D., Groß, M., Kappmeier, J.-P., Kelter, T., Kulbatzki, J., Plümpe, D., Schlechter, G., Schmidt, M., Skutella, M. and Temme, S..
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. (ed.)Proceedings of the International Conference on Evacuation Modeling and Management, Procedia Engineering, Vol. 3, pp. 205–215, Elsevier Ltd, 2010.

Link zur Originalpublikation


Dressler, D. and Skutella, M..
An FPTAS for Flows over Time with Aggregated Arc Capacities.
In Jansen, Klaus and Solis-Oba, Roberto (ed.)Approximation and Online Algorithms, 8th International Workshop, WAOA 2010, Liverpool, United Kingdom, September 2010. Revised Papers, pp. 106–117, Springer, 2011.

Link zur Publikation


Dressler, D..
Network Flow Problems Arising From Evacuation Planning.
Doctoral thesis, TU Berlin, 2012.

Link zur Publikation


Dürr, C., Erlebach, T., Megow, N. and Meißner, J..
An Adversarial Model for Scheduling with Testing.
In Proceedings of Innovations in Theoretical Computer Science (ITCS), 2018. full version on arXiv with title "Scheduling with Explorable Uncertainty".

Link zur Publikation


Däubel, K., Jäger, S., Mütze, T. and Scheucher, M..
On orthogonal symmetric chain decompositions.
Electronic Journal of Combinatorics, Vol. 26, pp. P3.64, 2019. Full version.

Link zur Originalpublikation


Däubel, K..
An Improved Upper Bound for the Ring Loading Problem.
In Springer International Publishing (ed.)Approximation and Online Algorithms, pp. 89–105, 2020.

Link zur Originalpublikation


Däubel, K., Jäger, S., Mütze, T. and Scheucher, M..
On orthogonal symmetric chain decompositions.
In Nešetřil, Jaroslav and Škoviera, Martin (ed.)Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), Vol. 88, pp. 611–618, 2019. extended abstract.

Link zur Originalpublikation


E

Eisenbrand, F. and Rothvoß, T..
EDF-schedulability of synchronous periodic task systems is coNP-hard.
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2010), pp. 1029–1034, 2010.

Link zur Publikation


Eisenbrand, F. and Rothvoß, T..
New Hardness Results for Diophantine Approximation.
In Proceedings of the 12th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2009), Lecture Notes in Computer Science, Vol. 5687, pp. 98–110, Springer, 2009.

Link zur Publikation


Eisenbrand, F. and Rothvoß, T..
Static-priority Real-time Scheduling: Response Time Computation is NP-hard.
In IEEE Real-Time Systems Symposium (RTSS), 2008.

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.


Eisenbrand, F., Grandoni, F., Oriolo, G. and Skutella, M..
New Approaches for Virtual Private Network Design.
SIAM Journal on Computing, Vol. 37, pp. 706–721, 2007.

Link zur Publikation


Eisenbrand, F., Hähnle, N., Niemeier, M., Skutella, M., Verschae, J. and Wiese, A..
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. (ed.)Automata, Languages and Programming (ICALP 2010), pp. 299–311, Springer, 2010.

Link zur Publikation


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.


Eisenbrand, F., Karrenbauer, A., Skutella, M. and Xu, C..
Multiline Addressing by Network Flow.
Algorithmica, Vol. 53, pp. 583–596, 2009.

Link zur Publikation


Eisenbrand, F., Kesavan, K., Mattikalli, R. S., Niemeier, M., Nordsieck, A. W., Skutella, M., Verschae, J. and Wiese, A..
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods.
In de Berg, Mark and Meyer, Ulrich (ed.)Algorithms – ESA '10, pp. 11–22, Springer, 2010.

Link zur Publikation


Eisenbrand, F., Moran, S., Pinchasi, R. and Skutella, M..
Node-balancing by edge-increments.
In Bansal, Nikhil and Finocchi, Irene (ed.)Algorithms – ESA 2015, pp. 450-458, Springer, 2015.


Epstein, L., Levin, A., Marchetti-Spaccamela, A., Megow, N., Mestre, J., Skutella, M. and Stougie, L..
Universal sequencing on a single machine.
In Eisenbrand, Friedrich and Shepherd, Bruce (ed.)Integer Programming and Combinatorial Optimization, pp. 230–243, Springer, 2010.

Link zur Publikation


Epstein, L., Levin, A., Mestre, J., Marchetti-Spaccamela, A., Megow, N., Skutella, M. and Stougie, L..
Universal sequencing on a single unreliable machine.
SIAM Journal on Computing, Vol. 41, pp. 565-586, 2012.

Link zur Publikation Link zur Originalpublikation


F

Faigle, U., Kern, W. and Peis, B..
On Greedy and Submodular Matrices.
In Marchetti-Spaccamela and Segal, Michael (ed.)Theory and Practice of Algorithms in (Computer) Systems - First International ICST Conference, TAPAS 2011, Rome, Italy, Lecture Notes in Computer Science, Springer, Vol. 6595, pp. 116-126, 2011.


Faigle, U. and Peis, B..
Two-phase Greedy Algorithms for Some Classes of Combinatorial Linear Programs.
ACM Transactions on Algorithms, Vol. 6(4), 2010. An extended abstract appeared in SODA 2008-proceedings.


Faigle, U., Kern, W. and Peis, B..
A Ranking Model for Cooperative Games, Convexity and the Greedy Algorithm.
Math. Programming, (doi:10.1007/s10107-010-0406-2), Vol. A, 2010.


Faigle, U. and Peis, B..
A Hierarchical Model for Cooperative Games.
In Monien, Burkhard and Schroeder, Ulf-Peter (ed.)Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, Lecture Notes in Computer Science, Springer, Vol. 4997, pp. 230-241, 2008.


Faigle, U. and Peis, B..
Two-phase Greedy Algorithms for Some Classes of Combinatorial Linear Programs.
In Teng, Shang-Hua (ed.)Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, SIAM, pp. 161-166, 2008. A full version appeared in TALG 2010.


Faigle, U. and Peis, B..
Note on Pseudolattices, Lattices and Submodular Linear Programs.
Discrete Optimization, Vol. 5, pp. 489-500, 2008.


Faigle, U., Fuchs, B. and Peis, B..
Note on maximal split-stable subgraphs.
Discrete Applied Mathematics, Vol. 156, pp. 3194-3202, 2008.


Fekete, S. P., Skutella, M. and Woeginger, G. J..
The complexity of economic equilibria for house allocation markets.
Information Processing Letters, Vol. 88, pp. 219–223, 2003.

Link zur Publikation


Felsner, S..
Interval Orders: Combinatorial Structure and Algorithms.
Doctoral thesis, TU Berlin, 1992.


Felsner, S., Kleist, L., Mütze, T. and Sering, L..
Rainbow Cycles in Flip Graphs.
In 34th International Symposium on Computational Geometry (SoCG 2018), Vol. 99, pp. 38:1–38:14, Dagstuhl, Germany, 2018.

Link zur Publikation


Felsner, S., Kleist, L., Mütze, T. and Sering, L..
Rainbow Cycles in Flip Graphs.
SIAM Journal on Discrete Mathematics, Vol. 34, pp. 1-39, 2020.

Link zur Originalpublikation


Fischer, F. and Klimm, M..
Optimal Impartial Selection.
In Klaus Jansen and Jos'e Rolim and Nikhil Devanur and Cristopher Moore (ed.)Proceedings of the 15th ACM Conference on Economics and Computation (EC), pp. 803 – 820, 2014.


Fischer, F. and Klimm, M..
Optimal Impartial Selection.
SIAM Journal on Computing, Vol. 44, pp. 1263-1285, 2015.

Link zur Publikation


Fleischer, L. and Skutella, M..
The quickest multicommodity flow problem.
In Cook, William J. and Schulz, Andreas S. (ed.)Integer Programming and Combinatorial Optimization, pp. 36–53, Springer, 2002.


Fleischer, L. and Skutella, M..
Quickest Flows Over Time.
SIAM Journal on Computing, Vol. 36, pp. 1600–1630, 2007.

Link zur Publikation


Fleischer, L. and Skutella, M..
Minimum Cost Flows Over Time without Intermediate Storage.
In Proceedings of the 14th Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 66–75, Baltimore, MD, 2003.


Focke, J., Megow, N. and Meißner, J..
Minimum Spanning Tree under Uncertainty in Theory and Experiments.
In Proceedings of the Symposium on Experimental Algorithms (SEA), 2017.

Link zur Publikation Link zur Originalpublikation


Friedrich, M..
Benefits of Sexual Reproduction in Evolutionary Computation.
Doctoral thesis, TU Berlin, 2013.

Link zur Publikation


Froyland, G., Koch, T., Megow, N., Duane, E. and Wren, H..
Optimizing the Landside Operation of a Container Terminal.
OR Spectrum, Vol. 30, pp. 53-75, 2008.

Link zur Publikation


Fujishige, S. and Peis, B..
Lattice Polyhedra and Submodular Flows.
Japan Journal of Industrial and Applied Mathematics, Vol. 29, pp. 441-451, 2012.


G

Gairing, M. and Klimm, M..
Congestion Games with Player-Specific Costs Revisited.
In B. Vöcking (ed.)Proceedings of the 6th International Symposium on Algorithmic Game Theory (SAGT), Lecture Notes in Computer Science, Vol. 8146, pp. 98 – 109, 2013.


Gairing, M., Harks, T. and Klimm, M..
Complexity and Approximation of the Continuous Network Design Problem.
In Klaus Jansen and Jos'e Rolim and Nikhil Devanur and Cristopher Moore (ed.)Proceedings of the 17th Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 226 – 241, 2014.


Galli, L. and Stiller, S..
Strong Formulations for the Multi-module PESP and a Quadratic Algorithm for Graphical Diophantine Equation Systems.
In Mark de Berg and Ulrich Meyer (ed.)Algorithms - ESA 2010 (1), 18th Annual European Symposium on Algorithms, Lecture Notes in Computer Science, Vol. 6346, pp. 338-349, Springer, 2010.


Gawrilow, E., Klimm, M., Möhring, R. H. and Stenzel, B..
Conflict-free vehicle routing: Load balancing and deadlock prevention.
EURO Journal on transportation and logistics, Vol. 1, pp. 87 – 111, 2012.


Gellert, T. J..
Scheduling Rail-mounted Cranes.
Doctoral thesis, TU Berlin, 2015.

Link zur Publikation


Gellert, T., Höhn, W. and Möhring, R. H..
Sequencing and scheduling for filling lines in dairy production.
Optimization Letters, Vol. 5, pp. 491–504, 2011. Special issue of SEA 2011.

Link zur Originalpublikation


Gellert, T. J. and König, F. G..
1D Vehicle Scheduling with Conflicts.
In Proceedings of the Workshop on Algorithm Engineering and Experiments, ALENEX 2011, pp. 107-115, Society for Industrial and Applied Mathematics, 2011.


Goemans, M. X., Queyranne, M., Schulz, A. S., Skutella, M. and Wang, Y..
Single machine scheduling with release dates.
SIAM Journal on Discrete Mathematics, Vol. 15, pp. 165–192, 2002.

Link zur Publikation


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

Link zur Publikation


Goemans, M. X. and Skutella, M..
Cooperative facility location games.
In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 76–85, San Francisco, CA, 2000.



Zusatzinformationen / Extras