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
[1]
Hilfe
Suche: Author="Lee, Der-Tsai"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Rectilinear covering for imprecise input points
Hee-Kap Ahn
,
Sang Won Bae
,
Shin-ichi Tanigawa
Lecture Notes in Computer Science
7676
, 2012, pp. 309-318
Computing
k
-center over streaming data for small
k
Hee-Kap Ahn
,
Hyo-Sil Kim
,
Sang-Sub Kim
,
Wanbin Son
Lecture Notes in Computer Science
7676
, 2012, pp. 54-63
On the complexity of the maximum common subgraph problem for partial
k
-trees of bounded degree
Tatsuya Akutsu
,
Takeyuki Tamura
Lecture Notes in Computer Science
7676
, 2012, pp. 146-155
Universal point subsets for planar graphs
Patrizio Angelini
,
Carla Binucci
,
William Evans
,
Ferran Hurtado
,
Giuseppe Liotta
,
Tamara Mchedlidze
,
Henk Meijer
,
Yoshio Okamoto
Lecture Notes in Computer Science
7676
, 2012, pp. 423-432
The minimum vulnerability problem
Sepehr Assadi
,
Ehsan Emamjomeh-Zadeh
,
Ashkan Norouzi-Fard
,
Sadra Yazdanbod
,
Hamid Zarrabi-Zadeh
Lecture Notes in Computer Science
7676
, 2012, pp. 382-391
Area bounds of rectilinear polygons realized by angle sequences
Sang Won Bae
,
Yoshio Okamoto
,
Chan-Su Shin
Lecture Notes in Computer Science
7676
, 2012, pp. 629-638
Green scheduling, flows and matchings
Evripidis Bampis
,
Dimitrios Letsios
,
Giorgio Lucarelli
Lecture Notes in Computer Science
7676
, 2012, pp. 106-115
Induced immersions
Rémy Belmonte
,
Pim van 't Hof
,
Marcin Kamiński
Lecture Notes in Computer Science
7676
, 2012, pp. 299-308
Computing minmax regret 1-median on a tree network with positive/negative vertex weights
Binay Bhattacharya
,
Tsunehiko Kameda
,
Zhao Song
Lecture Notes in Computer Science
7676
, 2012, pp. 588-597
Efficient dominating and edge dominating sets for graphs and hypergraphs
Andreas Brandstädt
,
Arne Leitert
,
Dieter Rautenbach
Lecture Notes in Computer Science
7676
, 2012, pp. 267-277
Finger search in the implicit model
Gerth Stlting Brodal
,
Jesper Sindahl Nielsen
,
Jakob Truelsen
Lecture Notes in Computer Science
7676
, 2012, pp. 527-536
Speeding up shortest path algorithms
Andrej Brodnik
,
Marko Grgurovic̑
Lecture Notes in Computer Science
7676
, 2012, pp. 156-165
Combinatorial geometry and approximation algorithms
Timothy M. Chan
Lecture Notes in Computer Science
7676
, 2012, pp. 2-2
Strong conflict-free coloring for intervals
Panagiotis Cheilaris
,
Luisa Gargano
,
Adele A. Rescigno
,
Shakhar Smorodinsky
Lecture Notes in Computer Science
7676
, 2012, pp. 4-13
On the hyperbolicity of small-world and tree-like random graphs
Wei Chen
,
Wenjie Fang
,
Guangda Hu
,
Michael W. Mahoney
Lecture Notes in Computer Science
7676
, 2012, pp. 278-288
Optimal point movement for covering circular regions
Danny Z. Chen
,
Xuehou Tan
,
Haitao Wang
,
Gangshan Wu
Lecture Notes in Computer Science
7676
, 2012, pp. 332-341
Weak visibility queries of line segments in simple polygons
Danny Z. Chen
,
Haitao Wang
Lecture Notes in Computer Science
7676
, 2012, pp. 609-618
Origami robots and star trek replicators
Erik D. Demaine
Lecture Notes in Computer Science
7676
, 2012, pp. 3-3
Revenue maximization in a Bayesian double auction market
Xiaotie Deng
,
Paul Goldberg
,
Bo Tang
,
Jinshan Zhang
Lecture Notes in Computer Science
7676
, 2012, pp. 690-699
Degree-constrained orientations of embedded graphs
Yann Disser
,
Jannik Matuschke
Lecture Notes in Computer Science
7676
, 2012, pp. 506-516
On the advice complexity of buffer management
Reza Dorrigiv
,
Meng He
,
Norbert Zeh
Lecture Notes in Computer Science
7676
, 2012, pp. 136-145
Robust nonparametric data approximation of point sets via data reduction
Stephane Durocher
,
Alexandre Leblanc
,
Jason Morrison
,
Matthew Skala
Lecture Notes in Computer Science
7676
, 2012, pp. 319-331
More on a problem of Zarankiewicz
Chinmoy Dutta
,
Jaikumar Radhakrishnan
Lecture Notes in Computer Science
7676
, 2012, pp. 257-266
On the number of upward planar orientations of maximal planar graphs
Fabrizio Frati
,
Joachim Gudmundsson
,
Emo Welzl
Lecture Notes in Computer Science
7676
, 2012, pp. 413-422
Parameterized clique on scale-free networks
Tobias Friedrich
,
Anton Krohmer
Lecture Notes in Computer Science
7676
, 2012, pp. 659-668
Seiten 1
2
3
>