Each list is chronologically sorted. Click a publication's title to get an abstract, bibtex entry, or the paper itself.
Journal Articles
- René van Bevern, Hannes Moser,
and Rolf
Niedermeier:
Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion.
Algorithmica: 62(3), pp. 930–950, 2012. - Nadja
Betzler, René van Bevern,
Michael R. Fellows, Christian
Komusiewicz, and Rolf
Niedermeier:
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks.
IEEE/ACM Transactions on Computational Biology and Bioinformatics:8(5), pp. 1296–1308, 2011. Source code used for experiments available.
Conference Articles
- 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. In Proceedings of the 6th International Symposium on Parameterized and Exact Computation (IPEC'11), Saarbrücken, Germany, September 2011. Volume 7112 in Lecture Notes in Computer Science, pages 194–206, Springer. - Manuel
Sorge, René van
Bevern, Rolf
Niedermeier,
and Mathias
Weller:
A New View on Rural Postman Based on Eulerian Extension and Matching. In Proceedings of the 22nd International Workshop on Combinatorial Algorithms (IWOCA'11), Victoria, Canada, June 2011. Volume 7056 in Lecture Notes in Computer Science, pages 310–323, Springer. - Manuel
Sorge, René van
Bevern, Rolf
Niedermeier,
and Mathias
Weller:
From Few Components to an Eulerian Graph by Adding Arcs. In Proceedings of the 37th International Workshop on Graph Theoretic Concepts in Computer Science (WG'11), Teplá Monastery, Czech Republic, June 2011. Volume 6986 in Lecture Notes in Computer Science, pages 307–318, Springer. - René van Bevern, Christian
Komusiewicz, Hannes Moser,
and Rolf
Niedermeier:
Measuring Indifference: Unit Interval Vertex Deletion. In Proceedings of the 36th International Workshop on Graph Theoretic Concepts in Computer Science (WG'10), Zarós (Crete), Greece, June 2010. Volume 6410 in Lecture Notes in Computer Science, pages 232–243, Springer. - René van Bevern, Hannes Moser,
and Rolf
Niedermeier:
Kernelization Through Tidying: A Case Study Based on s-Plex Cluster Vertex Deletion. In Proceedings of the 9th Latin American Theoretical Informatics Symposium (LATIN'10), Oaxaca, México, April 2010. Volume 6034 in Lecture Notes in Computer Science, pages 528–539, Springer.
Theses
- 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. - René van Bevern:
Graph-based data clustering: a quadratic-vertex problem kernel for s-Plex Cluster Vertex Deletion. Studienarbeit, Department of Mathematics and Computer Science, Friedrich Schiller University of Jena, Germany, September 2009.
Slides and Talks
Slides of talks accompanying the above publications can be found by clicking on the publication's title. Other talks' slides can be found below.
- Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs, at Workshop über Algorithmen und Komplexität at Universität Trier, Feburary 2011.
- Hashfunktionen in der Kryptologie: ihre Erzeugung und dadurch ermöglichte Attacken (German). March 2008.
- Netzwerke und Flüsse – der Algorithmus von Ford und Fulkerson (German). November 2007.
© 2010–2012 René van Bevern. Last modified 2012-01-10.