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="Chen, Ge"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The smallest possible interaction radius for synchronization of self-propelled particles
Ge Chen
,
Zhixin Liu
,
Lei Guo
SIAM Review
56
(3), 2014, pp. 499-521
A linear-time algorithm for finding locally connected spanning trees on circular-arc graphs
Ching-Chi Lin
,
Gen-Huey Chen
,
Gerard J. Chang
Algorithmica
66
(2), 2013, pp. 369-396
Broadcasting in heterogeneous tree networks with uncertainty
Cheng-Hsiao Tsou
,
Gen-Huey Chen
,
Ching-Chi Lin
Lecture Notes in Computer Science
7074
, 2011, pp. 200-209
The degree-preserving spanning tree problem in strongly chordal and directed path graphs
Ching-Chi Lin
,
Gerard J. Chang
,
Gen-Huey Chen
Networks
56
(3), 2010, pp. 183-187
Edge-fault-tolerant pancyclicity of alternating group graphs
Ping-Ying Tsai
,
Gen-Huey Chen
,
Jung-Sheng Fu
Networks
53
(3), 2009, pp. 307-313
Fault-free longest paths in star networks with conditional link faults
Ping-Ying Tsai
,
Jung-Sheng Fu
,
Gen-Huey Chen
Theoretical Computer Science
410
(8-10), 2009, pp. 766-775
Efficient on-line repetition detection
Jin-Ju Hong
,
Gen-Huey Chen
Theoretical Computer Science
407
(1-3), 2008, pp. 554-563
w
-Rabin numbers and strong
w
-Rabin numbers of folded hypercubes
Cheng-Nan Lai
,
Gen-Huey Chen
Networks
51
(3), 2008, pp. 171-177
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
Ping-Ying Tsai
,
Jung-Sheng Fu
,
Gen-Huey Chen
Theoretical Computer Science
409
(3), 2008, pp. 450-460
Finding cycles in hierarchical hypercube networks
Ruei-Yu Wu
,
Gen-Huey Chen
,
Jung-Sheng Fu
,
Gerard J. Chang
Information Processing Letters
109
(2), 2008, pp. 112-115
A calculus and algebra for distributed data management
Serge Abiteboul
Lecture Notes in Computer Science
4393
, 2007, pp. 1-11
The polynomially bounded perfect matching problem is in
NC^2
Manindra Agrawal
,
Thanh Minh Hoang
,
Thomas Thierauf
Lecture Notes in Computer Science
4393
, 2007, pp. 489-499
A first investigation of Sturmian trees
Jean Berstel
,
Luc Boasson
,
Olivier Carton
,
Isabelle Fagnot
Lecture Notes in Computer Science
4393
, 2007, pp. 73-84
On the complexity of unary tiling-recognizable picture languages
Alberto Bertoni
,
Massimiliano Goldwurm
,
Violetta Lonati
Lecture Notes in Computer Science
4393
, 2007, pp. 381-392
Admissibility in infinite games
Dietmar Berwanger
Lecture Notes in Computer Science
4393
, 2007, pp. 188-199
Kolmogorov-Loveland stochasticity and Kolmogorov complexity
Laurent Bienvenu
Lecture Notes in Computer Science
4393
, 2007, pp. 260-271
Correlations of partial words
Francine Blanchet-Sadri
,
Joshua D. Gafni
,
Kevin H. Wilson
Lecture Notes in Computer Science
4393
, 2007, pp. 97-108
A cubic kernel for feedback vertex set
Hans L. Bodlaender
Lecture Notes in Computer Science
4393
, 2007, pp. 320-331
Reachability in unions of commutative rewriting systems is decidable
Mikoƚaj Bojańczyk
,
Piotr Hoffman
Lecture Notes in Computer Science
4393
, 2007, pp. 622-633
Symmetries and the complexity of pure Nash equilibrium
Felix Brandt
,
Felix Fischer
,
Markus Holzer
Lecture Notes in Computer Science
4393
, 2007, pp. 212-223
Cost sharing methods for makespan and completion time scheduling
Janina Brenner
,
Guido Schäfer
Lecture Notes in Computer Science
4393
, 2007, pp. 670-681
An optimal tableau-based decision algorithm for propositional neighborhood logic
Davide Bresolin
,
Angelo Montanari
,
Pietro Sala
Lecture Notes in Computer Science
4393
, 2007, pp. 549-560
On defining integers in the counting hierarchy and proving arithmetic circuit lower bounds
Peter Bürgisser
Lecture Notes in Computer Science
4393
, 2007, pp. 133-144
Associative-commutative deducibility constraints
Sergiu Bursuc
,
Hubert Comon-Lundh
,
Stéphanie Delaune
Lecture Notes in Computer Science
4393
, 2007, pp. 634-645
A deterministic algorithm for summarizing asynchronous streams over a sliding window
Costas Busch
,
Srikanta Tirthapura
Lecture Notes in Computer Science
4393
, 2007, pp. 465-476
Seiten 1
2
3
4
5
6
7
8
9
10
>