{"type":"conference","month":"11","department":[{"_id":"UlWa"}],"publication_status":"published","citation":{"ista":"Arroyo Guevara AM, Derka M, Parada I. 2019. Extending simple drawings. 27th International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network Visualization, LNCS, vol. 11904, 230–243.","ieee":"A. M. Arroyo Guevara, M. Derka, and I. Parada, “Extending simple drawings,” in <i>27th International Symposium on Graph Drawing and Network Visualization</i>, Prague, Czech Republic, 2019, vol. 11904, pp. 230–243.","short":"A.M. Arroyo Guevara, M. Derka, I. Parada, in:, 27th International Symposium on Graph Drawing and Network Visualization, Springer Nature, 2019, pp. 230–243.","chicago":"Arroyo Guevara, Alan M, Martin Derka, and Irene Parada. “Extending Simple Drawings.” In <i>27th International Symposium on Graph Drawing and Network Visualization</i>, 11904:230–43. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-35802-0_18\">https://doi.org/10.1007/978-3-030-35802-0_18</a>.","ama":"Arroyo Guevara AM, Derka M, Parada I. Extending simple drawings. In: <i>27th International Symposium on Graph Drawing and Network Visualization</i>. Vol 11904. Springer Nature; 2019:230-243. doi:<a href=\"https://doi.org/10.1007/978-3-030-35802-0_18\">10.1007/978-3-030-35802-0_18</a>","apa":"Arroyo Guevara, A. M., Derka, M., &#38; Parada, I. (2019). Extending simple drawings. In <i>27th International Symposium on Graph Drawing and Network Visualization</i> (Vol. 11904, pp. 230–243). Prague, Czech Republic: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-35802-0_18\">https://doi.org/10.1007/978-3-030-35802-0_18</a>","mla":"Arroyo Guevara, Alan M., et al. “Extending Simple Drawings.” <i>27th International Symposium on Graph Drawing and Network Visualization</i>, vol. 11904, Springer Nature, 2019, pp. 230–43, doi:<a href=\"https://doi.org/10.1007/978-3-030-35802-0_18\">10.1007/978-3-030-35802-0_18</a>."},"isi":1,"doi":"10.1007/978-3-030-35802-0_18","intvolume":"     11904","conference":{"end_date":"2019-09-20","location":"Prague, Czech Republic","name":"GD: Graph Drawing and Network Visualization","start_date":"2019-09-17"},"year":"2019","external_id":{"arxiv":["1908.08129"],"isi":["000612918800018"]},"date_updated":"2023-09-06T14:56:00Z","volume":11904,"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1908.08129"}],"page":"230-243","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships"}],"alternative_title":["LNCS"],"date_published":"2019-11-28T00:00:00Z","author":[{"orcid":"0000-0003-2401-8670","full_name":"Arroyo Guevara, Alan M","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","last_name":"Arroyo Guevara","first_name":"Alan M"},{"first_name":"Martin","last_name":"Derka","full_name":"Derka, Martin"},{"full_name":"Parada, Irene","last_name":"Parada","first_name":"Irene"}],"publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["978-3-0303-5801-3"]},"article_processing_charge":"No","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Springer Nature","ec_funded":1,"status":"public","scopus_import":"1","publication":"27th International Symposium on Graph Drawing and Network Visualization","abstract":[{"lang":"eng","text":"Simple drawings of graphs are those in which each pair of edges share at most one point, either a common endpoint or a proper crossing. In this paper we study the problem of extending a simple drawing D(G) of a graph G by inserting a set of edges from the complement of G into D(G) such that the result is a simple drawing. In the context of rectilinear drawings, the problem is trivial. For pseudolinear drawings, the existence of such an extension follows from Levi’s enlargement lemma. In contrast, we prove that deciding if a given set of edges can be inserted into a simple drawing is NP-complete. Moreover, we show that the maximization version of the problem is APX-hard. We also present a polynomial-time algorithm for deciding whether one edge uv can be inserted into D(G) when {u,v} is a dominating set for the graph G."}],"day":"28","quality_controlled":"1","oa":1,"title":"Extending simple drawings","_id":"7230","date_created":"2020-01-05T23:00:47Z"}