
Y. Chang, and H. Yen, Improved Algorithms for Gridunfolding
Orthogonal Polyhedra, accepted for publication in International
Journal of Computational Geometry & Applications, 2017

Y. Chang, and H. Yen, On Orthogonally Convex Drawings of Plane
Graphs, COMPUTATIONAL GEOMETRY: Theory and Applications, Vol. 62,
34–51, April 2017.

Y. Chang, and H. Yen, Areauniversal Drawings of
Biconnected Outerplane Graphs,
Information Processing Letters,
Vol. 118, 15, Feb. 2017.

C. Chang, H. Yen, and D. Deng, “V2V
QoS Guaranteed Channel Access in IEEE 802.11p VANETs,”
IEEE Transactions on Dependable and Secure Computing,
Vol. 13, Issue 1, 517, Jan. 2016.

Y. Chang, and H. Yen, “Constrained
Floorplans in 2D and 3D,” Theoretical Computer Science,
Vol. 607, Part 3, 320336, Nov. 2015.

C. Chang, H. Yen, C. Lin, and D. Deng, “QoS/QoE
Support for H.264/AVC Video Stream in IEEE 802.11ac WLANs,”
IEEE System Journal, doi: 10.1109/JSYST.2015.2431291, Jun.
2015.

C. Chang, H. Yen, A. Benslimane, and D. Deng, “A
Pragmatic VBR Stream Scheduling Policy for IEEE 802.11e HCCA Access
Method,” IEEE Transactions on Emerging Topics in
Computing,
Vol. 3, Issue 4, 514523, Dec. 2015.

H. Wu, S. Takahashi, D. Hirono, M. Arikawa, C. Lin, and H. Yen,
Spatially Efficient Design of Annotated Metro Maps, Computer
Graphics Forum,
(special issue for EuroVis 2013), Vol. 32, No. 3, pp.
261270, 2013.

O. Ibarra, and H. Yen, On the Containment and Equivalence Problems
for Twoway Transducers,
Theoretical Computer Science, Vol. 429, pp. 155163,
2012.

H. Wu, S. Takahashi, C. Lin, and H. Yen, TravelRouteCentered Metro
Map Layout and Annotation, Computer Graphics Forum,
(special issue for EuroVis 2012), Vol. 31, No. 3, pp. 925934, 2012.

C. Lin and H. Yen,
A New ForceDirected Graph Drawing Method Based on
EdgeEdge Repulsion, Journal of
Visual Languages and Computing, Vol. 29, No. 1, pp. 2942, 2012.

H. Yen, On AlmostSure Properties of Probabilistic Discrete Event
Systems. Fundamenta Informaticae,
110
(14): 343359, 2011.

S. Takahashi,
H. Wu,
S. Saw,
C. Lin, and H. Yen, Optimized
Topological Surgery for Unfolding 3D Meshes.
Comput. Graph. Forum 30
(7): 20772086, 2011.

C. Lin,
H. Yen, S. Poon, and J. Fan,
Complexity Analysis of Balloon Drawing for Rooted Trees,
Theoretical
Computer Science, Vol.
412, pp. 430447, 2011.

C. Lin, Y. Lee, and H. Yen,
Mental Map Preserving Graph Drawing Using Simulated
Annealing, Information Sciences, Vol. 181, No. 19,
pp. 42534272, 2011.

O. Ibarra, I. Potapov,
H. Yen, On Decision Problems for Parameterized
Machines, Theoretical
Computer Science,
Vol. 411, 11921201, 2010.

C. Chen, S. Chin, and
H. Yen, Reachability Analysis of
Augmented Marked Graphs via Integer Linear Programming
(pdf),
The Computer Journal, Vol. 53, No. 6,
623633, 2010.

H. Yen, Path Decomposition and Semilinearity of Petri Nets, International Journal of Foundations of Computer Science,
Vol. 20, No. 4, 581596, 2009.

H. Yen and C. Chen,
On Minimal Elements of Upwardclosed Sets,
Theoretical Computer Science
(pdf),
Vol. 410, 24422452, 2009.

C. Lin, H. Yen, and J. Chuang,
Drawing Graphs with Nonuniform Nodes Using Potential
Fields, Journal of Visual
Languages and Computing,
Vol. 20, No. 6, 385402, 2009.

C. Lin, H. Kao, and H. Yen, ManytoOne Boundary Labeling,
Journal of Graph Algorithms and
Applications (pdf),
(special issue for APVIS 2007),
Vol. 13, No. 3, pp. 319356, 2008.

