SCOPUS 정보 검색 플랫폼

Algorithmica (New York)

Volumn 58, Issue 1, 2010, Pages 119-136

Assigning papers to referees

(5) Garg, Naveen a Kavitha, Telikepalli b Kumar, Amit a Mehlhorn, Kurt c Mestre, Julián c

a INDIAN INSTITUTE OF TECHNOLOGY DELHI (India)

b INDIAN INSTITUTE OF SCIENCE (India)

c MAX PLANCK INSTITUTE FOR INFORMATICS (Germany)

Author keywords

Fair assignment; Leximin principle; Rank maximal matchings

Indexed keywords

CONFERENCE MANAGEMENT; CONFERENCE PROGRAMS; LEXIMIN; MAXIMAL MATCHINGS; NP-HARD; PERSONAL PREFERENCES; POLYNOMIAL-TIME; PROGRAM COMMITTEE; REVIEW PROCESS;

COMPUTER SOFTWARE; POLYNOMIAL APPROXIMATION;

APPROXIMATION ALGORITHMS;

EID: 77953621104 PISSN: 01784617 EISSN: 14320541 Source Type: Journal
DOI: 10.1007/s00453-009-9386-0 Document Type: Article

Times cited : (110)

References (32)

1
- 84864170477
- Linklings
- Linklings: http://www.linklings.com/

2
- 84864162183
- Softconf
- Softconf: http://www.softconf.com/

3
- 0000391433
- Fair allocation of indivisible goods and criteria of justice
- 0734.90026 10.2307/2938172 1113545
- A. Alkan G. Demange D. Gale 1991 Fair allocation of indivisible goods and criteria of justice Econometrica 59 4 1023 1039 0734.90026 10.2307/2938172 1113545
- (1991) Econometrica , vol.59 , Issue.4 , pp. 1023-1039
- Alkan, A.¹ Demange, G.² Gale, D.³

4
- 84864162182
- Apers, P.: Acceptance rates major database conferences. http://wwwhome.cs.utwente.nl/~apers/rates.html
- Acceptance Rates Major Database Conferences
- Apers, P.¹

5
- 33750983897
- Allocating indivisible goods
- 10.1145/1120680.1120683
- I. Bezáková V. Dani 2005 Allocating indivisible goods SIGecom Exch. 5 3 11 18 10.1145/1120680.1120683
- (2005) SIGecom Exch. , vol.5 , Issue.3 , pp. 11-18
- Bezáková, I.¹ Dani, V.²

6
- 0035180456
- A new solution to the random assignment problem
- DOI 10.1006/jeth.2000.2710
- A. Bogomolnaia H. Moulin 2001 A new solution to the random assignment problem J. Econ. Theory 100 2 295 328 1134.91357 10.1006/jeth.2000.2710 1860037 (Pubitemid 33082653)
- (2001) Journal of Economic Theory , vol.100 , Issue.2 , pp. 295-328
- Bogomolnaia, A.¹ Moulin, H.²

7
- 70449088106
- A simple random assignment problem with a unique solution
- A. Bogomolnaia H. Moulin 2004 A simple random assignment problem with a unique solution Econ. Theory 75 3 257 279
- (2004) Econ. Theory , vol.75 , Issue.3 , pp. 257-279
- Bogomolnaia, A.¹ Moulin, H.²

8
- 84864170478
- Chaudhuri, S.: Microsoft's academic conference management service. http://cmt.research.microsoft.com/cmt/
- Microsoft's Academic Conference Management Service
- Chaudhuri, S.¹

9
- 22544435516
- Optimal allocation of proposals to reviewers to facilitate effective ranking
- DOI 10.1287/mnsc.1040.0290
- W. Cook B. Golany M. Kress M. Penn T. Raviv 2005 Optimal allocation of proposals to reviewers to facilitate effective ranking Manag. Sci. 51 4 655 661 10.1287/mnsc.1040.0290 (Pubitemid 41009659)
- (2005) Management Science , vol.51 , Issue.4 , pp. 655-661
- Cook, W.D.¹ Golany, B.² Kress, M.³ Penn, M.⁴ Raviv, T.⁵

