{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:12:12Z","timestamp":1754482332650,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319575858"},{"type":"electronic","value":"9783319575865"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-57586-5_34","type":"book-chapter","created":{"date-parts":[[2017,4,13]],"date-time":"2017-04-13T15:23:34Z","timestamp":1492097014000},"page":"405-417","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Rooted Uniform Monotone Minimum Spanning Trees"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Mastakas","sequence":"first","affiliation":[]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-36763-2_23","volume-title":"Graph Drawing","author":"S Alamdari","year":"2013","unstructured":"Alamdari, S., Chan, T.M., Grant, E., Lubiw, A., Pathak, V.: Self-approaching graphs. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 260\u2013271. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-36763-2_23"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Angelini, P.: Monotone drawings of graphs with few directions. In: 6th International Conference on Information, Intelligence, Systems and Applications, IISA , Corfu, Greece, 6\u20138 July, pp. 1\u20136. IEEE (2015)","DOI":"10.1109\/IISA.2015.7388003"},{"issue":"1","key":"34_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.7155\/jgaa.00249","volume":"16","author":"P Angelini","year":"2012","unstructured":"Angelini, P., Colasante, E., Di Battista, G., Frati, F., Patrignani, M.: Monotone drawings of graphs. J. Graph Algorithms Appl. 16(1), 5\u201335 (2012)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"34_CR4","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s00453-013-9790-3","volume":"71","author":"P Angelini","year":"2015","unstructured":"Angelini, P., Didimo, W., Kobourov, S., Mchedlidze, T., Roselli, V., Symvonis, A., Wismath, S.: Monotone drawings of graphs with fixed embedding. Algorithmica 71(2), 233\u2013257 (2015)","journal-title":"Algorithmica"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Arkin, E.M., Connelly, R., Mitchell, J.S.B.: On monotone paths among obstacles with applications to planning assemblies. In: Mehlhorn, K. (ed.) Proceedings of the Fifth Annual Symposium on Computational Geometry, SCG 1989, pp. 334\u2013343. ACM (1989)","DOI":"10.1145\/73833.73870"},{"issue":"5","key":"34_CR6","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","volume":"8","author":"JL Bentley","year":"1979","unstructured":"Bentley, J.L.: Decomposable searching problems. Inf. Process. Lett. 8(5), 244\u2013251 (1979)","journal-title":"Inf. Process. Lett."},{"key":"34_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-319-50106-2_40","volume-title":"Graph Drawing and Network Visualization","author":"N Bonichon","year":"2016","unstructured":"Bonichon, N., Bose, P., Carmi, P., Kostitsyna, I., Lubiw, A., Verdonschot, S.: Gabriel triangulations and angle-monotone graphs: local routing and recognition. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 519\u2013531. Springer, Cham (2016). doi:10.1007\/978-3-319-50106-2_40"},{"issue":"2","key":"34_CR8","doi-asserted-by":"publisher","first-page":"761","DOI":"10.7155\/jgaa.00348","volume":"19","author":"HR Dehkordi","year":"2015","unstructured":"Dehkordi, H.R., Frati, F., Gudmundsson, J.: Increasing-chord graphs on point sets. J. Graph Algorithms Appl. 19(2), 761\u2013778 (2015)","journal-title":"J. Graph Algorithms Appl."},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"G Di Battista","year":"1988","unstructured":"Di Battista, G., Tamassia, R.: Algorithms for plane representations of acyclic digraphs. Theoret. Comput. Sci. 61, 175\u2013198 (1988)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"34_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1137\/0205015","volume":"5","author":"DP Dobkin","year":"1976","unstructured":"Dobkin, D.P., Lipton, R.J.: Multidimensional searching problems. SIAM J. Comput. 5(2), 181\u2013186 (1976)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"34_CR11","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/S0097539794277123","volume":"31","author":"A Garg","year":"2001","unstructured":"Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear planarity testing. SIAM J. Comput. 31(2), 601\u2013625 (2001)","journal-title":"SIAM J. Comput."},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2016.01.009","volume":"654","author":"D He","year":"2016","unstructured":"He, D., He, X.: Nearly optimal monotone drawing of trees. Theoret. Comput. Sci. 654, 26\u201332 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1017\/S0305004198003016","volume":"125","author":"C Icking","year":"1999","unstructured":"Icking, C., Klein, R., Langetepe, E.: Self-approaching curves. Math. Proc. Cambridge Philos. Soc. 125, 441\u2013453 (1999)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"2","key":"34_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1145\/1103963.1103967","volume":"1","author":"R Jothi","year":"2005","unstructured":"Jothi, R., Raghavachari, B.: Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design. ACM Trans. Algorithms 1(2), 265\u2013282 (2005)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"34_CR15","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"DG Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.G.: Optimal search in planar subdivisions. SIAM J. Comput. 12(1), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"key":"34_CR16","volume-title":"The Art of Computer Programming, Volume III: Sorting and Searching","author":"DE Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley, Boston (1973)"},{"key":"34_CR17","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1017\/S0305004100047022","volume":"72","author":"DG Larman","year":"1972","unstructured":"Larman, D.G., McMullen, P.: Arcs with increasing chords. Math. Proc. Cambridge Philos. Soc. 72, 205\u2013207 (1972)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"issue":"3","key":"34_CR18","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"RJ Lipton","year":"1980","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9(3), 615\u2013627 (1980)","journal-title":"SIAM J. Comput."},{"key":"34_CR19","doi-asserted-by":"crossref","unstructured":"Mastakas, K., Symvonis, A.: On the construction of increasing-chord graphs on convex point sets. In: 6th International Conference on Information, Intelligence, Systems and Applications, IISA, Corfu, Greece, 6\u20138 July, pp. 1\u20136. IEEE (2015)","DOI":"10.1109\/IISA.2015.7388028"},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Mastakas, K., Symvonis, A.: Rooted uniform monotone minimum spanning trees. CoRR, abs\/1607.03338v2 (2017)","DOI":"10.1007\/978-3-319-57586-5_34"},{"issue":"1","key":"34_CR21","first-page":"47","volume":"7","author":"M N\u00f6llenburg","year":"2016","unstructured":"N\u00f6llenburg, M., Prutkin, R., Rutter, I.: On self-approaching and increasing-chord drawings of 3-connected planar graphs. J. Comput. Geom. 7(1), 47\u201369 (2016)","journal-title":"J. Comput. Geom."},{"key":"34_CR22","series-title":"Texts and Monographs in Computer Science","volume-title":"Computational Geometry: An Introduction","author":"FP Preparata","year":"1988","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Texts and Monographs in Computer Science. Springer, Heidelberg (1988)"},{"key":"34_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0305004100071875","volume":"115","author":"G Rote","year":"1994","unstructured":"Rote, G.: Curves with increasing chords. Math. Proc. Cambridge Philos. Soc. 115, 1\u201312 (1994)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"34_CR24","doi-asserted-by":"crossref","unstructured":"Shamos, M.I.: Geometric complexity. In: Rounds, W.C., Martin, N., Carlyle, J.W., Harrison, M.A. (eds.) Proceedings of the 7th Annual ACM Symposium on Theory of Computing, STOC 1975, pp. 224\u2013233. ACM (1975)","DOI":"10.1145\/800116.803772"},{"key":"34_CR25","unstructured":"Shamos, M.I.: Computational geometry. Ph.D. thesis, Yale University, USA (1978)"},{"key":"34_CR26","doi-asserted-by":"crossref","unstructured":"Shamos M.I., Hoey, D.: Closest-point problems. In: 16th Annual Symposium on Foundations of Computer Science, pp. 151\u2013162. IEEE Computer Society (1975)","DOI":"10.1109\/SFCS.1975.8"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57586-5_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T14:51:24Z","timestamp":1710341484000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-57586-5_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319575858","9783319575865"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57586-5_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 May 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ciac2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.corelab.ntua.gr\/ciac2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}