| Efficient edge domination on hole-free graphs in polynomial time A Brandstädt, C Hundt, R Nevries Latin American Symposium on Theoretical Informatics, 650-661, 2010 | 48 | 2010 |
| New polynomial cases of the weighted efficient domination problem A Brandstädt, M Milanič, R Nevries International Symposium on Mathematical Foundations of Computer Science, 195-206, 2013 | 33 | 2013 |
| A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation C Hundt, M Liśkiewicz, R Nevries Theoretical Computer Science 410 (51), 5317-5333, 2009 | 22 | 2009 |
| Towards a characterization of leaf powers by clique arrangements R Nevries, C Rosenke Graphs and Combinatorics 32 (5), 2053-2077, 2016 | 21 | 2016 |
| Efficient domination and polarity RC Nevries Dissertation, Rostock, Universität Rostock. Fakultät für Informatik und …, 2014 | 16 | 2014 |
| Complexity and algorithms for recognizing polar and monopolar graphs R Nevries Theoretical Computer Science 528, 1-11, 2014 | 13 | 2014 |
| Recognizing polar planar graphs using new results for monopolarity VB Le, R Nevries International Symposium on Algorithms and Computation, 120-129, 2011 | 13 | 2011 |
| Characterizing and computing the structure of clique intersections in strongly chordal graphs R Nevries, C Rosenke Discrete Applied Mathematics 181, 221-234, 2015 | 12 | 2015 |
| Weighted efficient domination for F-free graphs A Brandstädt, V Giakoumakis, M Milanic, R Nevries Manuscript (2014, submitted), 2014 | 8 | 2014 |
| Entwicklung und Analyse eines beschleunigten Image Matching-Algorithmus für natürliche Bilder R Nevries Diplomarbeit, Universität Rostock, 2008 | 6 | 2008 |
| Efficient dominating and edge dominating sets for graphs and hypergraphs A Brandstädt, R Nevries Encyclopedia of Algorithms, 618-621, 2016 | 2 | 2016 |
| Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs A Brandstädt, R Nevries Encyclopedia of Algorithms, 1-4, 2014 | | 2014 |
