direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationsliste

2020

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.


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.


Morell, S. and Skutella, M..
Single source unsplittable flows with arc-wise lower and upper bounds.
In Proceedings of the 21st Conference on Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, Springer, 2020.


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


2019

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., 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


Jäger, S. and Schöbel, A..
The blockwise coordinate descent method for integer programs.
Mathematical Methods of Operations Research, 2019.

Link zur Publikation Link zur Originalpublikation


Cseh, Á. and Skutella, M..
Paths to stable allocations.
International Journal of Game Theory, Vol. 48, pp. 835–862, 2019.


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.


Disser, Y. and Skutella, M..
The Simplex Algorithm Is NP-Mighty.
ACM Transactions on Algorithms, Vol. 15, pp. 5:1–5:19, 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 zur Originalpublikation


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 zur Originalpublikation


Cevallos, A., Eisenbrand, F. and Morell, S..
Diversity maximization in doubling metrics.
29th International Symposium on Algorithms and Computation (ISAAC 2018), Vol. 123, pp. 33, 2018.

Link zur Publikation


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.


Sagnol, G., Schmidt genannt Waldschmidt, D. and Tesch, A..
The Price of Fixed Assignments in Stochastic Extensible Bin Packing.
In Approximation and Online Algorithms (WAOA '18), Lecture Notes in Computer Science, Vol. 11312, pp. 327–347, 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 zur Originalpublikation


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


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


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


Groß, M., Pfetsch, M. E. and Skutella, M..
On the Complexity of Instationary Gas Flows.
Operations Research Letters, Vol. 46, pp. 286-290, 2018.


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.


2017

Sering, L..
A Combinatorial Upper Bound on the Length of Twang Cascades.
In Proceedings of the 33nd European Workshop on Computational Geometry (EuroCG'17), pp. 177 – 180, Malmö, 2017.

Link zur Publikation


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.


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


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 zur Publikation Link zur Originalpublikation


Schlöter, M. and Skutella, M..
Fast and Memory-Efficient Algorithms for Evacuation Problems.
In Klein, Philip N. (ed.)Proceedings of the 28th Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 821-840, SIAM, 2017.


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 zur Publikation Link zur Originalpublikation


2016


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.


Disser, Y. and Matuschke, J..
Degree-constrained orientations of embedded graphs.
Journal of Combinatorial Optimization, Vol. 3, pp. 758–773, 2016.

Link zur Publikation Link zur Originalpublikation


Disser, Y., Hackfeld, J. and Klimm, M..
Undirected graph exploration with Θ(log log n) pebbles.
In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 25-39, 2016.

Link zur Publikation


Böhmová, K., Disser, Y., Mihalák, M. and Sramek, R..
Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs.
In Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN), 2016. to appear.


Chen, L., Megow, N. and Schewior, K..
An O(log m)-competitive algorithm for online machine minimization.
In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 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.


Harks, T. and Klimm, M..
Congestion games with variable demands.
Mathematics of Operations Research, Vol. 41, pp. 255-277, 2016.


Borndörfer, R., Schenker, S., Skutella, M. and Strunk, T..
PolySCIP.
In Greuel, Gert-Martin and Koch, Thorsten and Paule, Peter and Sommese, Aandrew J. (ed.)Proceedings of the 5th International Conference on Mathematical Software, Lecture Notes in Computer Science, Vol. 9725, pp. 259–264, Springer, 2016.


Skutella, M..
A note on the ring loading problem.
SIAM Journal on Discrete Mathematics, Vol. 30, pp. 327–342, 2016.


Skutella, M., Sviridenko, M. and Uetz, M..
Unrelated Machine Scheduling with Stochastic Processing Times.
Mathematics of Operations Research, Vol. 41, pp. 851–864, 2016.


Skutella, M. and Verschae, J..
Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures.
Mathematics of Operations Research, Vol. 41, pp. 991–1021, 2016.


2015

Groß, M. and Skutella, M..
A tight bound on the speed-up through storage for quickest multi-commodity flows.
Operation Research Letters, Vol. 43, pp. 93–95, 2015.

Link zur Originalpublikation


Bjelde, A., Fischer, F. and Klimm, M..
Impartial Selection and the Power of Up to Two Choices.
In Proceedings of the 11th Conference on Web and Internet Economics (WINE), 2015.


Harks, T. and Klimm, M..
Bottleneck Routing with Elastic Demands.
In Proceedings of the 11th Conference on Web and Internet Economics (WINE), 2015.


Harks, T. and Klimm, M..
Equilibria in a Class of Aggregative Location Games.
Journal of Mathematical Economics, Vol. 61, pp. 211-220, 2015.


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.


Chen, L., Megow, N., Rischke, R., Stougie, L. and Verschae, J..
Optimal Algorithms and a PTAS for Cost-Aware Scheduling.
In Proceedings of the 40th International Symposium on Mathematical Foundations of Computer Science (MFCS'15), pp. 211–222, 2015.


Chen, L., Megow, N., Rischke, R. and Stougie, L..
Stochastic and Robust Scheduling in the Cloud.
In Proceedings of the 18th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'15), pp. 175–186, 2015.


Zusatzinformationen / Extras