10
- 0037761909
- Charactérisations des matrices totalment unimodulaires
- 132752
- A. Ghouilla-Houri 1962 Charactérisations des matrices totalment unimodulaires C. R. Acad. Sci. Paris 254 1192 1193 132752
- (1962) C. R. Acad. Sci. Paris , vol.254 , pp. 1192-1193
- Ghouilla-Houri, A.¹

11
- 77953612215
- The AI conference assignment problem
- Goldsmith, J., Sloan, R.H.: The AI conference assignment problem. In: Proceedings of the Workshop on Preference Handling for Artificial Intelligence (2007)
- (2007) Proceedings of the Workshop on Preference Handling for Artificial Intelligence
- Goldsmith, J.¹ Sloan, R.H.²

12
- 84864161360
- Halevi, S.: Websubrev, http://people.csail.mit.edu/shaih/websubrev/
- Websubrev
- Halevi, S.¹

13
- 0033272086
- The conference paper-reviewer assignment problem
- 10.1111/j.1540-5915.1999.tb00910.x
- D. Hartvigsen J.C. Wei R. Czuchlewski 1999 The conference paper-reviewer assignment problem Decis. Sci. 30 3 865 876 10.1111/j.1540-5915.1999.tb00910.x
- (1999) Decis. Sci. , vol.30 , Issue.3 , pp. 865-876
- Hartvigsen, D.¹ Wei, J.C.² Czuchlewski, R.³

14
- 33846620479
- Rank-maximal matchings
- DOI 10.1145/1198513.1198520
- R.W. Irving T. Kavitha K. Mehlhorn D. Michail K. Paluch 2006 Rank-maximal matchings ACM Trans. Algorithms 2 4 602 610 10.1145/1198513.1198520 2284247 (Pubitemid 46174063)
- (2006) ACM Transactions on Algorithms , vol.2 , Issue.4 , pp. 602-610
- Irving, R.W.¹ Kavitha, T.² Mehlhorn, K.³ Michail, D.⁴ Paluch, K.E.⁵

15
- 30444444819
- Novel and effective integer optimization approach for the NSF panel-assignment problem
- 10.1021/ie050478h
- S.L. Janak M.S. Taylor C.A. Floudas M. Burka T.J. Mountzizris 2005 Novel and effective integer optimization approach for the NSF panel-assignment problem Ind. Eng. Chem. Res. 45 1 258 265 10.1021/ie050478h
- (2005) Ind. Eng. Chem. Res. , vol.45 , Issue.1 , pp. 258-265
- Janak, S.L.¹ Taylor, M.S.² Floudas, C.A.³ Burka, M.⁴ Mountzizris, T.J.⁵

16
- 0003037529
- Reducibility among combinatorial problems
- Plenum New York
- Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85-103. Plenum, New York (1972)
- (1972) Complexity of Computer Computations , pp. 85-103
- Karp, R.M.¹

17
- 33749993483
- A solution to the random assignment problem on the full preference domain
- 10.1016/j.jet.2005.05.001 2267052
- A.-K. Katta J. Sethuraman 2005 A solution to the random assignment problem on the full preference domain J. Econ. Theory 131 1 231 250 10.1016/j.jet.2005.05.001 2267052
- (2005) J. Econ. Theory , vol.131 , Issue.1 , pp. 231-250
- Katta, A.-K.¹ Sethuraman, J.²

18
- 84863171591
- Kohler, E.: HotCRP. http://www.cs.ucla.edu/~kohler/hotcrp/
- HotCRP
- Kohler, E.¹

19
- 0000438412
- Approximation algorithms for scheduling unrelated parallel machines
- 0715.90063 10.1007/BF01585745 1054138
- J.K. Lenstra D.B. Shmoys É. Tardos 1990 Approximation algorithms for scheduling unrelated parallel machines Math. Program. 46 259 271 0715.90063 10.1007/BF01585745 1054138
- (1990) Math. Program. , vol.46 , pp. 259-271
- Lenstra, J.K.¹ Shmoys, D.B.² Tardos, É.³

