{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T16:27:13Z","timestamp":1758126433778,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T00:00:00Z","timestamp":1574380800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T00:00:00Z","timestamp":1574380800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1007\/s11083-019-09510-6","type":"journal-article","created":{"date-parts":[[2019,11,22]],"date-time":"2019-11-22T12:02:56Z","timestamp":1574424176000},"page":"371-387","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A New Characterization of $\\mathcal {V}$-Posets"],"prefix":"10.1007","volume":"37","author":[{"given":"Joshua","family":"Cooper","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9249-4930","authenticated-orcid":false,"given":"Peter","family":"Gartland","sequence":"additional","affiliation":[]},{"given":"Hays","family":"Whitlatch","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,22]]},"reference":[{"key":"9510_CR1","doi-asserted-by":"crossref","unstructured":"Bergeron, A.: A Very Elementary Presentation of the Hannenhalli-Pevzner Theory. In: Annual Symposium on Combinatorial Pattern Matching, pp. 106\u2013117. Springer (2001)","DOI":"10.1007\/3-540-48194-X_9"},{"issue":"3","key":"9510_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF00383444","volume":"8","author":"G Brightwell","year":"1991","unstructured":"Brightwell, G., Winkler, P.: Counting linear extensions. Order 8(3), 225\u2013242 (1991)","journal-title":"Order"},{"key":"9510_CR3","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.laa.2015.11.001","volume":"490","author":"J Cooper","year":"2016","unstructured":"Cooper, J., Davis, J.: Successful pressing sequences for a bicolored graph and binary matrices. Linear Algebra Appl. 490, 162\u2013173 (2016)","journal-title":"Linear Algebra Appl."},{"key":"9510_CR4","doi-asserted-by":"crossref","unstructured":"Cooper, J., Whitlatch, H.: Uniquely pressable graphs: characterization, enumeration, and recognition. Advances in Applied Mathematics, to appear. Preprint at arXiv:1706.07468 (2018)","DOI":"10.1016\/j.aam.2018.09.005"},{"issue":"1","key":"9510_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/300515.300516","volume":"46","author":"S Hannenhalli","year":"1999","unstructured":"Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM (JACM) 46(1), 1\u201327 (1999)","journal-title":"J. ACM (JACM)"},{"key":"9510_CR6","doi-asserted-by":"crossref","unstructured":"Hartman, T., Verbin, E.: Matrix Tightness: a Linear-Algebraic Framework for Sorting by Transpositions. In: String Processing and Information Retrieval, Lecture Notes in Comput. Sci., Vol. 4209, pp. 279-290. Springer, Berlin (2006)","DOI":"10.1007\/11880561_23"},{"key":"9510_CR7","unstructured":"Harvey, D., Van Der Hoeven, J.: Integer multiplication in time O(n log n). https:\/\/hal.archives-ouvertes.fr\/hal-02070778. Preprint (2019)"},{"issue":"3-4","key":"9510_CR8","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1007\/s10801-017-0761-7","volume":"46","author":"T Hasebe","year":"2017","unstructured":"Hasebe, T., Tsujie, S.: Order quasisymmetric functions distinguish rooted trees. J. Algebraic Comb. 46(3-4), 499\u2013515 (2017)","journal-title":"J. Algebraic Comb."},{"key":"9510_CR9","unstructured":"Misanantenaina, V.R., Wagner, S.: A tutte-like polynomial for rooted trees and specific posets. arXiv:1803.09623 (2018)"},{"key":"9510_CR10","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.H.: Computationally Tractable Classes of Ordered Sets. In: Algorithms and Order (Ottawa, ON, 1987), pp. 105\u2013193. Kluwer Acad. Publ., Dordrecht (1989)","DOI":"10.1007\/978-94-009-2639-4_4"},{"issue":"1","key":"9510_CR11","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0890-5401(89)90067-9","volume":"82","author":"A Sinclair","year":"1989","unstructured":"Sinclair, A., Jerrum, M.: Approximate counting, uniform generation and rapidly mixing Markov chains. Inform. and Comput. 82(1), 93\u2013133 (1989)","journal-title":"Inform. and Comput."},{"key":"9510_CR12","doi-asserted-by":"crossref","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. In: Proceedings of the eleventh annual ACM symposium on Theory of computing, pp. 1\u201312. ACM (1979)","DOI":"10.1145\/800135.804393"},{"issue":"2","key":"9510_CR13","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J Valdes","year":"1982","unstructured":"Valdes, J., Tarjan, R.E., Lawler, E.L.: The recognition of series parallel digraphs. SIAM J. Comput. 11(2), 298\u2013313 (1982)","journal-title":"SIAM J. Comput."}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-019-09510-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11083-019-09510-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11083-019-09510-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,21]],"date-time":"2020-11-21T00:24:28Z","timestamp":1605918268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11083-019-09510-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,22]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,7]]}},"alternative-id":["9510"],"URL":"https:\/\/doi.org\/10.1007\/s11083-019-09510-6","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"type":"print","value":"0167-8094"},{"type":"electronic","value":"1572-9273"}],"subject":[],"published":{"date-parts":[[2019,11,22]]},"assertion":[{"value":"18 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}