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="Cai, Leizhen"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Geodesic-preserving polygon simplification
Oswin Aichholzer
,
Thomas Hackl
,
Matias Korman
,
Alexander Pilz
,
Birgit Vogtenhuber
Lecture Notes in Computer Science
8283
, 2013, pp. 11-21
Pattern matching with non overlapping reversals - Approximation and on-line algorithms
Amihood Amir
,
Benny Porat
Lecture Notes in Computer Science
8283
, 2013, pp. 55-65
Testing mutual duality of planar graphs
Patrizio Angelini
,
Thomas Bläsius
,
Ignaz Rutter
Lecture Notes in Computer Science
8283
, 2013, pp. 350-360
SEFE with no mapping via large induced outerplane graphs in plane graphs
Patrizio Angelini
,
William Evans
,
Fabrizio Frati
,
Joachim Gudmundsson
Lecture Notes in Computer Science
8283
, 2013, pp. 185-195
RAM-efficient external memory sorting
Lars Arge
,
Mikkel Thorup
Lecture Notes in Computer Science
8283
, 2013, pp. 491-501
Structure and computation of straight skeletons in 3-space
Franz Aurenhammer
,
Gernot Walzl
Lecture Notes in Computer Science
8283
, 2013, pp. 44-54
Hardness and algorithms for variants of line graphs of directed graphs
Mourad Baïou
,
Laurent Beaudou
,
Zhentao Li
,
Vincent Limouzy
Lecture Notes in Computer Science
8283
, 2013, pp. 196-206
Bounded representations of interval and proper interval graphs
Martin Balko
,
Pavel Klavík
,
Yota Otachi
Lecture Notes in Computer Science
8283
, 2013, pp. 535-546
Single and multiple consecutive permutation motif search
Djamal Belazzougui
,
Adeline Pierrot
,
Mathieu Raffinot
,
Stéphane Vialette
Lecture Notes in Computer Science
8283
, 2013, pp. 66-77
On the edge crossing properties of Euclidean minimum weight Laman graphs
Sergey Bereg
,
Seok-Hee Hong
,
Naoki Katoh
,
Sheung-Hung Poon
,
Shin-ichi Tanigawa
Lecture Notes in Computer Science
8283
, 2013, pp. 33-43
Abstract Voronoi diagrams with disconnected regions
Cecilia Bohler
,
Rolf Klein
Lecture Notes in Computer Science
8283
, 2013, pp. 306-316
The complexity of finding a large subgraph under anonymity constraints
Robert Bredereck
,
Sepp Hartung
,
André Nichterlein
,
Gerhard J. Woeginger
Lecture Notes in Computer Science
8283
, 2013, pp. 152-162
Dynamic point labeling is strongly PSPACE-complete
Kevin Buchin
,
Dirk H.P. Gerrits
Lecture Notes in Computer Science
8283
, 2013, pp. 262-272
A probabilistic analysis of Kademlia networks
Xing Shi Cai
,
Luc Devroye
Lecture Notes in Computer Science
8283
, 2013, pp. 711-721
Faster, space-efficient selection algorithms in read-only memory for integers
Timothy M. Chan
,
J. Ian Munro
,
Venkatesh Raman
Lecture Notes in Computer Science
8283
, 2013, pp. 405-412
The train delivery problem revisited
Jing Chen
,
He Guo
,
Xin Han
,
Kazuo Iwama
Lecture Notes in Computer Science
8283
, 2013, pp. 601-611
Effective and efficient data reduction for the Subset Interconnection Design problem
Jiehua Chen
,
Christian Komusiewicz
,
Rolf Niedermeier
,
Manuel Sorge
,
Ondȓej Suchý
,
Mathias Weller
Lecture Notes in Computer Science
8283
, 2013, pp. 361-371
On determining deep holes of generalized Reed-Solomon codes
Qi Cheng
,
Jiyou Li
,
Jincheng Zhuang
Lecture Notes in Computer Science
8283
, 2013, pp. 100-110
On the number of edges of fan-crossing free graphs
Otfried Cheong
,
Sariel Har-Peled
,
Heuna Kim
,
Hyo-Sil Kim
Lecture Notes in Computer Science
8283
, 2013, pp. 163-173
Space-efficient and data-sensitive polygon reconstruction algorithms from visibility angle information
Jinhee Chun
,
Ricardo Garcia de Gonzalo
,
Takeshi Tokuyama
Lecture Notes in Computer Science
8283
, 2013, pp. 22-32
Approximating the generalized minimum Manhattan network problem
Aparna Das
,
Krzysztof Fleszar
,
Stephen Kobourov
,
Joachim Spoerhase
,
Sankar Veeramoni
,
Alexander Wolff
Lecture Notes in Computer Science
8283
, 2013, pp. 722-732
Performance guarantees for scheduling algorithms under perturbed machine speeds
Michael Etscheid
Lecture Notes in Computer Science
8283
, 2013, pp. 207-217
Tight approximation bounds for connectivity with a color-spanning set
Chenglin Fan
,
Jun Luo
,
Binhai Zhu
Lecture Notes in Computer Science
8283
, 2013, pp. 590-600
Exact sublinear binomial sampling
Martín Farach-Colton
,
Meng-Tsung Tsai
Lecture Notes in Computer Science
8283
, 2013, pp. 240-250
Detecting and counting small pattern graphs
Peter Floderus
,
Mirosƚaw Kowaluk
,
Andrzej Lingas
,
Eva-Marta Lundell
Lecture Notes in Computer Science
8283
, 2013, pp. 547-557
Seiten 1
2
3
4
>