direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationsliste

G

Goetzmann, K.-S., Stiller, S. and Telha, C..
Optimization over Integers with Robustness in Cost and Few Constraints.
In Solis-Oba, Roberto and Persiano, Giuseppe (ed.)Approximation and Online Algorithms (WAOA 2011), pp. 89-101, Springer Berlin / Heidelberg, 2012.

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


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

Link zur Originalpublikation


Grandoni, F., Kaibel, V., Oriolo, G. and Skutella, M..
A short proof of the VPN tree routing conjecture on ring networks.
Operations Research Letters, Vol. 36, pp. 361–365, 2008.

Link zur Publikation


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


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.


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


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


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



Groß, M..
Flows over Time with Commodity-Dependent Transit Times.
Diploma thesis, TU Dortmund, 2009.

Link zur Publikation


Groß, M., Kappmeier, J.-P., Plümpe, D. and Schmidt, M..
Kreuzzahlrätsel.
Mitteilungen der DMV, Vol. 18, pp. 118, 2010.


Groß, M., Kappmeier, J.-P., Plümpe, D. and Schmidt, M..
Kreuzzahlrätsel.
Mitteilungen der DMV, Vol. 17, pp. 96, 2009.


Groß, M., Plümpe, D. and Schmidt, M..
Kreuzzahlrätsel – Sudokus waren gestern.
Informatik-Spektrum, Vol. 32, pp. 538-545, 2009.

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.


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


Gröpl, C. and Skutella, M..
Parallel Repetition of MIP(2,1) Systems.
In Mayr, Ernst W. and Prömel, Hans Jürgen and Steger, Angelika (ed.)Lectures on Proof Verification and Approximation Algorithms, pp. 161–177, Springer, 1998.

Link zur Publikation


Günther, E., Maurer, O., Megow, N. and Wiese, A..
A New Approach to Online Scheduling: Approximating the Optimal Competitive Ratio.
In Proceedings of the 24st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2013), pp. 118-128, 2013.

Link zur Publikation Link zur Originalpublikation


Gustedt, J..
Algorithmic Aspects of Ordered Structures.
Doctoral thesis, TU Berlin, 1992.


Gutiérrez, S., Krumke, S. O., Megow, N. and Vredeveld, T..
How to whack moles.
Theoretical Computer Science, Vol. 361, pp. 329–341, 2006.

Link zur Publikation Link zur Originalpublikation


Günther, E., König, F. G. and Megow, N..
Scheduling and Packing Malleable and Parallel Tasks with Precedence Constraints of Bounded Width.
Journal of Combinatorial Optimization, Vol. 27, pp. 164-181, 2014.

Link zur Publikation Link zur Originalpublikation


Günther, E., König, F. G. and Megow, N..
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width.
In Approximation and Online Algorithms: 7th International Workshop, WAOA 2009, Lecture Notes in Computer Science, Vol. 5893, pp. 170-181, Springer, 2010.

Link zur Publikation Link zur Originalpublikation


Günther, E., König, F. G. and Megow, N..
The Bin Scheduling Problem.
In Proceedings of the 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2009), 2009.

Link zur Publikation


Günther, E., Lübbecke, M. E. and Möhring, R. H..
Ship Traffic Optimization for the Kiel Canal.
In Proceedings of the Seventh Triennial Symposium on Transportation Analysis (TRISTAN 2010), 2010.

Link zur Publikation


Günther, E., Lübbecke, M. E. and Möhring, R. H..
Challenges in Scheduling when Planning the Ship Traffic on the Kiel Canal.
In Proceedings of the 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP 2011), 2011.

Link zur Publikation


H

Hall, A., Hippler, S. and Skutella, M..
Multicommodity Flows Over Time: Efficient Algorithms and Complexity.
In Baeten, Jos C. M. and Lenstra, Jan Karel and Parrow, Joachim and Woeginger, Gerhard J. (ed.)Automata, Languages and Programming, pp. 397–409, Springer, 2003.


Hall, A., Hippler, S. and Skutella, M..
Multicommodity Flows Over Time: Efficient Algorithms and Complexity.
Theoretical Computer Science, Vol. 379, pp. 387–404, 2007.

Link zur Publikation


