default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDY. Daniel Liang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c11]E. Miles Gertis, Y. Daniel Liang:
Design and Implementation of an Automatic Word Match Generator. FTC (3) 2022: 752-765
2000 – 2009
- 2005
- [c10]Hong Zhang, Y. Daniel Liang:
Undergraduate computer graphics using Java 3D. ACM Southeast Regional Conference (1) 2005: 12-13 - 2002
- [p1]Raymond Greenlaw, Y. Daniel Liang:
Object-Oriented Programming. Encyclopedia of Information Systems 2002: 347-361
1990 – 1999
- 1997
- [j14]Y. Daniel Liang, Maw-Shang Chang:
Minimum Feedback Vertex Sets in Cocomparability Graphs and Convex Bipartite Graphs. Acta Informatica 34(5): 337-346 (1997) - [j13]Y. Daniel Liang:
Parallel Algorithms for the Domination Problems in Trapezoid Graphs. Discret. Appl. Math. 74(3): 241-249 (1997) - [c9]Y. Daniel Liang, Chin Lung Lu, Chuan Yi Tang:
Effincient Domination of Permutation Graphs and Trapezoid Graphs. COCOON 1997: 232-241 - 1996
- [j12]Chongkye Rhee, Y. Daniel Liang:
An NC Algorithm for the Clique Cover Problem in Cocomparability Graphs and its Application. Inf. Process. Lett. 57(5): 287-290 (1996) - [j11]Y. Daniel Liang, Chongkye Rhee:
Finding Biconnected Components in O(n) Time for a Class of Graphs. Inf. Process. Lett. 60(3): 159-163 (1996) - [j10]Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan:
An O(N+M)-Time Algorithm for Finding a Minimum-Weight Dominating Set in a Permutation Graph. SIAM J. Comput. 25(2): 404-419 (1996) - 1995
- [j9]Chongkye Rhee, Y. Daniel Liang:
Finding a Maximum Matching in a Permutation Graph. Acta Informatica 32(8): 779-792 (1995) - [j8]Y. Daniel Liang:
Steiner Set and Connected Domination in Trapezoid Graphs. Inf. Process. Lett. 56(2): 101-108 (1995) - [j7]Y. Daniel Liang, Norbert Blum:
Circular Convex Bipartite Graphs: Maximum Matching and Hamiltonian Circuits. Inf. Process. Lett. 56(4): 215-219 (1995) - [c8]Y. Daniel Liang, Chongkye Rhee:
An Optimal Algorithm for Finding Biconnected Components in Permutation Graphs. ACM Conference on Computer Science 1995: 104-108 - [c7]Y. Daniel Liang:
Teaching dynamic programming techniques using permutation graphs. SIGCSE 1995: 56-60 - 1994
- [j6]Chong Jye Rhee, Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan:
Efficient Algorithms for Finding Depth-First and Breadth-First Search Trees in Permutation Graphs. Inf. Process. Lett. 49(1): 45-50 (1994) - [j5]Y. Daniel Liang:
On the Feedback Vertex Set Problem in Permutation Graphs. Inf. Process. Lett. 52(3): 123-129 (1994) - [j4]Y. Daniel Liang:
Dominations in Trapezoid Graphs. Inf. Process. Lett. 52(6): 309-315 (1994) - [j3]Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan:
A New Class of Parallel Algorithms for Finding Connected Components on Machines with Bit-Vector Operations. Inf. Sci. 76(3-4): 177-195 (1994) - [c6]Y. Daniel Liang, Chongkye Rhee:
Linear Algorithms for Two Independent Set Problems in Permutation Graphs. ACM Conference on Computer Science 1994: 90-93 - [c5]Y. Daniel Liang, Raymond Greenlaw, Glenn K. Manacher:
NC² Algorithms Regarding Hamiltonian Path and Circuits in Interval Graphs (Extended Abstract). Canada-France Conference on Parallel and Distributed Computing 1994: 45-57 - 1993
- [j2]Y. Daniel Liang, Chongkye Rhee:
Finding a Maximum Matching in a Circular-Arc Graph. Inf. Process. Lett. 45(4): 185-190 (1993) - [c4]Y. Daniel Liang, Glenn K. Manacher:
An O(nlogn) Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs. ACM Conference on Computer Science 1993: 390-397 - 1992
- [c3]Y. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan:
NC algorithms for dominations in permutation graphs. SAC 1992: 734-739 - 1991
- [j1]Y. Daniel Liang, Chong Jye Rhee, Sudarshan K. Dhall, S. Lakshmivarahan:
A New Approach for the Domination Problem on Permutation Graphs. Inf. Process. Lett. 37(4): 219-224 (1991) - [c2]Y. Daniel Liang, Sudarshan K. Dhall, Sivaramakrishnan Lakshmivarahan:
Efficient parallel algorithms for finding biconnected components of some intersection graphs. ACM Conference on Computer Science 1991: 48-52 - 1990
- [c1]Y. Daniel Liang, Sudarshan K. Dhall, S. Lakshmivarahan:
Parallel algorithms for ranking of trees. SPDP 1990: 26-31
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:56 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:
