Babak Ghanbari

I am a PhD student at Computer Science Institute of Charles University under the supervision of Robert Šámal. I received my Master's degree in Mathematics from Sharif University of Technology, where I was advised by Ebadollah S. Mahmoodian and Javad B. Ebrahimi. My research interests lie in Combinatorics, Graph Theory, and Combinatorial Optimization.

My hobbies

I play football, volleyball, bowling, billiards, tennis, badminton, and other sports whenever possible. Apart from playing sports, I like programming and watching movies and TV series.

Publications

  1. Ghanbari, B., Šámal, R. (2026). A Near-Linear-Time Algorithm for Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs. In: Koucký, M., Petrișan, D. (eds), 51st International Symposium on Mathematical Foundations of Computer Science (MFCS 2026), Leibniz International Proceedings in Informatics (LIPIcs), vol. 386, pp. 11:1–11:14. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. DOI.
  2. Ghanbari, B., Hartman, D., Jelínek, V., Pokorná, A., Šámal, R., Valtr, P. (2026). Structure of betweenness uniform graphs with low values of betweenness centrality. Discrete Applied Mathematics, vol. 395, pp. 19–34. DOI.
  3. Ghanbari, B., Šámal, R. (2026). On the Time Complexity of Finding a Well-Spread Perfect Matching in Bridgeless Cubic Graphs. In: Fernau, H., Kindermann, P. (eds), Graph-Theoretic Concepts in Computer Science (WG 2025), Lecture Notes in Computer Science, vol. 16124, pp. 219–229. Springer, Cham. DOI.
  4. Ebrahimi, J. B., Ghanbari, B. (2026). Fractional forcing number of graphs. Discrete Mathematics, vol. 349, no. 2, 114739. DOI.
  5. Ghanbari, B., Šámal, R. (2025). Facial diagrams and cycle double cover. In: Proceedings of the 13th European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'25), pp. 493–498.
  6. Ghanbari, B., Šámal, R. (2024). Approximate Cycle Double Cover. In: Rescigno, A. A., Vaccaro, U. (eds), Combinatorial Algorithms (IWOCA 2024), Lecture Notes in Computer Science, vol. 14764, pp. 421–432. Springer, Cham. DOI.
  7. Ghanbari, B., Hartman, D., Jelínek, V., Pokorná, A., Šámal, R., Valtr, P. (2023). On the structure and values of betweenness centrality in dense betweenness-uniform graphs. In: Proceedings of the European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2023), pp. 478–484. DOI.

Preprints

  1. Ghanbari, B., Šámal, R. (2025). Approximate Cycle Double Cover. Extended version.

Teaching

  • Combinatorics and Graphs 2 (Summer 2023/24)
  • Combinatorics and Graphs 1 (Winter 2023/24)

Contact Information

Email: babak@iuuk.mff.cuni.cz

Office: S 508, Malostranské nám. 2/25, Prague, Czech Republic