default search action
Yung H. Tsin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j24]Francis Y. L. Chin, Hing-Fung Ting, Yung H. Tsin
, Yong Zhang
A linear-time certifying algorithm for recognizing generalized series-parallel graphs. Discret. Appl. Math. 325: 152-171 (2023) - [j23]Yung H. Tsin:
A simple certifying algorithm for 3-edge-connectivity. Theor. Comput. Sci. 951: 113760 (2023) - [i3]Yung H. Tsin:
On finding 2-cuts and 3-edge-connected components in parallel. CoRR abs/2306.14103 (2023) - [i2]Yung H. Tsin:
A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs. CoRR abs/2309.13827 (2023) - 2020
- [i1]Yung H. Tsin:
A simple certifying algorithm for 3-edge-connectivity. CoRR abs/2002.04727 (2020)
2010 – 2019
- 2016
- [c9]Roohollah Etemadi, Jianguo Lu, Yung H. Tsin:
Efficient Estimation of Triangles in Very Large Graphs. CIKM 2016: 1251-1260 - 2014
- [j22]Amr Elmasry, Yung H. Tsin:
On Finding Sparse Three-Edge-Connected and Three-Vertex-Connected Spanning subgraphs. Int. J. Found. Comput. Sci. 25(3): 355-368 (2014) - [j21]Nima Norouzi, Yung H. Tsin:
A simple 3-edge connected component algorithm revisited. Inf. Process. Lett. 114(1-2): 50-55 (2014) - [j20]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han, Chung Keung Poon
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing. Theor. Comput. Sci. 554: 135-149 (2014) - 2013
- [c8]Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han, Chung Keung Poon
Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing and Square Packing. COCOON 2013: 506-517 - 2012
- [c7]Yung H. Tsin:
Decomposing a Multigraph into Split Components. CATS 2012: 3-12 - 2011
- [j19]Abusayeed M. Saifullah, Yung H. Tsin:
Self-Stabilizing Computation of 3-Edge-Connected Components. Int. J. Found. Comput. Sci. 22(5): 1161-1185 (2011) - [j18]Abusayeed M. Saifullah, Yung H. Tsin:
A self-stabilising algorithm for 3-edge-connectivity. Int. J. High Perform. Comput. Netw. 7(1): 40-52 (2011) - [j17]Yong Zhang, Zhuo Chang, Francis Y. L. Chin, Hing-Fung Ting, Yung H. Tsin:
Uniformly inserting points on square grid. Inf. Process. Lett. 111(16): 773-779 (2011) - [c6]Yung H. Tsin:
Recognizing and Embedding Outerplanar Distributed Computer Networks. CyberC 2011: 212-219 - 2010
- [c5]Yong Zhang, Zhuo Chang, Francis Y. L. Chin, Hing-Fung Ting, Yung H. Tsin:
Online Uniformly Inserting Points on Grid. AAIM 2010: 281-292 - [c4]Yong Zhang, Jing-Chi Chen, Francis Y. L. Chin, Xin Han, Hing-Fung Ting, Yung H. Tsin:
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing. ISAAC (2) 2010: 242-253
2000 – 2009
- 2009
- [j16]Yung H. Tsin:
Yet another optimal algorithm for 3-edge-connectivity. J. Discrete Algorithms 7(1): 130-146 (2009) - 2007
- [j15]Yung H. Tsin:
An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity. Inf. Process. Lett. 102(1): 27-34 (2007) - [j14]Yung H. Tsin:
A Simple 3-Edge-Connected Component Algorithm. Theory Comput. Syst. 40(2): 125-142 (2007) - [c3]Abusayeed M. Saifullah, Yung H. Tsin:
A Self-stabilizing Algorithm For 3-Edge-Connectivity. ISPA 2007: 6-19 - 2006
- [j13]Yung H. Tsin:
An Efficient Distributed Algorithm for 3-edge-connectivity. Int. J. Found. Comput. Sci. 17(3): 677-702 (2006) - 2004
- [j12]Yung H. Tsin:
On finding an ear decomposition of an undirected graph distributively. Inf. Process. Lett. 91(3): 147-153 (2004) - [c2]Yung H. Tsin:
An Efficient Distributed Algorithm for Ear Decomposition. MSV/AMCS 2004: 413-418 - 2002
- [j11]Yung H. Tsin:
Some remarks on distributed depth-first search. Inf. Process. Lett. 82(4): 173-178 (2002)
1990 – 1999
- 1998
- [j10]Cao An Wang, Yung H. Tsin:
Finding constrained and weighted Voronoi diagrams in the plane. Comput. Geom. 10(2): 89-104 (1998) - 1996
- [j9]Yung H. Tsin, Cao An Wang:
Geodesic Voronoi Diagrams in the Presence of Rectilinear Barriers. Nord. J. Comput. 3(1): 1-26 (1996) - 1993
- [j8]Yung H. Tsin:
Incremental Distributed Asynchronous Algorithm for Minimum Spanning Trees. Comput. Networks ISDN Syst. 26(2): 227-232 (1993)
1980 – 1989
- 1988
- [j7]Yung H. Tsin:
On Handling Vertex Deletion in Updating Spanning Trees. Inf. Process. Lett. 27(4): 167-168 (1988) - 1987
- [j6]Cao An Wang, Yung H. Tsin:
An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane. Inf. Process. Lett. 25(1): 55-60 (1987) - 1986
- [j5]Yung H. Tsin:
Finding Lowest Common Ancestors in Parallel. IEEE Trans. Computers 35(8): 764-769 (1986) - 1985
- [j4]Yung H. Tsin:
An Optimal Parallel Processor Bound in Strong Orientation of an Undirected Graph. Inf. Process. Lett. 20(3): 143-146 (1985) - 1984
- [j3]Yung H. Tsin, Francis Y. L. Chin:
Efficient Parallel Algorithms for a Class of Graph Theoretic Problems. SIAM J. Comput. 13(3): 580-599 (1984) - 1983
- [j2]Yung H. Tsin, Francis Y. L. Chin:
A General Program Scheme for Finding Bridges. Inf. Process. Lett. 17(5): 269-272 (1983) - [c1]Yung H. Tsin:
Bridge-Connectivity and Biconnectivity Algorithms for Parallel Computer Models. ICPP 1983: 180-182 - 1982
- [j1]Yung H. Tsin:
Extending the Power of Pascal's External Procedure Mechanism. Softw. Pract. Exp. 12(3): 283-292 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: