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
[2]
Hilfe
Suche: Author="Yen, Hsu-Chun"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On orthogonally convex drawings of plane graphs
Yi-Jun Chang
,
Hsu-Chun Yen
Lecture Notes in Computer Science
8242
, 2013, pp. 400-411
On the containment and equivalence problems for two-way transducers
Oscar H. Ibarra
,
Hsu-Chun Yen
Theoretical Computer Science
429
, 2012, pp. 155-163
Complexity analysis of balloon drawing for rooted trees
Chun-Cheng Lin
,
Hsu-Chun Yen
,
Sheung-Hung Poon
,
Jia-Hao Fan
Theoretical Computer Science
412
(4-5), 2011, pp. 430-447
On decision problems for parameterized machines
Oscar H. Ibarra
,
Igor Potapov
,
Hsu-Chun Yen
Theoretical Computer Science
411
(7-9), 2010, pp. 1192-1201
On minimal elements of upward-closed sets
Hsu-Chun Yen
,
Chien-Liang Chen
Theoretical Computer Science
410
(24-25), 2009, pp. 2442-2452
Path decomposition and semilinearity of Petri nets
Hsu-Chun Yen
International Journal of Foundations of Computer Science
20
(4), 2009, pp. 581-596
Decidability and complexity analysis of forbidden state problems for discrete event systems
Hsu-Chun Yen
International Journal of Foundations of Computer Science
19
(4), 2008, pp. 999-1013
Width-optimal visibility representations of plane graphs
Jia-Hao Fan
,
Chun-Cheng Lin
,
Hsueh-I Lu
,
Hsu-Chun Yen
Lecture Notes in Computer Science
4835
, 2007, pp. 160-171
Computing minimal elements of upward-closed sets for Petri nets
Hsu-Chun Yen
,
Chien-Liang Chen
Lecture Notes in Computer Science
4546
, 2007, pp. 465-483
Deterministic catalytic systems are not universal
Oscar H. Ibarra
,
Hsu-Chun Yen
Theoretical Computer Science
363
(2), 2006, pp. 149-161
On balloon drawings of rooted trees
Chun-Cheng Lin
,
Hsu-Chun Yen
Lecture Notes in Computer Science
3843
, 2006, pp. 285-296
On sequential and 1-deterministic
P
systems
Oscar H. Ibarra
,
Sara Woodworth
,
Hsu-Chun Yen
,
Zhe Dang
Lecture Notes in Computer Science
3595
, 2005, pp. 905-914
On various notions of parallelism in
P
systems
Oscar H. Ibarra
,
Hsu-Chun Yen
,
Zhe Dang
International Journal of Foundations of Computer Science
16
(4), 2005, pp. 683-705
Signaling
P
systems and verification problems
Cheng Li
,
Zhe Dang
,
Oscar H. Ibarra
,
Hsu-Chun Yen
Lecture Notes in Computer Science
3580
, 2005, pp. 1462-1473
Drawing graphs with nonuniform nodes using potential fields
Jen-Hui Chuang
,
Chun-Cheng Lin
,
Hsu-Chun Yen
Lecture Notes in Computer Science
2912
, 2004, pp. 460-465
Reachability solution characterization of parametric real-time systems
Farn Wang
,
Hsu-Chun Yen
Theoretical Computer Science
328
(1-2), 2004, pp. 187-201
Compact floor-planning via orderly spanning trees
Chien-Chih Liao
,
Hsueh-I Lu
,
Hsu-Chun Yen
Journal of Algorithms
48
(2), 2003, pp. 441-451
Petri nets with simple circuits
Hsu-Chun Yen
,
Lien-Po Yu
Lecture Notes in Computer Science
2697
, 2003, pp. 149-158
Some applications of orderly spanning trees in graph drawing
Ho-Lin Chen
,
Chien-Chih Liao
,
Hsueh-I Lu
,
Hsu-Chun Yen
Lecture Notes in Computer Science
2528
, 2002, pp. 332-343
Floor-planning via orderly spanning trees
Chien-Chih Liao
,
Hsueh-I. Lu
,
Hsu-Chun Yen
Lecture Notes in Computer Science
2265
, 2002, pp. 367-377
Distributed and on-line routing on tori
Tzuoo-Hawn Yeh
,
Cheng-Ming Kuo
,
Chin-Laung Lei
,
Hsu-Chun Yen
Algorithmica
32
(4), 2002, pp. 562-593
On maximum symmetric subgraphs
Ho-Lin Chen
,
Hsueh-I. Lu
,
Hsu-Chun Yen
Lecture Notes in Computer Science
1984
, 2001, pp. 372-383
The symmetry number problem for trees
Kien-Weh Chin
,
Hsu-Chun Yen
Information Processing Letters
79
(2), 2001, pp. 73-79
Orthogonal and straight-line drawings of graphs with succinct representations
Ho-Lin Chen
,
Hsu-Chun Yen
Lecture Notes in Computer Science
1731
, 1999, pp. 416-417
Competitive analysis of on-line disk scheduling
Tzuoo-Hawn Yeh
,
Cheng-Ming Kuo
,
Chin-Laung Lei
,
Hsu-Chun Yen
Theory of Computing Systems
31
(5), 1998, pp. 491-506
Seiten 1
2
3
>