@inproceedings{92d4c1deb36849ea85686ead1e5dd4f3,

title = "Colored point-set embeddings of acyclic graphs",

abstract = "We show that any planar drawing of a forest of three stars whose vertices are constrained to be at fixed vertex locations may require Ω(n2/3) edges each having Ω (n1/3) bends in the worst case. The lower bound holds even when the function that maps vertices to points is not a bijection but it is defined by a 3-coloring. In contrast, a constant number of bends per edge can be obtained for 3-colored paths and for 3-colored caterpillars whose leaves all have the same color. Such results answer to a long standing open problem.",

author = "{Di Giacomo}, Emilio and Leszek Gasieniec and Giuseppe Liotta and Alfredo Navarra",

year = "2018",

month = jan,

day = "1",

doi = "10.1007/978-3-319-73915-1_32",

language = "English (US)",

isbn = "9783319739144",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "413--425",

editor = "Kwan-Liu Ma and Fabrizio Frati",

booktitle = "Graph Drawing and Network Visualization - 25th International Symposium, GD 2017, Revised Selected Papers",

note = "25th International Symposium on Graph Drawing and Network Visualization, GD 2017 ; Conference date: 25-09-2017 Through 27-09-2017",

}