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="Vatshelle, Martin"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Faster algorithms for vertex partitioning problems parameterized by clique-width
Sang-il Oum
,
Sigve Hortemo Sæther
,
Martin Vatshelle
Theoretical Computer Science
535
, 2014, pp. 16-24
Graph classes with structured neighborhoods and algorithmic applications
Rémy Belmonte
,
Martin Vatshelle
Theoretical Computer Science
511
, 2013, pp. 54-65
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
Binh-Minh Bui-Xuan
,
Jan Arne Telle
,
Martin Vatshelle
Theoretical Computer Science
511
, 2013, pp. 66-76
The point-set embeddability problem for plane graphs
Therese Biedl
,
Martin Vatshelle
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 41-50
Graph classes with structured neighborhoods and algorithmic applications
Rémy Belmonte
,
Martin Vatshelle
Lecture Notes in Computer Science
6986
, 2011, pp. 47-58
Boolean-width of graphs
Binh-Minh Bui-Xuan
,
Jan Arne Telle
,
Martin Vatshelle
Theoretical Computer Science
412
(39), 2011, pp. 5187-5204
Faster algorithms on branch and clique decompositions
Hans L. Bodlaender
,
Erik Jan van Leeuwen
,
Johan M.M. van Rooij
,
Martin Vatshelle
Lecture Notes in Computer Science
6281
, 2010, pp. 174-185
Characterization and recognition of digraphs of bounded Kelly-width
Daniel Meister
,
Jan Arne Telle
,
Martin Vatshelle
Lecture Notes in Computer Science
4769
, 2007, pp. 270-279