Rao Li - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2023

Tree trunk detection in urban scenes using a multiscale attention-based deep learning methodRao Li, Guodong Sun, Sheng Wang, TianZhuzi Tan, Fu Xu. ecoi, 77:102215, November 2023. [doi]

Nonmonotone Submodular Maximization Under Routing ConstraintsHaotian Zhang, Rao Li, Zewei Wu, Guodong Sun. nctcs 2024: 3-17 [doi]

2022

Improved sufficient conditions for k-leaf-connected graphsGuoyan Ao, Ruifang Liu, Jinjiang Yuan, Rao Li. DAM, 314:17-30, 2022. [doi]

Cover Image, Volume 39, Number 7, October 2022Rao Li, Cheng Zhou, Quanli Dou, Bin Hu. jfr, 39(7), 2022. [doi]

Complete coverage path planning and performance factor analysis for autonomous bulldozerRao Li, Cheng Zhou, Quanli Dou, Bin Hu. jfr, 39(7):1014-1034, 2022. [doi]

k-connected graphsRuifang Liu, Hong-Jian Lai, Rao Li. DM, 345(4):112774, 2022. [doi]

A fusion of a deep neural network and a hidden Markov model to recognize the multiclass abnormal behavior of elderly peopleLingling Wang, Ying Zhou, Rao Li, Lieyun Ding. kbs, 252:109351, 2022. [doi]

2020

The matching number and Hamiltonicity of graphsRao Li. akcej, 17(3):1094-1095, 2020. [doi]

2016

1-Graphs with Bounded Dilworth NumbersRao Li. arscom, 127:57-64, 2016.

2015

Harary index and some Hamiltonian properties of graphsRao Li. akcej, 12(1):64-69, 2015. [doi]

On α - Incidence Energy and α - Distance Energy of a GraphRao Li. arscom, 121:373-384, 2015.

Spectral Invariants and Some Stable Properties of a GraphGuidong Yu, Rao Li, Baohua Xing. arscom, 121:33-46, 2015.

2014

1-GraphsRao Li. arscom, 115:305-314, 2014.

2012

An Inequality on Laplacian Eigenvalues of Connected GraphsRao Li. arscom, 105:361-368, 2012.

2011

Hamilton-Connectivity of Claw-Free Graphs with Bounded Dilworth NumbersRao Li. arscom, 98:289-294, 2011.

2009

Finding Hamiltonian cycles in {quasi-claw, K::1, 5::, K::1, 5::+e}-free graphs with bounded Dilworth numbersRao Li. DM, 309(8):2555-2558, 2009. [doi]

Finding Hamiltonian Cycles in Four Subfamilies of Quasi-Claw-Free GraphsRao Li. arscom, 93, 2009.

2008

A space efficient algorithm for the constrained heaviest common subsequence problemRao Li. ACMse 2008: 226-230 [doi]

2006

A new sufficient condition for Hamiltonicity of graphsRao Li. ipl, 98(4):159-161, 2006. [doi]

2004

Hamiltonicity of 2-connected quasi-claw-free graphsRao Li. DM, 283(1-3):145-150, 2004. [doi]

Hamiltonicity of 2-connected ::::K::::::1, 4::, ::::K::::::1, 4+::::e::::::-free graphsRao Li. DM, 287(1-3):69-76, 2004. [doi]

2003

Every 3-connected distance claw-free graph is Hamilton-connectedRao Li, Richard H. Schelp. DM, 268(1-3):185-197, 2003. [doi]

Hamiltonicity of 3-connected quasi-claw-free graphsRao Li. DM, 265(1-3):393-399, 2003. [doi]

2002

Hamiltonicity of {K::1, 4::, K::1, 4::+::::e::::}-free graphsRao Li, Richard H. Schelp. DM, 245(1-3):195-202, 2002. [doi]

2001

Relative length of longest paths and cycles in 3-connected graphsRao Li, Akira Saito, Richard H. Schelp. jgt, 37(3):137-156, 2001. [doi]

2000

Some hamiltonian properties of ::::L::::::1::-graphsRao Li, Richard H. Schelp. DM, 223(1-3):207-216, 2000. [doi]

A Fan-type condition for claw-free graphs to be HamiltonianRao Li. DM, 219(1-3):195-205, 2000. [doi]

1999

A Note on Hamiltonian Cycles in K(1, r)-Free GraphsRao Li. arscom, 51, 1999.

Sign in or sign up to see more results.

runs on WebDSL