direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationsliste

B

Büsing, C..
Recoverable Robustness in Combinatorial Optimization.
Doctoral thesis, TU Berlin, 2010.


Büsing, C. and Stiller, S..
Line planning, path constrained network flow, and inapproximability.
Networks, Vol. 57, pp. 106-113, 2011.


C

Caprara, A., Galli, L., Stiller, S. and Toth, P..
Delay-Robust Event Scheduling.
Operations Research, Vol. 62, pp. 274-283, 2014.

Link zur Publikation


Caragiannis, I., Kaklamanis, C., Kranakis, E., Krizanc, D. and Wiese, A..
Communication in wireless networks with directional antennas.
In Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures (SPAA 2008), pp. 344–351, ACM, 2008.

Link zur Publikation


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


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


Chalopin, J., Das, S., Disser, Y., Mihalák, M. and Widmayer, P..
Telling convex from reflex allows to map a polygon.
In Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 153–164, 2011.

Link zur Publikation


Chalopin, J., Das, S., Disser, Y., Mihalák, M. and Widmayer, P..
How Simple Robots Benefit from Looking Back.
In Proceedings of the 7th International Conference on Algorithms and Complexity (CIAC), pp. 229–239, 2010.

Link zur Publikation


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


Chalopin, J., Das, S., Disser, Y., Mihalák, M. and Widmayer, P..
Mapping Simple Polygons: The Power of telling Convex from Reflex.
ACM Transactions on Algorithms, Vol. 11, pp. 33(16), 2015.

Link zur Publikation


Chan, H.-L., Megow, N., Sitters, R. and van Stee, R..
The offline sorting buffer problem is NP-hard.
Theoretical Computer Science, Vol. 423, pp. 11–18, 2012.

Link zur Publikation Link zur Originalpublikation


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.


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.


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.
In Integer Programming and Combinatorial Optimization (IPCO 2014), pp. 249-260, Springer, 2014.


Correa, J. R., Skutella, M. and Verschae, J..
The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders.
In Dinur, Irit and Jansen, Klaus and Naor, Joseph and Rolim, José D. P. (ed.)Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, Lecture Notes in Computer Science, Vol. 5687, pp. 84–97, Springer, 2009.

Link zur Publikation


Correa, J. and Megow, N..
Clique partitioning with value-monotone submodular cost.
Discrete Optimization, Vol. 15, pp. 26-36, 2015.

Link zur Publikation Link zur Originalpublikation


Correa, J. R., Megow, N., Raman, R. and Suchan, K..
Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs.
In 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2009), 2009.

Link zur Publikation


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.


Coughlan, E. T., Lübbecke, M. E. and Schulz, J..
A Branch-and-Price Algorithm for Multi-mode Resource Leveling.
In Paola Festa (ed.)Proceedings of the 9th International Symposium on Experimental Algorithms (SEA2010), Lecture Notes in Computer Science, Vol. 6049, pp. 226-238, Springer, 2010.



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


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

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


D

Davis, R., Rothvoß, T., Baruah, S. and Burns, A..
Exact quantification of the sub-optimality of uniprocessor fixed-priority preemptive scheduling.
Kluwer Academic Publishers, Vol. 43, pp. 211–258, 2009.


Dereniowski, D., Disser, Y., Kosowski, A., Pająk, D. and Uznański, P..
Fast collaborative graph exploration.
Information and Computation, Vol. 243, pp. 37–49, 2015. to appear.

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


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.
Theoretical Computer Science, Vol. 562, pp. 557–564, 2015.

Link zur Publikation


Disser, Y., Mihalák, M. and Widmayer, P..
A polygon is determined by its angles.
Computational Geometry: Theory and Applications, Vol. 44, pp. 418–426, 2011.

Link zur Publikation


Disser, Y., Ghosh, S. K., Mihalák, M. and Widmayer, P..
Mapping a polygon with holes using a compass.
In Proceedings of the 8th International Symposium on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities (ALGOSENSORS), pp. 78–89, 2012.

Link zur Publikation


Disser, Y., Mihalák, M. and Widmayer, P..
Mapping polygons with agents that measure angles.
In Proceedings of the 10th International Workshop on the Algorithmic Foundations of Robotics (WAFR), pp. 415-425, 2012.

Link zur Publikation


Disser, Y., Mihalák, M. and Widmayer, P..
Reconstructing a simple polygon from its angles.
In Proceedings of the 12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), pp. 13–24, 2010.

Link zur Publikation


Disser, Y. and Skutella, M..
The Simplex Algorithm Is NP-Mighty.
ACM Transactions on Algorithms, Vol. 15, pp. 5:1–5:19, 2019.


Disser, Y., Bilò, D., Mihalák, M., Suri, S., Vicari, E. and Widmayer, P..
On the Limitations of Combinatorial Visibilities.
In Proceedings of the 25th European Workshop on Computational Geometry (EuroCG), pp. 207–210, 2009.

Link zur Publikation


Disser, Y., Müller-Hannemann, M. and Schnee, M..
Multi-criteria Shortest Paths in Time-Dependent Train Networks.
In Proceedings of the 7th International Workshop on Experimental Algorithms (WEA), pp. 347 – 361, 2008.

Link zur Publikation


Disser, Y., Megow, N., Klimm, M. and Stiller, S..
Packing a Knapsack of Unknown Capacity.
In Proceedings of the 31st Symposium on Theoretical Aspects of Computer Science (STACS), pp. 276–287, 2014.

Link zur Publikation


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. and Skutella, M..
The Simplex Algorithm is NP-mighty.
In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 858-872, 2015.

Link zur Publikation


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


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


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., Klimm, M. and Lübbecke, E..
Scheduling Bidirectional Traffic on a Path.
In Proceedings of the 42nd International Colloquium on Automata, Languages, and Programming (ICALP), pp. 406-418, 2015.

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.


Disser, Y. and Matuschke, J..
Degree-constrained orientations of embedded graphs.
In Kun-Mao Chao, Tsan-sheng Hsu, and Der-Tsai Lee (ed.)Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, pp. 506-516, Springer, 2012.

Link zur Publikation Link zur Originalpublikation


Doerr, B., Eremeev, A. V., Horoba, C., Neumann, F. and Theile, M..
Evolutionary algorithms and dynamic programming.
In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 771-778, 2009.


Doerr, B., Eremeev, A. V., Neumann, F., Theile, M. and Thyssen, C..
Evolutionary Algorithms and Dynamic Programming.
Theoretical Computer Science, Vol. (to appear), 2011.

Link zur Publikation


Doerr, B., Johannsen, D., Kötzing, T., Neumann, F. and Theile, M..
More Effective Crossover Operators for the All-Pairs Shortest Path Problem.
In Proceedings of the Parallel Problem Solving from Nature (PPSN XI), pp. 184-193, 2010.


Doerr, B. and Theile, M..
Improved analysis methods for crossover-based algorithms.
In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO), pp. 247-254, 2009.


Dressler, D., Flötteröd, G., Lämmel, G., Nagel, K. and Skutella, M..
Optimal Evacuation Solutions for Large-Scale Scenarios.
In Hu, Bo and Morasch, Karl and Pickl, Stefan and Siegle, Markus (ed.)Operations Research Proceedings 2010, pp. 239–244, Springer, 2011.


Zusatzinformationen / Extras