direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Journal Publications

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


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.  [pdf]


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.  [pdf]


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.  [pdf]


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.  [pdf]


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.  [pdf]


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.  [pdf]


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.  [pdf]


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.  [pdf]


Wilms, J., Disser, Y., Alber, G. and Percival, I. C.
Local Realism, Detection Efficiencies, and Probability Polytopes.
Physical Review A, Vol. 73, pp. 032116(8), 2008.  [pdf]


Conference Publications

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.


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.  [pdf]


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


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.  [pdf]


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.


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.  [pdf]


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.  [pdf]


Montanari, S., Mihalák, M. and Disser, Y.
Max Shortest Path for Imprecise Points.
In Proceedings of the 31st European Workshop on Computational Geometry (EuroCG), 2015.


Böhmova, K., Disser, Y., Kravina, E., Mihalák, M. and Widmayer, P.
Interval Selection on Unrelated Machines.
In Proceedings of the 12th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), 2015.


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.  [pdf]


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.  [pdf]


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.


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 Proceedings of the 8th International Conference on Algorithms and Complexity (CIAC), pp. 158 – 169, 2013.  [pdf]


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.  [pdf]


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.  [pdf]


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.  [pdf]


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.  [pdf]


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.  [pdf]


Disser, Y. and Matuschke, J.
Degree-constrained orientations of embedded graphs.
In Proceedings of the 23rd International Symposium on Algorithms and Computation (ISAAC), pp. 506-516, 2012.  [pdf]


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.  [pdf]


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.  [pdf]


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.  [pdf]


Bilò, D., Disser, Y., Mihalák, M., Suri, S., Vicari, E. and Widmayer, P.
Reconstructing Visibility Graphs with Simple Robots.
In Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 87–99, 2009.  [pdf]


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.  [pdf]


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.  [pdf]


Zusatzinformationen / Extras