The Complexity of Drawing Graphs on Few Lines and Few Planes

Chaplick, Steven; Fleszar, Krzysztof; Lipp, Fabian; Ravsky, Alexander; Verbitsky, Oleg; Wolff, Alexander

doi:10.1007/978-3-319-62127-2_23

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

The Complexity of Drawing Graphs on Few Lines and Few Planes

MPS-Authors

There are no MPG-Authors in the publication available

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., & Wolff, A. (2017). The Complexity of Drawing Graphs on Few Lines and Few Planes. In F. Ellen, A. Kolokolova, & J.-R. Sack (Eds.), Algorithms and Data Structures (pp. 265-276). Berlin: Springer. doi:10.1007/978-3-319-62127-2_23.

Cite as: https://hdl.handle.net/21.11116/0000-0000-B552-7

Abstract

There is no abstract available