You are at page:1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10
Order by:
Author
Year
Journal
2021
Ziemke, T., Sering, L., Vargas Koch, L., Zimmer, M., Nagel, K. and Skutella, M..
Flows Over Time as Continuous Limits of Packet-Based Network Simulations.
Transportation Research Procedia, Vol. 52, pp. 123–130, 2021.
2020
Klimm, M., Pfetsch, M. E., Raber, R. and Skutella, M..
Packing under Convex Quadratic Constraints.
In Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, Springer, 2020.
2019
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 to original publication
Groß, M., Pfetsch, M. E., Schewe, L., Schmidt, M. and Skutella, M..
Algorithmic results for potential-based flows: Easy and hard cases.
Networks, Vol. 73, pp. 306–324, 2019.
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 to original publication
Burlacu, R., Egger, H., Groß, M., Martin, A., Pfetsch, M. E., Schewe, L., Sirvent, M. and Skutella, M..
Maximizing the storage capacity of gas networks: a global MINLP approach.
Optimization and Engineering, Vol. 20, pp. 543-–573, 2019.
2018
Gregor, P., Jäger, S., Mütze, T., Sawada, J. and Wille, K..
Gray codes and symmetric chains.
In Chatzigiannakis, Ioannis and Kaklamanis, Christos and Marx, Dániel and Sannella, Donald (ed.), 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Leibniz International Proceedings in Informatics (LIPIcs), Vol. 107, pp. 66:1–66:14, Dagstuhl, Germany, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018.
Link to original publication
Neumann, F., Polyakovskiy, S., Skutella, M., Stougie, L. and Wu, J..
A Fully Polynomial Time Approximation Scheme for Packing While Traveling.
In Disser, Yann and Verykios, Vassilios S. (ed.), Algorithmic Aspects of Cloud Computing – Fourth International Workshop, ALGOCLOUD 2018, pp. 59–72, Springer, 2018.
Jäger, S. and Skutella, M..
Generalizing the Kawaguchi-Kyan Bound to Stochastic Parallel Machine Scheduling.
In Niedermeier, Rolf and Vallée, Brigitte (ed.), 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), Leibniz International Proceedings in Informatics (LIPIcs), Vol. 96, pp. 43:1–43:14, Dagstuhl, Germany, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018.
Link to original publication
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 to original publication
Sering, L. and Skutella, M..
Multi-Source Multi-Sink Nash Flows Over Time.
In Borndörfer, R. and Storandt, S. (ed.), Proceedings of the 18th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2018), OASICS, Vol. 65, pp. 12:1-12:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.
Link to original publication
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 to publication
2017
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.
Bjelde, A., Disser, Y., Hackfeld, J., Hansknecht, C., Lipmann, M., Meißner, J., Schewior, K., Schlöter, M. and Stougie, L..
Tight bounds for online TSP on the line.
In Proceedings of the Symposium on Discrete Algorithms (SODA), pp. 994–1005, 2017.
Link to publication Link to original publication
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.
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 to publication Link to original publication
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 to publication Link to original publication
2016
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.
You are at page:1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10