BSc theses

  Ákos Englert: Representations of planar graphs (in Hungarian), Eötvös Loránd University (2010)

  Katalin Pajkossy: Graphic Submodular Function Minimalization (in Hungarian), Eötvös Loránd University (2010)

  Laura Cizmadija: Fullerene structures (in Hungarian), Eötvös Loránd University (2011)

  Markó Horváth: Polychromatic coloring of plane graphs (in Hungarian), Eötvös Loránd University (2011)

  Bálint Márk Vásárhelyi: Mathematical methods in DNA sequence analysis, Eötvös Loránd University (2011)

  Bonifác Herczeg: Antimagic graphs (in Hungarian), Eötvös Loránd University (2013)

  Erika Mercs: Mathematical methods in navigation (in Hungarian), Eötvös Loránd University (2013)

  Kinga Tikosi: Tuza's conjecture (in Hungarian), Eötvös Loránd University (2014)

  Zsolt Szabó: Multi-agent pathfinding algorithms (in Hungarian), Eötvös Loránd University (2014)

  Regina Krisztina Bíró: Constructing Phylogenetic Trees, Eötvös Loránd University (2015)

  Natália Réka Ivánkó: Distance of gene sequences in bioinformatics (in Hungarian), Eötvös Loránd University (2015)

  Orsolya Gyóni: Alternating paths and separated matchings (in Hungarian), Eötvös Loránd University (2016)

  Máté Rónai: Interval edge-colorings (in Hungarian), Eötvös Loránd University (2016)

  Zoltán Paulovics: Satisfactory graph partition (in Hungarian), Eötvös Loránd University (2018)

  Szilvia Keszthelyi: Extensions of bipartite matching Eötvös Loránd University (2019)

MSc theses

  Ferenc Péterfalvi: Independent trees in graphs (in Hungarian), Eötvös Loránd University (2009)

  Bálint Márk Vásárhelyi: Suffix trees and their applications , Eötvös Loránd University (2013)

  Szilvia Ágnes Tóth: Drawing Planar Graphs (in Hungarian), Eötvös Loránd University (2014)

  Norbert Vadas: Edge colourings (in Hungarian), Eötvös Loránd University (2015)

  Pál Bärnkopf: Algorithmic research of score vectors (in Hungarian), Eötvös Loránd University (2018)

  Hanna Gábor: About a conjecture of Goddard and Henning, Eötvös Loránd University (2018)

  Lydia Mirabel Mendoza Cadena: The minimum feasibility blocker problem, Eötvös Loránd University (2020)

  Tamás Schwarcz: Packing common independent sets through reductions of matroids, Eötvös Loránd University (2020)