{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:10:01Z","timestamp":1751879401569,"version":"3.41.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,6,1]],"date-time":"2000-06-01T00:00:00Z","timestamp":959817600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Order"],"published-print":{"date-parts":[[2000,6]]},"DOI":"10.1023\/a:1006422023869","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T02:03:28Z","timestamp":1040522608000},"page":"179-193","source":"Crossref","is-referenced-by-count":3,"title":["On the Complexity of Partial Order Properties"],"prefix":"10.1007","volume":"17","author":[{"given":"Stefan","family":"Felsner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Kant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"277419_CR1","volume-title":"Combinatorial Search","author":"M. Aigner","year":"1988","unstructured":"Aigner, M. (1988) Combinatorial Search, Wiley-Teubner, Stuttgart."},{"key":"277419_CR2","first-page":"1231","volume-title":"Handbook of Combinatorics, Vol. II","author":"B. Bollobas","year":"1995","unstructured":"Bollobas, B. (1995) Extremal graph theory, in R. Graham, M. Groetschel and L. Lov\u00e1sz (eds), Handbook of Combinatorics, Vol. II, Elsevier, Amsterdam, pp. 1231\u20131292."},{"key":"277419_CR3","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0217007","volume":"17","author":"U. Faigle","year":"1988","unstructured":"Faigle, U. and Tur\u00e1n, Gy. (1988) Sorting and recognition problems for ordered sets, SIAM J. Comp.\n17, 100\u2013113.","journal-title":"SIAM J. Comp."},{"key":"277419_CR4","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/3-540-56402-0_50","volume-title":"Proc. 18th Int. Workshop Graph-Theoret. Concepts Comput. Sci., LNCS, Vol. 657","author":"S. Felsner","year":"1993","unstructured":"Felsner, S. and Wagner, D. (1993) On the complexity of partial order properties, in Proc. 18th Int. Workshop Graph-Theoret. Concepts Comput. Sci., LNCS, Vol. 657, Springer, New York, pp. 225\u2013235."},{"key":"277419_CR5","volume-title":"Interval Orders and Interval Graphs","author":"P.C. Fishburn","year":"1985","unstructured":"Fishburn, P.C. (1985) Interval Orders and Interval Graphs, John Wiley & Sons, New York."},{"key":"277419_CR6","first-page":"266","volume-title":"Proc. 9th Int. Conf. Fundamentals of Comput. Theory, LNCS, Vol. 710","author":"H.D. Gr\u00f6ger","year":"1993","unstructured":"Gr\u00f6ger, H.D. (1993) Does transitivity help? On the complexity of poset properties, in Proc. 9th Int. Conf. Fundamentals of Comput. Theory, LNCS, Vol. 710, Springer, New York, pp. 266\u2013278."},{"key":"277419_CR7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF02579140","volume":"4","author":"J. Kahn","year":"1984","unstructured":"Kahn, J., Saks, M. and Sturtevant, D. (1984) A topological approach to evasiveness, Combinatorica\n4, 297\u2013306.","journal-title":"Combinatorica"},{"key":"277419_CR8","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/0304-3975(76)90053-0","volume":"3","author":"R.L. Rivest","year":"1976","unstructured":"Rivest, R.L. and Vuillemin, J. (1976) On recognizing graph properties from adjacency matrices, Theor. Comp. Science\n3, 371\u2013384.","journal-title":"Theor. Comp. Science"},{"key":"277419_CR9","first-page":"525","volume-title":"Handbook of Theoretical Computer Science, Algorithms and Complexity","author":"J. Van Leeuwen","year":"1990","unstructured":"Van Leeuwen, J. (1990) Graph algorithms, in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Algorithms and Complexity, Elsevier, Amsterdam, pp. 525\u2013632."}],"container-title":["Order"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1006422023869.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1006422023869\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1006422023869.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T08:51:00Z","timestamp":1751878260000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1006422023869"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,6]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,6]]}},"alternative-id":["277419"],"URL":"https:\/\/doi.org\/10.1023\/a:1006422023869","relation":{},"ISSN":["0167-8094","1572-9273"],"issn-type":[{"type":"print","value":"0167-8094"},{"type":"electronic","value":"1572-9273"}],"subject":[],"published":{"date-parts":[[2000,6]]}}}