 | 2009 |
|---|
| 91 |       | Chun-Cheng Lin,
Hsiang-Yun Wu,
Hsu-Chun Yen:
Boundary Labeling in Text Annotation.
IV 2009: 110-115 |
| 90 | | Chien-Liang Chen,
Suey Wang,
Hsu-Chun Yen:
Reachability Analysis of Variants of Communication-Free Petri Nets.
IEICE Transactions 92-D(3): 377-388 (2009) |
| 89 | | Hsu-Chun Yen:
Path Decomposition and Semilinearity of Petri Nets.
Int. J. Found. Comput. Sci. 20(4): 581-596 (2009) |
| 88 | | Hsu-Chun Yen,
Chien-Liang Chen:
On minimal elements of upward-closed sets.
Theor. Comput. Sci. 410(24-25): 2442-2452 (2009) |
| 2008 |
|---|
| 87 | | Hsu-Chun Yen:
Concurrency, Synchronization, and Conflicts in Petri Nets.
CIAA 2008: 33-35 |
| 86 | | Cheng-Lung Sung,
Cheng-Wei Lee,
Hsu-Chun Yen,
Wen-Lian Hsu:
An alignment-based surface pattern for a question answering system.
IRI 2008: 172-177 |
| 85 | | Cheng-Lung Sung,
Min-Yuh Day,
Hsu-Chun Yen,
Wen-Lian Hsu:
A template alignment algorithm for question classification.
ISI 2008: 197-199 |
| 84 | | Hsu-Chun Yen:
Decidability and Complexity Analysis of Forbidden State Problems for Discrete Event Systems.
Int. J. Found. Comput. Sci. 19(4): 999-1013 (2008) |
| 83 | | Chun-Cheng Lin,
Hao-Jen Kao,
Hsu-Chun Yen:
Many-to-One Boundary Labeling.
J. Graph Algorithms Appl. 12(3): 319-356 (2008) |
| 82 | | Tzay-Farn Shih,
Hsu-Chun Yen:
Location-aware routing protocol with dynamic adaptation of request zone for mobile ad hoc networks.
Wireless Networks 14(3): 321-333 (2008) |
| 2007 |
|---|
| 81 | | Hao-Jen Kao,
Chun-Cheng Lin,
Hsu-Chun Yen:
Many-to-one boundary labeling.
APVIS 2007: 65-72 |
| 80 | | Hsu-Chun Yen,
Chien-Liang Chen:
Computing Minimal Elements of Upward-Closed Sets for Petri Nets.
ICATPN 2007: 465-483 |
| 79 | | Jia-Hao Fan,
Chun-Cheng Lin,
Hsueh-I Lu,
Hsu-Chun Yen:
Width-Optimal Visibility Representations of Plane Graphs.
ISAAC 2007: 160-171 |
| 78 | | Chun-Cheng Lin,
Hsu-Chun Yen:
Balloon Views of Source Code and Their Multiscalable Font Modes.
IV 2007: 53-58 |
| 77 | | Oscar H. Ibarra,
Hsu-Chun Yen:
Preface.
Int. J. Found. Comput. Sci. 18(4): 667-668 (2007) |
| 76 | | Chun-Cheng Lin,
Hsu-Chun Yen:
On Balloon Drawings of Rooted Trees.
J. Graph Algorithms Appl. 11(2): 431-452 (2007) |
| 2006 |
|---|
| 75 |  | Oscar H. Ibarra,
Hsu-Chun Yen:
Implementation and Application of Automata, 11th International Conference, CIAA 2006, Taipei, Taiwan, August 21-23, 2006, Proceedings
Springer 2006 |
| 74 | | Yi-Yi Lee,
Chun-Cheng Lin,
Hsu-Chun Yen:
Mental map preserving graph drawing using simulated annealing.
APVIS 2006: 179-188 |
| 73 | | Hsu-Chun Yen:
Introduction to Petri Net Theory.
Recent Advances in Formal Languages and Applications 2006: 343-373 |
| 72 | | Hsu-Chun Yen,
Lien-Po Yu:
Decidability Analysis of Self-Stabilization for Infinite-State Systems.
Fundam. Inform. 70(4): 387-402 (2006) |
| 71 | | Oscar H. Ibarra,
Sara Woodworth,
Hsu-Chun Yen,
Zhe Dang:
On the Computational Power of 1-Deterministic and Sequential P Systems.
Fundam. Inform. 73(1-2): 133-152 (2006) |
| 70 | | Seok-Hee Hong,
Hsu-Chun Yen:
Preface.
Int. J. Found. Comput. Sci. 17(5): 1003-1004 (2006) |
| 69 | | Oscar H. Ibarra,
Hsu-Chun Yen:
Deterministic catalytic systems are not universal.
Theor. Comput. Sci. 363(2): 149-161 (2006) |
| 2005 |
|---|
| 68 | | Oscar H. Ibarra,
Hsu-Chun Yen:
On Deterministic Catalytic Systems.
CIAA 2005: 163-175 |
| 67 | | Oscar H. Ibarra,
Sara Woodworth,
Hsu-Chun Yen,
Zhe Dang:
On Sequential and 1-Deterministic P Systems.
COCOON 2005: 905-914 |
| 66 | | Chun-Cheng Lin,
Hsu-Chun Yen:
On Balloon Drawings of Rooted Trees.
Graph Drawing 2005: 285-296 |
| 65 | | Cheng Li,
Zhe Dang,
Oscar H. Ibarra,
Hsu-Chun Yen:
Signaling P Systems and Verification Problems.
ICALP 2005: 1462-1473 |
| 64 | | Jiunn Deng,
Hsu-Chun Yen:
Design and Performance Evaluation of an Optimal Collision Avoidance Mechanism over Congested and Noisy Channels for IEEE 802.11 DCF Access Method.
ICOIN 2005: 11-20 |
| 63 | | Chun-Cheng Lin,
Hsu-Chun Yen:
A New Force-Directed Graph Drawing Method Based on Edge-Edge Repulsion.
IV 2005: 329-334 |
| 62 | | Oscar H. Ibarra,
Sara Woodworth,
Hsu-Chun Yen,
Zhe Dang:
On Symport/Antiport P Systems and Semilinear Sets.
Workshop on Membrane Computing 2005: 253-271 |
| 61 | | Der-Jiunn Deng,
Hsu-Chun Yen:
Quality-of-service provisioning system for multimedia transmission in IEEE 802.11 wireless LANs.
IEEE Journal on Selected Areas in Communications 23(6): 1240-1252 (2005) |
| 60 | | Hsu-Chun Yen,
Lien-Po Yu:
Petri Nets with Simple Circuits.
IEICE Transactions 88-D(9): 2113-2125 (2005) |
| 59 | | Oscar H. Ibarra,
Hsu-Chun Yen,
Zhe Dang:
On various notions of parallelism in P Systems.
Int. J. Found. Comput. Sci. 16(4): 683-705 (2005) |
| 2004 |
|---|
| 58 | | Oscar H. Ibarra,
Hsu-Chun Yen,
Zhe Dang:
The Power of Maximal Parallelism in P Systems.
Developments in Language Theory 2004: 212-224 |
| 57 | | Hsu-Chun Yen,
Lien-Po Yu:
Dependability Analysis of a Class of Probabilistic Petri Nets.
PRDC 2004: 373-380 |
| 56 | | Joseph Deng,
Hsu-Chun Yen:
Quality-of-service provisioning system for multimedia transmission in IEEE 802.11 wireless lans.
Parallel and Distributed Computing and Networks 2004: 165-170 |
| 2003 |
|---|
| 55 | | Farn Wang,
Hsu-Chun Yen:
Timing Parameter Characterization of Real-Time Systems.
CIAA 2003: 23-34 |
| 54 | | Hsu-Chun Yen,
Lien-Po Yu:
Petri Nets with Simple Circuits.
COCOON 2003: 149-158 |
| 53 | | Jen-Hui Chuang,
Chun-Cheng Lin,
Hsu-Chun Yen:
Drawing Graphs with Nonuniform Nodes Using Potential Fields.
Graph Drawing 2003: 460-465 |
| 52 | | Ming-Yang Chen,
Hsueh-I Lu,
Hsu-Chun Yen:
On the Ramsey Numbers for Bipartite Multigraphs
CoRR cs.DM/0305006: (2003) |
| 51 | | Yih-Kai Lin,
Hsu-Chun Yen:
An /spl omega/-automata approach to the representation of bilevel images.
IEEE Transactions on Systems, Man, and Cybernetics, Part B 33(3): 524-531 (2003) |
| 50 | | Chien-Chih Liao,
Hsueh-I Lu,
Hsu-Chun Yen:
Compact floor-planning via orderly spanning trees.
J. Algorithms 48(2): 441-451 (2003) |
| 2002 |
|---|
| 49 | | Meng-Hang Ho,
Hsu-Chun Yen:
A Dictionary-Based Compressed Pattern Matching Algorithm.
COMPSAC 2002: 873-878 |
| 48 | | Ho-Lin Chen,
Chien-Chih Liao,
Hsueh-I Lu,
Hsu-Chun Yen:
Some Applications of Orderly Spanning Trees in Graph Drawing.
Graph Drawing 2002: 332-343 |
| 47 | | Ming-Che Chuang,
Hsu-Chun Yen:
On Nearly Symmetric Drawings of Graphs.
IV 2002: 489- |
| 46 | | Tzuoo-Hawn Yeh,
Cheng-Ming Kuo,
Chin-Laung Lei,
Hsu-Chun Yen:
Distributed and On-Line Routing on Tori.
Algorithmica 32(4): 562-593 (2002) |
| 45 | | Chien-Chih Liao,
Hsueh-I Lu,
Hsu-Chun Yen:
Compact Floor-Planning via Orderly Spanning Trees
CoRR cs.DS/0210016: (2002) |
| 2001 |
|---|
| 44 | | Chien-Chih Liao,
Hsueh-I Lu,
Hsu-Chun Yen:
Floor-Planning via Orderly Spanning Trees.
Graph Drawing 2001: 367-377 |
| 43 | | Hsu-Chun Yen:
Analysis of Self-Stabilization for Infinite-State Systems.
ICECCS 2001: 240-248 |
| 42 | | Farn Wang,
Hsu-Chun Yen:
Parametric Optimization of Open Real-Time Systems.
SAS 2001: 299-318 |
| 41 | | Kien-Weh Chin,
Hsu-Chun Yen:
The symmetry number problem for trees.
Inf. Process. Lett. 79(2): 73-79 (2001) |
| 2000 |
|---|
| 40 | | Ho-Lin Chen,
Hsueh-I Lu,
Hsu-Chun Yen:
On Maximum Symmetric Subgraphs.
Graph Drawing 2000: 372-383 |
| 39 | | Yih-Kai Lin,
Hsu-Chun Yen:
An omega-automata approach to the compression of bi-level images.
Electr. Notes Theor. Comput. Sci. 31: (2000) |
| 1999 |
|---|
| 38 | | Ho-Lin Chen,
Hsu-Chun Yen:
Orthogonal and Straight-Line Drawings of Graphs with Succinct Representations.
Graph Drawing 1999: 416-417 |
| 1998 |
|---|
| 37 | | Hsu-Chun Yen:
Priority Conflict-Free Petri Nets.
Acta Inf. 35(8): 673-688 (1998) |
| 36 | | Tzuoo-Hawn Yeh,
Cheng-Ming Kuo,
Chin-Laung Lei,
Hsu-Chun Yen:
Competitive Analysis of On-Line Disk Scheduling.
Theory Comput. Syst. 31(5): 491-506 (1998) |
| 1997 |
|---|
| 35 | | Tzuoo-Hawn Yeh,
Cheng-Ming Kuo,
Chin-Laung Lei,
Hsu-Chun Yen:
Competitive Source Routing on Tori and Meshes.
ISAAC 1997: 82-91 |
| 34 | | Hsu-Chun Yen:
On Reachability Equivalence for BPP-Nets.
Theor. Comput. Sci. 179(1-2): 301-317 (1997) |
| 33 | | Hsu-Chun Yen,
Bow-Yaw Wang,
Ming-Sheng Yang:
Deciding a Class of Path Formulas for Conflict-Free Petri Nets.
Theory Comput. Syst. 30(5): 475-494 (1997) |
| 1996 |
|---|
| 32 | | Tzuoo-Hawn Yeh,
Cheng-Ming Kuo,
Chin-Laung Lei,
Hsu-Chun Yen:
Competitive Analysis of On-Line Disk Scheduling.
ISAAC 1996: 356-365 |
| 31 | | Hsu-Chun Yen:
On the Regularity of Petri Net Languages.
Inf. Comput. 124(2): 168-181 (1996) |
| 30 | | Hsu-Chun Yen,
Shi-Tsuen Jian,
Ta-Pang Lao:
Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes.
Theor. Comput. Sci. 170(1-2): 445-464 (1996) |
| 1995 |
|---|
| 29 | | Jin-Fu Chang,
Shi-Chung Chang,
Zsehong Tsai,
Jung-Shyr Wu,
Hsu-Chun Yen:
Design, implementation, and applications of a B-ISDN simulation testbed.
Annual Simulation Symposium 1995: 212-219 |
| 28 | | Hsu-Chun Yen,
Shi-Tsuen Jian,
Ta-Pang Lao:
Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes.
ISAAC 1995: 301-310 |
| 27 | | Hsu-Chun Yen:
A Note on Fine Covers and Iterable Factors of VAS Languages.
Inf. Process. Lett. 56(5): 237-243 (1995) |
| 1994 |
|---|
| 26 | | Hsu-Chun Yen:
On multiterminal single bend wirability.
IEEE Trans. on CAD of Integrated Circuits and Systems 13(6): 822-826 (1994) |
| 25 | | Hsu-Chun Yen,
Bow-Yaw Wang,
Ming-Sheng Yang:
Some Complexity Results for Rings of Petri Nets.
Int. J. Found. Comput. Sci. 5(3/4): 282-292 (1994) |
| 1993 |
|---|
| 24 | | Hsu-Chun Yen,
Bow-Yaw Wang,
Ming-Sheng Yang:
A Unified Approach for Reasoning about Conflict-Free Petri Nets.
Application and Theory of Petri Nets 1993: 513-531 |
| 23 | | Rodney R. Howell,
Louis E. Rosier,
Hsu-Chun Yen:
Normal and Sinkless Petri Nets.
J. Comput. Syst. Sci. 46(1): 1-26 (1993) |
| 22 | | Hsu-Chun Yen,
Namhee Pak:
Complexity Analysis of Propositional Concurrent Programs Using Domino Tiling.
Mathematical Systems Theory 26(4): 357-378 (1993) |
| 1992 |
|---|
| 21 | | Hsu-Chun Yen:
A Unified Approach for Deciding the Existence of Certain Petri Net Paths
Inf. Comput. 96(1): 119-137 (1992) |
| 20 | | Hsu-Chun Yen:
A Multiparameter Analysis of Domino Tiling with an Application to Concurrent Systems.
Theor. Comput. Sci. 98(2): 263-287 (1992) |
| 1991 |
|---|
| 19 | | Hsu-Chun Yen:
Priority Systems with many Identical Processes.
Acta Inf. 28(7): 681-692 (1991) |
| 18 | | Hsu-Chun Yen:
A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict-Free Petri Nets.
Inf. Process. Lett. 38(2): 71-76 (1991) |
| 17 | | Rodney R. Howell,
Louis E. Rosier,
Hsu-Chun Yen:
Global and Local Views of State Fairness.
Theor. Comput. Sci. 80(1): 77-104 (1991) |
| 16 | | Rodney R. Howell,
Louis E. Rosier,
Hsu-Chun Yen:
A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets.
Theor. Comput. Sci. 82(2): 341-372 (1991) |
| 1990 |
|---|
| 15 | | Hsu-Chun Yen:
Communicating Processes, Scheduling, and the Complexity of Nondeterminism.
Mathematical Systems Theory 23(1): 33-59 (1990) |
| 14 | | Ethan Gannett,
Suresh C. Kothari,
Hsu-Chun Yen:
On Optimal Parallelization of Sorting Networks.
Theor. Comput. Sci. 76(2-3): 331-341 (1990) |
| 1989 |
|---|
| 13 | | Rodney R. Howell,
Louis E. Rosier,
Hsu-Chun Yen:
Normal and Sinkless Petri Nets.
FCT 1989: 234-243 |
| 1988 |
|---|
| 12 | | Rodney R. Howell,
Louis E. Rosier,
Hsu-Chun Yen:
A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets.
MFCS 1988: 351-359 |
| 11 | | Louis E. Rosier,
Hsu-Chun Yen:
On the Complexity of Deciding fair Termination of Probabilistic Concurrent Finite-State Programs.
Theor. Comput. Sci. 58: 263-324 (1988) |
| 1987 |
|---|
| 10 | | Ethan Gannett,
Suresh C. Kothari,
Hsu-Chun Yen:
On Optimal Parallelization of Sorting Networks.
FSTTCS 1987: 195-206 |
| 9 | | Rodney R. Howell,
Louis E. Rosier,
Hsu-Chun Yen:
An O(n^(1.5)) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement Systems.
Inf. Process. Lett. 25(1): 27-33 (1987) |
| 8 | | Louis E. Rosier,
Hsu-Chun Yen:
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning Omega-Machines.
SIAM J. Comput. 16(5): 779-807 (1987) |
| 1986 |
|---|
| 7 | | Louis E. Rosier,
Hsu-Chun Yen:
On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs.
ICALP 1986: 334-343 |
| 6 | | Louis E. Rosier,
Hsu-Chun Yen:
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-Machines.
STACS 1986: 306-320 |
| 5 | | Louis E. Rosier,
Hsu-Chun Yen:
A Multiparameter Analysis of the Boundedness Problem for Vector Addition Systems.
J. Comput. Syst. Sci. 32(1): 105-135 (1986) |
| 4 | | Louis E. Rosier,
Hsu-Chun Yen:
Boundedness, Empty Channel Detection, and Synchronization for Communicating Finite Automata.
Theor. Comput. Sci. 44: 69-105 (1986) |
| 3 | | Rodney R. Howell,
Louis E. Rosier,
Dung T. Huynh,
Hsu-Chun Yen:
Some Complexity Bounds for Problems Concerning Finite and 2-Dimensional Vector Addition Systems with States.
Theor. Comput. Sci. 46(3): 107-140 (1986) |
| 1985 |
|---|
| 2 | | Louis E. Rosier,
Hsu-Chun Yen:
A multiparameter analysis of the boundedness problem for vector addition systems.
FCT 1985: 361-370 |
| 1 | | Louis E. Rosier,
Hsu-Chun Yen:
Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State Machines.
STACS 1985: 287-298 |
