Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Nevries, Ragnar"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complexity and algorithms for recognizing polar and monopolar graphs
Van Bang Le
,
Ragnar Nevries
Theoretical Computer Science
528
, 2014, pp. 1-11
New polynomial cases of the weighted efficient domination problem
Andreas Brandstädt
,
Martin Milanic̑
,
Ragnar Nevries
Lecture Notes in Computer Science
8087
, 2013, pp. 195-206
Characterizing and computing the structure of clique intersections in strongly chordal graphs
Ragnar Nevries
,
Christian Rosenke
Lecture Notes in Computer Science
8165
, 2013, pp. 382-393
Recognizing polar planar graphs using new results for monopolarity
Van Bang Le
,
Ragnar Nevries
Lecture Notes in Computer Science
7074
, 2011, pp. 120-129
Efficient edge domination on hole-free graphs in polynomial time
Andreas Brandstädt
,
Christian Hundt
,
Ragnar Nevries
Lecture Notes in Computer Science
6034
, 2010, pp. 650-661
A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation
Christian Hundt
,
Maciej Liśkiewicz
,
Ragnar Nevries
Theoretical Computer Science
410
(51), 2009, pp. 5317-5333