Search & Read at all times.
Your portable library is online!,Hello!
Search Symbol (Half-width) Description of Search Symbols
Space "AND" indicates the intertwining of key terms used in a search
Double Quotation Marks ("") ( " " ) Double quotation marks indicate the beginning and end of a phrase, and the search will only include terms that appear in the same order of those within the quotations. Example: "image process" : " image process "
? Indicates a variable letter. Entering two ? will indicate two variable letters, and so on. Example: "Appl?", search results will yield apple, apply… e , appl y … ( (often used to English word searches) )
* Indicates an unlimited number of variable letters to follow, from 1~n. Example: Enter "appl*", search results will yield apple, apples, apply, applied, application…(often used in English word searches) e , appl es , appl y , appl ied , appl ication … ( (often used to English word searches) )

Boolean logic combinations of key words is a skill used to expand or refine search parameters.
(1) AND (1) AND: Refines search parameters
(2) OR (2) OR: Expands search parameters (3) NOT: Excludes irrelevant parameters


DOI stands for Digital Object Identifier ( D igital O bject I dentifier ) ,
and is the unique identifier for objects on the internet. It can be used to create persistent link and to cite articles.

Using DOI as a persistent link

To create a persistent link, add「」 「 」 before a DOI.
For instance, if the DOI of an article is 10.5297/ser.1201.002 , you can link persistently to the article by entering the following link in your browser: 10.5297/ser.1201.002
The DOI link will always direct you to the most updated article page no matter how the publisher changes the document's position, avoiding errors when engaging in important research.

Cite a document with DOI

When citing references, you should also cite the DOI if the article has one. If your citation guideline does not include DOIs, you may cite the DOI link.

DOIs allow accurate citations, improve academic contents connections, and allow users to gain better experience across different platforms. Currently, there are more than 70 million DOIs registered for academic contents. If you want to understand more about DOI, please visit airiti DOI ) 。

Previous Page
Next Page
There is no full-text available at the moment. Airiti would like to request author's authorization. I would like to provide authorization.
Abstract 〈TOP〉
Parallel Abstract 〈TOP〉
Reference ( 13 ) 〈TOP〉
  1. 1. Chu, C. & Wong, Y. C. (2005). ” Fast and Accurate Rectilinear Steiner Minimal Tree Algorithm for VLSI Design”, Proc. International Symposium on Physical Design, pp. 28-35.
  2. 3. Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L. & Clifford Stein (2001). “The algorithms of Kruskal and Prim”, INTRODUCTION TO ALGORITHMS Second Edition, pp. 567-573.
  3. algorithm for obstacle-avoiding routing tree construction in the λ-geometry plane”, in Proc. of ACM International Symposium on Physical Design, pp. 48-55.
  4. 5. Garey, M. & Johnson, D. (1977). “The rectilinear Steiner tree problem is NP-complete”, SIAM J. Appl. Math., pp. 826–834.
  5. 6. Huang, H. H., Huang, H. Y., Huang, D. J., & Hsieh, T. M. (2006). “Efficient Obstacle-Avoiding Rectilinear Steiner Tree Construction Algorithms”, WSEAS Transactions on Circuits and Systems, Vol. 5, pp. 1775-1782.
Altmetrics 〈TOP〉
E-mail :
When an article is available to download, a notice will be sent to your mailbox address.
E-mail :