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="Chao, Kun-Mao"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Preface algorithms and computation (ISAAC 2012)
Kun-Mao Chao
,
Tsan-Sheng Hsu
,
D.T. Lee
Algorithmica
70
(4), 2014, pp. 694-695
The generalized popular condensation problem
Yen-Wei Wu
,
Wei-Yin Lin
,
Hung-Lung Wang
,
Kun-Mao Chao
Lecture Notes in Computer Science
8889
, 2014, pp. 606-617
A fully compressed algorithm for computing the edit distance of run-length encoded strings
Kuan-Yu Chen
,
Kun-Mao Chao
Algorithmica
65
(2), 2013, pp. 354-370
Computing plurality points and Condorcet points in Euclidean space
Yen-Wei Wu
,
Wei-Yin Lin
,
Hung-Lung Wang
,
Kun-Mao Chao
Lecture Notes in Computer Science
8283
, 2013, pp. 688-698
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
Efficient algorithms for local ranking
Chia-Jung Chang
,
Kun-Mao Chao
Information Processing Letters
112
(13), 2012, pp. 517-522
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
Efficient retrieval of approximate palindromes in a run-length encoded string
Kuan-Yu Chen
,
Ping-Hui Hsu
,
Kun-Mao Chao
Theoretical Computer Science
432
, 2012, pp. 28-37
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
Seiten 1
2
3
4
5
>