direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

List of all publications

next >> [10]

2020

Marchetti-Spaccamela, A., Megow, N., Schlöter, J., Skutella, M. and Stougie, L..
On the Complexity of Conditional DAG Scheduling in Multiprocessor Systems [14].
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 [15].
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 [16].
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 [17].
In Springer International Publishing (ed.)Approximation and Online Algorithms, pp. 89–105, 2020.

Link to original publication [18]


Felsner, S., Kleist, L., Mütze, T. and Sering, L..
Rainbow Cycles in Flip Graphs [19].
SIAM Journal on Discrete Mathematics, Vol. 34, pp. 1-39, 2020.

Link to original publication [20]


Graf, L., Harks, T. and Sering, L..
Dynamic flows with adaptive route choice [21].
Mathematical Programming, Vol. 183, pp. 309–335, 2020.

Link to original publication [22]


Israel, J. and Sering, L..
The Impact of Spillback on the Price of Anarchy for Flows over Time [23].
In International Symposium on Algorithmic Game Theory, pp. 114–129, 2020.

Link to original publication [24]


Pham, H. M. and Sering, L..
Dynamic Equilibria in Time-Varying Networks [25].
In International Symposium on Algorithmic Game Theory, pp. 130–145, 2020.

Link to original publication [26]


2019

Däubel, K., Jäger, S., Mütze, T. and Scheucher, M..
On orthogonal symmetric chain decompositions [27].
Electronic Journal of Combinatorics, Vol. 26, pp. P3.64, 2019. Full version.

Link to original publication [28]


Däubel, K., Jäger, S., Mütze, T. and Scheucher, M..
On orthogonal symmetric chain decompositions [29].
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 [30]


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

Link to publication [32] Link to original publication [33]


Cseh, Á. and Skutella, M..
Paths to stable allocations [34].
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 [35].
Networks, Vol. 73, pp. 306–324, 2019.


Disser, Y. and Skutella, M..
The Simplex Algorithm Is NP-Mighty [36].
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 [37].
SIAM Journal on Discrete Mathematics, Vol. 33, pp. 1607-1636, 2019.

Link to original publication [38]


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 [39].
Optimization and Engineering, Vol. 20, pp. 543-–573, 2019.


Sering, L. and Vargas Koch, L..
Nash Flows Over Time with Spillback [40].
In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 935–945, 2019.

Link to publication [41] Link to original publication [42]


2018

Jäger, S..
Approximating Total Weighted Completion Time on Identical Parallel Machines with Precedence Constraints and Release Dates [43].
Operations Research Letters, Vol. 46, pp. 505–509, 2018.

Link to original publication [44]


Gregor, P., Jäger, S., Mütze, T., Sawada, J. and Wille, K..
Gray codes and symmetric chains [45].
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 [46]


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

Link to publication [48]


Neumann, F., Polyakovskiy, S., Skutella, M., Stougie, L. and Wu, J..
A Fully Polynomial Time Approximation Scheme for Packing While Traveling [49].
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 [50].
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 [51].
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 [52]


Bernstein, A., Däubel, K., Disser, Y., Klimm, M., Mütze, T. and Smolny, F..
Distance-preserving graph contractions [53].
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 [54]


Dürr, C., Erlebach, T., Megow, N. and Meißner, J..
An Adversarial Model for Scheduling with Testing [55].
In Proceedings of Innovations in Theoretical Computer Science (ITCS), 2018. full version on arXiv with title "Scheduling with Explorable Uncertainty".

Link to publication [56]


Matusche, J., Skutella, M. and Soto, J..
Robust randomized matchings [57].
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 [58].
Operations Research Letters, Vol. 46, pp. 286-290, 2018.


Sering, L. and Skutella, M..
Multi-Source Multi-Sink Nash Flows Over Time [59].
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 [60]


Felsner, S., Kleist, L., Mütze, T. and Sering, L..
Rainbow Cycles in Flip Graphs [61].
In 34th International Symposium on Computational Geometry (SoCG 2018), Vol. 99, pp. 38:1–38:14, Dagstuhl, Germany, 2018.

Link to publication [62]


2017

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

Link to publication [64]


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 [65].
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 [66].
In Proceedings of the Symposium on Experimental Algorithms (SEA), 2017.

Link to publication [67] Link to original publication [68]


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 [69].
In Proceedings of the Symposium on Discrete Algorithms (SODA), pp. 994–1005, 2017.

Link to publication [70] Link to original publication [71]


Schlöter, M. and Skutella, M..
Fast and Memory-Efficient Algorithms for Evacuation Problems [72].
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 [73].
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 [74].
In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP), 2017.

Link to publication [75] Link to original publication [76]


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

Link to publication [78] Link to original publication [79]


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

Link to publication [81] Link to original publication [82]


2016

Skutella, M..
A 2.542-Approximation for Precedence Constrained Single Machine Scheduling with Release Dates and Total Weighted Completion Time Objective [83].
Operations Research Letters, Vol. 44, pp. 676–679, 2016.


Schewior, K..
Handling Critical Tasks Online [84].
Doctoral thesis, TU Berlin, 2016.

Link to publication [85]


Cseh, Á..
Complexity and algorithms in matching problems under preferences [86].
Doctoral thesis, TU Berlin, 2016.

Link to publication [87]


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


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

Link to publication [90] Link to original publication [91]


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

Link to publication [93]


Böhmová, K., Disser, Y., Mihalák, M. and Sramek, R..
Scheduling Transfers of Resources over Time: Towards Car-Sharing with Flexible Drop-Offs [94].
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 [95].
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 [96].
Latin American Theoretical Informatics Symposium (LATIN), 2016.


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


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


Borndörfer, R., Schenker, S., Skutella, M. and Strunk, T..
PolySCIP [99].
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.


next >> [109]
------ Links: ------

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.
Copyright TU Berlin 2008