Sanità, Laura and Skutella, Martin (ed.), 
Approximation and Online Algorithms – 13th International Workshop, WAOA 2015, Patras, Greece, September 17-18, 2015. Revised Selected Papers.
Proceedings, Lecture Notes in Computer Science, Vol. 9499, Springer, 2015.

Deuflhard, Peter and Grötschel, Martin and Hömberg, Dietmar and Horst, Ulrich and Kramer, Jürg and Mehrmann, Volker and Polthier, Konrad and Schmidt, Frank and Schütte, Christof and Skutella, Martin and Sprekels, Jürgen (ed.), 
\textscMatheon – Mathematics for Key Technologies.
Book, EMS Series in Industrial and Applied Mathematics, Vol. 1, European Mathematical Society, 2014.

Louveaux, Quentin and Skutella, Martin (ed.), 
Integer Programming and Combinatorial Optimization – 18th International Conference, IPCO 2016, Liége, Belgium, June 1-3, 2016, Proceedings.
Proceedings, Lecture Notes in Computer Science, Vol. 9682, Springer, 2016.

Schulz, Aandreas S. and Skutella, Martin and Stiller, Sebastian and Wagner, Dorothea (ed.), 
Gems of Combinatorial Optimization and Graph Algorithms.
Book, Springer, 2015.

25th Euromicro Conference on Real-Time Systems, ECRTS 2013, Paris, France, July 9-12, 2013.
Proceedings, IEEE, 2013.

Bampis, Evripidis and Skutella, Martin (ed.), 
Approximation and Online Algorithms, 6th International Workshop, WAOA 2008, Karlsruhe, Germany, September 18-19, 2008. Revised Papers.
Proceedings, Lecture Notes in Computer Science, Vol. 5426, Springer, 2009.

Link zur Publikation

Kaklamanis, Christos and Skutella, Martin (ed.), 
Approximation and Online Algorithms, 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers.
Proceedings, Lecture Notes in Computer Science, Vol. 4927, Springer, 2008.

Link zur Publikation

Abed, F., Chen, L., Disser, Y., Groß, M., Megow, N., Meißner, J., Richter, A. and Rischke, R..
Scheduling Maintenance Jobs in Networks.
In Proceedings of the International Conference on Algorithms and Complexity (CIAC), 2017. full version on arXiv.

Link zur Publikation Link zur Originalpublikation

Adjiashvili, D., Stiller, S. and Zenklusen, R..
Bulk-Robust combinatorial optimization.
Mathematical Programming, pp. 1-30, 2014.

Link zur Publikation

Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C. and Sviridenko, M..
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.
In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pp. 32–43, New York City, NY, 1999.

Link zur Publikation

Althaus, E., Funke, S., Har-Peled, S., Könemann, J., Ramos, E. A. and Skutella, M..
Approximating k-Hop Minimum-Spanning Trees.
Operations Research Letters, Vol. 33, pp. 115–120, 2005.

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

Antoniadis, A., Hoeksma, R., Meißner, J., Verschae, J. and Wiese, A..
A QPTAS for the General Scheduling Problem with Identical Release Dates.
In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP), 2017.

Link zur Publikation Link zur Originalpublikation

Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., Schewior, K. and Scquizzato, M..
Chasing Convex Bodies and Functions.
Latin American Theoretical Informatics Symposium (LATIN), 2016.

Arkin, E. M., Bender, M. A., Fekete, S. P., Mitchell, J. S. B. and Skutella, M..
The freeze-tag problem: How to wake up a swarm of robots.
Algorithmica, Vol. 46, pp. 193-221, 2006.

Link zur Publikation

Arkin, E. M., Bender, M. A., Fekete, S. P., Mitchell, J. S. B. and Skutella, M..
The freeze-tag problem: How to wake up a swarm of robots.
In Proceedings of the 13th Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 568–577, San Francisco, CA, 2002.

Arulselvan, A., Groß, M. and Skutella, M..
Graph Orientation and Flows Over Time.
Networks, Vol. 66, pp. 196-209, 2015.

Arulselvan, A., Maurer, O. and Skutella, M..
An incremental algorithm for the uncapacitated facility location problem.
Networks, Vol. 65, pp. 306-311, 2015.

