People‎ > ‎

Dirk Oliver Theis

Associate Professor

Diplom in math w/ minor CS Heidelberg (2002)
Dr. rer.nat. Heidelberg (2005, summa cum laude) under Gerhard Reinelt
Habilitation to Priv.-Doz. (math) Magdeburg (2012)

Complete resumé

Research

Algorithms, Randomness, Combinatorics, Combinatorial Optimization;
Applications of Optimization

Recent Talks


Projects and Activities

2015-2018:
Bicliques--Combinatorics, Communication, and Optimization. Funded by ETAG (2015-2018)

2015:
Dagstuhl seminar #15082: Limitations of Convex Programming (report)

2013:
Dagstuhl seminar #13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (report)


Recent Preprints

Theory:

  • On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope
    w/ Kaveh Khoshkhah
    arXiv:1702.01424
  • Fooling Sets and the Spanning Tree Polytope
    w/ Kaveh Khoshkhah
    arXiv:1701.00350 (Inform Process Lett)
  • The (minimum) rank of typical fooling set matrices
    w/ Mozhgan Pourmoradnasseri
    arXiv:1608.07038
  • On the Graph of the Pedigree Polytope
    w/ Abdullah Makkeh, Mozhgan Pourmoradnasseri
    arXiv:1611.08431
  • The Graph of the Pedigree Polytope is Asymptotically Almost Complete (Ext.Abs.)
    w/ Abdullah Makkeh, Mozhgan Pourmoradnasseri
    arXiv:1611.08419 (CALDAM)
  • Nondeterministic Communication Complexity of Random Boolean Functions
    w/ Mozhgan Pourmoradnasseri
    arXiv:1611.08400 (TAMC)
  • Short note on the number of 1-ascents in dispersed Dyck paths
    w/ Kairi Kangro, Mozhgan Pourmoradnasseri
    arXiv:1603.01422

Applications:



Teaching


Spring 2017
Fall 2016/17
Spring 2016:   sabbatical

Fall 2015/16
Spring 2015
Fall 2014/15
Spring 2014
Fall 2013/14
  • MTAT.05.008 Discrete Mathematics
  • MTAT.05.005 Enumerative Combinatorics
  • MTAT.05.116 Discrete Math Seminar
Spring 2013
  • MTAT.07.025 Mathematics for Cryptology