{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T23:54:41Z","timestamp":1778025281259,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806740","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"359-368","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Sorting under partial information (without the ellipsoid algorithm)"],"prefix":"10.1145","author":[{"given":"Jean","family":"Cardinal","sequence":"first","affiliation":[{"name":"Universit\u00e9 Libre de Bruxelles (ULB), Brussels, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samuel","family":"Fiorini","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Libre de Bruxelles (ULB), Brussels, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gwena\u00ebl","family":"Joret","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Libre de Bruxelles (ULB), Brussels, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rapha\u00ebl M.","family":"Jungers","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology (MIT), Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Ian","family":"Munro","sequence":"additional","affiliation":[{"name":"University of Waterloo, Waterloo, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/993483"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01110378"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00383444"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-008-9152-2"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536430"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9062-1"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02122693"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90078-5"},{"key":"e_1_3_2_1_9_1","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic M. C.","year":"2004","unstructured":"M. C. Golumbic . Algorithmic Graph Theory and Perfect Graphs , 2 nd edition. Annals of Discrete Mathematics. Elsevier , 2004 . M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs, 2nd edition. Annals of Discrete Mathematics. Elsevier, 2004.","edition":"2"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201004"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1077"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01275670"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00565647"},{"key":"e_1_3_2_1_14_1","first-page":"411","volume-title":"Transactions of the 6th Prague Conference on Information Theory","author":"K\u00f6rner J.","year":"1973","unstructured":"J. K\u00f6rner . Coding of an information source having ambiguous alphabet and the entropy of graphs . In Transactions of the 6th Prague Conference on Information Theory , pages 411 -- 425 , 1973 . J. K\u00f6rner. Coding of an information source having ambiguous alphabet and the entropy of graphs. In Transactions of the 6th Prague Conference on Information Theory, pages 411--425, 1973."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0607062"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0401008"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213049"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(72)90006-4"},{"key":"e_1_3_2_1_19_1","series-title":"DIMACS Ser","first-page":"399","volume-title":"Combinatorial optimization (New Brunswick, NJ","author":"Simonyi G\u00e1bor","year":"1992","unstructured":"G\u00e1bor Simonyi . Graph entropy: a survey . In Combinatorial optimization (New Brunswick, NJ , 1992 --1993), volume 20 of DIMACS Ser . Discrete Math. Theoret. Comput. Sci., pages 399 -- 441 . Amer. Math. Soc., Providence, RI , 1995. G\u00e1bor Simonyi. Graph entropy: a survey. In Combinatorial optimization (New Brunswick, NJ, 1992--1993), volume 20 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 399--441. Amer. Math. Soc., Providence, RI, 1995."}],"event":{"name":"STOC'10: Symposium on Theory of Computing","location":"Cambridge Massachusetts USA","acronym":"STOC'10","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806740","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806740","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806740"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":19,"alternative-id":["10.1145\/1806689.1806740","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806740","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}