Balint Tillman

I have received my B.Sc. degree in Business Information Technology from Corvinus University of Budapest (2012) and my M.Sc. degree in Software Development and Technology from IT University of Copenhagen (2014). I worked as an intern during my studies at Corvinno Technology Transfer (Budapest) and I served as a teaching assistant for algorithm classes at ITU (Denmark). I have joined Google for three internship over the summers of 2016-2018 working on recommender systems for data center networking and YouTube spam detection. Currently, I am a PhD. student in the Networked Systems Program at UC Irvine working with professor Athina Markopoulou.

For more detailed information, please see: CV


  • Graph theory and algorithms
  • Privacy in networks
  • Applied machine learning


  • A research position in machine learning and networked systems starting September 2019

Research and work experience

  • Project III: Graph construction methods
  • Google Internship 2018 (Youtube Scaled Abuse): Spam detection in video similarity graphs
  • Google Internship 2017 (NetEng): Postmortem recommender system v2 based on machine learning (using TFX)
  • Google Internship 2016 (NetEng): Postmortem recommender system based on graph alignment


  • Henry Samueli Fellowship for Networked Systems 2015-2016
  • UCI Networked Systems Fellowship 2014-2015
  • InGRID Visiting Grant, Jan. 2014 at UvA, Netherlands


  • On the Construction of DAG1K and DAG2K Graphs
    B. Tillman, A. Markopoulou, manuscript in preparation
  • 2K+ Graph Construction Framework: Targeting Joint Degree Matrix and Beyond pdf
    B. Tillman, A. Markopoulou, C. T. Butts, M. Gjoka,  to appear in IEEE/ACM Transactions on Networking, Dec. 2018
  • Construction of Directed 2K Graphs pdf
    B. Tillman, A. Markopoulou, C.T Butts, M. Gjoka
    In Proc. of KDD 2017 and poster presentation, Halifax, Canada, Aug. 2017
  • Construction of Simple Graphs with a Target Joint Degree Matrix and Beyond pdf
    M. Gjoka, B. Tillman, A. Markopoulou
    IEEE INFOCOM 2015, Hong Kong, Apr. 2015
  • Script- and Cluster-based UCT for StarCraft pdf
    N. Justesen, B. Tillman, J. Togelius, S. Risi
    IEEE Conference on Computational Intelligence in Games (CIG), Dortmund, Germany, Aug. 2014


  • On the Number of Connected Components of Joint Degree Matrix Realizations pdf
    B. Tillman, A. Markopoulou
    NetSci, Paris, France, June 2018
  • The Computational Hardness of dK-Series pdf
    W. E Devanny, D. Eppstein, B. Tillman
    NetSci, Seoul, South Korea, June 2016
  • Efficient Construction of 2K+ Graphs pdf
    M. Gjoka, B. Tillman, A. Markopoulou, R. Pagh
    NetSci, Berkeley, CA, June 2014


  • Graph Construction using the dK-Series Framework pdf
    B. Tillman
    PhD Dissertation, UCI, March 2020
  • Towards 3K graph construction pdf
    B. Tillman
    Master’s Thesis, ITU, June 2014

Teaching experience

  • EECS215/UCI: Design and Analysis of Algorithms, Winter 2018
  • EECS215/UCI: Design and Analysis of Algorithms, Fall 2015
  • SAD1/ITU: Algorithm Design I., Autumn 2013
  • SGDS/ITU: Foundations of Computing – Algorithms and Data Structures, Autumn 2013
  • SGDS/ITU: Foundations of Computing – Algorithms and Data Structures, Spring 2013


  • tillmanb AT uci DOT edu