Dr. Maurice Chandoo

Researcher and lecturer at Leibniz Universität Hannover, Institut für Theoretische Informatik
E-Mail: chandoo@thi.uni-hannover.de (PGP Key)
Postal address:
Leibniz Universität Hannover
Institut für Theoretische Informatik
Appelstraße 4
30167 Hannover, Germany

Short Bio

I studied computer science with a minor in economics at Leibniz Unveristät Hannover from 2010 to 2014 and completed my bachelor's and master's degree in 7 semesters. Afterwards, I did a PhD in computational complexity and graph theory under the supervision of Prof. Heribert Vollmer. Before studying computer science, I worked as freelancing software developer building specialized content management systems and bots.

I am interested in facilitating programming and making it accessible to a broad audience. To simplify the process of translating a mental representation of an algorithm into code, I developed a method where a program is constructed from traces and which untangles the tasks of determining the control flow, operations and predicates (demonstration in German). Currently, I am working on a meta programming language which can be translated into high-level programming languages such as C++, Haskell, Java, JavaScript and Python. Programs produced by the application of the aforementioned method result in code in this meta language and thus can be directly used in any of these high-level languages.

Publications & Theses

  1. Separating Algorithmic Thinking and Programming
    Repositorium der Leibniz Universität Hannover, DOI 10.15488/9177, 2020
  2. A Systematic Approach to Programming
    Arxiv, CoRR abs/1808.08989, 2019
  3. Fundamentals of Parameterized Complexity Revisited
    Arxiv, CoRR abs/1804.11089, 2019
  4. A Complexity Theory for Labeling Schemes
    Arxiv, CoRR abs/1802.02819, 2018
  5. Canonical Representations for Circular-Arc Graphs Using Flip Sets
    Algorithmica Volume 80, Issue 12, pp 3646-3672, 2018
  6. On the Implicit Graph Conjecture
    41st Symposium on Mathematical Foundations of Computer Science (MFCS), 2016
    superseded by [4]
  7. Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace
    33rd Symposium on Theoretical Aspects of Computer Science (STACS), 2016
    superseded by [3]
The bachelor's and master's theses are direct links to the pdf files.

Selected Talks


I used to tutor students from 5th to 13th grade in math and physics for about three years. At university, I teach the following courses:


last updated on 22 July 2020