Jakub Balabán

I am a PhD student under the supervision of Professor Petr Hliněný at the DIMEA laboratory at the Faculty of Informatics, Masaryk University, Brno, Czechia. I study algorithmic graph theory: my research has focused mainly on a graph parameter called twin-width. I am a Brno PhD Talent scholarship holder – funded by the Brno city municipality.

My e-mail: jakbal@mail.muni.cz

Conference proceedings

Jakub Balabán, Robert Ganian, and Mathis Rocton. "Twin-Width Meets Feedback Edges and Vertex Integrity". In: 19th International Symposium on Parameterized and Exact Computation, IPEC 2024.
Jakub Balabán, Robert Ganian, and Mathis Rocton. "Computing Twin-Width Parameterized by the Feedback Edge Number". In: 41st International Symposium on Theoretical Aspects of Computer Science, STACS 2024.
Jakub Balabán, Petr Hliněný, and Jan Jedelský. "Twin-Width and Transductions of Proper k-Mixed-Thin Graphs". In: Graph-Theoretic Concepts in Computer Science - 48th International Workshop, WG 2022.
Jakub Balabán and Petr Hliněný. "Twin-Width Is Linear in the Poset Width". In: 16th International Symposium on Parameterized and Exact Computation, IPEC 2021.

Journal publications

Jakub Balabán, Petr Hliněný, and Jan Jedelský. "Twin-Width and Transductions of Proper k-Mixed-Thin Graphs". In: Discrete Mathematics, 2024.

Internships and stays

Two-month stay at RWTH Aachen, Germany; hosted by Professor Peter Rossmanith; 2025
One-semester Erasmus stay at TU Wien, Vienna, Austria; 2023

Events attended with a talk

Czech-Slovak Conference on Graph Theory; Trojanovice, Czechia; 2024
International Symposium on Theoretical Aspects of Computer Science (STACS); Clermont-Ferrand, France; 2024
Spring School of Combinatorics; Vysoká Lípa, Czechia; 2024
GGOAT Research Seminar; Czech Technical University in Prague, Czechia; 2022
Czech and Slovak Conference on Graph Theory; Rajecké Teplice, Slovakia; 2021

Other attended events

Workshop on Graph Classes, Optimization, and Width Parameters; Cottbus, Germany; 2024
Czech Summer School on Discrete Mathematics; Prague, Czechia; 2024
EPIT 2023: Le Kaléidoscope de la Complexité; Ile d'Oléron, France; 2023
LoGAlg, Workshop on Logic, Graphs, and Algorithms; Warsaw, Poland; 2023
Czech-Slovak International Symposium on Graph Theory, Combinatorics, Algorithms and Applications; Prague, Czechia; 2022
DIMEA Days (attended with a poster); Brno, Czechia; 2022
International Workshop on Graph-Theoretic Concepts in Computer Science (WG); Tübingen, Germany; 2022
SAT/SMT/AR/CP Summer School; Haifa, Israel; 2022

Teaching Experience

Mathematical Foundations of Computer Science; 2020, 2022-2024
Introduction to Informatics; 2022, 2024
Algorithms and Data Structures; 2021, 2024
Computability and Complexity; 2021, 2023
Non-Imperative Programming; 2020, 2021

Awards and Honors

Brno PhD Talent Fellowship; 2025
Dean’s Award for excellent academic performance and for final thesis; 2024
Czech and Slovak scientific competition (SVOČ 2022) – 1st place; 2022
Dean’s Award for excellent academic performance; 2021

More details

I have a Bachelor's degree in Mathematical Informatics and a Master's degree in Theoretical Computer Science (with specialization in Discrete Algorithms and Models), both from Masaryk University. Before university, I studied at Gymnázium Třebíč.
I hold a CEFR level C1 certificate in English from 2018. I also have basic knowledge of German.
Since 2023, I have been a member of the Accommodation Board and the Canteens Board of Masaryk University.
Between 2022 and 2024, I served as an elected representative in the Student Chamber of the Academic Senate of the Faculty of Informatics.