@inbook {19624,
	title = {Applications of Parameterized st-Orientations in Graph Drawing Algorithms},
	booktitle = {Graph Drawing},
	series = {Lecture Notes in Computer Science},
	year = {2006},
	month = {2006/01/01/},
	pages = {355 - 367},
	publisher = {Springer Berlin Heidelberg},
	organization = {Springer Berlin Heidelberg},
	abstract = {Many graph drawing algorithms use st-numberings (st-orien-tations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a directed graph with no cycles, one single source s and one single sink t. As there exist exponentially many st-numberings that correspond to a certain undirected graph G, using different st-numberings in various graph drawing algorithms can result in aesthetically different drawings with different area bounds. In this paper, we present results concerning new algorithms for parameterized st-orientations, their impact on graph drawing algorithms and especially in visibility representations.},
	keywords = {Algorithm Analysis and Problem Complexity, Computer Graphics, Data structures, Discrete Mathematics in Computer Science},
	isbn = {978-3-540-31425-7, 978-3-540-31667-1},
	url = {http://link.springer.com/chapter/10.1007/11618058_32},
	author = {Charalampos Papamanthou and Tollis, Ioannis G.},
	editor = {Healy, Patrick and Nikolov, Nikola S.}
}
