… algorithm and complicated mathematical justification. More precisely, we provide an algorithm
that for a given (dense) graph … surface of genus g, and this is ε-close to a minimum genus …

… Efficient Polynomial-Time Approximation Scheme (EPTAS) for approximating the genus of
dense graphs… an EPTAS for the genus of dense graphs, we outline an algorithm whose time …

… Polynomial-Time Approximation Scheme (EPTAS) for approximating the genus of dense
graphs. … In order to obtain EPTAS for the genus of dense graphs, we outline an algorithm whose …

… not have such an approximation algorithm if the regions are … we cannot solve this instance
in polynomial time (in n), since … evidence that low genus graphs are low density graphs.) For …

… , we derive polynomial-time approximation schemes for the … , we obtain a polynomial-time
approximation scheme for … is necessarily dense in the graph; in particular if for grid graphs a …

… is no known effective approximation algorithm for the problem… Our results on the polynomial
time approximation schemes (… more tractable on dense graphs, for which the graph genus is …

… Abstract—We propose polynomial-time algorithms that spar… to an instance must be dense in
the input graph. However, this … Mathieu, “An efficient polynomial-time approximation scheme …

… of an efficient polynomial-time approximation scheme for the … -0012 –time algorithm for
graphs of genus g. Their results … instance of dense k-subgraph, we construct a split graph urn:x-…

… genus embeddings of quasirandom graphs, we provide an Efficient Polynomial-Time
Approximation Scheme … More precisely, we provide an algorithm that for a given (dense) graph G …

… use more efficient heuristics in place of an optimal bisection algorithm. … gn)-separators,
where g is the genus of the graphs. • … There is a polynomial time algorithm that finds a (2,p)-way …