{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:31:52Z","timestamp":1760441512795,"version":"3.41.0"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030002558"},{"type":"electronic","value":"9783030002565"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-00256-5_7","type":"book-chapter","created":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T08:22:08Z","timestamp":1535790128000},"page":"79-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimality Program in Segment and\u00a0String Graphs"],"prefix":"10.1007","author":[{"given":"\u00c9douard","family":"Bonnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,9,2]]},"reference":[{"key":"7_CR1","unstructured":"Adamaszek, A., Har-Peled, S., Wiese, A.: Approximation schemes for independent set and sparse subsets of polygons. CoRR abs\/1703.04758 (2017). http:\/\/arxiv.org\/abs\/1703.04758"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Adamaszek, A., Wiese, A.: A QPTAS for maximum weight independent set of polygons with polylogarithmically many vertices. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, 5\u20137 January 2014, pp. 645\u2013656 (2014). https:\/\/doi.org\/10.1137\/1.9781611973402.49","DOI":"10.1137\/1.9781611973402.49"},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jalgor.2003.10.001","volume":"52","author":"J Alber","year":"2004","unstructured":"Alber, J., Fiala, J.: Geometric separation and exact solutions for the parameterized independent set problem on disk graphs. J. Algorithms 52(2), 134\u2013151 (2004)","journal-title":"J. Algorithms"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"BS Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153\u2013180 (1994). https:\/\/doi.org\/10.1145\/174644.174650","journal-title":"J. ACM"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Bir\u00f3, C., Bonnet, \u00c9., Marx, D., Miltzow, T., Rz\u0105\u017cewski, P.: Fine-grained complexity of coloring unit disks and balls. In: 33rd International Symposium on Computational Geometry, SoCG 2017, 4\u20137 July 2017, Brisbane, Australia, pp. 18:1\u201318:16 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.SoCG.2017.18","DOI":"10.4230\/LIPIcs.SoCG.2017.18"},{"key":"7_CR6","unstructured":"Bonnet, \u00c9., Rz\u0105\u017cewski, P.: Optimality program in segment and string graphs. CoRR abs\/1712.08907 (2017). http:\/\/arxiv.org\/abs\/1712.08907"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Boyer, J.M., Myrvold, W.J.: On the cutting edge: simplified o(n) planarity by edge addition. J. Graph Algorithms Appl. 8(2), 241\u2013273 (2004). http:\/\/jgaa.info\/accepted\/2004\/BoyerMyrvold2004.8.3.pdf","DOI":"10.7155\/jgaa.00091"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s00454-013-9538-5","volume":"50","author":"S Cabello","year":"2013","unstructured":"Cabello, S., Cardinal, J., Langerman, S.: The clique problem in ray intersection graphs. Discret. Comput. Geom. 50(3), 771\u2013783 (2013). https:\/\/doi.org\/10.1007\/s00454-013-9538-5","journal-title":"Discret. Comput. Geom."},{"key":"7_CR9","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: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, 31 May - 2 June 2009, pp. 631\u2013638 (2009). https:\/\/doi.org\/10.1145\/1536414.1536500","DOI":"10.1145\/1536414.1536500"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1137\/S0895480103433410","volume":"18","author":"ED Demaine","year":"2004","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M.T., Thilikos, D.M.: Bidimensional parameters and local treewidth. SIAM J. Discret. Math. 18(3), 501\u2013511 (2004)","journal-title":"SIAM J. Discret. Math."},{"issue":"6","key":"7_CR11","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1145\/1101821.1101823","volume":"52","author":"ED Demaine","year":"2005","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M.T., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and $${H}$$-minor-free graphs. J. ACM 52(6), 866\u2013893 (2005)","journal-title":"J. ACM"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M.T.: Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth. In: Proceedings of GD 2014, pp. 517\u2013533 (2004)","DOI":"10.1007\/978-3-540-31843-9_57"},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1093\/comjnl\/bxm033","volume":"51","author":"ED Demaine","year":"2008","unstructured":"Demaine, E.D., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. Comput. J. 51(3), 292\u2013302 (2008)","journal-title":"Comput. J."},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00493-008-2140-4","volume":"28","author":"ED Demaine","year":"2008","unstructured":"Demaine, E.D., Hajiaghayi, M.: Linearity of grid minors in treewidth with applications through bidimensionality. Combinatorica 28(1), 19\u201336 (2008)","journal-title":"Combinatorica"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Erd\u0151s, P., Szekeres, G.: A Combinatorial Problem in Geometry, pp. 49\u201356. Birkh\u00e4user Boston, Boston (1987). https:\/\/doi.org\/10.1007\/978-0-8176-4842-8_3","DOI":"10.1007\/978-0-8176-4842-8_3"},{"key":"7_CR16","unstructured":"Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S., Zehavi, M.: Finding, hitting and packing cycles in subexponential time on unit disk graphs. CoRR abs\/1704.07279 (2017). http:\/\/arxiv.org\/abs\/1704.07279"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S.: Bidimensionality and geometric graphs. In: Proceedings of SODA 2012, pp. 1563\u20131575 (2012)","DOI":"10.1137\/1.9781611973099.124"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Fox, J., Pach, J.: Computing the independence number of intersection graphs. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, 23\u201325 January 2011, pp. 1161\u20131165 (2011). https:\/\/doi.org\/10.1137\/1.9781611973082.87","DOI":"10.1137\/1.9781611973082.87"},{"key":"7_CR19","unstructured":"Fox, J., Pach, J.: Applications of a new separator theorem for string graphs. CoRR abs\/1302.7228 (2013). http:\/\/arxiv.org\/abs\/1302.7228"},{"issue":"1","key":"7_CR20","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.jctb.2009.03.005","volume":"100","author":"J Fox","year":"2010","unstructured":"Fox, J., Pach, J., T\u00f3th, C.D.: A bipartite strengthening of the crossing lemma. J. Comb. Theory, Ser. B 100(1), 23\u201335 (2010). https:\/\/doi.org\/10.1016\/j.jctb.2009.03.005","journal-title":"J. Comb. Theory, Ser. B"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Gon\u00e7alves, D., Isenmann, L., Pennarun, C.: Planar Graphs as L-intersection or L-contact graphs. In: Czumaj, A. (ed.) Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, 7\u201310 January 2018, pp. 172\u2013184. SIAM (2018). https:\/\/doi.org\/10.1137\/1.9781611975031.12","DOI":"10.1137\/1.9781611975031.12"},{"key":"7_CR22","doi-asserted-by":"publisher","unstructured":"Har-Peled, S.: Quasi-polynomial time approximation scheme for sparse subsets of polygons. In: 30th Annual Symposium on Computational Geometry, SOCG 2014, Kyoto, Japan, 08\u201311 June 2014, p. 120 (2014). https:\/\/doi.org\/10.1145\/2582112.2582157","DOI":"10.1145\/2582112.2582157"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? In: Proceedings of FOCS 1998, pp. 653\u2013662, November 1998","DOI":"10.1109\/SFCS.1998.743516"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of $$k$$-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000000917276","DOI":"10.1006\/jcss.2000.1727"},{"issue":"4","key":"7_CR25","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001). https:\/\/doi.org\/10.1006\/jcss.2001.1774","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR26","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"DE Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, vol. III. Addison-Wesley, Boston (1973)"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Comb. Theory, Ser. B 62(2), 289\u2013315 (1994). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0095895684710719","DOI":"10.1006\/jctb.1994.1071"},{"issue":"1","key":"7_CR28","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(91)90091-W","volume":"52","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J.: String graphs. II. Recognizing string graphs is NP-hard. J. Comb. Theory, Ser. B 52(1), 67\u201378 (1991). https:\/\/doi.org\/10.1016\/0095-8956(91)90091-W","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1","key":"7_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0095-8956(91)90050-T","volume":"53","author":"J Kratochv\u00edl","year":"1991","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: String graphs requiring exponential representations. J. Comb. Theory, Ser. B 53(1), 1\u20134 (1991). https:\/\/doi.org\/10.1016\/0095-8956(91)90050-T","journal-title":"J. Comb. Theory, Ser. B"},{"key":"7_CR30","unstructured":"Lee, J.R.: Separators in region intersection graphs. CoRR abs\/1608.01612 (2016). http:\/\/arxiv.org\/abs\/1608.01612"},{"issue":"3","key":"7_CR31","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"RJ Lipton","year":"1980","unstructured":"Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9(3), 615\u2013627 (1980). https:\/\/doi.org\/10.1137\/0209046","journal-title":"SIAM J. Comput."},{"key":"7_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/11847250_14","volume-title":"Parameterized and Exact Computation","author":"D Marx","year":"2006","unstructured":"Marx, D.: Parameterized complexity of independence and domination on geometric graphs. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 154\u2013165. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11847250_14"},{"key":"7_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1007\/978-3-662-48350-3_72","volume-title":"Algorithms \u2013 ESA 2015","author":"D Marx","year":"2015","unstructured":"Marx, D., Pilipczuk, M.: Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. In: Bansal, N., Finocchi, I. (eds.) ESA 2015. LNCS, vol. 9294, pp. 865\u2013877. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48350-3_72"},{"key":"7_CR34","unstructured":"Marx, D., Pilipczuk, M.: Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. CoRR abs\/1504.05476 (2015). http:\/\/arxiv.org\/abs\/1504.05476"},{"key":"7_CR35","unstructured":"Matou\u0161ek, J.: Intersection graphs of segments and $$\\exists \\mathbb{R}$$. CoRR abs\/1406.2636 (2014). http:\/\/arxiv.org\/abs\/1406.2636"},{"issue":"1","key":"7_CR36","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1017\/S0963548313000400","volume":"23","author":"J Matou\u0161ek","year":"2014","unstructured":"Matou\u0161ek, J.: Near-optimal separators in string graphs. Comb. Probab. Comput. 23(1), 135\u2013139 (2014). https:\/\/doi.org\/10.1017\/S0963548313000400","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"7_CR37","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.jctb.2012.09.004","volume":"103","author":"C McDiarmid","year":"2013","unstructured":"McDiarmid, C., M\u00fcller, T.: Integer realizations of disk and segment graphs. J. Comb. Theory, Ser. B 103(1), 114\u2013143 (2013). https:\/\/doi.org\/10.1016\/j.jctb.2012.09.004","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"7_CR38","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1006\/jctb.1994.1073","volume":"62","author":"N Robertson","year":"1994","unstructured":"Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theory, Ser. B 62(2), 323\u2013348 (1994). https:\/\/doi.org\/10.1006\/jctb.1994.1073","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"7_CR39","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0022-0000(03)00045-X","volume":"67","author":"M Schaefer","year":"2003","unstructured":"Schaefer, M., Sedgwick, E., \u0160tefankovi\u010d, D.: Recognizing string graphs in NP. J. Comput. Syst. Sci. 67(2), 365\u2013380 (2003). https:\/\/doi.org\/10.1016\/S0022-0000(03)00045-X","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"7_CR40","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/s00224-015-9662-0","volume":"60","author":"M Schaefer","year":"2017","unstructured":"Schaefer, M., \u0160tefankovi\u010d, D.: Fixed points, nash equilibria, and the existential theory of the reals. Theory Comput. Syst. 60(2), 172\u2013193 (2017). https:\/\/doi.org\/10.1007\/s00224-015-9662-0","journal-title":"Theory Comput. Syst."},{"key":"7_CR41","unstructured":"Scheinerman, E.: Intersection classes and multiple intersection parameters of graphs. Ph.D. thesis, Princeton University (1984)"},{"key":"7_CR42","unstructured":"Smith, W.D., Wormald, N.C.: Geometric separator theorems and applications. In: Proceedings of FOCS 1998, pp. 232\u2013243. IEEE Computer Society, Washington, DC (1998). http:\/\/dl.acm.org\/citation.cfm?id=795664.796397"},{"issue":"3","key":"7_CR43","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1002\/jgt.3190200313","volume":"20","author":"IE Zverovich","year":"1995","unstructured":"Zverovich, I.E., Zverovich, V.E.: An induced subgraph characterization of domination perfect graphs. J. Graph Theory 20(3), 375\u2013395 (1995). https:\/\/doi.org\/10.1002\/jgt.3190200313","journal-title":"J. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00256-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T19:34:28Z","timestamp":1751830468000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00256-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030002558","9783030002565"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00256-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"2 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cottbus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.wg2018.b-tu.de\/","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":"66","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":"30","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":"0","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":"45% - 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":"4","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":"11,5","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)"}}]}}