{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:44:49Z","timestamp":1781077489630,"version":"3.54.1"},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3607,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0022-0000(03)00045-x","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T01:09:12Z","timestamp":1052788152000},"page":"365-380","source":"Crossref","is-referenced-by-count":78,"title":["Recognizing string graphs in NP"],"prefix":"10.1016","volume":"67","author":[{"given":"Marcus","family":"Schaefer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Sedgwick","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"\u0160tefankovi\u010d","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00045-X_BIB1","doi-asserted-by":"crossref","first-page":"1607","DOI":"10.1073\/pnas.45.11.1607","article-title":"On the topology of the genetic fine structure","volume":"45","author":"Benzer","year":"1959","journal-title":"Proc. Nat. Acad. Sci."},{"key":"10.1016\/S0022-0000(03)00045-X_BIB2","doi-asserted-by":"crossref","unstructured":"Z.-Z. Chen, M. Grigni, C. Papadimitriou, Planar map graphs, in: Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), ACM Press, New York, pp. 514\u2013523, 1998.","DOI":"10.1145\/276698.276865"},{"key":"10.1016\/S0022-0000(03)00045-X_BIB3","unstructured":"V. Diekert, Personal communication, 2002."},{"key":"10.1016\/S0022-0000(03)00045-X_BIB4","doi-asserted-by":"crossref","unstructured":"V. Diekert, C. Guti\u00e9rrez, C. Hagenah, Existential theory of equations with rational constraints in free groups is PSPACE-complete, in: Proceedings of the 18th International Symposium on Theoretical Aspects of Computer Science, STACS 2001, pp. 170\u2013182.","DOI":"10.1007\/3-540-44693-1_15"},{"key":"10.1016\/S0022-0000(03)00045-X_BIB5","doi-asserted-by":"crossref","unstructured":"V. Diekert, Y. Matiyasevich, A. Muscholl, Solving trace equations using lexicographical normal forms, in: Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP\u201997), Bologna, Italy, 1997, Springer, Berlin-Heidelberg-New York, pp. 336\u2013346. URL citeseer.nj.nec.com\/diekert97solving.html.","DOI":"10.1007\/3-540-63165-8_190"},{"key":"10.1016\/S0022-0000(03)00045-X_BIB6","article-title":"Partial commutation and traces","volume":"Vol. III","author":"Diekert","year":"1997"},{"key":"10.1016\/S0022-0000(03)00045-X_BIB7","doi-asserted-by":"crossref","unstructured":"V. Diekert, A. Muscholl, Solvability of equations in free partially commutative groups is decidable, in: ICALP 2001, pp. 543\u2013554.","DOI":"10.1007\/3-540-48224-5_45"},{"key":"10.1016\/S0022-0000(03)00045-X_BIB8","unstructured":"B. Farb, B. Thurston, Homeomorphisms and simple closed curves, unpublished manuscript, 1991."},{"issue":"3","key":"10.1016\/S0022-0000(03)00045-X_BIB9","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","article-title":"Crossing number is NP-complete","volume":"4","author":"Garey","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0022-0000(03)00045-X_BIB10","doi-asserted-by":"crossref","unstructured":"L. Ga\u0327sieniec, M. Karpinski, W. Plandowski, W. Rytter, Efficient algorithms for Lempel-Ziv encoding, in: Proceedings of SWAT\u201996, Lecture Notes in Computer Science, Vol. 1097, 1996, pp. 392\u2013403.","DOI":"10.1007\/3-540-61422-2_148"},{"key":"10.1016\/S0022-0000(03)00045-X_BIB11","unstructured":"R.L. Graham, Problem 1, in: Open Problems at 5th Hungarian Colloquium on Combinatorics, 1996."},{"key":"10.1016\/S0022-0000(03)00045-X_BIB12","unstructured":"M. Grigni, D. Papadias, C. Papadimitriou, Topological inference, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence, 1995, pp. 901\u2013906."},{"key":"10.1016\/S0022-0000(03)00045-X_BIB13","doi-asserted-by":"crossref","DOI":"10.1016\/0095-8956(91)90090-7","article-title":"String Graphs. I. The number of critical nonstring graphs is infinite","volume":"52","author":"Kratochv\u0131\u0301l","year":"1991","journal-title":"J. Combin. Theory, Series B"},{"key":"10.1016\/S0022-0000(03)00045-X_BIB14","doi-asserted-by":"crossref","DOI":"10.1016\/0095-8956(91)90091-W","article-title":"String graphs. II. Recognizing string graphs is NP-hard","volume":"52","author":"Kratochv\u0131\u0301l","year":"1991","journal-title":"J. Combin. Theory, Series B"},{"key":"10.1016\/S0022-0000(03)00045-X_BIB15","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/3-540-37623-2_18","article-title":"Crossing number of abstract topological graphs","volume":"1547","author":"Kratochv\u0131\u0301l","year":"1998","journal-title":"Lecture Notes in Comput. Sci."},{"key":"10.1016\/S0022-0000(03)00045-X_BIB16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(91)90050-T","article-title":"String graphs requiring exponential representations","volume":"53","author":"Kratochv\u0131\u0301l","year":"1991","journal-title":"J. Combin. Theory, Series B"},{"key":"10.1016\/S0022-0000(03)00045-X_BIB17","article-title":"Algebraic Combinatorics on Words","volume":"Vol. 90","author":"Lothaire","year":"2002"},{"issue":"4","key":"10.1016\/S0022-0000(03)00045-X_BIB18","first-page":"703","article-title":"On polynomial time decidability of induced-minor-closed classes","volume":"29","author":"Matou\u0161ek","year":"1988","journal-title":"Comment. Math. Univ. Carolin."},{"key":"10.1016\/S0022-0000(03)00045-X_BIB19","doi-asserted-by":"crossref","unstructured":"A. Mazurkiewicz, Introduction to trace theory, in: V. Diekert, G. Rozenberg (Eds.), The Book of Traces, World Scientific, Singapore, Chapter 1, 1995, pp. 3\u201341.","DOI":"10.1142\/9789814261456_0001"},{"key":"10.1016\/S0022-0000(03)00045-X_BIB20","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1006\/jctb.2000.1978","article-title":"Which crossing number is it anyway?","volume":"80","author":"Pach","year":"2000","journal-title":"J. Combin. Theory, Series B"},{"key":"10.1016\/S0022-0000(03)00045-X_BIB21","doi-asserted-by":"crossref","unstructured":"J. Pach, G. T\u00f3th, Recognizing string graphs is decidable, in: P. Mutzel (Ed.), Graph Drawing 2001, Lecture Notes in Computer Science, Springer, Berlin, pp. 247\u2013260.","DOI":"10.1007\/3-540-45848-4_20"},{"key":"10.1016\/S0022-0000(03)00045-X_BIB22","doi-asserted-by":"crossref","unstructured":"W. Plandowski, W. Rytter, Application of Lempel\u2013Ziv encodings to the solution of words equations, Automata, Languages and Programming (1998), 731\u2013742.","DOI":"10.1007\/BFb0055097"},{"key":"10.1016\/S0022-0000(03)00045-X_BIB23","doi-asserted-by":"crossref","unstructured":"J.M. Robson, V. Diekert, On quadratic word equations, in: C. Meinel et al. (Eds.), 16th STACS, Trier, 1999, Lecture Notes in Computer Science, Vol. 1563, Springer-Verlag, Berlin, pp. 217\u2013226.","DOI":"10.1007\/3-540-49116-3_20"},{"key":"10.1016\/S0022-0000(03)00045-X_BIB24","doi-asserted-by":"crossref","unstructured":"M. Schaefer, D. \u0160tefankovi\u010d, Decidability of String Graphs, in: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC-2001), pp. 241\u2013246.","DOI":"10.1145\/380752.380807"},{"key":"10.1016\/S0022-0000(03)00045-X_BIB25","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1002\/j.1538-7305.1966.tb01713.x","article-title":"Topology of thin film circuits","volume":"45","author":"Sinden","year":"1966","journal-title":"Bell System Tech. J."},{"key":"10.1016\/S0022-0000(03)00045-X_BIB26","doi-asserted-by":"crossref","unstructured":"M. Thorup, Map graphs in polynomial time, in: IEEE Symposium on Foundations of Computer Science, pp. 396\u2013405, 1998.","DOI":"10.1109\/SFCS.1998.743490"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200000300045X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200000300045X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T21:48:02Z","timestamp":1584654482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002200000300045X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S002200000300045X"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00045-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}