Cornelius Brand

I'm a former PhD student in the group of Holger Dell. I've since moved as a postdoctoral researcher to Charles University in Prague, please see my website

Short CV

  • 07/2011: Abitur at Gymnasium Neutraubling
  • 10/2011 - 02/2014: Bachelor's studies in Computer Science at the University of Passau. Graduated with distinction
  • 04/2014 - now: Member of the Saarbrücken Graduate School of Computer Science
  • 01/2016 - 05/2016: Visiting graduate student at the Simons Institute for the Theory of Computing, in the program on counting complexity and phase transitions
  • 06/2016: Joined the group on Foundations of Exact Algorithms, headed by Holger Dell.
    09/2019: Defended my thesis


Research interests

  • Lower bounds under #ETH, ETH and SETH
  • Parameterized complexity, esp. for Subgraph Isomorphism and related problems, including the parameterized complexity of exact and approximative counting problems
  • Algebraic graph algorithms
  • Computing coefficients in representation theory (such as Kostka numbers and Littlewood-Richardson coefficients)
  • Polynomial system solving



My 5th through my 9th semester at university, I was supported by a scholarship from the German National Merit foundation.

Our paper "Fine-grained dichotomies for the Tutte plane and Boolean #CSP" co-won a best paper award at IPEC 2016. Equivalently, a co-best paper award won our co-paper.

My paper "Patching Colors with Tensors" won the best student paper award of Track A at ESA 2019.


Cornelius Brand

Saarland University
Cluster of Excellence
Multimodal Computing and Interaction

Room 426
Campus E1 3
66123, Saarbrücken

Fon: +49 681 302 3434



Computer Science Department, Saarland University Saarland University International Graduate School for Computer Science, Saarland University Cluster of Excellence