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="Zickfeld, Florian"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
Paul Bonsma
,
Florian Zickfeld
SIAM Journal on Discrete Mathematics
25
(4), 2011, pp. 1652-1666
A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
Paul Bonsma
,
Florian Zickfeld
Lecture Notes in Computer Science
5344
, 2008, pp. 66-77
Schnyder woods and orthogonal surfaces
Stefan Felsner
,
Florian Zickfeld
Lecture Notes in Computer Science
4372
, 2007, pp. 417-429
On the number of
\alpha
-orientations
Stefan Felsner
,
Florian Zickfeld
Lecture Notes in Computer Science
4769
, 2007, pp. 190-201
Reducing Hajós' 4-coloring conjecture to 4-connected graphs
Xingxing Yu
,
Florian Zickfeld
Journal of Combinatorial Theory Series B
96
(4), 2006, pp. 482-492