default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFranklin Kenter
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Susama Agarwala, Franklin Kenter:
A geometric Chung-Lu model and the Drosophila medulla connectome. J. Complex Networks 11(3) (2023)- [i9]Franklin Kenter, Erin Meger, Jérémie Turcotte:
Improved bounds on the cop number when forbidding a minor. CoRR abs/2302.14851 (2023) - 2022
- [j9]Joseph S. Alameda
, Franklin Kenter, Karen Meagher, Michael Young:
An upper bound for the k-power domination number in r-uniform hypergraphs. Discret. Math. 345(11): 113038 (2022) - 2021
- [i8]Susama Agarwala, Franklin Kenter:
A Geometric Chung Lu model and the Drosophila Medulla connectome. CoRR abs/2109.00061 (2021) - 2020
- [j8]Franklin Kenter, Daphne E. Skipper, Dan Wilson:
Computing bounds on product graph pebbling numbers. Theor. Comput. Sci. 803: 160-177 (2020)
2010 – 2019
- 2018
- [j7]Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter, Michael Young:
The relationship between k-forcing and k-power domination. Discret. Math. 341(6): 1789-1797 (2018) - [c2]Franklin Kenter, Daphne E. Skipper:
Integer-Programming Bounds on Pebbling Numbers of Cartesian-Product Graphs. COCOA 2018: 681-695 - [i7]David Burstein, Franklin Kenter, Feng Shi:
Leveraging local network communities to predict academic performance. CoRR abs/1810.04730 (2018) - 2017
- [j6]Randy Davila, Caleb Fast, Michael A. Henning, Franklin Kenter:
Lower Bounds on the Distance Domination Number of a Graph. Contributions Discret. Math. 12(2) (2017) - [j5]David Burstein, Franklin Kenter, Jeremy Kun, Feng Shi:
Interception in distance-vector routing networks. J. Complex Networks 5(2): 179-198 (2017) - [j4]Daniela Ferrero, Leslie Hogben, Franklin H. J. Kenter, Michael Young:
Note on power propagation time and lower bounds for the power domination number. J. Comb. Optim. 34(3): 736-741 (2017) - [i6]Franklin H. J. Kenter, Jephian C.-H. Lin:
On the error of a priori sampling: zero forcing sets and propagation time. CoRR abs/1709.08740 (2017) - 2016
- [j3]Franklin H. J. Kenter:
Approximating the minimum rank of a graph via alternating projection. Oper. Res. Lett. 44(2): 255-259 (2016) - [j2]Franklin H. J. Kenter:
How to Win Your Betting Pool with Jensen's Inequality and the Law of Large Numbers. Am. Math. Mon. 123(6): 592-596 (2016) - [c1]Franklin Kenter, Emily Meigs:
Iterated prisoner's dilemma with extortionate zero-determinant strategies and random-memory opponents. CEC 2016: 3499-3506 - 2015
- [i5]Franklin Kenter, Mary Radcliffe:
A linear k-fold Cheeger inequality. CoRR abs/1501.01741 (2015) - [i4]David Burstein, Franklin Kenter, Jeremy Kun, Feng Shi:
Information Monitoring in Routing Networks. CoRR abs/1507.05206 (2015) - 2014
- [j1]Fan R. K. Chung, Franklin Kenter:
Discrepancy inequalities for directed graphs. Discret. Appl. Math. 176: 30-42 (2014) - [i3]Randy Davila, Franklin Kenter:
Bounds for the Zero-Forcing Number of Graphs with Large Girth. CoRR abs/1406.0482 (2014) - [i2]Franklin H. J. Kenter:
A Linear Cheeger Inequality using Eigenvector Norms. CoRR abs/1412.3195 (2014) - [i1]Franklin H. J. Kenter:
Necessary Spectral Conditions for Coloring Hypergraphs. CoRR abs/1412.3855 (2014)
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:18 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:
