direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationsliste

K

Kääb, V..
Scheduling with AND/OR-Networks.
Doctoral thesis, TU Berlin, 2003.


Köhler, E..
Graphs without Asteroidal Triples.
Doctoral thesis, TU Berlin, 1999.


Köhler, E., Langkau, K. and Skutella, M..
Time-Expanded Graphs for Flow-Dependent Transit Times.
In Möhring, Rolf H. and Raman, Rajeev (ed.)Algorithms – ESA '02, pp. 599–611, Springer, 2002.

Link zur Publikation


Köhler, E., Möhring, R. H. and Skutella, M..
Traffic networks and flows over time.
In Lerner, Jürgen and Wagner, Dorothea and Zweig, Katharina A. (ed.)Algorithmics of Large and Complex Networks: Design, Analysis, and Simulation, pp. 166–196, Springer, 2009.

Link zur Publikation


Köhler, E. and Skutella, M..
Flows over time with load-dependent transit times.
SIAM Journal on Optimization, Vol. 15, pp. 1185–1202, 2005.

Link zur Publikation


Köhler, E. and Skutella, M..
Flows over time with load-dependent transit times.
In Proceedings of the 13th Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 174–183, San Francisco, CA, 2002.


König, F. G..
Sorting with Objectives - Graph Theoretic Concepts in Industrial Optimization.
Doctoral thesis, Technische Universität Berlin, 2009. Supervisors: Rolf H. Möhring and Peter Widmayer.

Link zur Publikation


König, F. G..
Traffic Optimization under Route Constraints with Lagrangian Relaxation and Cutting Plane Methods.
In Operations Research Proceedings 2006, pp. 53-59, Springer, 2007.


König, F. G..
Verkehrsoptimierung unter Routennebenbedingungen mit Lagrange-Relaxation und Schnittebenenverfahren.
Diploma thesis, Technische Universität Berlin, 2005. Supervisor: Rolf H. Möhring. Won the GOR-Diplomarbeitspreis 2006 (Master Thesis Award of the German Association for Operations Research). In German.


König, F. G. and Lübbecke, M. E..
Sorting with Complete Networks of Stacks.
In Algorithms and Computation: 19th International Symposium, ISAAC 2008, Lecture Notes in Computer Science, Vol. 5369, pp. 896-907, Springer, 2008.


König, F. G., Lübbecke, M. E., Möhring, R. H., Schäfer, G. and Spenke, I..
Solutions to Real-World Instances of PSPACE-Complete Stacking.
In Algorithms - ESA 2007: 15th Annual European Symposium, Lecture Notes in Computer Science, Vol. 4698, pp. 729-740, Springer, 2007.


König, F. G., Matuschke, J. and Richter, A..
Multi-dimensional commodity covering for tariff selection in transportation.
In Daniel Delling and Leo Liberti (ed.)12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, OpenAccess Series in Informatics (OASIcs), Vol. 25, pp. 58–70, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2012.

Link zur Publikation Link zur Originalpublikation


Kötzing, T., Sudholt, D. and Theile, M..
How Crossover Helps in Pseudo-Boolean Optimization.
In Genetic and Evolutionary Computation Conference (GECCO 2011), 2011. (best paper award).

Link zur Publikation


L

Landry, C., Henrion, R., Hömberg, D., Skutella, M. and Welz, W..
Task assignment, sequencing and path-planning in robotic welding cells.
In Methods and Models in Automation and Robotics (MMAR), 2013 18th International Conference on, pp. 252-257, 2013.


Langkau, K..
Flows Over Time with Flow-Dependent Transit Times.
Doctoral thesis, TU Berlin, 2003.


Liebchen, C..
Periodic Timetable Optimization in Public Transport.
Doctoral thesis, TU Berlin, 2006.


Liebchen, C., Schachtebeck, M., Schöbel, A., Stiller, S. and Prigge, A..
Computing delay resistant railway timetables.
Computers & OR, Vol. 37, pp. 857-868, 2010.


