{"oa":1,"alternative_title":["LNCS"],"status":"public","title":"Decomposition of geometric graphs into star-forests","scopus_import":"1","publisher":"Springer Nature","language":[{"iso":"eng"}],"intvolume":"     14465","volume":14465,"citation":{"short":"J. Pach, M. Saghafian, P. Schnider, in:, 31st International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2024, pp. 339–346.","ieee":"J. Pach, M. Saghafian, and P. Schnider, “Decomposition of geometric graphs into star-forests,” in <i>31st International Symposium on Graph Drawing and Network Visualization</i>, Isola delle Femmine, Palermo, Italy, 2024, vol. 14465, pp. 339–346.","mla":"Pach, János, et al. “Decomposition of Geometric Graphs into Star-Forests.” <i>31st International Symposium on Graph Drawing and Network Visualization</i>, vol. 14465, Springer Nature, 2024, pp. 339–46, doi:<a href=\"https://doi.org/10.1007/978-3-031-49272-3_23\">10.1007/978-3-031-49272-3_23</a>.","apa":"Pach, J., Saghafian, M., &#38; Schnider, P. (2024). Decomposition of geometric graphs into star-forests. In <i>31st International Symposium on Graph Drawing and Network Visualization</i> (Vol. 14465, pp. 339–346). Isola delle Femmine, Palermo, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-49272-3_23\">https://doi.org/10.1007/978-3-031-49272-3_23</a>","ista":"Pach J, Saghafian M, Schnider P. 2024. Decomposition of geometric graphs into star-forests. 31st International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network Visualization, LNCS, vol. 14465, 339–346.","ama":"Pach J, Saghafian M, Schnider P. Decomposition of geometric graphs into star-forests. In: <i>31st International Symposium on Graph Drawing and Network Visualization</i>. Vol 14465. Springer Nature; 2024:339-346. doi:<a href=\"https://doi.org/10.1007/978-3-031-49272-3_23\">10.1007/978-3-031-49272-3_23</a>","chicago":"Pach, János, Morteza Saghafian, and Patrick Schnider. “Decomposition of Geometric Graphs into Star-Forests.” In <i>31st International Symposium on Graph Drawing and Network Visualization</i>, 14465:339–46. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-49272-3_23\">https://doi.org/10.1007/978-3-031-49272-3_23</a>."},"article_processing_charge":"No","oa_version":"Preprint","doi":"10.1007/978-3-031-49272-3_23","quality_controlled":"1","day":"01","acknowledgement":"János Pach’s Research partially supported by European Research Council (ERC), grant “GeoScape” No. 882971 and by the Hungarian Science Foundation (NKFIH), grant K-131529. Work by Morteza Saghafian is partially supported by the European Research Council (ERC), grant No. 788183, and by the Wittgenstein Prize, Austrian Science Fund (FWF), grant No. Z 342-N31.","ec_funded":1,"conference":{"start_date":"2023-09-20","location":"Isola delle Femmine, Palermo, Italy","end_date":"2023-09-22","name":"GD: Graph Drawing and Network Visualization"},"department":[{"_id":"HeEd"}],"publication_identifier":{"eissn":["16113349"],"isbn":["9783031492716"],"issn":["03029743"]},"publication":"31st International Symposium on Graph Drawing and Network Visualization","date_updated":"2024-02-20T09:13:07Z","date_published":"2024-01-01T00:00:00Z","month":"01","external_id":{"arxiv":["2306.13201"]},"page":"339-346","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","author":[{"id":"E62E3130-B088-11EA-B919-BF823C25FEA4","first_name":"János","last_name":"Pach","full_name":"Pach, János"},{"full_name":"Saghafian, Morteza","last_name":"Saghafian","first_name":"Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824"},{"first_name":"Patrick","full_name":"Schnider, Patrick","last_name":"Schnider"}],"year":"2024","project":[{"name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","call_identifier":"H2020"},{"grant_number":"Z00342","call_identifier":"FWF","name":"The Wittgenstein Prize","_id":"268116B8-B435-11E9-9278-68D0E5697425"}],"date_created":"2024-02-18T23:01:03Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2306.13201","open_access":"1"}],"abstract":[{"text":"We solve a problem of Dujmović and Wood (2007) by showing that a complete convex geometric graph on n vertices cannot be decomposed into fewer than n-1 star-forests, each consisting of noncrossing edges. This bound is clearly tight. We also discuss similar questions for abstract graphs.","lang":"eng"}],"_id":"15012","publication_status":"published"}