H. Yen, Decidability
and Complexity Analysis of Forbidden State Problems for Discrete Event
Systems (pdf),
International Journal of Foundations of Computer Science,
Vol. 19, No. 4, 9991013, 2008.

T. Shih and H. Yen,
LocationAware Routing
Protocol with Dynamic Adaptation of Request Zone for Mobile Ad Hoc
Networks, Wireless Networks,
14(3): 321333, 2008.

C. Lin and H. Yen, On Balloon Drawings of Rooted Trees,
Journal
of Graph Algorithms and Applications (pdf),
(special issue for GD 2005), Vol. 11, No. 2, pp. 431452, 2007.

O. Ibarra, and H. Yen, Deterministic Catalytic Systems Are not
Universal, Theoretical Computer Science (pdf)
363(2): 149161, 2006.

O. Ibarra, S. Woodworth, H. Yen, and Z. Dang, On the Computational
Power of 1Deterministic and Sequential P Systems, Fundamenta
Informaticae (pdf),
Vol. 73 (12), pp. 133152, 2006.

H. Yen and L. Yu, Decidability Analysis of SelfStabilization for
Infinite State Systems, Fundamenta Informaticae, Vol. 70,
No. 4, 387402, 2006. (Postscript)

O. Ibarra, H. Yen, and Z. Dang, On Various Notions of Parallelism in
P Systems, International Journal of Foundations of Computer Science,
Vol. 16, No. 4, pp. 683706, August 2005.

D. Deng, and H. Yen,
QualityofService Provisioning System for Multimedia
Transmission in
IEEE 802.11 Wireless LANs, IEEE Journal on
Selected Areas in Communications (special issue on
Mobile Computing and Networking), Vol. 23, No. 6,
pp. 12401252, June 2005.
(pdf)

F. Wang and H. Yen, Reachability Solution Characterization of
Parametric Realtime Systems, Theoretical Computer Science
,
Vol. 328 , pp. 187201, 2004. (Postscript)

C. Liao, H. Lu and H. Yen, Compact FloorPlanning via
Orderly Spanning Trees, Journal of Algorithms, Vol. 48, No.
2, pp. 441451, September 2003. (Postscript)

K. Lin and H. Yen, An OmegaAutomata Approach to the
Representation of Bilevel Images, IEEE Trans. on Systems, Man, and
Cybernetics (Part B: Cybernetics), Vol. 33, No. 3, pp. 524531,
June 2003. (Postscript)

H. Yen, Sequential versus Concurrent Languages of Labeled
ConflictFree Petri Nets, IEEE Trans. on Automatic Control,
Vol. 47, No. 7, pp. 11581162, July 2002. (Postscript)

H. Yen, A ValuationBased Analysis of ConflictFree Petri
Nets, Systems and Control Letters, Vo. 45, No. 5, pp. 387 
395, 2002. (Postscript)

T. Yeh, C. Kuo, C. Lei, and H. Yen, Distributed and Online
Routing on Tori, Algorithmica, Vol. 32, pp. 562593, 2002. (
Postscript)

K. Chin, and H. Yen, The Symmetry Number Problem for Trees,
Information Processing Letters, Vol. 79, No. 2, pp. 7379,
May 2001. (
Postscript)

H. Yen, Integer Linear Programming and the Analysis of Some
Petri Net Problems, Theory of Computing Systems (formerly,
Mathematical Systems Theory), Vol. 32, No. 4, pp. 467485,
1999. (
Postscript)

H. Yen, Priority ConflictFree Petri Nets,
Acta
Informatica, Vol. 35, No. 8, pp. 673688, 1998 (
Postscript )

T. Yeh, C. Kuo, C. Lei, and H. Yen, Competitive Analysis of
OnLine Disk Scheduling, Theory of Computing Systems
(formerly, Mathematical Systems Theory), Vol. 31, No. 5, pp.
491506, 1998. (
Postscript)

H. Yen, B. Wang, and M. Yang, Deciding a Class of Path
Formulas for ConflictFree Petri Nets, Theory of Computing Systems
(formerly, Mathematical Systems Theory) Vol. 30, No. 5, pp.
475494, September/October 1997. (
Postscript)

H. Yen, On Reachability Equivalence for BPP Nets,
Theoretical Computer Science Vol. 179, No. 12, pp. 397419, June
1997. (
Postscript)

