Samuel German
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Complexity×1Discrete Math×1
Frequent co-authors
Research Timeline
2026
Lettericity Is NP-Complete
The authors prove that the lettericity problem on arbitrary graphs is NP-complete.
Highlighted terms show continued research focus across papers