Ragnar Nevries

According to our database, Ragnar Nevries authored at least 9 papers between 2009 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs.

Andreas Brandstädt, Ragnar Nevries

Encyclopedia of Algorithms, 2016

2015

Towards a Characterization of Leaf Powers by Clique Arrangements.

Ragnar Nevries, Christian Rosenke

Proceedings of the SOFSEM 2015: Theory and Practice of Computer Science, 2015

2014

Efficient domination and polarity.

Ragnar Nevries

PhD thesis, 2014

Complexity and algorithms for recognizing polar and monopolar graphs.

Van Bang Le, Ragnar Nevries

Theor. Comput. Sci., 2014

2013

Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs.

Ragnar Nevries, Christian Rosenke

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

New Polynomial Cases of the Weighted Efficient Domination Problem.

Andreas Brandstädt, Martin Milanic, Ragnar Nevries

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2011

Recognizing Polar Planar Graphs Using New Results for Monopolarity.

Van Bang Le, Ragnar Nevries

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

Efficient Edge Domination on Hole-Free Graphs in Polynomial Time.

Andreas Brandstädt, Christian Hundt, Ragnar Nevries

Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009

A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation.

Christian Hundt, Maciej Liskiewicz, Ragnar Nevries

Theor. Comput. Sci., 2009