Arulselvan, A., Groß, M. and Skutella, M..
Graph Orientation and Flows Over Time.
In Ahn, Hee-Kap and Shin, Chan-Su (ed.), Algorithms and Computation, Lecture Notes in Computer Science, Vol. 8889, pp. 741–752, Springer International Publishing, 2014.

Link zur Originalpublikation

Arulselvan, A., Bley, A., Gollowitzer, S., Ljubic, I. and Maurer, O..
MIP modeling of Incremental Connected Facility Location.
In Proceedings of the 5th International Network Optimization Conference (INOC 2011), Hamburg, Germany, LNCS, pp. 490–502, Springer, 2011.

Baier, G., Erlebach, T., Hall, A., Köhler, E., Kolman, P., Pangr\?ac, O., Schilling, H. and Skutella, M..
Length-Bounded Cuts and Flows.
ACM Transactions on Algorithms, Vol. 7, pp. 4, 2010.

Link zur Publikation

Baier, G., Erlebach, T., Hall, A., Köhler, E., Schilling, H. and Skutella, M..
Length-Bounded Cuts and Flows.
In Bugliesi, Michele and Preneel, Bart and Sassone, Vladimiro and Wegener, Ingo (ed.), Automata, Languages and Programming, pp. 679–690, Springer, 2006.

Baier, G., Köhler, E. and Skutella, M..
On the k-splittable flow problem.
In Möhring, Rolf H. and Raman, Rajeev (ed.), Algorithms – ESA '02, pp. 101–113, Springer, 2002.

Baier, G., Köhler, E. and Skutella, M..
On the k-splittable flow problem.
Algorithmica, Vol. 42, pp. 231–248, 2005.

Link zur Publikation

Baier, G..
Flows with Path Restrictions.
Doctoral thesis, TU Berlin, 2003.

Bansal, N., Khandekar, R., Könemann, J., Nagarajan, V. and Peis, B..
On Generalizations of Network Design Problems with Degree Bounds.
In Eisenbrand, Friedrich and Shepherd, F. Bruce (ed.), Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, Lecture Notes in Computer Science, Springer, Vol. 6080, pp. 110-123, 2010.

Bansal, N., Gupta, A., Krishnaswamy, R., Pruhs, K., Schewior, K. and Stein, C..
A 2-Competitive algorithm for Online Convex Optimization with Switching Costs.
In Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 96–109, 2015.

Bärtschi, A., Chalopin, J., Das, S., Disser, Y., Geissmann, B., Graf, D., Labourel, A. and Mihalák, M..
Collaborative Delivery with Energy-Constrained Mobile Robots.
In Proceedings of the 24th International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2017.

Baruah, S., Bonifaci, V., D'Angelo, G., Li, H., Marchetti-Spaccamela, A., Megow, N. and Stougie, L..
Scheduling real-time mixed-criticality jobs.
In Proceedings of the 35th International Symposium on Mathematical Foundations of Computer Science (MFCS 2010), Lecture Notes in Computer Science, Vol. 6281, pp. 90–101, Springer, 2010.

Link zur Publikation

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

Baruah, S. K., Bonifaci, V., Marchetti-Spaccamela, A. and Stiller, S..
Improved multiprocessor global schedulability analysis.
Real-Time Systems, Vol. 46, pp. 3-24, 2010.

Baruah, S. K., Bonifaci, V., Marchetti-Spaccamela, A. and Stiller, S..
Implementation of a Speedup-Optimal Global EDF Schedulability Test.
In ECRTS, pp. 259-268, IEEE Computer Society, 2009.

Baumann, N. and Skutella, M..
Solving Evacuation Problems Efficiently: Earliest Arrival Flows with Multiple Sources.
Mathematics of Operations Research, Vol. 34, pp. 499–512, 2009.

Link zur Publikation

Baumann, N. and Skutella, M..
Solving Evacuation Problems Efficiently: Earliest Arrival Flows with Multiple Sources.
In Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, pp. 399–408, Berkeley, CA, 2006.

Baumann, N. and Stiller, S..
The Price of Anarchy of a Network Creation Game with Exponential Payoff.
In Burkhard Monien and Ulf-Peter Schroeder (ed.), Algorithmic Game Theory, First International Symposium, SAGT 2008, Paderborn, Germany, April 30-May 2, 2008. Proceedings, Lecture Notes in Computer Science, Vol. 4997, pp. 218-229, Springer, 2008.

