default search action
Ruying Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Mohamad Awada
, Burcin Becerik-Gerber
A New Perspective on Stress Detection: An Automated Approach for Detecting Eustress and Distress. IEEE Trans. Affect. Comput. 15(3): 1153-1165 (2024) - [i2]Tuo Zhang, Tiantian Feng, Yibin Ni, Mengqin Cao, Ruying Liu, Katharine Butler, Yanjun Weng, Mi Zhang, Shrikanth S. Narayanan, Salman Avestimehr:
Creating a Lens of Chinese Culture: A Multimodal Dataset for Chinese Pun Rebus Art Understanding. CoRR abs/2406.10318 (2024) - [i1]Ruying Liu, Wanjing Wu, Burcin Becerik-Gerber, Gale M. Lucas:
Enhancing Building Safety Design for Active Shooter Incidents: Exploration of Building Exit Parameters using Reinforcement Learning-Based Simulations. CoRR abs/2407.10441 (2024) - 2023
- [j14]Ruying Liu, Runhe Zhu, Burcin Becerik-Gerber
Be prepared: How training and emergency type affect evacuation behaviour. J. Comput. Assist. Learn. 39(5): 1493-1509 (2023) - 2022
- [c1]Ruying Liu, Burcin Becerik-Gerber:
Human and Building Digital Twins for Virtual Reality Based Building Emergency Training. DTPI 2022: 1-2
2010 – 2019
- 2013
- [j13]Jianfeng Wang, Qiongxiang Huang, Kok Lay Teo, Francesco Belardo, Ruying Liu, Chengfu Ye:
Almost every complement of a tadpole graph is not chromatically unique. Ars Comb. 108: 33-49 (2013)
2000 – 2009
- 2009
- [j12]Jianfeng Wang, Kee L. Teo, Qiongxiang Huang, Chengfu Ye, Ruying Liu:
A new expression for the adjoint polynomial of a path. Australas. J Comb. 43: 103-114 (2009) - [j11]Jianfeng Wang
The cospectral equivalence classes of graphs having an isolated vertex. Comput. Math. Appl. 57(10): 1638-1644 (2009) - [j10]Haixing Zhao, Ruying Liu:
On the minimum real roots of the adjoint polynomial of a graph. Discret. Math. 309(13): 4635-4641 (2009) - 2008
- [j9]Jianfeng Wang
A complete solution to the chromatic equivalence class of graph I. Discret. Math. 308(16): 3607-3623 (2008) - [j8]Qiongxiang Huang, Ruying Liu, Jianfeng Wang, Chengfu Ye:
The chromatic equivalence class of graph ‾{Bn-6, 12}. Discuss. Math. Graph Theory 28(2): 189-218 (2008) - 2007
- [j7]Haixing Zhao, Xueliang Li, Ruying Liu:
Chromaticity of the Complements of Some Sparse Graphs. Australas. J Comb. 37: 11-20 (2007) - 2005
- [j6]Haixing Zhao, Xueliang Li, Ruying Liu:
On problems and conjectures on adjointly equivalent graphs. Discret. Math. 295(1-3): 203-212 (2005) - 2004
- [j5]Haixing Zhao, Ruying Liu, Xueliang Li, Ligong Wang:
On properties of adjoint polynomials of graphs and their applications. Australas. J Comb. 30: 291-306 (2004) - [j4]Haixing Zhao, Xueliang Li, Shenggui Zhang, Ruying Liu:
On the minimum real roots of the -polynomials and chromatic uniqueness of graphs. Discret. Math. 281(1-3): 277-294 (2004) - [j3]Ruying Liu, Haixing Zhao, Chengfu Ye:
A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs. Discret. Math. 289(1-3): 175-179 (2004) - [j2]Haixing Zhao, Xueliang Li, Ruying Liu, Chengfu Ye:
The Chromaticity of Certain Complete Multipartite Graphs. Graphs Comb. 20(3): 423-434 (2004)
1990 – 1999
- 1999
- [j1]Ligong Wang, Xueliang Li, Ruying Liu:
Integral Trees With Diameter 6 or 8. Electron. Notes Discret. Math. 3: 208-213 (1999)
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-10-04 19:59 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: