Janka Chlebikova

Janka Chlebikova is a Senior Lecturer and Associate Head (Partnerships) in the School of Computing at the University of Portsmouth. She holds a PhD from Comenius University in Bratislava, where she also served as an Associate Professor. Previously, she conducted research at Christian-Albrechts-Universität zu Kiel and collaborated with institutions like the University of Copenhagen and Université Paris Dauphine. Her primary research interests include combinatorial optimization (focusing on approximation algorithms and hardness), graph theory, and educational software for discrete mathematics.

Her work spans theoretical contributions to algorithm design, particularly in scheduling, vehicle routing, and graph partitioning problems. Notable projects include studies on anonymization in social networks and approximation hardness of NP-hard problems. She is affiliated with the Portsmouth AI and Data Science Centre, reflecting her interdisciplinary approach to computational challenges.

Key research areas include the Travelling Salesman Problem, Dial-A-Ride scheduling, and structural graph analysis. Her publications address inapproximability results, optimization under constraints, and graph-theoretic applications in social networks. Chlebikova actively supervises PhD students and contributes to advancing educational tools in discrete mathematics.