Baumann, N. and Stiller, S..
Network Analysis: Methodological Foundations.
In Ulrik Brandes and Thomas Erlebach (ed.), Network Analysis, Lecture Notes in Computer Science, Vol. 3418, pp. 341-372, Springer, 2005.

Becchetti, L., Korteweg, P., Marchetti-Spaccamela, A., Skutella, M., Stougie, L. and Vitaletti, A..
Latency Constrained Aggregation in Sensor Networks.
In Azar, Yossi and Erlebach, Thomas (ed.), Algorithms – ESA '06, pp. 88–99, Springer, 2006.

Becchetti, L., Korteweg, P., Marchetti-Spaccamela, A., Skutella, M., Stougie, L. and Vitaletti, A..
Latency Constrained Aggregation in Sensor Networks.
ACM Transactions on Algorithms, Vol. 6, pp. 13:1–13:20, 2009.

Link zur Publikation

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

Berger, A., Hoffmann, R., Lorenz, U. and Stiller, S..
TOPSU–RDM: a simulation platform for online railway delay management.
In Sándor Molnár and John R. Heath and Olivier Dalle and Gabriel A. Wainer (ed.), Proceedings of the 1st International Conference on Simulation Tools and Techniques for Communications, Networks and Systems & Workshops, SimuTools 2008, pp. 20, ICST, 2008.

Bernstein, A., Däubel, K., Disser, Y., Klimm, M., Mütze, T. and Smolny, F..
Distance-preserving graph contractions.
In Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik (ed.), 9th Innovations in Theoretical Computer Science Conference (ITCS 2018), Leibniz International Proceedings in Informatics (LIPIcs), Vol. 94, pp. 51:1–51:14, 2018.

Link zur Originalpublikation

Bernstein, A., Däubel, K., Disser, Y., Klimm, M., Mütze, T. and Smolny, F..
Distance-Preserving Graph Contractions.
SIAM Journal on Discrete Mathematics, Vol. 33, pp. 1607-1636, 2019.

Link zur Originalpublikation

Berthold, T., Heinz, S., Lübbecke, M. E., Möhring, R. H. and Schulz, J..
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling.
In Andrea Lodi and Michela Milano and Paolo Toth (ed.), Proceedings of the 7th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science, Vol. 6140, pp. 313-317, Springer, 2010.

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.

Bertsimas, D., Nasrabadi, E. and Stiller, S..
Robust and Adaptive Network Flows.
Operations Research, Vol. 61, pp. 1218-1242, 2013.

Link zur Publikation

Bhattacharya, B., Burmester, B., Hu, Y., Kranakis, E., Shi, Q. and Wiese, A..
Optimal Movement of Mobile Sensors for Barrier Coverage of a Planar Region.
In Yang, Boting and Du, Ding-Zhu and Wang, Cao (ed.), Combinatorial Optimization and Applications (COCOA 2008), pp. 103-115, Springer, 2008.

Link zur Publikation

Bienstock, D. and Bley, A..
Capacitated Network Design with Multicast Commodities.
In Proceedings of the 8th International Conference on Telecommunication Systems (ICTSM 2000), Modeling and Analysis, Nashville, USA, 2000.

Link zur Publikation

Biermann, D., Surmann, T., Sacharow, A., Skutella, M. and Theile, M..
Automated analysis of the form error caused by springback in metal sheet forming.
In Bouzakis, Konstantinos-Dionysios (ed.), Proceedings of the 3rd International Conference on Manufacturing Engineering, 1.-3. October 2008, Kallithea of Chalkidiki, Greece, pp. 737–746, 2008.

Link zur Publikation

Bilò, D., Disser, Y., Mihalák, M., Suri, S., Vicari, E. and Widmayer, P..
Reconstructing Visibility Graphs with Simple Robots.
Theoretical Computer Science, Vol. 444, pp. 52–59, 2012.

Link zur Publikation

Bilò, D., Disser, Y., Gualà, L., Mihalák, M., Proietti, G. and Widmayer, P..
Polygon-Constrained Motion Planning Problems.
In Proceedings of the 9th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), pp. 67–82, 2013.

Link zur Publikation