Ragnar Nevries

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs.
Encyclopedia of Algorithms, 2016

Towards a Characterization of Leaf Powers by Clique Arrangements.
Graphs and Combinatorics, 2016

2015
Characterizing and computing the structure of clique intersections in strongly chordal graphs.
Discrete Applied Mathematics, 2015

2014
Efficient domination and polarity.
PhD thesis, 2014

Complexity and algorithms for recognizing polar and monopolar graphs.
Theor. Comput. Sci., 2014

2013
New Polynomial Cases of the Weighted Efficient Domination Problem.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

2011
Recognizing Polar Planar Graphs Using New Results for Monopolarity.
Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010
Efficient Edge Domination on Hole-Free Graphs in Polynomial Time.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009
A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation.
Theor. Comput. Sci., 2009


  Loading...