default search action
Allan Lo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j47]Deepak Bal, Louis DeBiasio, Allan Lo:
A lower bound on the multicolor size-Ramsey numbers of paths in hypergraphs. Eur. J. Comb. 120: 103969 (2024) - [j46]Allan Lo, Viresh Patel, Mehmet Akif Yildiz
:
Hamilton cycles in dense regular digraphs and oriented graphs. J. Comb. Theory B 164: 119-160 (2024) - [j45]Allan Lo, Simón Piga
Cycle decompositions in k-uniform hypergraphs. J. Comb. Theory B 167: 55-103 (2024) - [j44]Andrea Freschi, Allan Lo
An oriented discrepancy version of Dirac's theorem. J. Comb. Theory B 169: 338-351 (2024) - 2023
- [j43]Allan Lo, Vincent Pfenninger:
Towards Lehel's Conjecture for 4-Uniform Tight Cycles. Electron. J. Comb. 30(1) (2023) - [j42]A. Nicholas Day, Allan Lo:
Upper density of monochromatic paths in edge-coloured infinite complete graphs and bipartite graphs. Eur. J. Comb. 110: 103625 (2023) - 2022
- [j41]Allan Lo, Andrew Treglown, Yi Zhao:
Complete subgraphs in a multipartite graph. Comb. Probab. Comput. 31(6): 1092-1101 (2022) - 2021
- [j40]Richard Lang
Monochromatic cycle partitions in random graphs. Comb. Probab. Comput. 30(1): 136-152 (2021) - [j39]Jie Han, Allan Lo, Nicolás Sanhueza-Matamala
Covering and tiling hypergraphs with tight cycles. Comb. Probab. Comput. 30(2): 288-329 (2021) - [j38]Louis DeBiasio
Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree. SIAM J. Discret. Math. 35(1): 250-266 (2021) - 2020
- [j37]Stefan Glock, Daniela Kühn, Allan Lo, Deryk Osthus:
On a Conjecture of Erdős on Locally Sparse Steiner Triple Systems. Comb. 40(3): 363-403 (2020) - [j36]Ben Barber, Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus:
Minimalist designs. Random Struct. Algorithms 57(1): 47-63 (2020)
2010 – 2019
- 2019
- [j35]Allan Lo, Nicolás Sanhueza-Matamala
An asymptotic bound for the strong chromatic number. Comb. Probab. Comput. 28(5): 768-776 (2019) - [j34]Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus:
On the decomposition threshold of a given graph. J. Comb. Theory B 139: 47-127 (2019) - [j33]Allan Lo
Long properly coloured cycles in edge-coloured graphs. J. Graph Theory 90(3): 416-442 (2019) - [j32]Louis DeBiasio
Spanning Trees with Few Branch Vertices. SIAM J. Discret. Math. 33(3): 1503-1520 (2019) - [c3]Allan Lo, Richard Mycroft, Guillem Perarnau, Andrew Treglown:
Preface. BCC 2019: vii-viii - [e1]Allan Lo, Richard Mycroft, Guillem Perarnau, Andrew Treglown:
Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29 - August 2, 2019. Cambridge University Press 2019, ISBN 978-1-108-74072-2 [contents] - 2018
- [j31]Victor Falgas-Ravry
Subgraphs with Large Minimum ℓ-Degree in Hypergraphs where Almost All ℓ-Degrees are Large. Electron. J. Comb. 25(2): 2 (2018) - [j30]Allan Lo, Viresh Patel:
Hamilton Cycles in Sparse Robustly Expanding Digraphs. Electron. J. Comb. 25(3): 3 (2018) - [j29]Allan Lo, Nicolás Sanhueza-Matamala
Density of Monochromatic Infinite Paths. Electron. J. Comb. 25(4): 4 (2018) - [j28]Allan Lo
Codegree Turán Density of Complete r-Uniform Hypergraphs. SIAM J. Discret. Math. 32(2): 1154-1158 (2018) - 2017
- [j27]Jie Han
Exact Minimum Codegree Threshold for K - 4-Factors. Comb. Probab. Comput. 26(6): 856-885 (2017) - [j26]Jie Han, Allan Lo
Covering and tiling hypergraphs with tight cycles. Electron. Notes Discret. Math. 61: 561-567 (2017) - [j25]Allan Lo
Decomposing tournaments into paths. Electron. Notes Discret. Math. 61: 813-818 (2017) - [j24]József Balogh, Allan Lo
Transitive triangle tilings in oriented graphs. J. Comb. Theory B 124: 64-87 (2017) - [j23]Ben Barber, Daniela Kühn, Allan Lo
Fractional clique decompositions of dense graphs and hypergraphs. J. Comb. Theory B 127: 148-186 (2017) - [j22]Ben Barber, Daniela Kühn, Allan Lo
Clique decompositions of multipartite graphs and completion of Latin squares. J. Comb. Theory A 151: 146-201 (2017) - [i1]Louis DeBiasio, Allan Lo:
Spanning trees with few branch vertices. CoRR abs/1709.04937 (2017) - 2016
- [j21]Allan Lo
Properly coloured Hamiltonian cycles in edge-coloured complete graphs. Comb. 36(4): 471-492 (2016) - [j20]Daniela Kühn, Allan Lo
Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs. J. Comb. Theory B 121: 85-145 (2016) - 2015
- [j19]Joanna Cyman, Tomasz Dzido, John Lapinskas, Allan Lo:
On-line Ramsey Numbers of Paths and Cycles. Electron. J. Comb. 22(1): 1 (2015) - [j18]Allan Lo
Existences of rainbow matchings and rainbow matching covers. Discret. Math. 338(11): 2119-2124 (2015) - [j17]Ben Barber, Daniela Kühn, Allan Lo
Edge-decompositions of graphs with high minimum degree. Electron. Notes Discret. Math. 49: 115-121 (2015) - [j16]Allan Lo
F-Factors in Hypergraphs Via Absorption. Graphs Comb. 31(3): 679-712 (2015) - 2014
- [j15]Allan Lo
A note on the minimum size of k-rainbow-connected graphs. Discret. Math. 331: 20-21 (2014) - [j14]Allan Lo
A Note on Large Rainbow Matchings in Edge-coloured Graphs. Graphs Comb. 30(2): 389-393 (2014) - [j13]Allan Lo
Perfect matchings in 3-partite 3-uniform hypergraphs. J. Comb. Theory A 127: 22-57 (2014) - [j12]Allan Lo
A Dirac Type Condition for Properly Coloured Paths and Cycles. J. Graph Theory 76(1): 60-87 (2014) - [j11]Allan Lo
An Edge-Colored Version of Dirac's Theorem. SIAM J. Discret. Math. 28(1): 18-36 (2014) - [j10]Allan Lo
ℓ-Degree Turán Density. SIAM J. Discret. Math. 28(3): 1214-1225 (2014) - 2013
- [j9]Jhih-Siang Lai
Lipid exposure prediction enhances the inference of rotational angles of transmembrane helices. BMC Bioinform. 14: 304 (2013) - [j8]Allan Lo
A Multipartite Version of the Hajnal-Szemerédi Theorem for Graphs and Hypergraphs. Comb. Probab. Comput. 22(1): 97-111 (2013) - [j7]Allan Lo
Minimum codegree threshold for -factors. J. Comb. Theory A 120(3): 708-721 (2013) - 2012
- [j6]Jennifer Diemunsch, Michael Ferrara, Allan Lo, Casey Moffatt, Florian Pfender, Paul S. Wenger:
Rainbow Matchings of Size δ(G) in Properly Edge-Colored Graphs. Electron. J. Comb. 19(2): 52 (2012) - [j5]Allan Lo
Cliques in Graphs With Bounded Minimum Degree. Comb. Probab. Comput. 21(3): 457-482 (2012) - 2011
- [j4]Allan Lo, Cheng-Wei Cheng
TMPad: an integrated structural database for helix-packing folds in transmembrane proteins. Nucleic Acids Res. 39(Database-Issue): 347-355 (2011)
2000 – 2009
- 2009
- [j3]Allan Lo, Yi-Yuan Chiu, Einar Andreas Rødland, Ping-Chiang Lyu, Ting-Yi Sung, Wen-Lian Hsu:
Predicting helix-helix interactions from residue contacts in membrane proteins. Bioinform. 25(8): 996-1003 (2009) - [j2]Allan Lo
Cliques in graphs with bounded minimum degree. Electron. Notes Discret. Math. 34: 163-166 (2009) - 2007
- [j1]Emily Chia-Yu Su, Hua-Sheng Chiu, Allan Lo, Jenn-Kang Hwang, Ting-Yi Sung, Wen-Lian Hsu:
Protein subcellular localization prediction based on compartment-specific features and structure conservation. BMC Bioinform. 8 (2007) - 2006
- [c2]Hua-Sheng Chiu, Hsin-Nan Lin
A Two-stage Classifier for Protein B-turn Prediction Using Support Vector Machines. GrC 2006: 738-743 - 2005
- [c1]Emily Chia-Yu Su, Allan Lo, Chin-Chin Lin, Fu Chang, Wen-Lian Hsu:
A Novel Approach for Prediction of Multi-Labeled Protein Subcellular Localization for Prokaryotic Bacteria. CSB Workshops 2005: 79-82
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-12-10 20:46 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: