{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T10:08:03Z","timestamp":1748426883305,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030358013"},{"type":"electronic","value":"9783030358020"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35802-0_30","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"395-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["4-Connected Triangulations on Few Lines"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6150-1998","authenticated-orcid":false,"given":"Stefan","family":"Felsner","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"1561","DOI":"10.1007\/s00453-018-0487-5","volume":"81","author":"MJ Bannister","year":"2019","unstructured":"Bannister, M.J., Devanny, W.E., Dujmovic, V., Eppstein, D., Wood, D.R.: Track layouts, layered path decompositions, and leveled planarity. Algorithmica 81, 1561\u20131583 (2019)","journal-title":"Algorithmica"},{"doi-asserted-by":"crossref","unstructured":"Biedl, T., Felsner, S., Meijer, H., Wolff, A.: Line and plane cover numbers revisited. In: Archambault, D., T\u00f3th, C.D. (eds.) GD 2019, LNCS 11904, pp. 409\u2013415. Springer, Heidelberg (2019)","key":"30_CR2","DOI":"10.1007\/978-3-030-35802-0_31"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-319-50106-2_14","volume-title":"Graph Drawing and Network Visualization","author":"S Chaplick","year":"2016","unstructured":"Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: Drawing graphs on few lines and few planes. In: Hu, Y., N\u00f6llenburg, M. (eds.) GD 2016. LNCS, vol. 9801, pp. 166\u2013180. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50106-2_14"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-319-62127-2_23","volume-title":"Algorithms and Data Structures","author":"S Chaplick","year":"2017","unstructured":"Chaplick, S., Fleszar, K., Lipp, F., Ravsky, A., Verbitsky, O., Wolff, A.: The complexity of drawing graphs on few lines and few planes. In: Ellen, F., Kolokolova, A., Sack, J.R. (eds.) WADS 2017. LNCS, vol. 10389, pp. 265\u2013276. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_23"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"G Di Battista","year":"1992","unstructured":"Di Battista, G., Tamassia, R., Tollis, I.G.: Area requirement and symmetry display of planar upward drawings. Discrete Comput. Geom. 7, 381\u2013401 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"30_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/9781108539180","volume-title":"Forbidden Configurations in Discrete Geometry","author":"D Eppstein","year":"2018","unstructured":"Eppstein, D.: Forbidden Configurations in Discrete Geometry. Cambridge University Press, Cambridge (2018)"},{"unstructured":"Eppstein, D.: Cubic planar graphs that cannot be drawn on few lines. In: Proceedings of SoCG 2019. LIPIcs (2019)","key":"30_CR7"},{"key":"30_CR8","first-page":"1510","volume":"19","author":"SV Fomin","year":"1978","unstructured":"Fomin, S.V.: Finite partially ordered sets and Young tableaux. Soviet Math. Dokl. 19, 1510\u20131514 (1978)","journal-title":"Soviet Math. Dokl."},{"key":"30_CR9","volume-title":"Flows in Networks","author":"LR Ford Jr","year":"1962","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/0095-8956(80)90079-9","volume":"29","author":"A Frank","year":"1980","unstructured":"Frank, A.: On chain and antichain families of partially ordered sets. J. Combin. Theory Ser. B 29, 176\u2013184 (1980)","journal-title":"J. Combin. Theory Ser. B"},{"issue":"2\u20133","key":"30_CR11","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0166-218X(94)00085-R","volume":"56","author":"H de Fraysseix","year":"1995","unstructured":"de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: Bipolar orientations revisited. Discrete Appl. Math. 56(2\u20133), 157\u2013179 (1995)","journal-title":"Discrete Appl. Math."},{"unstructured":"Fusy, E.: Combinatoire des cartes planaires et applications algorithmiques. Ph.D. thesis, LIX Polytechnique (2007). www.lix.polytechnique.fr\/~fusy\/Articles\/these_eric_fusy.pdf","key":"30_CR12"},{"issue":"7","key":"30_CR13","doi-asserted-by":"publisher","first-page":"1870","DOI":"10.1016\/j.disc.2007.12.093","volume":"309","author":"E Fusy","year":"2009","unstructured":"Fusy, E.: Transversal structures on triangulations: a combinatorial study and straight-line drawings. Discr. Math. 309(7), 1870\u20131894 (2009)","journal-title":"Discr. Math."},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/0001-8708(74)90031-0","volume":"14","author":"C Greene","year":"1974","unstructured":"Greene, C.: An extension of Schensted\u2019s theorem. Adv. Math. 14, 254\u2013265 (1974)","journal-title":"Adv. Math."},{"key":"30_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0097-3165(76)90078-9","volume":"20","author":"C Greene","year":"1976","unstructured":"Greene, C.: Some partitions associated with a partially ordered set. J. Combin. Theory Ser. A 20, 69\u201379 (1976)","journal-title":"J. Combin. Theory Ser. A"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0097-3165(76)90077-7","volume":"20","author":"C Greene","year":"1976","unstructured":"Greene, C., Kleitman, D.J.: The structure of Sperner k-families. J. Combin. Theory Ser. A 20, 41\u201368 (1976)","journal-title":"J. Combin. Theory Ser. A"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0304-3975(95)00257-X","volume":"172","author":"G Kant","year":"1997","unstructured":"Kant, G., He, X.: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theor. Comput. Sci. 172, 175\u2013193 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0001-8708(79)90010-0","volume":"33","author":"M Saks","year":"1979","unstructured":"Saks, M.: A short proof of the existence of $$k$$-saturated partitions of partially ordered sets. Adv. Math. 33, 207\u2013211 (1979)","journal-title":"Adv. Math."},{"unstructured":"Schnyder, W.: Embedding planar graphs on the grid. In: Proceedings of SODA 1990, pp. 138\u2013148. ACM-SIAM (1990)","key":"30_CR19"},{"key":"30_CR20","series-title":"Johns Hopkins Series in the Mathematical Sciences","doi-asserted-by":"crossref","DOI":"10.56021\/9780801844256","volume-title":"Combinatorics and Partially Ordered Sets: Dimension Theory","author":"WT Trotter","year":"1992","unstructured":"Trotter, W.T.: Combinatorics and Partially Ordered Sets: Dimension Theory. Johns Hopkins Series in the Mathematical Sciences. Johns Hopkins University Press, Baltimore (1992)"},{"unstructured":"Trotter, W.T.: Partially ordered sets. In: Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1s, L. (eds.) Handbook of Combinatorics, North-Holland, vol. I, pp. 433\u2013480 (1995)","key":"30_CR21"},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-94-009-5315-4_8","volume-title":"Graphs and Orders","author":"DB West","year":"1985","unstructured":"West, D.B.: Parameters of partial orders and graphs: packing, covering and representation. In: Rival, I. (ed.) Graphs and Orders, pp. 267\u2013350. D. Reidel, Dordrecht (1985)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35802-0_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:05:16Z","timestamp":1701133516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/kam.mff.cuni.cz\/gd2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"113","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12.55","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}