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
Hilfe
Suche: Author="Kaufmann, Michael"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the recognition of fan-planar and maximal outer-fan-planar graphs
Michael A. Bekos
,
Sabine Cornelsen
,
Luca Grilli
,
Seok-Hee Hong
,
Michael Kaufmann
Lecture Notes in Computer Science
8871
, 2014, pp. 198-209
Planar octilinear drawings with one bend per edge
Michael A. Bekos
,
Martin Gronemann
,
Michael Kaufmann
,
Robert Krug
Lecture Notes in Computer Science
8871
, 2014, pp. 331-342
Linear-time algorithms for hole-free rectilinear proportional contact graph representations
M. Jawaherul Alam
,
Therese Biedl
,
Stefan Felsner
,
Andreas Gerasch
,
Michael Kaufmann
,
Stephen G. Kobourov
Algorithmica
67
(1), 2013, pp. 3-22
Threshold-coloring and unit-cube contact representation of graphs
Md. Jawaherul Alam
,
Steven Chaplick
,
Gas̑per Fijavz̑
,
Michael Kaufmann
,
Stephen G. Kobourov
,
Sergey Pupyrev
Lecture Notes in Computer Science
8165
, 2013, pp. 26-37
Many-to-one boundary labeling with backbones
Michael A. Bekos
,
Sabine Cornelsen
,
Martin Fink
,
Seok-Hee Hong
,
Michael Kaufmann
,
Martin Nöllenburg
,
Ignaz Rutter
,
Antonios Symvonis
Lecture Notes in Computer Science
8242
, 2013, pp. 244-255
Smooth orthogonal layouts
Michael A. Bekos
,
Michael Kaufmann
,
Stephen G. Kobourov
,
Antonios Symvonis
Lecture Notes in Computer Science
7704
, 2013, pp. 150-161
Slanted orthogonal drawings
Michael A. Bekos
,
Michael Kaufmann
,
Robert Krug
,
Stefan Näher
,
Vincenzo Roselli
Lecture Notes in Computer Science
8242
, 2013, pp. 424-435
Progress on partial edge drawings
Till Bruckdorfer
,
Sabine Cornelsen
,
Carsten Gutwenger
,
Michael Kaufmann
,
Fabrizio Montecchiani
,
Martin Nöllenburg
,
Alexander Wolff
Lecture Notes in Computer Science
7704
, 2013, pp. 67-78
On the characterization of plane bus graphs
Till Bruckdorfer
,
Stefan Felsner
,
Michael Kaufmann
Lecture Notes in Computer Science
7878
, 2013, pp. 73-84
Table cartograms
William Evans
,
Stefan Felsner
,
Michael Kaufmann
,
Stephen G. Kobourov
,
Debajyoti Mondal
,
Rahnuma Islam Nishat
,
Kevin Verbeek
Lecture Notes in Computer Science
8125
, 2013, pp. 421-432
On the upward planarity of mixed plane graphs
Fabrizio Frati
,
Michael Kaufmann
,
János Pach
,
Csaba D. Tóth
,
David R. Wood
Lecture Notes in Computer Science
8242
, 2013, pp. 1-12
Planar packing of binary trees
Markus Geyer
,
Michael Hoffmann
,
Michael Kaufmann
,
Vincent Kusters
,
Csaba D. Tóth
Lecture Notes in Computer Science
8037
, 2013, pp. 353-364
Computing cartograms with optimal complexity
Md. Jawaherul Alam
,
Therese Biedl
,
Stefan Felsner
,
Michael Kaufmann
,
Stephen G. Kobourov
,
Torsten Ueckerdt
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 21-30
Proportional contact representations of planar graphs
Muhammad Jawaherul Alam
,
Therese Biedl
,
Stefan Felsner
,
Michael Kaufmann
,
Stephen G. Kobourov
Lecture Notes in Computer Science
7034
, 2012, pp. 26-38
Small point sets for simply-nested planar graphs
Patrizio Angelini
,
Giuseppe Di Battista
,
Michael Kaufmann
,
Tamara Mchedlidze
,
Vincenzo Roselli
,
Claudio Squarcella
Lecture Notes in Computer Science
7034
, 2012, pp. 75-85
Combining problems on RAC drawings and simultaneous graph drawings
Evmorfia N. Argyriou
,
Michael A. Bekos
,
Michael Kaufmann
,
Antonios Symvonis
Lecture Notes in Computer Science
7034
, 2012, pp. 433-434
Geometric RAC simultaneous drawings of graphs
Evmorfia Argyriou
,
Michael Bekos
,
Michael Kaufmann
,
Antonios Symvonis
Lecture Notes in Computer Science
7434
, 2012, pp. 287-298
Vertex angle and crossing angle resolution of leveled tree drawings
Walter Didimo
,
Michael Kaufmann
,
Giuseppe Liotta
,
Yoshio Okamoto
,
Andreas Spillner
Information Processing Letters
112
(16), 2012, pp. 630-635
Approximate proximity drawings
William Evans
,
Emden R. Gansner
,
Michael Kaufmann
,
Giuseppe Liotta
,
Henk Meijer
,
Andreas Spillner
Lecture Notes in Computer Science
7034
, 2012, pp. 166-178
Upward point set embeddability for convex point sets is in
P
Michael Kaufmann
,
Tamara Mchedlidze
,
Antonios Symvonis
Lecture Notes in Computer Science
7034
, 2012, pp. 403-414
Linear-time algorithms for hole-free rectilinear proportional contact graph representations
Muhammad Jawaherul Alam
,
Therese Biedl
,
Stefan Felsner
,
Andreas Gerasch
,
Michael Kaufmann
,
Stephen G. Kobourov
Lecture Notes in Computer Science
7074
, 2011, pp. 281-291
On the area requirements of Euclidean minimum spanning trees
Patrizio Angelini
,
Till Bruckdorfer
,
Marco Chiesa
,
Fabrizio Frati
,
Michael Kaufmann
,
Claudio Sqarcella
Lecture Notes in Computer Science
6844
, 2011, pp. 25-36
Upward geometric graph embeddings into point sets
Patrizio Angelini
,
Fabrizio Frati
,
Markus Geyer
,
Michael Kaufmann
,
Tamara Mchedlidze
,
Antonios Symvonis
Lecture Notes in Computer Science
6502
, 2011, pp. 25-37
On a tree and a path with no geometric simultaneous embedding
Patrizio Angelini
,
Markus Geyer
,
Michael Kaufmann
,
Daniel Neuwirth
Lecture Notes in Computer Science
6502
, 2011, pp. 38-49
Colored simultaneous geometric embeddings and universal pointsets
Ulrik Brandes
,
Cesim Erten
,
Alejandro Estrella-Balderrama
,
J. Joseph Fowler
,
Fabrizio Frati
,
Markus Geyer
,
Carsten Gutwenger
,
Seok-Hee Hong
,
Michael Kaufmann
,
Stephen G. Kobourov
,
Giuseppe Liotta
,
Petra Mutzel
,
Antonios Symvonis
Algorithmica
60
(3), 2011, pp. 569-592
Seiten 1
2
3
4
5
6
>