Franklin Kenter

Orcid: 0000-0001-8157-3772

According to our database1, Franklin Kenter authored at least 20 papers between 2014 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
A geometric Chung-Lu model and the Drosophila medulla connectome.
J. Complex Networks, April, 2023

Improved bounds on the cop number when forbidding a minor.
CoRR, 2023

2022
An upper bound for the <i>k</i>-power domination number in <i>r</i>-uniform hypergraphs.
Discret. Math., 2022

2020
Computing bounds on product graph pebbling numbers.
Theor. Comput. Sci., 2020

2018
The relationship between k-forcing and k-power domination.
Discret. Math., 2018

Leveraging local network communities to predict academic performance.
CoRR, 2018

Integer-Programming Bounds on Pebbling Numbers of Cartesian-Product Graphs.
Proceedings of the Combinatorial Optimization and Applications, 2018

2017
Note on power propagation time and lower bounds for the power domination number.
J. Comb. Optim., 2017

On the error of a priori sampling: zero forcing sets and propagation time.
CoRR, 2017

Interception in distance-vector routing networks.
J. Complex Networks, 2017

Lower Bounds on the Distance Domination Number of a Graph.
Contributions Discret. Math., 2017

2016
How to Win Your Betting Pool with Jensen's Inequality and the Law of Large Numbers.
Am. Math. Mon., 2016

Approximating the minimum rank of a graph via alternating projection.
Oper. Res. Lett., 2016

Iterated prisoner's dilemma with extortionate zero-determinant strategies and random-memory opponents.
Proceedings of the IEEE Congress on Evolutionary Computation, 2016

2015
A linear k-fold Cheeger inequality.
CoRR, 2015

Information Monitoring in Routing Networks.
CoRR, 2015

2014
Discrepancy inequalities for directed graphs.
Discret. Appl. Math., 2014

Necessary Spectral Conditions for Coloring Hypergraphs.
CoRR, 2014

A Linear Cheeger Inequality using Eigenvector Norms.
CoRR, 2014

Bounds for the Zero-Forcing Number of Graphs with Large Girth.
CoRR, 2014


  Loading...