Hall, A., Langkau, K. and Skutella, M..
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.
In Arora, Sanjeev and Jansen, Klaus and Rolim, José D. P. and Sahai, Amit (ed.)Approximation, Randomization, and Combinatorial Optimization, pp. 71–82, Springer, 2003.


Hall, A., Langkau, K. and Skutella, M..
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.
Algorithmica, Vol. 47, pp. 299–321, 2007.

Link zur Publikation


Hansknecht, C., Klimm, M. and Skopalik, A..
Approximate pure Nash equilibria in weighted congestion games.
In Klaus Jansen and Jos'e Rolim and Nikhil Devanur and Cristopher Moore (ed.)Proceedings of the 17th Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pp. 242 – 257, 2014.


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.


Harks, T. and Klimm, M..
On the Existence of Pure Nash Equilibria in Weighted Congestion Games.
Mathematics of Operations Research, Vol. 37, pp. 419 – 436, 2012.


Harks, T., Klimm, M. and Möhring, R. H..
Strong equilibria in games with the lexicographical improvement property.
International Journal of Game Theory, Vol. 42, pp. 461 – 482, 2013.

Link zur Publikation


Harks, T., Hoefer, M., Klimm, M. and Skopalik, A..
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games.
Mathematical Programming, Ser. A, Vol. 141, pp. 193 – 215, 2013.


Harks, T., Matuschke, J. and König, F. G..
Approximation Algorithms for Capacitated Location Routing.
Transportation Science, Vol. 47, pp. 3-22, 2013.

Link zur Publikation Link zur Originalpublikation


Harks, T., Hoefer, M., Klimm, M. and Skopalik, A..
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games.
In M. de Berg and U. Meyer (ed.)Proceedings of the 18th European Symposium on Algorithms (ESA), Lecture Notes in Computer Science, Vol. 6347, pp. 29 – 38, 2010.


Harks, T. and Klimm, M..
On the Existence of Pure Nash Equilibria in Weighted Congestion Games.
In S. Abramsky and C. Gavoille and C. Kirchner and F. Meyer auf der Heide and P. Spirakis (ed.)Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), Lecture Notes in Computer Science, Vol. 6198, pp. 79 – 89, Springer, 2010.


Harks, T., Hoefer, M., Schewior, K. and Skopalik, A..
Routing games with progressive filling.
In Proceedings of the International Conference on Computer Communications (INFOCOM), pp. 352-360, 2014.


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..
Strong Nash Equilibria in Games with the Lexicographical Improvement Property.
In S. Leonardi (ed.)Proceedings of the 5th International Workshop on Internet and Network Economics (WINE), Lecture Notes in Computer Science, Vol. 5929, pp. 463 – 470, Springer, 2009.


Harks, T., Klimm, M. and Möhring, R. H..
Characterizing the Existence of Potential Functions in Weighted Congestion Games.
In M. Mavronicolas and V. G. Papadopoulou (ed.)Proceedings of the 2nd International Symposium on Algorithmic Game Theory (SAGT), Lecture Notes in Computer Science, Vol. 5814, pp. 97 – 108, Springer, 2009.


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.


Harks, T., Matuschke, J. and König, F. G..
Approximation Algorithms for Capacitated Location Routing.
Preprint 010-2010, Technische Universität Berlin, 2010.

Link zur Publikation


Harks, T. and Klimm, M..
Multimarket oligopolies with restricted market access.
In Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), pp. 182-193, 2014.


Harks, T. and Klimm, M..
Demand Allocation Games: Integrating Discrete and Continuous Strategy Spaces.
In Chen, Ning and Elkind, Edith and Koutsoupias, Elias (ed.)Proceedings of the 7th International Workshop on Internet and Network Economics (WINE), pp. 194 – 205, 2011.


Harks, T., Klimm, M. and Peis, B..
Resource Competition on Integral Polymatroids.
In Proceedings of the 10th Conference on Web and Internet Economics (WINE), 2014. (to appear).


Harks, T., König, F., Matuschke, J., Richter, A. and Schulz, J..
An integrated approach to tactical transportion planning in logistics networks.
Transportation Science, 2014. To appear.


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.


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


Zusatzinformationen / Extras