Disser, Y., Mihalák, M. and Widmayer, P..
Mapping polygons with agents that measure angles.
In Proceedings of the 10th International Workshop on the Algorithmic Foundations of Robotics (WAFR), pp. 415-425, 2012.

Link zur Publikation

Verschae, J..
The power of recourse in online optimization.
Doctoral thesis, TU Berlin, 2012.

Bonifaci, V., Chan, H.-L., Marchetti-Spaccamela, A. and Megow, N..
Algorithms and Complexity for Periodic Real-Time Scheduling.
Transactions on Algorithms, Vol. 9, pp. 601-619, 2012.

Link zur Publikation Link zur Originalpublikation

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

Baruah, S., Bonifaci, V., D'Angelo, G., Li, H., Marchetti-Spaccamela, A., Megow, N. and Stougie, L..
Scheduling real-time mixed-criticality jobs.
IEEE Transactions on Computers, Vol. 61, pp. 1140-1152, 2012.

Link zur Publikation Link zur Originalpublikation

Koch, R..
Routing Games over Time.
Doctoral thesis, TU Berlin, 2012.

Link zur Publikation

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

Link zur Publikation

Bonifaci, V., Marchetti-Spaccamela, A. and Stiller, S..
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling.
Algorithmica, Vol. 62, pp. 1034-1049, 2012.

Höhn, W., Jacobs, T. and Megow, N..
On Eulerian extensions and their application to no-wait flowshop scheduling.
Journal of Scheduling, Vol. 15, pp. 295-309, 2012.

Link zur Publikation Link zur Originalpublikation

Chan, H.-L., Megow, N., Sitters, R. and van Stee, R..
The offline sorting buffer problem is NP-hard.
Theoretical Computer Science, Vol. 423, pp. 11–18, 2012.

Link zur Publikation Link zur Originalpublikation

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

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

Groß, M. and Skutella, M..
Maximum Multicommodity Flows over Time without Intermediate Storage.
In Epstein, Leah and Ferragina, Paolo (ed.), Algorithms – ESA 2012, pp. 539-550, Springer Berlin / Heidelberg, 2012.

Link zur Originalpublikation

Schulz, J..
Hybrid Solving Techniques for Resouce-Constrained Project Scheduling.
Doctoral thesis, TU Berlin, 2012.

Link zur Publikation

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

Kappmeier, J.-P. W., Matuschke, J. and Peis, B..
Abstract flows over time: A first step towards solving dynamic packing problems.
In Kun-Mao Chao, Tsan-sheng Hsu, and Der-Tsai Lee (ed.), Algorithms and Computation: 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings, Lecture Notes in Computer Science, pp. 433-443, Springer, 2012.

Link zur Publikation Link zur Originalpublikation

Disser, Y. and Matuschke, J..
Degree-constrained orientations of embedded graphs.
In Kun-Mao Chao, Tsan-sheng Hsu, and Der-Tsai Lee (ed.), Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, pp. 506-516, Springer, 2012.

Link zur Publikation Link zur Originalpublikation

Groß, M., Kappmeier, J.-P. W., Schmidt, M. and Schmidt, D..
Approximating Earliest Arrival Flows in Arbitrary Networks.
In Epstein, Leah and Ferragina, Paolo (ed.), Algorithms – ESA 2012, pp. 551-562, Springer Berlin / Heidelberg, 2012.

Link zur Originalpublikation

Harks, T. and Peis, B..
Resource Buying Games.
In Leah Epstein and Paolo Ferragina (ed.), Algorithms - ESA 2012 - 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, Lecture Notes in Computer Science, Vol. 7501, pp. 563-574, Springer, 2012.

Höhn, W. and Jacobs, T..
An experimental and analytical study of order constraints for single machine scheduling with quadratic cost.
In Proc. of the 14th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 103-117, SIAM, 2012.

Link zur Publikation

Höhn, W. and Jacobs, T..
On the performance of Smith's rule in single-machine scheduling with nonlinear cost.
In Proc. of the 10th Latin American Theoretical Informatics Symposium (LATIN), LNCS, Vol. 7256, pp. 482-493, Springer, 2012.

Link zur Publikation Link zur Originalpublikation

Megow, N., Mehlhorn, K. and Schweitzer, P..
Online graph exploration: New results on old and new algorithms.
Theoretical Computer Science, Vol. 463, pp. 62-72, 2012. Special Issue on Theory and Applications of Graph Searching Problems.

Link zur Publikation Link zur Originalpublikation

Megow, N., Möhring, R. H. and Schulz, J..
Decision Support and Optimization in Shutdown and Turnaround Scheduling.
INFORMS J. on Computing, Vol. 23, pp. 189–204, 2011.

Link zur Publikation Link zur Originalpublikation

