{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T15:17:52Z","timestamp":1775229472810,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T00:00:00Z","timestamp":1194307200000},"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":[[2007,11,6]]},"DOI":"10.1145\/1321440.1321526","type":"proceedings-article","created":{"date-parts":[[2007,11,30]],"date-time":"2007-11-30T14:39:06Z","timestamp":1196433546000},"page":"613-622","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Finding dense and isolated submarkets in a sponsored search spending graph"],"prefix":"10.1145","author":[{"given":"Kevin J.","family":"Lang","sequence":"first","affiliation":[{"name":"Yahoo, Sunnyale, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reid","family":"Andersen","sequence":"additional","affiliation":[{"name":"University of California San Diego, La Jolla, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,11,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250910.1250950"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007355"},{"key":"e_1_3_2_1_3_1","volume-title":"Experimental Evaluation of Parametric Maximum Flow Algorithms. Workshop on Experimental Algorithms (WEA)","author":"Babenko M.","year":"2007"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.3.230"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/993483"},{"key":"e_1_3_2_1_6_1","volume-title":"Workshop on Large Scale Clustering at IEEE ICDM","author":"Joseph J.","year":"2003"},{"key":"e_1_3_2_1_7_1","first-page":"84","article-title":"Greedy approximation algorithms for finding dense components in a graph","author":"Charikar M.","year":"2000","journal-title":"APPROX"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009180"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502550"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081948"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.175.0420"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701387660"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"e_1_3_2_1_16_1","volume-title":"University of California","author":"Goldberg A. V.","year":"1984"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990313"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/645588.659619"},{"key":"e_1_3_2_1_19_1","volume-title":"Manuscript","author":"Kannan R.","year":"1999"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1032"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1101\/gr.648603"},{"key":"e_1_3_2_1_23_1","first-page":"325","volume-title":"IPCO","author":"Lang K.","year":"2003"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0047"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00472-9"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.1982.11731876"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/0611030"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.3.200"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_3_2_1_31_1","unstructured":"B. Zhang J. Ward and Q. Feng. A Simultaneous Maximum Flow Algorithm for the Selection Model INFORMS 2004.  B. Zhang J. Ward and Q. Feng. A Simultaneous Maximum Flow Algorithm for the Selection Model INFORMS 2004."}],"event":{"name":"CIKM07: Conference on Information and Knowledge Management","location":"Lisbon Portugal","acronym":"CIKM07","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","ACM Association for Computing Machinery","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the sixteenth ACM conference on Conference on information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1321440.1321526","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1321440.1321526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:56:33Z","timestamp":1750254993000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1321440.1321526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,6]]},"references-count":30,"alternative-id":["10.1145\/1321440.1321526","10.1145\/1321440"],"URL":"https:\/\/doi.org\/10.1145\/1321440.1321526","relation":{},"subject":[],"published":{"date-parts":[[2007,11,6]]},"assertion":[{"value":"2007-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}