{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:56Z","timestamp":1740109316357,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T00:00:00Z","timestamp":1627257600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T00:00:00Z","timestamp":1627257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s00453-021-00857-0","type":"journal-article","created":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T20:03:28Z","timestamp":1627329808000},"page":"3338-3362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Recognizing k-Clique Extendible Orderings"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0498-7856","authenticated-orcid":false,"given":"Mathew","family":"Francis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rian","family":"Neogi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,26]]},"reference":[{"issue":"2","key":"857_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1137\/130947374","volume":"45","author":"HL Bodlaender","year":"2016","unstructured":"Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A $$c^kn$$ 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317\u2013378 (2016)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. Monographs on discrete mathematics and applications. Soc Indust Appl Mathemat (1999)","key":"857_CR2","DOI":"10.1137\/1.9780898719796"},{"key":"857_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, \u0141, Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, vol. 3. Springer, Berlin (2015)"},{"doi-asserted-by":"crossref","unstructured":"Francis, M., Neogi, R., Raman, V.: Recognizing $$k$$-clique extendible orderings. In: Isolde A., Haiko M.(eds), Graph-Theoretic Concepts in Computer Science, volume 12301 of Lecture Notes in Computer Science, pages 274\u2013285, Cham, (2020). Springer International Publishing","key":"857_CR4","DOI":"10.1007\/978-3-030-60440-0_22"},{"key":"857_CR5","volume-title":"Martin: Algorithmic Graph Theory and Perfect Graphs","author":"C Golumbic","year":"2004","unstructured":"Golumbic, C.: Martin: Algorithmic Graph Theory and Perfect Graphs, vol. 57. Elsevier, Amsterdam (2004)"},{"unstructured":"Hamburger, P., McConnell, R.M., P\u00f3r, A., Spinrad, J.P., Xu, Z.: Double threshold digraphs. In: Potapov, I., Spirakis, P., and Worrell, J. (eds) 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), volume 117 of Leibniz International Proceedings in Informatics (LIPIcs), pages 69:1\u201369:12. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, (2018)","key":"857_CR6"},{"issue":"4","key":"857_CR7","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."},{"unstructured":"Lokshtanov, D., Marx, D., Saurabh, S.: Lower bounds based on the exponential time hypothesis. Bulletin of EATCS 3(105), 41\u201371 (2013)","key":"857_CR8"},{"issue":"2","key":"857_CR9","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jcss.2008.08.004","volume":"75","author":"M Mahajan","year":"2009","unstructured":"Mahajan, M., Raman, V., Sikdar, S.: Parameterizing above or below guaranteed values. J. Comput. Syst. Sci. 75(2), 137\u2013153 (2009)","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"McConnell, R.M., Spinrad, J.P.: Linear-time transitive orientation. In: Saks, M. E. (eds) Proceedings of the eighth annual ACM-SIAM symposium on discrete algorithms, pp 19\u201325. Society for Industrial and Applied Mathematics (1997)","key":"857_CR10"},{"doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H.: Algorithmic aspects of comparability graphs and interval graphs. In: Rival, I. (eds) Graphs and Order, pp. 41\u2013101. Springer (1985)","key":"857_CR11","DOI":"10.1007\/978-94-009-5315-4_2"},{"issue":"1","key":"857_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0208008","volume":"8","author":"J Opatrny","year":"1979","unstructured":"Opatrny, J.: Total ordering problem. SIAM J. Comput. 8(1), 111\u2013114 (1979)","journal-title":"SIAM J. Comput."},{"key":"857_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J. Algo. 7, 309\u2013322 (1986)","journal-title":"J. Algo."},{"key":"857_CR14","doi-asserted-by":"publisher","DOI":"10.1090\/fim\/019","volume-title":"Efficient Graph Representations","author":"JP Spinrad","year":"2003","unstructured":"Spinrad, J.P.: Efficient Graph Representations. American Mathematical Society, Providence (2003)"},{"key":"857_CR15","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2000","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, New Jersey (2000)","edition":"2"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00857-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-021-00857-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-021-00857-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,27]],"date-time":"2021-10-27T12:03:09Z","timestamp":1635336189000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-021-00857-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,26]]},"references-count":15,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["857"],"URL":"https:\/\/doi.org\/10.1007\/s00453-021-00857-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2021,7,26]]},"assertion":[{"value":"31 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}