Lake Baikal, Siberia in January.

René van Bevern

Dipl.-Inf. René van Bevern, researcher and PhD student at Technische Universität Berlin, Germany.

Technische Universität Berlin
Algorithmik und Komplexitästheorie
Sekretariat TEL 5-1
Ernst-Reuter-Platz 7
10587 Berlin

Room: TEL 509
Office Phone: (+49) 30 314 24166
E-Mail: rene.vanbevern@tu-berlin.de

Work

Prior to my work in Berlin, I have been working at Friedrich-Schiller-Universität Jena, Thuringia, Germany.

I am a former member of the Debian project and used to write for German Linux magazines like Pro-Linux.de (online) and Linux-User (printed).

René van Bevern: Towards Optimal and Expressive Kernelization for d-Hitting Set. Appeared online 2013 in Algorithmica [paper, abstract, preprint, slides]. A preliminary version appeared at COCOON'12, Sydney, Australia, August 2012.
Manuel Sorge, René van Bevern, Rolf Niedermeier, and Mathias Weller: A New View on Rural Postman Based on Eulerian Extension and Matching. Appeared 2012 in Journal of Discrete Algorithms [paper, abstract, preprint]. A preliminary version appeared at IWOCA'11, Victoria, Canada, June 2011.
René van Bevern, Hannes Moser, and Rolf Niedermeier: Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion. Appeared 2012 in Algorithmica [paper, abstract, preprint, slides]. A preliminary version appeared at LATIN'10, Oaxaca, México, April 2010.
Nadja Betzler, René van Bevern, Michael R. Fellows, Christian Komusiewicz, and Rolf Niedermeier: Parameterized Algorithmics for Finding Connected Motifs in Biological Networks. Appeared 2011 in IEEE/ACM Transactions on Computational Biology and Bioinformatics. [paper, abstract, preprint, source code]

René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondřej Suchý: On the Parameterized Complexity of Graph Bisections. At WG'13, Lübeck, Germany, June 2013.
René van Bevern, Robert Bredereck, Morgan Chopin, Sepp Hartung, Falk Hüffner, André Nichterlein, Ondřej Suchý: Parameterized Complexity of DAG Partitioning. At CIAC'13, Barcelona, Spain, May 2013. [preprint]
René van Bevern, Mathias Mnich, Rolf Niedermeier, and Mathias Weller: Interval Scheduling and Colorful Independent Sets. At ISAAC'12, Taipei, Taiwan, December 2012. [paper, abstract, preprint]
René van Bevern, Sepp Hartung, Frank Kammer, Rolf Niedermeier, and Mathias Weller: Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs. At IPEC'11, Saarbrücken, Germany, September 2011. [paper, abstract, preprint, slides]
Manuel Sorge, René van Bevern, Rolf Niedermeier, and Mathias Weller: From Few Components to an Eulerian Graph by Adding Arcs. At WG'11, Teplá Monastery, Czech Republic, June 2011. [paper, abstract, preprint]
René van Bevern, Christian Komusiewicz, Hannes Moser, and Rolf Niedermeier: Measuring Indifference: Unit Interval Vertex Deletion. At WG'10, Zarós, Greece, June 2010. [paper, abstract, preprint, slides]

René van Bevern, Michael Fellows, Serge Gaspers, Frances Rosamond: Myhill-Nerode Methods for Hypergraphs and Applications. [abstract, manuscript]

René van Bevern: The Computational Hardness and Tractability of Restricted Seriation Problems on Inaccurate Data. Diplomarbeit, Institut für Informatik, Friedrich-Schiller-Universität Jena, Germany, April 2010. [abstract, thesis, slides]
René van Bevern: Graph-based data clustering: a quadratic-vertex problem kernel for s-Plex Cluster Vertex Deletion. Studienarbeit, Institut für Informatik, Friedrich-Schiller-Universität Jena, Germany, September 2009. [abstract, thesis, slides]

Thanks to Christoph Taszus for providing me with web space.