Liebchen, C., Lübbecke, M. E., Möhring, R. H. and Stiller, S..
The Concept of Recoverable Robustness, Linear Programming Recovery, and Railway Applications.
In Ravindra K. Ahuja and Rolf H. Möhring and Christos D. Zaroliagis (ed.)Robust and Online Large-Scale Optimization: Models and Techniques for Transportation Systems} publisher = {Springer, pp. 1-27, 2009.


Lätsch, M. and Peis, B..
On a Relation Between the Domination Number and a Strongly Connected Bidirection of an Undirected Graph.
Discrete Applied Mathematics, Vol. 156, pp. 3194-3202, 2008.


M

Magnanti, T. L., Sivaraman, R. and Skutella, M..
Linear Programming, Quickest Flows, and Time Cost Trade-offs.
In Proceedings of the 2nd International Network Optimization Conference, 2005.

Link zur Publikation


Malesinska, E..
Graph-Theoretical Models for Frequency Assignment Problems.
Doctoral thesis, TU Berlin, 1997.


Marchetti-Spaccamela, A., Megow, N., Schlöter, J., Skutella, M. and Stougie, L..
On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems.
In Proceedings of the 34th IEEE International Parallel and Distributed Processing Symposium, 2020.


Martens, M., Salazar, F. and Skutella, M..
Convex Combinations of Single Source Unsplittable Flows.
In Arge, Lars and Welzl, Emo (ed.)Algorithms – ESA '07, pp. 395–406, Springer, 2007.

Link zur Publikation


Martens, M. and Skutella, M..
Flows on Few Paths: Algorithms and Lower Bounds.
In Albers, Susanne and Radzik, Tomasz (ed.)Algorithms – ESA '04, pp. 520–531, Springer, 2004.


Martens, M. and Skutella, M..
Length-Bounded and Dynamic k-Splittable Flows.
In Haasis, Hans-Dietrich and Kopfer, Herbert and Schönberger, Jörn (ed.)Operations Research Proceedings 2005, pp. 297–302, Springer, 2006.

Link zur Publikation


Martens, M. and Skutella, M..
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 (ed.)Proceedings of the 2nd Annual International Conference on Combinatorial Optimization and Applications, Lecture Notes in Computer Science, Vol. 5165, pp. 180–189, Springer, 2008.


Martens, M. and Skutella, M..
A Network Flow Problem with Unit Path Capacities and Related Packing and Covering Problems.
Journal of Combinatorial Optimization, Vol. 18, pp. 272–293, 2009.

Link zur Publikation


Martens, M. and Skutella, M..
Flows on Few Paths: Algorithms and Lower Bounds.
Networks, Vol. 48, pp. 68–76, 2006.

Link zur Publikation


Martens, M. and Bley, A..
Securely Connected Facility Location in Metric Graphs.
In Operations Research Proceedings 2010: Selected Papers of the Annual International Conference of the German Operations Research Society, Munich, Germany, pp. 288–294, Springer, 2011.


Matusche, J., Skutella, M. and Soto, J..
Robust randomized matchings.
Mathematics of Operations Research, Vol. 43, pp. 675-692, 2018.


Matuschke, J..
Network flows and network design in theory and practice.
Doctoral thesis, TU Berlin, 2013.

Link zur Publikation


Matuschke, J. and Peis, B..
Lattices and Maximum Flow Algorithms in Planar Graphs.
In Thilikos, Dimitrios (ed.)Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, Lecture Notes in Computer Science, Springer, Vol. 6410, pp. 324-335, 2010.

Link zur Originalpublikation


Matuschke, J., McCormick, S., Oriolo, G., Peis, B. and Skutella, M..
Protection of flows under targeted attacks.
Operations Research Letters, Vol. 45, pp. 53-59, 2017.


Matuschke, J., Skutella, M. and Soto, J..
Robust randomized matchings.
Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), pp. 1904-1915, 2015.


