7 citations · 31 across the 24 of their papers we have counts for
Showing 2011 · cs.DMShow all
2 papers · 2 filters
cs.DM2011
How Not to Characterize Planar-emulable Graphs
Markus Chimani, Martin Derka, Petr Hliněný +1
We investigate the question of which graphs have planar emulators (a locally-surjective homomorphism from some finite planar graph) -- a problem raised already in Fellows' thesis (…
cs.DM2011
A Tighter Insertion-based Approximation of the Crossing Number
Markus Chimani, Petr Hlineny
Let G be a planar graph and F a set of additional edges not yet in G. The multiple edge insertion problem (MEI) asks for a drawing of G+F with the minimum number of pairwise edge c…