{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1804.09317"]},"author":[{"full_name":"Arroyo Guevara, Alan M","last_name":"Arroyo Guevara","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2401-8670","first_name":"Alan M"},{"full_name":"Bensmail, Julien","first_name":"Julien","last_name":"Bensmail"},{"full_name":"Bruce Richter, R.","last_name":"Bruce Richter","first_name":"R."}],"date_updated":"2023-02-23T13:22:12Z","has_accepted_license":"1","quality_controlled":"1","doi":"10.4230/LIPIcs.SoCG.2020.9","alternative_title":["LIPIcs"],"year":"2020","_id":"7994","volume":164,"ddc":["510"],"scopus_import":"1","month":"06","publication":"36th International Symposium on Computational Geometry","citation":{"ista":"Arroyo Guevara AM, Bensmail J, Bruce Richter R. 2020. Extending drawings of graphs to arrangements of pseudolines. 36th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 164, 9:1-9:14.","mla":"Arroyo Guevara, Alan M., et al. “Extending Drawings of Graphs to Arrangements of Pseudolines.” <i>36th International Symposium on Computational Geometry</i>, vol. 164, 9:1-9:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2020.9\">10.4230/LIPIcs.SoCG.2020.9</a>.","chicago":"Arroyo Guevara, Alan M, Julien Bensmail, and R. Bruce Richter. “Extending Drawings of Graphs to Arrangements of Pseudolines.” In <i>36th International Symposium on Computational Geometry</i>, Vol. 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2020.9\">https://doi.org/10.4230/LIPIcs.SoCG.2020.9</a>.","ama":"Arroyo Guevara AM, Bensmail J, Bruce Richter R. Extending drawings of graphs to arrangements of pseudolines. In: <i>36th International Symposium on Computational Geometry</i>. Vol 164. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2020. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2020.9\">10.4230/LIPIcs.SoCG.2020.9</a>","apa":"Arroyo Guevara, A. M., Bensmail, J., &#38; Bruce Richter, R. (2020). Extending drawings of graphs to arrangements of pseudolines. In <i>36th International Symposium on Computational Geometry</i> (Vol. 164). Zürich, Switzerland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2020.9\">https://doi.org/10.4230/LIPIcs.SoCG.2020.9</a>","short":"A.M. Arroyo Guevara, J. Bensmail, R. Bruce Richter, in:, 36th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.","ieee":"A. M. Arroyo Guevara, J. Bensmail, and R. Bruce Richter, “Extending drawings of graphs to arrangements of pseudolines,” in <i>36th International Symposium on Computational Geometry</i>, Zürich, Switzerland, 2020, vol. 164."},"publication_status":"published","status":"public","article_processing_charge":"No","title":"Extending drawings of graphs to arrangements of pseudolines","file_date_updated":"2020-07-14T12:48:06Z","publication_identifier":{"isbn":["9783959771436"],"issn":["18688969"]},"date_created":"2020-06-22T09:14:21Z","language":[{"iso":"eng"}],"project":[{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020"}],"intvolume":"       164","day":"01","file":[{"content_type":"application/pdf","relation":"main_file","file_name":"2020_LIPIcsSoCG_Arroyo.pdf","creator":"dernst","checksum":"93571b76cf97d5b7c8aabaeaa694dd7e","date_created":"2020-06-23T11:06:23Z","file_size":592661,"date_updated":"2020-07-14T12:48:06Z","access_level":"open_access","file_id":"8006"}],"article_number":"9:1 - 9:14","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"conference","oa":1,"ec_funded":1,"abstract":[{"text":"In the recent study of crossing numbers, drawings of graphs that can be extended to an arrangement of pseudolines (pseudolinear drawings) have played an important role as they are a natural combinatorial extension of rectilinear (or straight-line) drawings. A characterization of the pseudolinear drawings of K_n was found recently. We extend this characterization to all graphs, by describing the set of minimal forbidden subdrawings for pseudolinear drawings. Our characterization also leads to a polynomial-time algorithm to recognize pseudolinear drawings and construct the pseudolines when it is possible.","lang":"eng"}],"conference":{"name":"SoCG: Symposium on Computational Geometry","end_date":"2020-06-26","start_date":"2020-06-22","location":"Zürich, Switzerland"},"date_published":"2020-06-01T00:00:00Z","oa_version":"Published Version","department":[{"_id":"UlWa"}]}