Craig Tennenhouse

Orcid: 0000-0002-0600-0963

According to our database1, Craig Tennenhouse authored at least 11 papers between 2012 and 2025.

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

Timeline

2012
2014
2016
2018
2020
2022
2024
0
1
2
3
1
2
1
1
2
1
1
1
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Col is PSPACE-complete on Triangular Grids.
CoRR, January, 2025

2024
Vexing vexillological logic.
Int. J. Game Theory, December, 2024

The computational complexity of forced capture Hnefatafl.
Theor. Comput. Sci., 2024

2023
Forced Capture Hnefatafl.
CoRR, 2023

2020
Packing and Covering Directed Triangles.
Graphs Comb., 2020

2018
Impartial poker nim.
Int. J. Game Theory, 2018

Edge-Critical G, H Colorings.
Ars Comb., 2018

2017
The Game of Blocking Pebbles.
CoRR, 2017

2016
Games from Basic Data Structures.
CoRR, 2016

2015
A new parameter on resolving sets with a realizable triple.
Australas. J Comb., 2015

2012
Saturation numbers for families of graph subdivisions.
J. Graph Theory, 2012


  Loading...