Research Interests

• Mobile Agent Computing
• Distributed Computing
• Online Algorithms
• Optimization Problems in Optical Networks

Teaching

TU Darmstadt

• Distributed Computing, Winter Semester 2018-19

Teaching Assistant

TU Darmstadt

• Einführung in die Programmierung I, Winter Semester 2019-20

Publications

• Near-Gathering of Energy-Constrained Mobile Agents, A. Bärtschi, E. Bampas, J.Chalopin, S. Das, C. Karousatou and M. Mihalák. In Proceedings of the 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 52--65, 2019
• Collaborative Exploration of Trees by Energy-Constrained Mobile Robots, S. Das, D .Dereniowski and C. Karousatou. Theory of Computing Systems, 62(5): 1223--1240, 2018
• Minimum Multiplicity Edge Coloring via Orientation, E. Bampas, C. Karousatou, A. Pagourtzis and K. Potika. Discrete Applied Mathematics, 247: 380--388, 2018
• Path Multicoloring in Spider Graphs with Even Color Multiplicity, E. Bampas, C. Karousatou, A. Pagourtzis and K. Potika. Information Processing Letters, 133: 1--4, 2018
• Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots, E. Bampas, S. Das, D. Dereniowski and C. Karousatou. In Proceedings of the 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS), pp. 1--12, 2017
• Collaborative Exploration by Energy-Constrained Mobile Robots, S. Das, D. Dereniowski and C. Karousatou. In Proceedings of the 22nd International Colloquium on Structural Information and Communication Complexity (SIROCCO), pp. 357--369, 2015
• Scheduling Connections via Path and Edge Multicoloring, E. Bampas, C. Karousatou, A. Pagourtzis and K. Potika. In Proceedings of the 14th International Conference on Ad Hoc Networks and Wireless (ADHOC-NOW), pp. 33--47, 2015