H. Yen, S. Jian, and T. Lao, Deciding Bisimulation and
Trace Equivalences for Systems with Many Identical Processes, Theoretical Computer Science, Vol. 170, No. 12, pp. 445464,
December 1996. (
Postscript)

H. Yen, On the Regularity of Petri Net Languages,
Information and Computation, Vol. 124, No. 2, pp. 168181, 1996. (
Postscript)

H. Yen, A Note on Fine Covers and Iterable Factors of VAS
Languages, Information Processing Letters, Vol. 56, No. 5,
pp. 237243, December 1995. (
Postscript)

H. Yen, B. Wang, and M. Yang, Some Complexity Results for
Rings of Petri Nets, International Journal of Foundations of Computer
Science, Vol. 5, Nos. 3 & 4, pp. 281292, 1994. (
Postscript)

H. Yen, On Multiterminal Single Bend Wirability,
IEEE Transactions on Computer Aided Design of Integrated Circuits and
Systems, Vol. 13, No. 6, pp. 822826, June 1994.

H. Yen and N. Pak, Complexity Analysis of Propositional
Concurrent Programs Using Domino Tiling, Mathematical Systems Theory,
Vol. 26, pp. 357378, 1993.

R. Howell, L. Rosier, and H. Yen, Normal and Sinkless Petri
Nets, Journal of Computer and System Sciences, Vol. 46, pp.
126, February 1993. (
Postscript)

H. Yen, A Multiparameter Analysis of Domino Tiling with an
Application to Concurrent Systems, Theoretical Computer Science,
Vol. 98, pp. 263287, 1992.

H. Yen, A Unified Approach for Deciding the Existence of
Certain Petri Net Paths, Information and Computation, Vol.
96, No. 1, pp. 119137, 1992.

H. Yen, Priority Systems with Many Identical Processes,
Acta Informatica, Vol. 28, pp. 681692, 1991.

H. Yen, A Polynomial Time Algorithm to Decide Pairwise
Concurrency of Transitions for 1Bounded ConflictFree Petri Nets, Information Processing Letters, Vol. 38, No. 2, pp. 7176, 1991.

R. Howell, L. Rosier and H. Yen, A Taxonomy of Fairness and
Temporal Logic Problems for Petri Nets, Theoretical Computer Science,
Vol. 82, 1991, pp. 341372.

R. Howell, L. Rosier and H. Yen, Global and Local Views of
State Fairness, Theoretical Computer Science, Vol. 80, No.
1, 1991, pp. 77104.

E. Gannett, S. Kothari and H. Yen, On Optimal
Parallelization of Sorting Networks, Theoretical Computer Science,
Vol. 76, No. 23, 1990, pp. 331341.

H. Yen, Communicating Processes, Scheduling and the
Complexity of Nontermination, Mathematical Systems Theory,
Vol. 23, No. 1, 1990, pp. 3359.

A. Sharma and H. Yen, Boundedness, Hierarchy of Fairness
and Communication Networks with Delay, International Journal of
Computer Mathematics, Vol. 26, 1989, pp. 161178.

L. Rosier and H. Yen, On the Complexity of Deciding Fair
Termination of Probabilistic Concurrent FiniteState Programs, Theoretical Computer Science, Vol. 58, No. 13, 1988, pp. 263324.

L. Rosier and H. Yen, Logspace Hierarchies, Polynomial Time
and the Complexity of Fairness Problems Concerning OmegaMachines, SIAM J. on Computing, Vol. 16, No. 5, 1987, pp. 779807.

R. Howell, L. Rosier and H. Yen, An O(n^1.5) Algorithm to
Decide Boundedness for ConflictFree Vector Replacement Systems, Information Processing Letters, Vol. 25, No. 1, 1987, pp. 2733.

R. Howell, D. Huynh, L. Rosier and H. Yen, Some Complexity
Bounds for Problems Concerning Finite and 2Dimensional Vector Addition
Systems with States, Theoretical Computer Science, Vol. 46,
No. 2,3, 1986, pp. 107140.

L. Rosier and H. Yen, Boundedness, Empty Channel Detection,
and Synchronization for Communicating Finite Automata, Theoretical
Computer Science, Vol. 44, No. 1, 1986, pp. 69105.

L. Rosier and H. Yen, A Multiparameter Analysis of the
Boundedness Problem for Vector Addition Systems, Journal of Computer
and System Sciences, Vol. 32, No. 1, 1986, pp. 105135.


