A note on approximating graph genus

Authors:
Jianer Chen;Saroja P. Kanchi;Arkady Kanevsky
Affiliations:
-;-;-
Venue:
Information Processing Letters
Year:
1997

Citing 0
Cited 3

Genus characterizes the complexity of certain graph problems: Some tight results

Journal of Computer and System Sciences
Genus characterizes the complexity of graph problems: some tight results

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Planar drawings of higher-genus graphs

GD'09 Proceedings of the 17th international conference on Graph Drawing

Quantified Score

Hi-index	0.89

Visualization

Abstract