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 | 44 | 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 | 29 | 2013 |
Towards a characterization of leaf powers by clique arrangements R Nevries, C Rosenke Graphs and Combinatorics 32, 2053-2077, 2016 | 19 | 2016 |
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 | 19 | 2009 |
Characterizing and computing the structure of clique intersections in strongly chordal graphs R Nevries, C Rosenke Discrete Applied Mathematics 181, 221-234, 2015 | 11 | 2015 |
Complexity and algorithms for recognizing polar and monopolar graphs R Nevries Theoretical Computer Science 528, 1-11, 2014 | 11 | 2014 |
Efficient domination and polarity RC Nevries Dissertation, Rostock, Universität Rostock. Fakultät für Informatik und …, 2014 | 11 | 2014 |
Recognizing polar planar graphs using new results for monopolarity VB Le, R Nevries Algorithms and Computation: 22nd International Symposium, ISAAC 2011 …, 2011 | 10 | 2011 |
Weighted efficient domination for F-free graphs A Brandstädt, V Giakoumakis, M Milanic, R Nevries Manuscript (2014, submitted), 2014 | 6 | 2014 |
Entwicklung und Analyse eines beschleunigten Image Matching-Algorithmus für natürliche Bilder R Nevries Diplomarbeit, Universität Rostock, 2008 | 5 | 2008 |