{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:34:54Z","timestamp":1725744894233},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_61","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"719-730","source":"Crossref","is-referenced-by-count":1,"title":["The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial"],"prefix":"10.1007","author":[{"given":"George B.","family":"Mertzios","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"61_CR1","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1073\/pnas.45.11.1607","volume":"45","author":"S. Benzer","year":"1959","unstructured":"Benzer, S.: On the topology of the genetic fine structure. Proc.\u00a0of the National Academy of Sciences (PNAS)\u00a045, 1607\u20131620 (1959)","journal-title":"Proc.\u00a0of the National Academy of Sciences (PNAS)"},{"key":"61_CR2","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. In: Society for Industrial and Applied Mathematics (SIAM) (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"61_CR3","doi-asserted-by":"crossref","unstructured":"Carrano, A.V.: Establishing the order to human chromosome-specific DNA fragments. In: Biotechnology and the Human Genome, pp. 37\u201350. Plenum Press (1988)","DOI":"10.1007\/978-1-4684-5547-2_5"},{"key":"61_CR4","unstructured":"Corneil, D.G., Kamula, P.A.: Extensions of permutation and interval graphs. In: Proceedings of the 18th Southeastern Conference on Combinatorics, Graph Theory and Computing, pp. 267\u2013275 (1987)"},{"issue":"1","key":"61_CR5","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(88)90032-7","volume":"21","author":"I. Dagan","year":"1988","unstructured":"Dagan, I., Golumbic, M.C., Pinter, R.Y.: Trapezoid graphs and their coloring. Discrete Applied Mathematics\u00a021(1), 35\u201346 (1988)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"61_CR6","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"P.W. Goldberg","year":"1995","unstructured":"Goldberg, P.W., Golumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. Journal of Computational Biology\u00a02(1), 139\u2013152 (1995)","journal-title":"Journal of Computational Biology"},{"key":"61_CR7","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs, 2nd edn. Annals of Discrete Mathematics, vol.\u00a057. North-Holland Publishing Co. (2004)","DOI":"10.1016\/S0167-5060(04)80059-1"},{"key":"61_CR8","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Kratochvil, J., Lehmann, K.A., Subramanian, A.R.: Max-tolerance graphs as intersection graphs: cliques, cycles, and recognition. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 832\u2013841 (2006)","DOI":"10.1145\/1109557.1109649"},{"key":"61_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1006\/jagm.1994.1034","volume":"17","author":"T.-H. Ma","year":"1994","unstructured":"Ma, T.-H., Spinrad, J.P.: On the 2-chain subgraph cover and related problems. Journal of Algorithms\u00a017, 251\u2013268 (1994)","journal-title":"Journal of Algorithms"},{"key":"61_CR10","unstructured":"Mahadev, N., Peled, U.N.: Threshold Graphs and Related Topics. Annals of Discrete Mathematics, vol.\u00a056. North-Holland Publishing Co. (1995)"},{"key":"61_CR11","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2012.02.042","volume":"438","author":"G.B. Mertzios","year":"2012","unstructured":"Mertzios, G.B.: The recognition of triangle graphs. Theoretical Computer Science\u00a0438, 34\u201347 (2012)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"61_CR12","doi-asserted-by":"publisher","first-page":"1234","DOI":"10.1137\/090780328","volume":"40","author":"G.B. Mertzios","year":"2011","unstructured":"Mertzios, G.B., Sau, I., Zaks, S.: The recognition of tolerance and bounded tolerance graphs. SIAM Journal on Computing\u00a040(5), 1234\u20131257 (2011)","journal-title":"SIAM Journal on Computing"},{"key":"61_CR13","doi-asserted-by":"crossref","unstructured":"Raschle, T., Simon, K.: Recognition of graphs with threshold dimension two. In: Proceedings of the 27th ACM Symposium on Theory of Computing (STOC), pp. 650\u2013661 (1995)","DOI":"10.1145\/225058.225283"},{"key":"61_CR14","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient graph representations. Fields Institute Monographs, vol.\u00a019. American Mathematical Society (2003)","DOI":"10.1090\/fim\/019"},{"key":"61_CR15","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M. Yannakakis","year":"1982","unstructured":"Yannakakis, M.: The complexity of the partial order dimension problem. SIAM Journal on Algebraic and Discrete Methods\u00a03, 351\u2013358 (1982)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T13:04:58Z","timestamp":1558011898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}