2009+
- : Oligomorphic Clones. To appear in Algebra Universalis.
- : Enumeration of Unlabeled Outerplanar Graphs. Submitted.
- : Weak quasi-randomness for uniform hypergraphs. submitted.
- : Obfuscated Drawings of Planar Graphs. submitted.
- : Sparse partition universal graphs for graphs of bounded degree. submitted.
- : Highly connected coloured subgraphs via the Regularity Lemma. Discrete Mathematics, to appear.
- : An expected polynomial time algorithm for coloring 2-colorable 3-graphs. submitted Extended abstract appeared in Electron. Notes Discrete Math. 34, pages 465-469..
- : Regularity lemmas for graphs. submitted.
2007
- : The order of the giant component of random hypergraphs. January. Preprint.
- : Local limit theorems and the number of connected hypergraphs. January. Preprint.
- : Why almost all k-colorable graphs are easy. To appear in the Proceedings of STACS 2007.
- : On the chromatic number of random graphs. January. Preprint.
2006
- : Graph partitioning via adaptive spectral techniques. July. Preprint.
- : Surface Realization with the Intersection Edge Functional. July. submitted.
- : k-Connectivity in the Semi-Streaming Model.
2005
- : Colouring random intersection graphs and complex networks. submitted.
- : On the Laplacian eigenvalues of G(n,p). Preprint.
- : The evolution of the min-min random graph process. Preprint.
- : Algorithmen im Drug Design. Lecture Notes.
- : Algorithmische Diskrete Mathematik 2. Lecture Notes.
- : Computation of best possible low degree expanders. submitted.
- : Verfahren und Vorrichtung zum computergestützten Auffinden von ähnlichen Molekülen. Patent.
2004
- : Decomposing, counting, and generating unlabeled cubic planar graphs uniformly at random. Submitted.
- : Algorithmische Diskrete Mathematik 1. Lecture Notes.
- : Das Shortest-Common-Superstring Problem. Poster.
2003
2002
- : K4-free subgraphs of random graphs revisited.
- : Large planar subgraphs in dense graphs. preprint.