Y. Chang, and H. Yen, On Bendminimized Orthogonal Drawings of Planar
3graphs, to be presented at the 33rd International Symposium on
Computational Geometry (SoCG 2017), Brisbane, Australia, July 4 7,
2017.

Y. Chang, and H. Yen, "Unfolding Orthogonal Polyhedra with
Linear Refinement," in the Proc. of 26th International Symposium on
Algorithms and Computation (ISAAC 2015), LNCS 9472, pp. 415425, Nagoya, Japan, December
911, 2015.

Y. Chang, and H. Yen, “A New
Approach for Contact Graph Representations and Its Applications,”
in Proc. of 14th Int'l Symp. on Algorithms and Data Structures
(WADS 2015), LNCS 9214, pp. 166177, Victoria, Canada, Aug. 2015.

H.Y. Wu, S.H. Poon, S. Takahashi, M. Arikawa, C. Lin, and H. Yen,
"Designing and Annotating Metro Maps with Circular Routes," in Proc. of
19th International Conference on Information Visualisation (IV
2015), IEEE CS Press, pp. 96101, Barcelona, Spain, Jul. 2124, 2015.

Y. Chang, and H. Yen, “Rectilinear
Duals Using Monotone Staircase Polygons,” in Proc. of 8th
International Conference on Combinatorial Optimization and Applications
(COCOA 2014), LNCS 8881, pp. 86100, Maui, Hawaii, USA, Dec. 2014.

Y. Chang, and H. Yen, On Orthogonally Convex Drawings of Plane Graphs,
in Proc. of 21st International Symposium on Graph Drawing
(GD 2013), Bordeaux, France, Sept. 2325, 2013.

H. Wu, S. Takahashi, C. Lin, and H. Yen, VoronoiBased Label
Placement for Metro Maps, in Proc. of 17th International Conference on
Information Visualisation (IV 2013), IEEE CS Press,
London, UK, Jul. 1518, 2013.

S. Takahashi, H. Wu, S. Saw, C. Lin, and H. Yen, Optimized
Topological Surgery for Unfolding 3D Meshes, in Proc. of (Pacific Graphics 2011),
Kaohsiung, Taiwan Sept. 2123, 2011.

O. Ibarra, and H. Yen, On Twoway Transducers, in Proc. of 15th
International Conference on Developments in Language Theory (DLT
2011), (LNCS 6795), pp. 300311, Milan, Italy, July 19–22, 2011.

C. Lin, S. Poon, S. Takahashi, H. Wu, and H. Yen, Oneandahalfside
Boundary Labeling, in Proc. of 5th International Conference on
Combinatorial Optimization and Applications (COCOA 2011), (LNCS
6831), pp. 387398, Zhangjiajie, Hunan, China, Aug. 46, 2011.

H. Wu, S. Takahashi, C. Lin, and H. Yen, A ZoneBased Approach for
Placing Annotation Labels on Metro Maps, in Proc. of 11th
International Symposium on Smart Graphics (SG 2011), (LNCS
6815), pp. 91102, Bremen, Germany, July 1820, 2011.

H. Yen, On AlmostSure Properties of Probabilistic Discrete Event
Systems, 10th International Workshop on Discrete Event Systems
(WODES 2010), Berlin, Germany, August 30  Sept. 1, 2010.

C. Lin, H. Wu, and
H. Yen, Boundary Labeling in Text Annotation, in
Proc. of 13th International Conference on Information Visualisation
(IV09), IEEE CS Press, pp.110115, Barcelona, Spain, Jul. 1417, 2009.

P. Lin, C. Lin, and
H. Yen, TriHistogram Equalization Based on
First Order Statistics, in Proc. of 13th IEEE International
Symposium on Consumer Electronics (ISCE 2009), IEEE Press, pp.
387391, Kyoto, Japan, May 2528, 2009.

P. Lin, C. Shen, C.
Lin, and H. Yen, Contrast
Enhancement on Color Images Using Iterative Histogram Rearrangement, in
Proc. of 13th IEEE International Symposium on Consumer
Electronics (ISCE 2009), IEEE Press, pp. 382386, Kyoto, Japan, May
2528, 2009.

Y. Lin, C.
Shen, C. Lin, and H.
Yen, A Fast Image Fusion Algorithm for Image Stabilization on
HandHeld Consumer Electronics, in Proc. of 27th IEEE International
Conference on Consumer Electronics (ICCE 2009), IEEE Press, Las
Vegas, USA, Jan. 1014, 2009.

