Interests

Papers

Parameterized complexity of small weight automorphisms.
With V. Arvind, Johannes Köbler, Jacobo Torán.
Proceedings of 34th STACS. LIPIcs 66, 2017.

The parameterized complexity of fixing number and vertex individualization in graphs.
With V. Arvind, Frank Fuhlbrück, Johannes Köbler, Gaurav Rattan.
Mathematical Foundations of Computer Science (Proceedings of 41st MFCS). LIPIcs 58, 2016.

Solving linear equations parameterized by Hamming weight.
With V. Arvind, Johannes Köbler, Jacobo Torán.
Algorithmica 75:2 (Jun. 2016), pp. 322–338.

On the isomorphism problem for Helly circular-arc graphs.
With Johannes Köbler, Oleg Verbitsky.
Information and Computation 247:266–277 (2016)

Solving the canonical representation and star system problems for proper circular-arc graphs in logspace.
With Johannes Köbler, Oleg Verbitsky.
Journal of Discrete Algorithms 38–41:38–49 (2016)

Interval graph representation with given interval and intersection lengths.
With Johannes Köbler, Osamu Watanabe.
Journal of Discrete Algorithms 34:108–117 (Sep. 2015).

On the isomorphism problem for decision trees and decision lists.
With V. Arvind, Johannes Köbler, Gaurav Rattan, Yadu Vasudev.
Theoretical Computer Science 590:38–54 (2015).

Approximate Graph Isomorphism.
With V. Arvind, Johannes Köbler, Yadu Vasudev.
Mathematical Foundations of Computer Science (Proceedings of 37th MFCS). Springer, 2012. Pp. 100-111.

Around and beyond the isomorphism problem for interval graphs.
With Johannes Köbler, Oleg Verbitsky.
The Computational Complexity Column ed. by V. Arvind. Bulletin of the EATCS 107 (2012). Pp. 44-71.

The isomorphism problem for k-trees is complete for logspace.
With V. Arvind, Bireswar Das, Johannes Köbler.
Information and Computation 217:1–11 (Aug. 2012)

Interval graphs: Canonical representations in logspace.
With Johannes Köbler, Bastian Laubner, Oleg Verbitsky.
SIAM Journal on Computing 40(5):1292–1315 (2011).

Efficient edge-finding on unary resources with optional activities.
Applications of Declarative Programming and Knowledge Management (Proceedings of INAP/WLP 2007). Springer, 2009. Pp. 38-53.

Selected talks

Interval graphs: Canonical representations in logspace.
Talk at 37th ICALP, Bordeaux, France.
Delivered on July 7th, 2010.

The Isomorphism problem for k-trees is complete for logspace.
Talk at 34th MFCS, Novy Smokovec, Slovakia.
Delivered on August 24th, 2009.

Satz von Mahaney.
Referat im Rahmen der Veranstaltung Strukturelle Komplexitätstheorie.
Gehalten am 7.12.2004.

Teaching

Winter term 2016/17

Summer term 2016

Winter term 2015/16

Summer term 2015

Winter term 2014/15

Summer term 2014

Winter term 2013/14

Summer term 2013

Winter term 2012/13

Summer term 2012

Winter term 2011/12

Summer term 2011

Winter term 2010/11

Summer term 2010

Winter term 2009/10

Summer term 2009

Winter term 2008/09

Summer term 2008

Winter term 2007/08

Winter term 2005/6 to summer term 2007

Als Tutor habe ich an der TU Berlin folgende Veranstaltungen betreut: