 | 2012 |
|---|
| 9 |       | René van Bevern,
Hannes Moser,
Rolf Niedermeier:
Approximation and Tidying - A Problem Kernel for s-Plex Cluster Vertex Deletion.
Algorithmica 62(3-4): 930-950 (2012) |
| 2011 |
|---|
| 8 | | René van Bevern,
Sepp Hartung,
Frank Kammer,
Rolf Niedermeier,
Mathias Weller:
Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs.
IPEC 2011: 194-206 |
| 7 | | Manuel Sorge,
René van Bevern,
Rolf Niedermeier,
Mathias Weller:
A New View on Rural Postman Based on Eulerian Extension and Matching.
IWOCA 2011: 310-323 |
| 6 | | Manuel Sorge,
René van Bevern,
Rolf Niedermeier,
Mathias Weller:
From Few Components to an Eulerian Graph by Adding Arcs.
WG 2011: 307-318 |
| 5 | | René van Bevern:
Towards Optimal and Expressive Kernelization for d-Hitting Set
CoRR abs/1112.2310: (2011) |
| 4 | | Nadja Betzler,
René van Bevern,
Michael R. Fellows,
Christian Komusiewicz,
Rolf Niedermeier:
Parameterized Algorithmics for Finding Connected Motifs in Biological Networks.
IEEE/ACM Trans. Comput. Biology Bioinform. 8(5): 1296-1308 (2011) |
| 2010 |
|---|
| 3 | | René van Bevern,
Hannes Moser,
Rolf Niedermeier:
Kernelization through Tidying.
LATIN 2010: 527-538 |
| 2 | | René van Bevern,
Christian Komusiewicz,
Hannes Moser,
Rolf Niedermeier:
Measuring Indifference: Unit Interval Vertex Deletion.
WG 2010: 232-243 |
| 2009 |
|---|
| 1 | | René van Bevern:
Graph-based data clustering: a quadratic-vertex problem kernel for s-Plex Cluster Vertex Deletion
CoRR abs/0909.2814: (2009) |
Data released under the ODC-BY 1.0 license — See also our legal information page