Ragnar Nevries

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Towards a characterization of leaf powers by clique arrangements Graphs and Combinatorics	2016-11-29	Paper
Towards a characterization of leaf powers by clique arrangements Lecture Notes in Computer Science	2015-02-20	Paper
Characterizing and computing the structure of clique intersections in strongly chordal graphs Discrete Applied Mathematics	2014-12-05	Paper
Complexity and algorithms for recognizing polar and monopolar graphs Theoretical Computer Science	2014-03-13	Paper
Characterizing and computing the structure of clique intersections in strongly chordal graphs Graph-Theoretic Concepts in Computer Science	2013-12-06	Paper
New polynomial cases of the weighted efficient domination problem Mathematical Foundations of Computer Science 2013	2013-09-20	Paper
Recognizing polar planar graphs using new results for monopolarity Algorithms and Computation	2011-12-16	Paper
Efficient edge domination on hole-free graphs in polynomial time LATIN 2010: Theoretical Informatics	2010-04-27	Paper
A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation Theoretical Computer Science	2009-11-18	Paper

Research outcomes over time

This page was built for person: Ragnar Nevries