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="Pai, Kung-Jui"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A comment on ``Independent spanning trees in crossed cubes''
Jou-Ming Chang
,
Jhen-Ding Wang
,
Jinn-Shyong Yang
,
Kung-Jui Pai
Information Processing Letters
114
(12), 2014, pp. 734-739
Incidence coloring on hypercubes
Kung-Jui Pai
,
Jou-Ming Chang
,
Jinn-Shyong Yang
,
Ro-Yu Wu
Theoretical Computer Science
557
, 2014, pp. 59-65
A loopless algorithm for generating multiple binary tree sequences simultaneously
Ro-Yu Wu
,
Jou-Ming Chang
,
Hung-Chang Chan
,
Kung-Jui Pai
Theoretical Computer Science
556
, 2014, pp. 25-33
Amortized efficiency of generating planar paths in convex position
Ro-Yu Wu
,
Jou-Ming Chang
,
Kung-Jui Pai
,
Yue-Li Wang
Theoretical Computer Science
412
(35), 2011, pp. 4504-4512
Upper bounds on the queuenumber of
k
-ary
n
-cubes
Kung-Jui Pai
,
Jou-Ming Chang
,
Yue-Li Wang
Information Processing Letters
110
(2), 2009, pp. 50-56
A note on ``An improved upper bound on the queuenumber of the hypercube''
Kung-Jui Pai
,
Jou-Ming Chang
,
Yue-Li Wang
Information Processing Letters
108
(3), 2008, pp. 107-109