default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOn-Hei Solomon Lo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j13]On-Hei Solomon Lo, Carol T. Zamfirescu:
Counting cycles in planar triangulations. J. Comb. Theory B 170: 335-351 (2025)- 2024
- [j12]On-Hei Solomon Lo
, Jens M. Schmidt:
Generalized cut trees for edge-connectivity. J. Comb. Theory B 165: 47-67 (2024) - 2023
- [j11]On-Hei Solomon Lo, Carol T. Zamfirescu:
Tight cycle spectrum gaps of cubic 3-connected toroidal graphs. Discret. Math. 346(1): 113170 (2023) - [j10]On-Hei Solomon Lo:
Distribution of subtree sums. Eur. J. Comb. 108: 103615 (2023) - 2022
- [j9]On-Hei Solomon Lo:
On the Hamiltonian Property Hierarchy of 3-Connected Planar Graphs. Electron. J. Comb. 29(4) (2022) - [j8]On-Hei Solomon Lo, Jianguo Qian:
Hamiltonian Cycles in 4-Connected Planar and Projective Planar Triangulations with Few 4-Separators. SIAM J. Discret. Math. 36(2): 1496-1501 (2022) - [i4]Jan Goedgebeur, Jorik Jooken, On-Hei Solomon Lo, Ben Seamone, Carol T. Zamfirescu:
Few hamiltonian cycles in graphs with one or two vertex degrees. CoRR abs/2211.08105 (2022) - 2021
- [j7]On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup:
Compact cactus representations of all non-trivial min-cuts. Discret. Appl. Math. 303: 296-304 (2021) - [j6]On-Hei Solomon Lo, Jens M. Schmidt:
Cycle Spectra of Contraction-Critically 4-Connected Planar Graphs. Graphs Comb. 37(6): 2129-2137 (2021) - [j5]On-Hei Solomon Lo:
Find subtrees of specified weight and cycles of specified length in linear time. J. Graph Theory 98(3): 531-552 (2021) - [j4]Qing Cui, On-Hei Solomon Lo:
Tight Gaps in the Cycle Spectrum of 3-Connected Planar Graphs. SIAM J. Discret. Math. 35(3): 2039-2048 (2021) - 2020
- [j3]On-Hei Solomon Lo, Jens M. Schmidt, Nico Van Cleemput, Carol T. Zamfirescu:
Shortness Coefficient of Cyclically 4-Edge-Connected Cubic Graphs. Electron. J. Comb. 27(1): 1 (2020) - [j2]On-Hei Solomon Lo:
Hamiltonian cycles in 4-connected plane triangulations with few 4-separators. Discret. Math. 343(12): 112126 (2020)
2010 – 2019
- 2019
- [i3]On-Hei Solomon Lo:
Find Subtrees of Specified Weight and Cycles of Specified Length in Linear Time. CoRR abs/1902.06484 (2019) - 2018
- [j1]On-Hei Solomon Lo, Jens M. Schmidt:
Longest cycles in cyclically 4-edge-connected cubic planar graphs. Australas. J Comb. 72: 155-162 (2018) - [c1]On-Hei Solomon Lo, Jens M. Schmidt:
A Cut Tree Representation for Pendant Pairs. ISAAC 2018: 38:1-38:9 - [i2]On-Hei Solomon Lo, Jens M. Schmidt, Mikkel Thorup:
Contraction-Based Sparsification in Near-Linear Time. CoRR abs/1810.03865 (2018) - 2017
- [i1]On-Hei Solomon Lo, Jens M. Schmidt:
Cut Tree Structures with Applications on Contraction-Based Sparsification. CoRR abs/1707.00572 (2017)
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-11-19 21:45 CET 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:
