{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T23:35:03Z","timestamp":1777592103861,"version":"3.51.4"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2019,4,6]],"date-time":"2019-04-06T00:00:00Z","timestamp":1554508800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004421","name":"Warsaw University of Technology","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004421","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1007\/s00453-019-00568-7","type":"journal-article","created":{"date-parts":[[2019,4,7]],"date-time":"2019-04-07T01:34:27Z","timestamp":1554600867000},"page":"3047-3073","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Optimality Program in Segment and String Graphs"],"prefix":"10.1007","volume":"81","author":[{"given":"\u00c9douard","family":"Bonnet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7696-3848","authenticated-orcid":false,"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,6]]},"reference":[{"key":"568_CR1","unstructured":"Adamaszek, A., Har-Peled, S., Wiese, A.: Approximation schemes for independent set and sparse subsets of polygons. CoRR, \n                    arXiv:1703.04758\n                    \n                   (2017)"},{"key":"568_CR2","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, January 5\u20137, 2014, pp. 645\u2013656 (2014)"},{"issue":"2","key":"568_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":"568_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)","journal-title":"J. ACM"},{"key":"568_CR5","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, July 4\u20137, 2017, Brisbane, Australia, pp. 18:1\u201318:16 (2017)"},{"key":"568_CR6","unstructured":"Bonnet, \u00c9., Brettell, N., Kwon, O., Marx, D.: Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms. In: Lokshtanov, D., Nishimura, N. (eds.) 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, September 6\u20138, 2017, Vienna, Austria, volume 89 of LIPIcs, pp. 7:1\u20137:13. Schloss Dagstuhl\u2014Leibniz-Zentrum fuer Informatik (2017)"},{"key":"568_CR7","unstructured":"Bonnet, \u00c9., Brettell, N., Kwon, O., Marx, D.: Generalized feedback vertex set problems on bounded-treewidth graphs: chordality is the key to single-exponential parameterized algorithms. CoRR, \n                    arXiv:1704.06757\n                    \n                   (2017)"},{"key":"568_CR8","doi-asserted-by":"crossref","unstructured":"Bonnet, \u00c9., Rz\u0105\u017cewski, P.: Optimality program in segment and string graphs. In: Brandst\u00e4dt, A., K\u00f6hler, E., Meer, K. (eds.) Graph-Theoretic Concepts in Computer Science\u201444th International Workshop, WG 2018, Cottbus, Germany, June 27\u201329, 2018, Proceedings, volume 11159 of Lecture Notes in Computer Science, pp. 79\u201390. Springer (2018)","DOI":"10.1007\/978-3-030-00256-5_7"},{"issue":"2","key":"568_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.7155\/jgaa.00091","volume":"8","author":"JM Boyer","year":"2004","unstructured":"Boyer, J.M., Myrvold, W.J.: On the cutting edge: simplified \n                    \n                      \n                    \n                    $$O(n)$$\n                    \n                      \n                        \n                          O\n                          (\n                          n\n                          )\n                        \n                      \n                    \n                   planarity by edge addition. J. Graph Algorithms Appl. 8(2), 241\u2013273 (2004)","journal-title":"J. Graph Algorithms Appl."},{"issue":"5\/6","key":"568_CR10","first-page":"263","volume":"22","author":"A Brandst\u00e4dt","year":"1986","unstructured":"Brandst\u00e4dt, A., Kratsch, D.: On partitions of permutations into increasing and decreasing subsequences. Elektronische Informationsverarbeitung und Kybernetik 22(5\/6), 263\u2013273 (1986)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"issue":"3","key":"568_CR11","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. Discrete Comput. Geom. 50(3), 771\u2013783 (2013)","journal-title":"Discrete Comput. Geom."},{"key":"568_CR12","unstructured":"Cern\u00fd, J., Kr\u00e1l, D., Nyklov\u00e1, H., Pangr\u00e1c, O.: On intersection graphs of segments with prescribed slopes. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) Graph Drawing, 9th International Symposium, GD 2001 Vienna, Austria, September 23\u201326, 2001, Revised Papers, volume 2265 of Lecture Notes in Computer Science, pp. 261\u2013271. Springer (2001)"},{"key":"568_CR13","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, May 31\u2013June 2, 2009, pp. 631\u2013638 (2009)"},{"issue":"3","key":"568_CR14","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. Discrete Math. 18(3), 501\u2013511 (2004)","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"568_CR15","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 \n                    \n                      \n                    \n                    $${H}$$\n                    \n                      \n                        H\n                      \n                    \n                  -minor-free graphs. J. ACM 52(6), 866\u2013893 (2005)","journal-title":"J. ACM"},{"issue":"3","key":"568_CR16","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":"568_CR17","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":"568_CR18","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Hajiaghayi, M.T.: Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth. In: GD 2014 Proceedings, pp. 517\u2013533 (2004)","DOI":"10.1007\/978-3-540-31843-9_57"},{"key":"568_CR19","first-page":"49","volume-title":"A Combinatorial Problem in Geometry","author":"P Erd\u0151s","year":"1987","unstructured":"Erd\u0151s, P., Szekeres, G.: A Combinatorial Problem in Geometry, pp. 49\u201356. Birkh\u00e4user, Boston (1987)"},{"key":"568_CR20","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, \n                    arXiv:1704.07279\n                    \n                   (2017)"},{"key":"568_CR21","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S.: Bidimensionality and geometric graphs. In: Rabani, Y., (ed.) Proceedings of the twenty-third annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17\u201319, 2012, pp. 1563\u20131575. SIAM (2012)"},{"key":"568_CR22","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, January 23\u201325, 2011, pp. 1161\u20131165 (2011)"},{"key":"568_CR23","doi-asserted-by":"crossref","unstructured":"Fox, J., Pach, J.: Applications of a new separator theorem for string graphs. CoRR, \n                    arXiv:1302.7228\n                    \n                   (2013)","DOI":"10.1017\/S0963548313000412"},{"issue":"1","key":"568_CR24","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)","journal-title":"J. Comb. Theory Ser. B"},{"key":"568_CR25","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, January 7\u201310, 2018, pp. 172\u2013184. SIAM (2018)"},{"key":"568_CR26","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: Quasi-polynomial time approximation scheme for sparse subsets of polygons. In: 30th Annual Symposium on Computational Geometry, SOCG\u201914, Kyoto, Japan, June 08\u201311, 2014, pp. 120 (2014)","DOI":"10.1145\/2582112.2582157"},{"issue":"2","key":"568_CR27","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"568_CR28","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)","journal-title":"J. Comput. Syst. Sci."},{"key":"568_CR29","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)"},{"issue":"1","key":"568_CR30","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)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"568_CR31","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)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"568_CR32","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Comb. Theory Ser. B 62(2), 289\u2013315 (1994)","journal-title":"J. Comb. Theory Ser. B"},{"key":"568_CR33","unstructured":"Lee, J.R.: Separators in region intersection graphs. CoRR, \n                    arXiv:1608.01612\n                    \n                   (2016)"},{"issue":"3","key":"568_CR34","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)","journal-title":"SIAM J. Comput."},{"key":"568_CR35","doi-asserted-by":"crossref","unstructured":"Marx, D.: Parameterized complexity of independence and domination on geometric graphs. In: Parameterized and Exact Computation, Second International Workshop, IWPEC 2006, Z\u00fcrich, Switzerland, September 13\u201315, 2006, Proceedings, pp. 154\u2013165 (2006)","DOI":"10.1007\/11847250_14"},{"key":"568_CR36","doi-asserted-by":"crossref","unstructured":"Marx, D., Pilipczuk, M.: Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. In: Bansal, N., Finocchi, I. (eds) ESA 2015 Proceedings, volume 9294 of LNCS, pp. 865\u2013877. Springer (2015)","DOI":"10.1007\/978-3-662-48350-3_72"},{"key":"568_CR37","doi-asserted-by":"crossref","unstructured":"Marx, D., Pilipczuk, M.: Optimal parameterized algorithms for planar facility location problems using Voronoi diagrams. CoRR, \n                    arXiv:1504.05476\n                    \n                   (2015)","DOI":"10.1007\/978-3-662-48350-3_72"},{"key":"568_CR38","unstructured":"Matou\u0161ek, J.: Intersection graphs of segments and \n                    \n                      \n                    \n                    $$\\exists \\mathbb{R}$$\n                    \n                      \n                        \n                          \u2203\n                          R\n                        \n                      \n                    \n                  . CoRR, \n                    arXiv:1406.2636\n                    \n                   (2014)"},{"issue":"1","key":"568_CR39","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)","journal-title":"Comb. Probab. Comput."},{"issue":"1","key":"568_CR40","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)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"568_CR41","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)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"2","key":"568_CR42","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)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"568_CR43","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)","journal-title":"Theory Comput. Syst."},{"key":"568_CR44","unstructured":"Scheinerman, E.: Intersection classes and multiple intersection parameters of graphs. PhD thesis, Princeton University (1984)"},{"key":"568_CR45","unstructured":"Smith, W.D., Wormald, N.C.: Geometric separator theorems and applications. In: FOCS 1998 Proceedings, pp. 232\u2013243, Washington, DC, USA, 1998. IEEE Computer Society"},{"issue":"1","key":"568_CR46","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","volume":"8","author":"CA Tovey","year":"1984","unstructured":"Tovey, C.A.: A simplified NP-complete satisfiability problem. Discrete Appl. Math. 8(1), 85\u201389 (1984)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"568_CR47","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)","journal-title":"J. Graph Theory"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00568-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00568-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00568-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T23:16:57Z","timestamp":1586042217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00568-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,6]]},"references-count":47,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["568"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00568-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,6]]},"assertion":[{"value":"27 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}