{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:20:45Z","timestamp":1787322045249,"version":"build-2736575974"},"reference-count":23,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>Intersection graphs of geometric objects have been extensively studied, due to both their interesting structure and their numerous applications; prominent examples include interval graphs and permutation graphs. In this paper we study a natural graph class that generalizes both interval and permutation graphs, namely simple-triangle graphs. Simple-triangle graphs---also known as PI (point-interval) graphs---are the intersection graphs of triangles that are defined by a point on a line $L_{1}$ and an interval on a parallel line $L_{2}$. They lie naturally between permutation and trapezoid graphs, which are the intersection graphs of line segments between $L_{1}$ and $L_{2}$ and of trapezoids between $L_{1}$ and $L_{2}$, respectively. Although various efficient recognition algorithms for permutation and trapezoid graphs are well known to exist, the recognition of simple-triangle graphs has remained an open problem since their introduction by Corneil and Kamula three decades ago. In this paper we resolve this problem by proving that simple-triangle graphs can be recognized in polynomial time. Given a graph $G$ with $n$ vertices, such that its complement $\\overline{G}$ has $m$ edges, our algorithm runs in $O(n^{2}m)$ time. As a consequence, our algorithm also solves a longstanding open problem in the area of partial orders, namely, the recognition of linear-interval orders, i.e., of partial orders $P=P_{1}\\cap P_{2}$, where $P_{1}$ is a linear order and $P_{2}$ is an interval order. This is one of the first results on recognizing partial orders $P$ that are the intersection of orders from two different classes $\\mathcal{P}_{1}$ and $\\mathcal{P}_{2}$. In complete contrast to this, partial orders $P$ which are the intersection of orders from the same class $\\mathcal{P}$ have been extensively investigated, and in most cases the complexity status of these recognition problems has been already established.<\/jats:p>","DOI":"10.1137\/140963108","type":"journal-article","created":{"date-parts":[[2015,7,16]],"date-time":"2015-07-16T16:01:39Z","timestamp":1437062499000},"page":"1150-1185","source":"Crossref","is-referenced-by-count":10,"title":["The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial"],"prefix":"10.1137","volume":"29","author":[{"given":"George B.","family":"Mertzios","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,7,16]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.45.11.1607"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(97)00043-5"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"A. Brandsta\u0308dt, V. B. Le, and J. P. Spinrad,\n                      Graph Classes: A Survey\n                      , SIAM, Philadelphia, 1999.","DOI":"10.1137\/1.9780898719796"},{"key":"atypb4","first-page":"37","author":"Carrano A. V.","year":"1988","journal-title":"New York"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/j.endm.2008.01.021"},{"key":"atypb6","first-page":"267","author":"Corneil D. G.","year":"1987","journal-title":"Graph Theory and Computing"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(88)90032-7"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1137\/0205048"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1995.2.139"},{"key":"atypb10","doi-asserted-by":"crossref","unstructured":"M. C. Golumbic,\n                      Algorithmic Graph Theory and Perfect Graphs\n                      , 2nd ed., Ann. of Discrete Math. 57, North-Holland, Amsterdam, 2004.","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"atypb11","doi-asserted-by":"crossref","unstructured":"M. C. Golumbic and A. N. Trenk,\n                      Tolerance Graphs\n                      , Cambridge Stud. Adv. Math., Cambridge University Press, Cambridge, UK, 2004.","DOI":"10.1017\/CBO9780511542985"},{"key":"atypb12","first-page":"125","author":"Hammer P. L.","year":"1981","journal-title":"Amsterdam"},{"key":"atypb13","first-page":"241","author":"Ibaraki T.","year":"1981","journal-title":"Amsterdam"},{"key":"atypb14","doi-asserted-by":"crossref","unstructured":"M. Kaufmann, J. Kratochvil, K. A. Lehmann, and A. R. Subramanian,\n                      Max-tolerance graphs as intersection graphs: Cliques, cycles, and recognition\n                      , in Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006, pp. 832-841.","DOI":"10.1145\/1109557.1109649"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1034"},{"key":"atypb16","unstructured":"N. Mahadev and U. N. Peled,\n                      Threshold Graphs and Related Topics\n                      , Ann. Discrete Math. 56, North-Holland, Amsterdam, 1995."},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.02.042"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9743-2"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1137\/090780328"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00026-2"},{"key":"atypb21","doi-asserted-by":"crossref","unstructured":"T. Raschle and K. Simon,\n                      Recognition of graphs with threshold dimension two\n                      , in Proceedings of the 27th ACM Symposium on Theory of Computing (STOC), 1995, pp. 650-661.","DOI":"10.1145\/225058.225283"},{"key":"atypb22","doi-asserted-by":"crossref","unstructured":"J. P. Spinrad,\n                      Efficient Graph Representations\n                      , Fields Instit. Monogr. 19, AMS, Providence, RI, 2003.","DOI":"10.1090\/fim\/019"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1137\/0603036"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/140963108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:17:27Z","timestamp":1787318247000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/140963108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/140963108"],"URL":"https:\/\/doi.org\/10.1137\/140963108","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}