Yung H. Tsin

Orcid: 0000-0001-5987-4659

According to our database1, Yung H. Tsin authored at least 34 papers between 1982 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A simple certifying algorithm for 3-edge-connectivity.
Theor. Comput. Sci., March, 2023

A linear-time certifying algorithm for recognizing generalized series-parallel graphs.
Discret. Appl. Math., 2023

A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs.
CoRR, 2023

On finding 2-cuts and 3-edge-connected components in parallel.
CoRR, 2023

2016
Efficient Estimation of Triangles in Very Large Graphs.
Proceedings of the 25th ACM International Conference on Information and Knowledge Management, 2016

2014
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing.
Theor. Comput. Sci., 2014

A simple 3-edge connected component algorithm revisited.
Inf. Process. Lett., 2014

On Finding Sparse Three-Edge-Connected and Three-Vertex-Connected Spanning subgraphs.
Int. J. Found. Comput. Sci., 2014

2012
Decomposing a Multigraph into Split Components.
Proceedings of the Eighteenth Computing: The Australasian Theory Symposium, 2012

2011
Uniformly inserting points on square grid.
Inf. Process. Lett., 2011

A self-stabilising algorithm for 3-edge-connectivity.
Int. J. High Perform. Comput. Netw., 2011

Self-Stabilizing Computation of 3-Edge-Connected Components.
Int. J. Found. Comput. Sci., 2011

Recognizing and Embedding Outerplanar Distributed Computer Networks.
Proceedings of the 2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, 2011

2010
Improved Online Algorithms for 1-Space Bounded 2-Dimensional Bin Packing.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

Online Uniformly Inserting Points on Grid.
Proceedings of the Algorithmic Aspects in Information and Management, 2010

2009
Yet another optimal algorithm for 3-edge-connectivity.
J. Discrete Algorithms, 2009

2007
A Simple 3-Edge-Connected Component Algorithm.
Theory Comput. Syst., 2007

An improved self-stabilizing algorithm for biconnectivity and bridge-connectivity.
Inf. Process. Lett., 2007

A Self-stabilizing Algorithm For 3-Edge-Connectivity.
Proceedings of the Parallel and Distributed Processing and Applications, 2007

2006
An Efficient Distributed Algorithm for 3-edge-connectivity.
Int. J. Found. Comput. Sci., 2006

2004
On finding an ear decomposition of an undirected graph distributively.
Inf. Process. Lett., 2004

An Efficient Distributed Algorithm for Ear Decomposition.
Proceedings of the International Conference on Modeling, 2004

2002
Some remarks on distributed depth-first search.
Inf. Process. Lett., 2002

1998
Finding constrained and weighted Voronoi diagrams in the plane.
Comput. Geom., 1998

1996
Geodesic Voronoi Diagrams in the Presence of Rectilinear Barriers.
Nord. J. Comput., 1996

1993
Incremental Distributed Asynchronous Algorithm for Minimum Spanning Trees.
Comput. Networks ISDN Syst., 1993

1988
On Handling Vertex Deletion in Updating Spanning Trees.
Inf. Process. Lett., 1988

1987
An O(log n) Time Parallel Algorithm for Triangulating a Set of Points in the Plane.
Inf. Process. Lett., 1987

1986
Finding Lowest Common Ancestors in Parallel.
IEEE Trans. Computers, 1986

1985
An Optimal Parallel Processor Bound in Strong Orientation of an Undirected Graph.
Inf. Process. Lett., 1985

1984
Efficient Parallel Algorithms for a Class of Graph Theoretic Problems.
SIAM J. Comput., 1984

1983
A General Program Scheme for Finding Bridges.
Inf. Process. Lett., 1983

Bridge-Connectivity and Biconnectivity Algorithms for Parallel Computer Models.
Proceedings of the International Conference on Parallel Processing, 1983

1982
Extending the Power of Pascal's External Procedure Mechanism.
Softw. Pract. Exp., 1982


  Loading...