{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:34:27Z","timestamp":1743028467720,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"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_1","type":"book-chapter","created":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T23:02:50Z","timestamp":1574895770000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Stick Graphs with Length Constraints"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3501-4608","authenticated-orcid":false,"given":"Steven","family":"Chaplick","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5764-7719","authenticated-orcid":false,"given":"Philipp","family":"Kindermann","sequence":"additional","affiliation":[]},{"given":"Andre","family":"L\u00f6ffler","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Thiele","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5872-718X","authenticated-orcid":false,"given":"Alexander","family":"Wolff","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Zaft","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7398-718X","authenticated-orcid":false,"given":"Johannes","family":"Zink","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,28]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Cabello, S., Jej\u010di\u010d, M.: Refining the hierarchies of classes of geometric intersection graphs. Electr. J. Comb. 24(1), P1.33 (2017). http:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i1p33","key":"1_CR1","DOI":"10.37236\/6040"},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"273","DOI":"10.7155\/jgaa.00470","volume":"22","author":"J Cardinal","year":"2018","unstructured":"Cardinal, J., Felsner, S., Miltzow, T., Tompkins, C., Vogtenhuber, B.: Intersection graphs of rays and grounded segments. J. Graph Algorithms Appl. 22(2), 273\u2013295 (2018). https:\/\/doi.org\/10.7155\/jgaa.00470","journal-title":"J. Graph Algorithms Appl."},{"doi-asserted-by":"publisher","unstructured":"Catanzaro, D., Chaplick, S., Felsner, S., Halld\u00f3rsson, B.V., Halld\u00f3rsson, M.M., Hixon, T., Stacho, J.: Max point-tolerance graphs. Discrete Appl. Math. 216, 84\u201397 (2017). https:\/\/doi.org\/10.1016\/j.dam.2015.08.019","key":"1_CR3","DOI":"10.1016\/j.dam.2015.08.019"},{"doi-asserted-by":"publisher","unstructured":"Chalopin, J., Gon\u00e7alves, D.: Every planar graph is the intersection graph of segments in the plane: extended abstract. In: STOC 2009, pp. 631\u2013638. ACM (2009). https:\/\/doi.org\/10.1145\/1536414.1536500","key":"1_CR4","DOI":"10.1145\/1536414.1536500"},{"doi-asserted-by":"publisher","unstructured":"Chaplick, S., Dorbec, P., Kratochv\u00edl, J., Montassier, M., Stacho, J.: Contact representations of planar graphs: extending a partial representation is hard. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 139\u2013151. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-319-12340-0_12","key":"1_CR5","DOI":"10.1007\/978-3-319-12340-0_12"},{"doi-asserted-by":"publisher","unstructured":"Chaplick, S., Felsner, S., Hoffmann, U., Wiechert, V.: Grid intersection graphs and order dimension. Order 35(2), 363\u2013391 (2018). https:\/\/doi.org\/10.1007\/s11083-017-9437-0","key":"1_CR6","DOI":"10.1007\/s11083-017-9437-0"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.dam.2015.05.035","volume":"216","author":"S Chaplick","year":"2017","unstructured":"Chaplick, S., Hell, P., Otachi, Y., Saitoh, T., Uehara, R.: Ferrers dimension of grid intersection graphs. Discrete Appl. Math. 216, 130\u2013135 (2017). https:\/\/doi.org\/10.1016\/j.dam.2015.05.035","journal-title":"Discrete Appl. Math."},{"doi-asserted-by":"crossref","unstructured":"Chaplick, S., Kindermann, P., L\u00f6ffler, A., Thiele, F., Wolff, A., Zaft, A., Zink, J.: Stick graphs with length constraints. Arxiv report (2019). http:\/\/arxiv.org\/abs\/1907.05257","key":"1_CR8","DOI":"10.1007\/978-3-030-35802-0_1"},{"doi-asserted-by":"publisher","unstructured":"De Luca, F., Hossain, M.I., Kobourov, S.G., Lubiw, A., Mondal, D.: Recognition and drawing of stick graphs. In: Biedl, T.C., Kerren, A. (eds.) GD 2018. LNCS, vol. 11282, pp. 303\u2013316. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-04414-5_21","key":"1_CR9","DOI":"10.1007\/978-3-030-04414-5_21"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-662-44465-8_26","volume-title":"Mathematical Foundations of Computer Science 2014","author":"S Felsner","year":"2014","unstructured":"Felsner, S., Knauer, K., Mertzios, G.B., Ueckerdt, T.: Intersection graphs of L-shapes and segments in the plane. In: Csuhaj-Varj\u00fa, E., Dietzfelbinger, M., \u00c9sik, Z. (eds.) MFCS 2014. LNCS, vol. 8635, pp. 299\u2013310. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44465-8_26"},{"key":"1_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1089\/cmb.2010.0288","volume":"18","author":"BV Halld\u00f3rsson","year":"2011","unstructured":"Halld\u00f3rsson, B.V., Aguiar, D., Tarpine, R., Istrail, S.: The Clark phaseable sample size problem: long-range phasing and loss of heterozygosity in GWAS. J. Comput. Biol. 18(3), 323\u2013333 (2011). https:\/\/doi.org\/10.1089\/cmb.2010.0288","journal-title":"J. Comput. Biol."},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0012-365X(91)90069-E","volume":"87","author":"IB Hartman","year":"1991","unstructured":"Hartman, I.B., Newman, I., Ziv, R.: On grid intersection graphs. Discrete Math. 87(1), 41\u201352 (1991). https:\/\/doi.org\/10.1016\/0012-365X(91)90069-E","journal-title":"Discrete Math."},{"doi-asserted-by":"publisher","unstructured":"J\u00fcnger, M., Leipert, S., Mutzel, P.: Level planarity testing in linear time. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 224\u2013237. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-37623-2_17","key":"1_CR14","DOI":"10.1007\/3-540-37623-2_17"},{"doi-asserted-by":"publisher","unstructured":"Klav\u00edk, P., Otachi, Y., Sejnoha, J.: On the classes of interval graphs of limited nesting and count of lengths. Algorithmica 81(4), 1490\u20131511 (2019). https:\/\/doi.org\/10.1007\/s00453-018-0481-y","key":"1_CR15","DOI":"10.1007\/s00453-018-0481-y"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.jda.2015.05.011","volume":"34","author":"J K\u00f6bler","year":"2015","unstructured":"K\u00f6bler, J., Kuhnert, S., Watanabe, O.: Interval graph representation with given interval and intersection lengths. J. Discrete Algorithms 34, 108\u2013117 (2015). https:\/\/doi.org\/10.1016\/j.jda.2015.05.011","journal-title":"J. Discrete Algorithms"},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(94)90143-0","volume":"52","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J.: A special planar satisfiability problem and a consequence of its NP-completeness. Discrete Appl. Math. 52(3), 233\u2013252 (1994). https:\/\/doi.org\/10.1016\/0166-218X(94)90143-0","journal-title":"Discrete Appl. Math."},{"doi-asserted-by":"publisher","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Comb. Theory, Series B 62(2), 289\u2013315 (1994). https:\/\/doi.org\/10.1006\/jctb.1994.1071","key":"1_CR18","DOI":"10.1006\/jctb.1994.1071"},{"issue":"2","key":"1_CR19","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1137\/S0097539703437855","volume":"36","author":"D Kratsch","year":"2006","unstructured":"Kratsch, D., McConnell, R.M., Mehlhorn, K., Spinrad, J.P.: Certifying algorithms for recognizing interval graphs and permutation graphs. SIAM J. Comput. 36(2), 326\u2013353 (2006). https:\/\/doi.org\/10.1137\/S0097539703437855","journal-title":"SIAM J. Comput."},{"issue":"1\u20133","key":"1_CR20","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0166-218X(97)00020-6","volume":"78","author":"WN Li","year":"1997","unstructured":"Li, W.N.: Two-segmented channel routing is strong NP-complete. Discrete Appl. Math. 78(1\u20133), 291\u2013298 (1997). https:\/\/doi.org\/10.1016\/S0166-218X(97)00020-6","journal-title":"Discrete Appl. Math."},{"unstructured":"Lubiw, A.: Private communication (2019)","key":"1_CR21"},{"unstructured":"Matou\u0161ek, J.: Intersection graphs of segments and $$\\exists \\mathbb{R}$$. ArXiv. https:\/\/arxiv.org\/abs\/1406.2636 (2014)","key":"1_CR22"},{"issue":"4","key":"1_CR23","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1137\/S0895480196306373","volume":"10","author":"I Pe\u2019er","year":"1997","unstructured":"Pe\u2019er, I., Shamir, R.: Realizing interval graphs with size and distance constraints. SIAM J. Discrete Math. 10(4), 662\u2013687 (1997). https:\/\/doi.org\/10.1137\/S0895480196306373","journal-title":"SIAM J. Discrete Math."},{"doi-asserted-by":"publisher","unstructured":"Schaefer, M.: Complexity of some geometric and topological problems. In: GD 2009. LNCS, vol. 5849, pp. 334\u2013344. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-11805-0_32","key":"1_CR24","DOI":"10.1007\/978-3-642-11805-0_32"},{"issue":"2","key":"1_CR25","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1137\/S0895480190177145","volume":"7","author":"MK Sen","year":"1994","unstructured":"Sen, M.K., Sanyal, B.K.: Indifference digraphs: a generalization of indifference graphs and semiorders. SIAM J. Discrete Math. 7(2), 157\u2013165 (1994). https:\/\/doi.org\/10.1137\/S0895480190177145","journal-title":"SIAM J. Discrete Math."},{"doi-asserted-by":"publisher","unstructured":"Shrestha, A.M.S., Takaoka, A., Tayu, S., Ueno, S.: On two problems of nano-PLA design. IEICE Trans. 94-D(1), 35\u201341 (2011). https:\/\/doi.org\/10.1587\/transinf.E94.D.35","key":"1_CR26","DOI":"10.1587\/transinf.E94.D.35"},{"doi-asserted-by":"publisher","unstructured":"Spinrad, J., Brandst\u00e4dt, A., Stewart, L.: Bipartite permutation graphs. Discrete Appl. Math. 18(3), 279\u2013292 (1987). https:\/\/doi.org\/10.1016\/S0166-218X(87)80003-3","key":"1_CR27","DOI":"10.1016\/S0166-218X(87)80003-3"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,28]],"date-time":"2023-11-28T01:02:25Z","timestamp":1701133345000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-35802-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030358013","9783030358020"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35802-0_1","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"}]}}