Ruhl, M., Knuschke, T., Schewior, K., Glavinic, L., Neumann-Haefelin, C., Chang, D.-I., Klein, M., Heinemann, F. M., Tenckhoff, H., Wiese, M., Horn, P. A., Viazov, S., Spengler, U., Roggendorf, M., Scherbaum, N., Nattermann, J., Hoffmann, D. and Timm, J..
CD8+ T-Cell Response Promotes Evolution of Hepatitis C Virus Nonstructural Proteins.
Gastroenterology, Vol. 140, pp. 2064–2073, 2011.

Karrenbauer, A. and Rothvoß, T..
A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks.
In Proceedings of the 8th International Workshop on Approximation and Online Algorithms (WAOA 2010), Lecture Notes in Computer Science, Vol. 6534, pp. 166-177, Springer, 2011.

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.

Wiese, A. and Peis, B..
Universal Packet Routing with Arbitrary Bandwidths and Transit Times.
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. 362–375, 2011.

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.

Berthold, T., Heinz, S. and Schulz, J..
An Approximative Criterion for the Potential of Energetic Reasoning.
In Alberto Marchetti-Spaccamela and Michael Segal (ed.), Proceeding of the First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems (TAPAS 2011), Lecture Notes in Computer Science, Vol. 6595, pp. 229-239, Springer, 2011.

Bonsma, P., Schulz, J. and Wiese, A..
A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths.
In Proceedings of the 52th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2011), IEEE, 2011. to appear.

Doerr, B., Eremeev, A. V., Neumann, F., Theile, M. and Thyssen, C..
Evolutionary Algorithms and Dynamic Programming.
Theoretical Computer Science, Vol. (to appear), 2011.

Link zur Publikation

Dressler, D., Flötteröd, G., Lämmel, G., Nagel, K. and Skutella, M..
Optimal Evacuation Solutions for Large-Scale Scenarios.
In Hu, Bo and Morasch, Karl and Pickl, Stefan and Siegle, Markus (ed.), Operations Research Proceedings 2010, pp. 239–244, Springer, 2011.

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

Goetzmann, K., Harks, T., Klimm, M. and Miller, K..
Optimal File Distribution in Peer-to-Peer Networks.
In Asano, T. and Nakano, S. and Okamoto, Y. and Watanabe, O. (ed.), Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC), pp. 210 – 219, 2011.

Link zur Publikation

Disser, Y., Mihalák, M. and Widmayer, P..
A polygon is determined by its angles.
Computational Geometry: Theory and Applications, Vol. 44, pp. 418–426, 2011.

Link zur Publikation

Wiese, A..
Packet routing and scheduling.
Doctoral thesis, TU Berlin, 2011.

Chalopin, J., Das, S., Disser, Y., Mihalák, M. and Widmayer, P..
Telling convex from reflex allows to map a polygon.
In Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 153–164, 2011.

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

Anand, S., Garg, N. and Megow, N..
Meeting deadlines: How much speed suffices?.
In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP 2011), Lecture Notes in Computer Science, Vol. 6755, pp. 232–243, Springer, 2011.

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.

Haunert, J.-H. and Sering, L..
Drawing Road Networks with Focus Regions.
IEEE Transactions on Visualization and Computer Graphics, Vol. 17, pp. 2555-2562, 2011.

Link zur Publikation

Mittal, S. and Stiller, S..
Robust appointment scheduling.
In Proceedings of the MSOM Annual Conference, 2011.

Büsing, C. and Stiller, S..
Line planning, path constrained network flow, and inapproximability.
Networks, Vol. 57, pp. 106-113, 2011.

Berger, A., Hoffmann, R., Lorenz, U. and Stiller, S..
Online railway delay management: Hardness, simulation and computation.
Simulation, Vol. 87, pp. 616-629, 2011.

Höhn, W., König, F. G., Lübbecke, M. E. and Möhring, R. H..
Integrated Sequencing and Scheduling in Coil Coating.
Management Science, Vol. 57, pp. 647–666, 2011. Finalist for the EURO Excellence in Practice Award 2009.

Link zur Publikation Link zur Originalpublikation

Koch, R. and Nasrabadi, E..
Strong Duality for the Maximum Borel Flow Problem.
In Pahl, J. and Reiners, T. and Voß, S. (ed.), Network Optimization – 5th International Conference, INOC 2011, Lecture Notes in Computer Science, Vol. 6701, pp. 256–261, Springer, 2011.

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

Link zur Publikation Link zur Originalpublikation

Harks, T. and Klimm, M..
Congestion Games with Variable Demands.
In Apt, Krzysztof R. (ed.), Proceedings of the 13th Conference On Theoretical Aspects of Rationality and Knowledge (TARK), pp. 111 – 120, 2011.

Harks, T., Klimm, M. and Möhring, R. H..
Characterizing the Existence of Potential Functions in Weighted Congestion Games.
Theory of Computing Systems, Vol. 49, pp. 46 – 70, 2011.