H. Yen, Concurrency, Synchronization, and Conflicts in Petri Nets (Invited
Talk), in Proc. of the 13th International Conference on
Implementation and Application of Automata (CIAA
2008), (LNCS 5148), pp. 3335, San Francisco, USA, July 2124,
2008.

C. Shen, P. Lin, C. Lin, and H. Yen, Image
Enhancement Using Piecewise Transfer Functions with Segmentations, in Proc.
of the 2008 IEEE International Symposium on Consumer Electronics,
(ISCE 2008),
pp. 14, Algarve, Portugal, April 1416, 2008

C. Sung, M. Day, H. Yen, and W. Hsu, A Template
Alignment Algorithm for Question Classification, in Proc. of the
2008 IEEE International Conference on Intelligence and Security Informatics,
(ISI 2008),
pp. 197199, Taipei, Taiwan, June 1720, 2008.

J. Fan, C. Lin, H. Lu, and
H.Yen, WidthOptimal Visibility
Representation of Plane Graphs, in Proc. of the 18th International
Symposium on Algorithms and Computation (ISAAC
2007), (LNCS 4835), pp. 160171, Sendai, Japan, Dec. 1719,
2007.

H. Yen, Decidability and Complexity Analysis of
Forbidden State Problems for Discrete Event Systems, Workshop on
Reachability Problems, (satellite event of the
DLT'07), July 78, Turku, Finland.

H. Yen and C. Chen, Computing Minimal Elements of UpwardClosed Sets
for Petri Nets, in Proc. of the 28th Int'l Conf. on Application and
Theory of Petri Nets and Other Models of Concurrency, (Petri
Nets 2007), (LNCS 4546), pp. 465483, Siedlce, Poland, June
2529, 2007.

Y. Yang, T. Chang, and H. Yen, A Unified
Framework for Quantum Random Walk Algorithms on General Graphs, 7th
IEEE Conf. on Nanotechnology, (IEEENANO
2007), pp. 12771282, Hong Kong, August 25, 2007.

C. Lin, and
H. Yen: Balloon Views of Source Code and Their
Multiscalable Font Modes, in Proc. of the 11th Int'l
Conference on Information Visualisation (IV
2007), pp. 5358, Zurich, Switzerland, July 46, 2007.

H. Kao, C. Lin, and
H. Yen, ManytoOne Boundary Labeling, in
Proc. of the AsiaPacific Symposium on Visualisation 2007 (APVIS
2007), pp. 6572, Sydney, Australia, Feb. 57, 2007.

Y. Lee, C. Lin, and
H. Yen, Mental Map Preserving Graph Drawing
Using Simulated Annealing, in Proc. of the Asia Pacific Symposium
on Information Visualisation 2006 (APVIS
2006), Tokyo, Japan, Feb. 13, 2006. (Postscript)

C. Lin, and H. Yen, On Balloon Drawings of Rooted
Trees, in Proc. of the 13th International Symposium on Graph Drawing
(GD 2005),
(LNCS 3843),
Sept. 1214, 2005, Limerick, Ireland.
(Postscript)

O. Ibarra, S. Woodworth and
H. Yen, Z. Dang, On
Symport/Antiport Systems and Semilinear Sets, in Proc. of the 6^{th} International Workshop on Membrane
Computing (WMC6)
, (LNCS 3850), July 18  21, 2005,
Vienna, Austria. (Postscript)

O. Ibarra, and
H. Yen. On Deterministic Catalytic Systems, in
Proc. of the 10th International Conference on Implementation and
Application of Automata (CIAA
2005), (LNCS 3845),
June 27–29, 2005, Sophia Antipolis, France. (Postscript)

O. Ibarra, S. Woodworth, H. Yen and Z. Dang. On Sequential and
1Deterministic P Systems, in Proc. of the
11th International Computing and Combinatorics Conference
(COCOON
2005), (LNCS 3595) , August 16 
19, Kunming, Yunnan, China. (Postscript)

C. Li, Z. Dang, O. Ibarra, and
H. Yen, Signaling P Systems and
Verification Problems, in Proc. of the
32nd International Colloquium on Automata, Languages
and Programming (ICALP'05),
(LNCS 3580), pp. 14621473, July 1115, 2005,
Lisboa, Portugal. (Postscript)

C. Lin and H. Yen, A new forcedirected graph drawing method based
on edgeedge repulsion, in Proc. of the 9th International Conference on Information Visualisation (IV
2005), July 68 , 2005, London, UK. (pdf)

D. Deng and
H. Yen, Design and Performance Evaluation of
an Optimal Collision Avoidance Mechanism over Congested and Noisy Channels
for IEEE 802.11 DCF Access Method, in Proc. of International
Conference on Information Networking 2005, (ICOIN
2005) (LNCS 3391), pp. 1120, Jan. 31 Feb. 2, 2005, Jeju Korea.
(ps)

O. Ibarra,
H. Yen, and Z. Dang, The power of maximal
parallelism in P systems, Eighth International Conference on
Developments in Language Theory (DLT'04)
(LNCS 3340), pp. 212224, Dec. 1317, 2004, Auckland, New Zealand.

H. Yen and L. Yu, Dependability Analysis of a Class of
Probabilistic Petri Nets, in Proc. of 10th IEEE Pacific Rim
Int'l Symp. on Dependable Computing, (PRDC
2004) pp. 373382, March 35, 2004, Tahiti, French Polynesia. (ps)

C. Chen, T. Lin, and
H. Yen, Modelling and Analysis of
Asynchronous Circuits and Timing Diagrams Using Parametric Timed Automata,
in Proc. of the 23rd IASTED Int'l Conf. on Modelling,
Identification and Control (
MIC 2004 ), February 2325, 2004
Grindelwald, Switzerland (pdf)

D. Deng, and
H. Yen, QualityofService Provisioning
System for Multimedia Transmission in IEEE 802.11 Wireless LANs, in Proc.
of the IASTED Int'l Conf. on Parallel and Distributed Computing
and Networks (
PDCN 2004 ), February 1719, 2004
Innsbruck, Austria. (pdf)

J. Chuang, C. Lin, and
H. Yen, Drawing Graphs with
NonUniform Nodes Using Potential Fields, in Proc. of 11th
International Symposium on Graph Drawing (GD
2003) (LNCS 2912) pp. 460465, September 2124, 2003, Perugia,
Italy. (pdf)

F. Wang and
H. Yen, Timing Parameter Characterization of
RealTime Systems, in the Proceedings of the 8th International
Conference on Implementation and Application of Automata (
CIAA 2003), (LNCS 2759) pp. 2334, July 1618, 2003, Santa
Barbara, CA, USA. (ps)

H. Yen, and L. Yu, Petri Nets with Simple Circuits, in the
Proceedings of the Ninth International Computing and
Combinatorics Conference, (
COCOON 2003) (LNCS 2697), pp. 149158, July 2528, 2003, Big
Sky, MT, USA. (pdf)

H. Chen, C. Liao, H. Lu and
H. Yen, Some Applications of
Orderly Spanning Trees in Graph Drawing, in the Proceedings of the
10th International Symposium on Graph Drawing (GD
2002) (LNCS 2528) pp. 332343, August 2628, 2002,
Irvine, California. (
PostScript)

M. Ho, and
H. Yen, A Dictionarybased Compressed Pattern
Matching Algorithm, in the Proceedings of the IEEE COMPSAC 2002,
Oxford, England, August 2629, 2002. (
pdf)

M. Chuang, and
H. Yen, On Nearly Symmetric Drawings of
Graphs, in the Proceedings of the 6th International Conference on
Information Visualisation, pp. 489494, London, England, July
1012, 2002. (
Postscript)

C. Liao, H. Lu, and
H. Yen, FloorPlanning via Orderly
Spanning Tree, in the Proceedings of the 9th International Symposium
on Graph Drawing 2001, (LNCS 2265) pp. 367377, Vienna, Austria,
Sept. 2326, 2001. (
Postscript)

F. Wang and
H. Yen, Parametric Optimization of Open
RealTime Systems, in the Proceedings of the 8th International
Static Analysis Symposium (SAS 2001), (LNCS 2126) pp. 299318, La
Sorbonne, Paris, 1618 July 2001. (
Postscript)

H. Yen, Analysis of SelfStabilization for InfiniteState
Systems, in the Proceedings of the 7th IEEE International Conference
on Engineering of Complex Computer Systems (ICECCS 2001), pp.
240248, Skoevde, Sweden, June 1113, 2001. (
Postscript)

H. Chen, H. Lu and
H. Yen, On Maximum Symmetric Subgraphs,
in the Proceedings of the 8th International Symposium on Graph
Drawing (GD 2000), (LNCS 1984), pp. 372383, Colonial
Williamsburg, Virginia, USA, September 2023, 2000. (
Postscript)

H. Yen, Fair Control of OmegaAutomata, in the Proceedings of the 5th International Workshop on Discrete Event Systems (WODES
2000) (published in a book `Discrete Event Systems: Analysis
and Control' by Kluwer Academic Publishers), pp. 355362, Ghent,
Belgium, August 2123, 2000. (
Postscript)

Y. Lin and
H. Yen, An OmegaAutomata Approach to the
Compression of BiLevel Images, in the Proceedings of CATS 2000
Computing: the Australasian Theory Symposium, Canberra, Australia,
February 12, 2000.
Electronic Notes in Theoretical Computer Science,
Vol. 31, 2000.

H. Chen, and
H. Yen, Orthogonal and StraightLine Drawings
of Graphs with Succinct Representations, in the Proceedings of the
7th International Symposium on Graph Drawing (GD 1999) (LNCS
1731), pp. 416417, Stirin Castle, Czech, September 1999. (
Postscript)

T. Yeh, C. Kuo, C. Lei, and
H. Yen, Competitive Source
Routing on Tori and Meshes, in the Proceedings of the 8th Annual
International Symposium on Algorithms and Computation (ISAAC 1997)
(LNCS 1350), pp. 8291, Singapore, December 1997. (
Postscript)

T. Yeh, C. Kuo, C. Lei, and
H. Yen, Competitive Analysis
of OnLine Disk Scheduling, in the Proceedings of the 7th Annual
International Symposium on Algorithms and Computation (ISAAC 1996)
(LNCS 1178), pp. 356365, Osaka, Japan, December 1996. (
Postscript)

H. Yen, S. Jian, and T. Lao, Deciding Bisimulation and
Trace Equivalences for Systems with Many Identical Processes, in the
Proceedings of the 6th Annual International Symposium on Algorithms and
Computation (ISAAC 1995) (LNCS 1004), pp. 301310, Cairns,
Australia, December 1995. (
Postscript)

J. Chang, S. Chang, Z, Tsai, J. Wu, and
H. Yen, Design,
Implementation and Application of a BISDN Simulation Testbed, in the
Proceedings of the 28th Annual Simulation Symposium, pp.
212219, Phoenix, U.S.A., April 1995.

H. Yen, B. Wang, and M. Yang, Some Complexity Results for
Rings of Petri Nets, in the Proceedings of the 7th International
Conference on Parallel and Distributed Computing Systems, pp.
354357, Las Vegas, U.S.A., Oct. 1994

H. Yen, On the Regularity of Petri Net Languages, in the
Proceedings of the 1994 IEEE International Phoenix Conference on
Computers and Communications, pp. 329335, Phoenix, AZ, U.S.A.,
April 1994.

H. Yen, B. Wang, and M. Yang, A Unified Approach for
Reasoning about ConflictFree Petri Nets, in the Proceedings of the
14th International Conference on Application and Theory of Petri Nets
(Petri Nets 1993) (LNCS 691), pp. 513531, Chicago, U.S.A., June,
1993.

H. Yen and N. Pak, Complexity Analysis of Propositional
Concurrent Programs Using Domino Tiling, in the Proceedings of the 26th
Hawaii International Conference on System Sciences, pp. 253262,
Hawaii, U.S.A., January, 1993.

H. Yen, Applications of ConflictFree Petri Nets to
Parallel Programs and Asynchronous Circuits, in the Proceedings of
the 1992 IEEE International Phoenix Conference on Computers and
Communications, pp. 766773, Scottsdale, AZ, U.S.A., April 1992.

N. Pak and
H. Yen, Some Complexity Results for Problems
Concerning Ada Programs, in the Proceedings of the 24th Annual
Conference on Information Sciences and Systems, Princeton, NJ,
March 1990.

N. Pak and
H. Yen, Priority Systems with Many Identical
Processes, in the Proceedings of the 24th Annual Conference on
Information Sciences and Systems, Princeton, NJ, March 1990.

H. Yen, A Logic for Petri Nets and Its Applications, in
the Proceedings of the TwentySeventh Annual Allerton Conference on
Communication, Control, and Computing, pp. 714723, Monticello,
Illinois, September 1989.

R. Howell, L. Rosier and
H. Yen, Normal and Sinkless Petri
Nets, in the Proceedings of the 7th International Conference on the
Fundamentals of Computing Theory (FCT 1989) (LNCS 380), pp.
234243, Szeged, Hungary, August 1989.

H. Yen, Communicating Processes, Scheduling and the
Complexity of Termination Problems, in the Proceedings of 1988
International Computer Symposium, pp. 4651, Taiwan, Republic of
China, December 1988.

R. Howell, L. Rosier and
H. Yen, A Taxonomy of Fairness
and Temporal Logic Problems for Petri Nets, in the Proceedings of
the 13th Symposium on Mathematical Foundations of Computer Science (MFCS
1988) (LNCS 324), pp. 351359, CarlsbadKarlovy Vary,
Czechoslovakia, August 1988.

A. Sharma and
H. Yen, Boundedness, Hierarchy of Fairness
and Communication Networks with Delay, in the Proceedings of the
22nd Annual Conference on Information Sciences and Systems, pp.
445449, Princeton, NJ, March 1988.

E. Gannett, S. Kothari and
H. Yen, On Optimal
Parallelization of Sorting Networks, in the Proceedings of the 7th
Conference on Foundations of Software Technology and Theoretical Computer
Science (FST&TCS 1987) (LNCS 287), pp. 195206, Pune, India,
December 1987.

L. Rosier and
H. Yen, On Exact, Critical and Unique
Versions of Some Graph Problems, in the Proceedings of the
Twentyfifth Annual Allerton Conference on Communication, Control, and
Computing, pp. 12141223, Monticello, Illinois, September 1987.

R. Howell, D. Huynh, L. Rosier and
H. Yen, Some Complexity
Bounds for Problems Concerning Finite and 2Dimensional Vector Addition
Systems with States, in the Proceedings of the Fourth Annual
Symposium on Theoretical Aspects of Computer Science (STACS 1987)
(LNCS 247), pp. 360370, Passau, Federal Republic of Germany, February
1987.

R. Howell, L. Rosier and
H. Yen, On Global vs. Local State
Fairness, in the Proceedings of the TwentyFourth Annual Allerton
Conference on Communication, Control, and Computing, pp. 721729,
Monticello, Illinois, October 1986.

L. Rosier and
H. Yen, On the Complexity of Deciding Fair
Termination of Probabilistic Concurrent FiniteState Programs, in the
Proceedings of 13th International Colloquium on Automata, Languages and
Programming (ICALP 1986) (LNCS 226), pp. 334343, Rennes, France,
July 1986.

L. Rosier and
H. Yen, Logspace Hierarchies, Polynomial
Time and the Complexity of Fairness Problems Concerning OmegaMachines, in
the Proceedings of the Third Annual Symposium on Theoretical Aspects
of Computer Science (STACS 1986) (LNCS 210), pp. 306320, Orsay,
France, January 1986.

M. Gouda, L. Rosier and
H. Yen, A Theory of Closed Covers
 To Decide Progress of Communicating Finite State Machines, in the Proceedings of the TwentyThird Annual Allerton Conference on
Communication, Control, and Computing, pp. 914922, Monticello,
Illinois, October 1985.

L. Rosier and
H. Yen, A Multiparameter Analysis of the
Boundedness Problem for Vector Addition Systems, in the Proceedings
of the Fifth International Conference on the Fundamentals of Computation
Theory (FCT 1985) (LNCS 199), pp. 361370, Cottbus, German
Democratic Republic, September 1985.

L. Rosier and
H. Yen, Boundedness, Empty Channel Detection
and Synchronization for Communicating Finite State Machines, in the Proceedings of the Second Annual Symposium on Theoretical Aspects of
Computer Science (STACS 1985) (LNCS 182), pp. 287298, Saarbrucken,
WestGermany, January 1985.

W. Tsai, B. Jeng, C. Chou, G. Char, P. Liu, C. Wang, and
H. Yen,
CTIPS  A Multimicroprocessor system for Image Processing: Hardware
Architecture, System Software, and Applications, in the Proceedings
of 1983 International Symposium on VLSI Technology, Systems, and
Applications, pp. 235239, Taiwan, Republic of China, March 1983.

W. Tsai, C. Wang and
H. Yen, Moving Target Detection and
Tracking on a Multimicroprocessor System for Image Processing, in the
Proceedings of 1982 International Computer Symposium, pp.
292298, Taiwan, Republic of China, December 1982.
