Ragnar Nevries

13 papers B 5Journal 6
YearRankTypeTitle / Venue / Authors
2016 — ch.
Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs.
Encyclopedia of Algorithms
Andreas Brandstädt, Ragnar Nevries
2016 J jnl
Towards a Characterization of Leaf Powers by Clique Arrangements.
Graphs Comb.
Ragnar Nevries, Christian Rosenke
2015 J jnl
Characterizing and computing the structure of clique intersections in strongly chordal graphs.
Discret. Appl. Math.
Ragnar Nevries, Christian Rosenke
2015 B conf
Towards a Characterization of Leaf Powers by Clique Arrangements.
SOFSEM
Ragnar Nevries, Christian Rosenke
2014 J jnl
Complexity and algorithms for recognizing polar and monopolar graphs.
Theor. Comput. Sci.
Van Bang Le, Ragnar Nevries
2014 — —
Efficient domination and polarity.
Ragnar Nevries
2014 J jnl
Towards a Characterization of Leaf Powers by Clique Arrangements.
CoRR
Ragnar Nevries, Christian Rosenke
2013 B conf
Characterizing and Computing the Structure of Clique Intersections in Strongly Chordal Graphs.
WG
Ragnar Nevries, Christian Rosenke
2013 J jnl
New Polynomial Cases of the Weighted Efficient Domination Problem
CoRR
Andreas Brandstädt, Martin Milanic, Ragnar Nevries
2013 B conf
New Polynomial Cases of the Weighted Efficient Domination Problem.
MFCS
Andreas Brandstädt, Martin Milanic, Ragnar Nevries
2011 B conf
Recognizing Polar Planar Graphs Using New Results for Monopolarity.
ISAAC
Van Bang Le, Ragnar Nevries
2010 B conf
Efficient Edge Domination on Hole-Free Graphs in Polynomial Time.
LATIN
Andreas Brandstädt, Christian Hundt, Ragnar Nevries
2009 J jnl
A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation.
Theor. Comput. Sci.
Christian Hundt, Maciej Liskiewicz, Ragnar Nevries