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="Hartmann, Tanja"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Simultaneous embeddability of two partitions
Jan Christoph Athenstädt
,
Tanja Hartmann
,
Martin Nöllenburg
Lecture Notes in Computer Science
8871
, 2014, pp. 64-75
Hierarchies of predominantly connected communities
Michael Hamann
,
Tanja Hartmann
,
Dorothea Wagner
Lecture Notes in Computer Science
8037
, 2013, pp. 365-377
Cubic augmentation of planar graphs
Tanja Hartmann
,
Jonathan Rollin
,
Ignaz Rutter
Lecture Notes in Computer Science
7676
, 2012, pp. 402-412
Fast and simple fully-dynamic cut tree construction
Tanja Hartmann
,
Dorothea Wagner
Lecture Notes in Computer Science
7676
, 2012, pp. 95-105
Fully-dynamic hierarchical graph clustering using cut trees
Christof Doll
,
Tanja Hartmann
,
Dorothea Wagner
Lecture Notes in Computer Science
6844
, 2011, pp. 338-349
Dynamic graph clustering using minimum-cut trees
Robert Görke
,
Tanja Hartmann
,
Dorothea Wagner
Lecture Notes in Computer Science
5664
, 2009, pp. 339-350