20
- 77049095950
- Manuscript
- Mehlhorn, K., Michail, D.: Network problems with non-polynomial weights and applications. Manuscript
- Network Problems with Non-polynomial Weights and Applications
- Mehlhorn, K.¹ Michail, D.²

21
- 35048824460
- Conference paper assignment using a combined greedy/evolutionary algorithm
- Merelo-Gurvós, J.J., Castillo-Valdivieso, P.: Conference paper assignment using a combined greedy/evolutionary algorithm. In: Proceedings of Parallel Problem Solving from Nature, pp. 602-611 (2004)
- (2004) Proceedings of Parallel Problem Solving from Nature , pp. 602-611
- Merelo-Gurvós, J.J.¹

22
- 5444269087
- MIT Press Cambridge
- Moulin, H.: Fair Division and Collective Welfare. MIT Press, Cambridge (2003)
- (2003) Fair Division and Collective Welfare
- Moulin, H.¹

23
- 84864168427
- The paper assignment problem
- ETH Zürich
- O'Dell, R., Wattenhofer, M., Wattenhofer, R.: The paper assignment problem. Technical Report 491, ETH Zürich (2005)
- (2005) Technical Report 491
- O'Dell, R.¹ Wattenhofer, M.² Wattenhofer, R.³

24
- 0344924751
- Another look at the degree constrained subgraph problem
- 0492.05041 10.1016/0020-0190(81)90009-0 613243
- Y. Shiloach 1981 Another look at the degree constrained subgraph problem Inf. Process. Lett. 12 2 89 92 0492.05041 10.1016/0020-0190(81)90009-0 613243
- (1981) Inf. Process. Lett. , vol.12 , Issue.2 , pp. 89-92
- Shiloach, Y.¹

25
- 0038309442
- An approximation algorithm for the generalized assignment problem
- 10.1007/BF01585178 1251886
- D.B. Shmoys É. Tardos 1993 An approximation algorithm for the generalized assignment problem Math. Program. 62 461 474 10.1007/BF01585178 1251886
- (1993) Math. Program. , vol.62 , pp. 461-474
- Shmoys, D.B.¹ Tardos, É.²

26
- 0033466202
- Strategy-proof allocation of indivisible goods
- 1066.91571 10.1007/s003550050160 1713188
- L.-G. Svensson 1999 Strategy-proof allocation of indivisible goods Social Welf. Choice 16 4 557 567 1066.91571 10.1007/s003550050160 1713188
- (1999) Social Welf. Choice , vol.16 , Issue.4 , pp. 557-567
- Svensson, L.-G.¹

27
- 85012450889
- Egalitarianism: Is leximin the only option?
- 10.1017/S0266267100000237
- B. Tungodden 2000 Egalitarianism: Is leximin the only option? Econ. Philos. 16 229 245 10.1017/S0266267100000237
- (2000) Econ. Philos. , vol.16 , pp. 229-245
- Tungodden, B.¹

28
- 77953618504
- Voronkov, A.: Personal communication
- Personal Communication
- Voronkov, A.¹

29
- 84864160347
- Voronkov, A.: Easychair. http://www.easychair.org
- Easychair
- Voronkov, A.¹

30
- 84864165497
- Voronkov, A.: Easychair-users. http://www.easychair.org/users.cgi
- Easychair-users
- Voronkov, A.¹

31
- 48349142186
- A survey on reviewer assignment problem
- 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-727 (2008)
- (2008) Proceedings of the 21st International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems , pp. 718-727
- Wang, F.¹ Chen, B.² Miao, Z.³

32
- 0001581816
- On a conjecture by Gale about one-sided matching problems
- 0725.90003 10.1016/0022-0531(90)90070-Z
- L. Zhou 1990 On a conjecture by Gale about one-sided matching problems J. Econ. Theory 52 1 123 135 0725.90003 10.1016/0022-0531(90)90070-Z
- (1990) J. Econ. Theory , vol.52 , Issue.1 , pp. 123-135
- Zhou, L.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.