{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T03:57:18Z","timestamp":1777607838952,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s00453-009-9386-0","type":"journal-article","created":{"date-parts":[[2010,1,11]],"date-time":"2010-01-11T11:56:24Z","timestamp":1263210984000},"page":"119-136","source":"Crossref","is-referenced-by-count":42,"title":["Assigning Papers to Referees"],"prefix":"10.1007","volume":"58","author":[{"given":"Naveen","family":"Garg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Telikepalli","family":"Kavitha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kurt","family":"Mehlhorn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juli\u00e1n","family":"Mestre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,1,12]]},"reference":[{"key":"9386_CR1","unstructured":"Linklings: http:\/\/www.linklings.com\/"},{"key":"9386_CR2","unstructured":"Softconf: http:\/\/www.softconf.com\/"},{"issue":"4","key":"9386_CR3","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.2307\/2938172","volume":"59","author":"A. Alkan","year":"1991","unstructured":"Alkan, A., Demange, G., Gale, D.: Fair allocation of indivisible goods and criteria of justice. Econometrica 59(4), 1023\u20131039 (1991)","journal-title":"Econometrica"},{"key":"9386_CR4","unstructured":"Apers, P.: Acceptance rates major database conferences. http:\/\/wwwhome.cs.utwente.nl\/~apers\/rates.html"},{"issue":"3","key":"9386_CR5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1120680.1120683","volume":"5","author":"I. Bez\u00e1kov\u00e1","year":"2005","unstructured":"Bez\u00e1kov\u00e1, I., Dani, V.: Allocating indivisible goods. SIGecom Exch. 5(3), 11\u201318 (2005)","journal-title":"SIGecom Exch."},{"issue":"2","key":"9386_CR6","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1006\/jeth.2000.2710","volume":"100","author":"A. Bogomolnaia","year":"2001","unstructured":"Bogomolnaia, A., Moulin, H.: A new solution to the random assignment problem. J. Econ. Theory 100(2), 295\u2013328 (2001)","journal-title":"J. Econ. Theory"},{"issue":"3","key":"9386_CR7","first-page":"257","volume":"75","author":"A. Bogomolnaia","year":"2004","unstructured":"Bogomolnaia, A., Moulin, H.: A simple random assignment problem with a unique solution. Econ. Theory 75(3), 257\u2013279 (2004)","journal-title":"Econ. Theory"},{"key":"9386_CR8","unstructured":"Chaudhuri, S.: Microsoft\u2019s academic conference management service. http:\/\/cmt.research.microsoft.com\/cmt\/"},{"issue":"4","key":"9386_CR9","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/mnsc.1040.0290","volume":"51","author":"W. Cook","year":"2005","unstructured":"Cook, W., Golany, B., Kress, M., Penn, M., Raviv, T.: Optimal allocation of proposals to reviewers to facilitate effective ranking. Manag. Sci. 51(4), 655\u2013661 (2005)","journal-title":"Manag. Sci."},{"key":"9386_CR10","first-page":"1192","volume":"254","author":"A. Ghouilla-Houri","year":"1962","unstructured":"Ghouilla-Houri, A.: Charact\u00e9risations des matrices totalment unimodulaires. C. R. Acad. Sci. Paris 254, 1192\u20131193 (1962)","journal-title":"C. R. Acad. Sci. Paris"},{"key":"9386_CR11","unstructured":"Goldsmith, J., Sloan, R.H.: The AI conference assignment problem. In: Proceedings of the Workshop on Preference Handling for Artificial Intelligence (2007)"},{"key":"9386_CR12","unstructured":"Halevi, S.: Websubrev, http:\/\/people.csail.mit.edu\/shaih\/websubrev\/"},{"issue":"3","key":"9386_CR13","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1111\/j.1540-5915.1999.tb00910.x","volume":"30","author":"D. Hartvigsen","year":"1999","unstructured":"Hartvigsen, D., Wei, J.C., Czuchlewski, R.: The conference paper-reviewer assignment problem. Decis. Sci. 30(3), 865\u2013876 (1999)","journal-title":"Decis. Sci."},{"issue":"4","key":"9386_CR14","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1145\/1198513.1198520","volume":"2","author":"R.W. Irving","year":"2006","unstructured":"Irving, R.W., Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: Rank-maximal matchings. ACM Trans. Algorithms 2(4), 602\u2013610 (2006)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"9386_CR15","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1021\/ie050478h","volume":"45","author":"S.L. Janak","year":"2005","unstructured":"Janak, S.L., Taylor, M.S., Floudas, C.A., Burka, M., Mountzizris, T.J.: Novel and effective integer optimization approach for the NSF panel-assignment problem. Ind. Eng. Chem. Res. 45(1), 258\u2013265 (2005)","journal-title":"Ind. Eng. Chem. Res."},{"key":"9386_CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"issue":"1","key":"9386_CR17","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.jet.2005.05.001","volume":"131","author":"A.-K. Katta","year":"2005","unstructured":"Katta, A.-K., Sethuraman, J.: A solution to the random assignment problem on the full preference domain. J. Econ. Theory 131(1), 231\u2013250 (2005)","journal-title":"J. Econ. Theory"},{"key":"9386_CR18","unstructured":"Kohler, E.: HotCRP. http:\/\/www.cs.ucla.edu\/~kohler\/hotcrp\/"},{"key":"9386_CR19","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46, 259\u2013271 (1990)","journal-title":"Math. Program."},{"key":"9386_CR20","unstructured":"Mehlhorn, K., Michail, D.: Network problems with non-polynomial weights and applications. Manuscript"},{"key":"9386_CR21","doi-asserted-by":"crossref","unstructured":"Merelo-Gurv\u00f3s, J.J., Castillo-Valdivieso, P.: Conference paper assignment using a combined greedy\/evolutionary algorithm. In: Proceedings of Parallel Problem Solving from Nature, pp. 602\u2013611 (2004)","DOI":"10.1007\/978-3-540-30217-9_61"},{"key":"9386_CR22","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2954.001.0001","volume-title":"Fair Division and Collective Welfare","author":"H. Moulin","year":"2003","unstructured":"Moulin, H.: Fair Division and Collective Welfare. MIT Press, Cambridge (2003)"},{"key":"9386_CR23","unstructured":"O\u2019Dell, R., Wattenhofer, M., Wattenhofer, R.: The paper assignment problem. Technical Report 491, ETH Z\u00fcrich (2005)"},{"issue":"2","key":"9386_CR24","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0190(81)90009-0","volume":"12","author":"Y. Shiloach","year":"1981","unstructured":"Shiloach, Y.: Another look at the degree constrained subgraph problem. Inf. Process. Lett. 12(2), 89\u201392 (1981)","journal-title":"Inf. Process. Lett."},{"key":"9386_CR25","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D.B. Shmoys","year":"1993","unstructured":"Shmoys, D.B., Tardos, \u00c9.: An approximation algorithm for the generalized assignment problem. Math. Program. 62, 461\u2013474 (1993)","journal-title":"Math. Program."},{"issue":"4","key":"9386_CR26","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/s003550050160","volume":"16","author":"L.-G. Svensson","year":"1999","unstructured":"Svensson, L.-G.: Strategy-proof allocation of indivisible goods. Social Welf. Choice 16(4), 557\u2013567 (1999)","journal-title":"Social Welf. Choice"},{"key":"9386_CR27","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1017\/S0266267100000237","volume":"16","author":"B. Tungodden","year":"2000","unstructured":"Tungodden, B.: Egalitarianism: Is leximin the only option? Econ. Philos. 16, 229\u2013245 (2000)","journal-title":"Econ. Philos."},{"key":"9386_CR28","unstructured":"Voronkov, A.: Personal communication"},{"key":"9386_CR29","unstructured":"Voronkov, A.: Easychair. http:\/\/www.easychair.org"},{"key":"9386_CR30","unstructured":"Voronkov, A.: Easychair\u2014users. http:\/\/www.easychair.org\/users.cgi"},{"key":"9386_CR31","doi-asserted-by":"crossref","unstructured":"Wang, F., Chen, B., Miao, Z.: A survey on reviewer assignment problem. In: Proceedings of the 21st International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, pp. 718\u2013727 (2008)","DOI":"10.1007\/978-3-540-69052-8_75"},{"issue":"1","key":"9386_CR32","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0022-0531(90)90070-Z","volume":"52","author":"L. Zhou","year":"1990","unstructured":"Zhou, L.: On a conjecture by Gale about one-sided matching problems. J. Econ. Theory 52(1), 123\u2013135 (1990)","journal-title":"J. Econ. Theory"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s00453-009-9386-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T22:12:12Z","timestamp":1558735932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9386-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,12]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["9386"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9386-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,12]]}}}