11 citations · 66 across the 33 of their papers we have counts for
1 paper · 2 filters
Ken-ichi Kawarabayashi, Anastasios Sidiropoulos
Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter alg…