Jake Wellens

According to our database1, Jake Wellens authored at least 5 papers between 2018 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Testing gap <i>k</i>-planarity is NP-complete.
Inf. Process. Lett., 2021

Regarding Two Conjectures on Clique and Biclique Partitions.
Electron. J. Comb., 2021

2020
Relationships between the number of inputs and other complexity measures of Boolean functions.
CoRR, 2020

2019
A tighter bound on the number of relevant variables in a bounded degree Boolean function.
CoRR, 2019

2018
A note on partial rejection sampling for the hard disks model in the plane.
CoRR, 2018


  Loading...