Matuschke, J., Bley, A. and Müller, B..
Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections.
In Algorithms – ESA 2013, pp. 707-718, Springer, 2013.

Link zur Originalpublikation


McCormick, S. T. and Peis, B..
A Primal-Dual Algorithm for Weighted Abstract Cut Packing.
In Günlück, Oktay and Woeginger, Gerhard (ed.)Integer Programming and Combinatoral Optimization - 15th International Conference, IPCO 2011, New York, USA, Lecture Notes in Computer Science, Springer, Vol. 6655, pp. 324-335, 2011.


Megow, N. and Verschae, J..
Dual techniques for scheduling on a machine with varying speed.
In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), Lecture Notes in Computer Science, Vol. 7965, pp. 745–756, Springer-Verlag Berlin Heidelberg, 2013.

Link zur Publikation Link zur Originalpublikation


Megow, N., Skutella, M., Verschae, J. and Wiese, A..
The Power of Recourse for Online MST and TSP.
SIAM Journal on Computing, Vol. 45, pp. 859-880, 2016.


Megow, N. and Vredeveld, T..
A Tight 2-Approximation for Preemptive Stochastic Scheduling.
Mathematics of Operations Research, Vol. 39, pp. 1297-1310, 2014.

Link zur Publikation



Megow, N., Meißner, J. and Skutella, M..
Randomization Helps Computing a Minimum Spanning Tree under Uncertainty.
SIAM Journal on Computing, pp. 1217 - 1240, 2017.

Link zur Publikation Link zur Originalpublikation


Megow, N., Meißner, J. and Skutella, M..
Randomization Helps Computing a Minimum Spanning Tree Under Uncertainty.
In Proceedings of the European Symposium on Algorithms (ESA), 2015.

Link zur Publikation


Megow, N., Mehlhorn, K. and Schweitzer, P..
Online Graph Exploration: New Results on Old and New Algorithms.
In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), Lecture Notes in Computer Science, Vol. 6756, pp. 478–489, Springer, 2011.

Link zur Publikation


Megow, N., Skutella, M., Verschae, J. and Wiese, A..
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, Vol. 7391, pp. 689–-700, Springer, 2012.

Link zur Publikation Link zur Originalpublikation


Megow, N., Uetz, M. and Vredeveld, T..
Models and Algorithms for Stochastic Online Scheduling.
Mathematics of Operations Research, Vol. 31, pp. 513–525, 2006.

Link zur Publikation Link zur Originalpublikation


Megow, N. and Vredeveld, T..
Approximation in Preemptive Stochastic Online Scheduling.
In Proceedings of 14th European Symposium on Algorithms (ESA'06), Lecture Notes in Computer Science, Vol. 4168, pp. 516–527, Springer, 2006.


Megow, N., Uetz, M. and Vredeveld, T..
Stochastic Online Scheduling on Parallel Machines.
In Approximation and Online Algorithms (WAOA'04), Lecture Notes in Computer Science, Vol. 3351, pp. 167-180, Springer, 2005.

Link zur Publikation Link zur Originalpublikation


Megow, N. and Schulz, A. S..
On-line scheduling to minimize average completion time revisited.
Operations Research Letters, Vol. 32, pp. 485-490, 2004.

Link zur Publikation Link zur Originalpublikation


Megow, N. and Schulz, A. S..
Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms.
In Approximation and Online Algorithms (WAOA'03), Lecture Notes in Computer Science, Vol. 2909, pp. 227–234, Springer, 2004.


Megow, N..
Keller oder Dach zuerst.
In K. Biermann and M. Götschel and B. Lutz-Westphal (ed.)Besser als Mathe: Moderne angewandte Mathematik aus dem Matheon zum Mitmachen, pp. 111–115, Vieweg+Teubner, 2009.


Zusatzinformationen / Extras