Jan Dreier
Informatiker,
Hochschullehrer
Hat mitgewirkt an:
-
Two new perspectives on algorithmic meta-theorems : evaluating approximate first-order counting queries on bounded expansion and first-order queries on random graphs
-
CSP beyond tractable constraint languages
-
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
-
First-Order Model-Checking in Random Graphs and Complex Networks