default search action
Nathan Lemons
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Vladyslav Oles, Nathan Lemons, Alexander Panchenko:
Efficient estimation of the modified Gromov-Hausdorff distance between unweighted graphs. J. Comb. Optim. 48(2): 14 (2024) - 2023
- [j18]Nathan Lemons, Boris Gelfand, Nigel Lawrence, Austin Thresher, Justin L. Tripp, William Pierre Gammel, Aniruddha Nadiga, Kristina A. Meier, Raymond T. Newell:
Extending quantum key distribution through proxy re-encryption. JOCN 15(7): 457-465 (2023) - [i8]Naphan Benchasattabuse, Andreas Bärtschi, Luis Pedro García-Pintos, John K. Golden, Nathan Lemons, Stephan J. Eidenbenz:
Lower Bounds on Number of QAOA Rounds Required for Guaranteed Approximation Ratios. CoRR abs/2308.15442 (2023) - 2021
- [j17]Balázs Keszegh, Nathan Lemons, Ryan R. Martin, Dömötör Pálvölgyi, Balázs Patkós:
Induced and non-induced poset saturation problems. J. Comb. Theory A 184: 105497 (2021) - [j16]Ervin Györi, Nathan Lemons, Nika Salia, Oscar Zamora:
The structure of hypergraphs without long Berge cycles. J. Comb. Theory B 148: 239-250 (2021) - [j15]József Balogh, Nathan Lemons, Cory Palmer:
Maximum Size Intersecting Families of Bounded Minimum Positive Co-degree. SIAM J. Discret. Math. 35(3): 1525-1535 (2021) - 2020
- [i7]Risul Islam, Andrey Y. Lokhov, Nathan Lemons, Michalis Faloutsos:
Mobility Map Inference from Thermal Modeling of a Building. CoRR abs/2011.07372 (2020)
2010 – 2019
- 2019
- [i6]Vladyslav Oles, Nathan Lemons, Alexander Panchenko:
Efficient estimation of a Gromov-Hausdorff distance between unweighted graphs. CoRR abs/1909.09772 (2019) - 2018
- [i5]Patrick J. Coles, Stephan J. Eidenbenz, Scott Pakin, Adetokunbo Adedoyin, John Ambrosiano, Petr M. Anisimov, William Casper, Gopinath Chennupati, Carleton Coffrin, Hristo N. Djidjev, David Gunter, Satish Karra, Nathan Lemons, Shizeng Lin, Andrey Y. Lokhov, Alexander Malyzhenkov, David Dennis Lee Mascarenas, Susan M. Mniszewski, Balu Nadiga, Dan O'Malley, Diane Oyen, Lakshman Prasad, Randy Roberts, Philip Romero, Nandakishore Santhi, Nikolai Sinitsyn, Pieter Swart, Marc Vuffray, Jim Wendelberger, Boram Yoon, Richard J. Zamora, Wei Zhu:
Quantum Algorithm Implementations for Beginners. CoRR abs/1804.03719 (2018) - 2016
- [j14]Ervin Györi, Gyula Y. Katona, Nathan Lemons:
Hypergraph extensions of the Erdős-Gallai Theorem. Eur. J. Comb. 58: 238-246 (2016) - [j13]Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi:
Online and Quasi-online Colorings of Wedges and Intervals. Order 33(3): 389-409 (2016) - [c4]Andrey Y. Lokhov, Nathan Lemons, Thomas C. McAndrew, Aric A. Hagberg, Scott Backhaus:
Detection of Cyber-Physical Faults and Intrusions from Physical Correlations. ICDM Workshops 2016: 303-310 - [i4]Andrey Y. Lokhov, Nathan Lemons, Thomas C. McAndrew, Aric A. Hagberg, Scott Backhaus:
Detection of faults and intrusions in cyber-physical systems from physical correlations. CoRR abs/1602.06604 (2016) - 2015
- [c3]Matthew Farrell, Timothy D. Goodrich, Nathan Lemons, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan:
Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs. WAW 2015: 29-41 - 2014
- [c2]Aric A. Hagberg, Nathan Lemons, Alexander D. Kent, Joshua Neil:
Connected Components and Credential Hopping in Authentication Graphs. SITIS 2014: 416-423 - [i3]Matthew Farrell, Timothy Goodrich, Nathan Lemons, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan:
Hyperbolicity, degeneracy, and expansion of random intersection graphs. CoRR abs/1409.8196 (2014) - 2013
- [j12]Dániel Gerbner, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós, Vajk Szécsi:
Almost Cross-Intersecting and Almost Cross-Sperner Pairs of Families of Sets. Graphs Comb. 29(3): 489-498 (2013) - [j11]Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós:
Saturating Sperner Families. Graphs Comb. 29(5): 1355-1364 (2013) - [c1]Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi:
Online and Quasi-online Colorings of Wedges and Intervals. SOFSEM 2013: 292-306 - [i2]Milan Bradonjic, Aric A. Hagberg, Nicolas W. Hengartner, Nathan Lemons, Allon G. Percus:
The phase transition in inhomogeneous random intersection graphs. CoRR abs/1301.7320 (2013) - 2012
- [j10]Ervin Györi, Nathan Lemons:
3-uniform hypergraphs avoiding a given odd cycle. Comb. 32(2): 187-203 (2012) - [j9]Péter L. Erdös, Dániel Gerbner, Nathan Lemons, Dhruv Mubayi, Cory Palmer, Balázs Patkós:
Two-Part Set Systems. Electron. J. Comb. 19(1): 52 (2012) - [j8]Ervin Györi, Nathan Lemons:
Hypergraphs with No Cycle of a Given Length. Comb. Probab. Comput. 21(1-2): 193-201 (2012) - [j7]Ervin Györi, Nathan Lemons:
Hypergraphs with no cycle of length 4. Discret. Math. 312(9): 1518-1520 (2012) - [j6]Dániel Gerbner, Nathan Lemons, Cory Palmer, Balázs Patkós, Vajk Szécsi:
Almost Intersecting Families of Sets. SIAM J. Discret. Math. 26(4): 1657-1669 (2012) - [i1]Balázs Keszegh, Nathan Lemons, Dömötör Pálvölgyi:
Online and quasi-online colorings of wedges and intervals. CoRR abs/1207.4415 (2012) - 2011
- [j5]Nathan W. Lemons, Bin Hu, William S. Hlavacek:
Hierarchical graphs for rule-based modeling of biochemical systems. BMC Bioinform. 12: 45 (2011) - 2010
- [j4]Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós:
Polychromatic colorings of arbitrary rectangular partitions. Discret. Math. 310(1): 21-30 (2010) - [j3]Ervin Györi, Gyula Y. Katona, Nathan Lemons:
Hypergraph Extensions of the Erdos-Gallai Theorem. Electron. Notes Discret. Math. 36: 655-662 (2010)
2000 – 2009
- 2009
- [j2]Ervin Györi, Nathan Lemons:
Hypergraphs with no odd cycle of given length. Electron. Notes Discret. Math. 34: 359-362 (2009) - 2008
- [j1]Nathan Lemons, Cory Palmer:
The Unbalance of Set Systems. Graphs Comb. 24(4): 361-365 (2008)
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-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint