direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationsliste

2014

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.


Cseh, Á. and Skutella, M..
Paths to stable allocations.
Proceedings of the 7th International Symposium on Algorithmic Game Theory (SAGT), 2014.

Link zur Originalpublikation


Correa, J., Marchetti-Spaccamela, A., Matuschke, J., Stougie, L., Svensson, O., Verdugo, V. and Verschae, J..
Strong LP formulations for scheduling splittable jobs on unrelated machines.
Mathematical Programming, 2014. To appear.


Kappmeier, J.-P. W., Matuschke, J. and Peis, B..
Abstract flows over time: A first step towards solving dynamic packing problems.
Theoretical Computer Science, Vol. 544, pp. 74-85, 2014.

Link zur Publikation Link zur Originalpublikation


Skutella, M., Sviridenko, M. and Uetz, M..
Stochastic scheduling on unrelated machines.
In Mayr, E. W. and Portier, N. (ed.)Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science, Leibniz International Proceedings in Informatics, Vol. 25, pp. 639-650, Dagstuhl Publishing, 2014.


Gairing, M., Harks, T. and Klimm, M..
Complexity and Approximation of the Continuous Network Design Problem.
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. 226 – 241, 2014.


Fischer, F. and Klimm, M..
Optimal Impartial Selection.
In Klaus Jansen and Jos'e Rolim and Nikhil Devanur and Cristopher Moore (ed.)Proceedings of the 15th ACM Conference on Economics and Computation (EC), pp. 803 – 820, 2014.


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


Klimm, M. and Schütz, A..
Congestion games with higher demand dimensions.
In Proceedings of the 10th Conference on Web and Internet Economics (WINE), pp. 453-459, 2014.


Höhn, W., Mestre, J. and Wiese, A..
How Unsplittable-Flow-Covering helps Scheduling with Job-Dependent Cost Functions.
In Proc. of the 41st International Colloquium on Automata, Languages, and Programming (ICALP), LNCS, Vol. 8572, pp. 625-636, Springer, 2014.

Link zur Publikation Link zur Originalpublikation


Disser, Y., Ghosh, S. K., Mihalák, M. and Widmayer, P..
Mapping a polygon with holes using a compass.
Theoretical Computer Science, Vol. 553, pp. 106–113, 2014.

Link zur Publikation


Disser, Y., Mihalák, M., Montanari, S. and Widmayer, P..
Rectilinear Shortest Path and Rectilinear Minimum Spanning Tree with Neighborhoods.
In Proceedings of the 3rd International Symposium on Combinatorial Optimization (ISCO), pp. 208-220, 2014.

Link zur Publikation


Disser, Y., Kratsch, S. and Sorge, M..
The minimum feasible tileset problem.
In Proceedings of the 12th Workshop on Approximation and Online Algorithms (WAOA), 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.


Klimm, M..
Competition for Resources: The equilibrium Existence Problem in Congestion Games.
In Selected Papers of the International Conference on Operations Research (OR2013), 2014.


Borndörfer, R., Möhring, R. and Skutella, M..
Towards better solutions in logistics with mathematics.
In 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, pp. 93–107, European Mathematical Society, 2014.


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.


2013

Megow, N. and Verschae, J..
Dual techniques for scheduling on a machine with varying speed.
In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP 2013), Lecture Notes in Computer Science, Vol. 7965, pp. 745–756, Springer-Verlag Berlin Heidelberg, 2013.

Link zur Publikation Link zur Originalpublikation



Matuschke, J..
Network flows and network design in theory and practice.
Doctoral thesis, TU Berlin, 2013.

Link zur Publikation



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.


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

Link zur Publikation


Bonifaci, V., Marchetti-Spaccamela, A., Stiller, S. and Wiese, A..
Feasibility Analysis in the Sporadic DAG Task Model.
In ECRTS, pp. 225-233, 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


Chalopin, J., Das, S., Disser, Y., Mihalák, M. and Widmayer, P..
Mapping Simple Polygons: How Robots Benefit from Looking Back.
Algorithmica, Vol. 65, pp. 43–59, 2013.

Link zur Publikation


Bonifaci, V., Marchetti-Spaccamela, A., Megow, N. and Wiese, A..
Polynomial-time exact schedulability tests for harmonic real-time tasks.
In Proceedings of the 34th IEEE Real-Time Systems Symposium (RTSS 2013), pp. 236-245, 2013.

Link zur Publikation


Gairing, M. and Klimm, M..
Congestion Games with Player-Specific Costs Revisited.
In B. Vöcking (ed.)Proceedings of the 6th International Symposium on Algorithmic Game Theory (SAGT), Lecture Notes in Computer Science, Vol. 8146, pp. 98 – 109, 2013.


Chalopin, J., Das, S., Disser, Y., Mihalák, M. and Widmayer, P..
Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons.
Discrete Applied Mathematics, Vol. 161, pp. 1287–1307, 2013.

Link zur Publikation


Disser, Y., Feldmann, A., Klimm, M. and Mihalák, M..
Improving the Hk-Bound on the Price of Stability in Undirected Shapley Network Design Games.
In P.G. Spirakis and M. Serna (ed.)Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC), Lecture Notes in Computer Science, Vol. 7878, pp. 158 – 169, 2013.

Link zur Publikation


von Falkenhausen, P. and Harks, T..
Optimal Cost Sharing for Resource Selection Games.
Mathematics of Operations Research, Vol. 38, pp. 184–208, 2013.


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


Megow, N. and Mestre, J..
Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints.
In Proceedings of the 4th Innovations in Theoretical Computer Science (ITCS 2013), pp. 495-504, 2013.

Link zur Publikation


Böhmová, K., Disser, Y., Mihalák, M. and Widmayer, P..
Interval Selection with Machine-Dependent Intervals.
In Proceedings of the 13th International Algorithms and Data Structures Symposium (WADS), pp. 170–181, 2013.

Link zur Publikation


Dereniowski, D., Disser, Y., Kosowski, A., Pajak, D. and Uznanski, P..
Fast Collaborative Graph Exploration.
In Proceedings of the 40th International Colloquium on Automata, Languages and Programming (ICALP), pp. 520–532, 2013.

Link zur Publikation


Matuschke, J., Bley, A. and Müller, B..
Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections.
In Algorithms – ESA 2013, pp. 707-718, Springer, 2013.

Link zur Originalpublikation


Cseh, Á., Matuschke, J. and Skutella, M..
Stable Flows over Time.
Algorithms, Vol. 6, pp. 532–545, 2013.

Link zur Publikation Link zur Originalpublikation


Landry, C., Henrion, R., Hömberg, D., Skutella, M. and Welz, W..
Task assignment, sequencing and path-planning in robotic welding cells.
In Methods and Models in Automation and Robotics (MMAR), 2013 18th International Conference on, pp. 252-257, 2013.


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


Friedrich, M..
Benefits of Sexual Reproduction in Evolutionary Computation.
Doctoral thesis, TU Berlin, 2013.

Link zur Publikation


Skutella, M..
Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines.
In Bonifaci, Vincenzo and Demetrescu, Camil and Marchetti-Spaccamela, Alberto (ed.)Experimental Algorithms – 12th International Symposium, SEA 2013, pp. 1–3, Springer, 2013.


2012


Gawrilow, E., Klimm, M., Möhring, R. H. and Stenzel, B..
Conflict-free vehicle routing: Load balancing and deadlock prevention.
EURO Journal on transportation and logistics, Vol. 1, pp. 87 – 111, 2012.


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.


Niemeier, M. and Wiese, A..
Scheduling with an Orthogonal Resource Constraint.
In 10th Workshop on Approximation and Online Algorithms (WAOA2012), 2012.


Fujishige, S. and Peis, B..
Lattice Polyhedra and Submodular Flows.
Japan Journal of Industrial and Applied Mathematics, Vol. 29, pp. 441-451, 2012.


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


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


Zusatzinformationen / Extras