THEORETICAL COMPUTER ALGORITHMS CONFERENCES: ANALYZING THE PROGRAM COMMITTEE CHARACTERISTICS
Journal of Theoretical and Applied Information Technology
Algorithm represents the computer-based road map for accomplishing a given, well-defined task. In general, computer algorithms form one of the core practical technologies of computer science. In principle, research in theoretical computer science focuses on the design and analysis of algorithms and data structures, as well as the study of fundamental barriers to efficient computation. The research community of this field has been significantly growing in the last decade. In general, in the
... eneral, in the computer science field, publishing research results is an integral part of a researcher's professional life. The preference for conference publications is motivated by many arguments such as the high dynamism of the field requiring shorter turnaround time between submissions; the prestige associated with publishing at highly-selective venues. With the main aim of retaining the high quality and the prestige of these conference, program committee members plays the major role of evaluating the submitted papers and deciding which submissions are to be included in the conference programs. In this article we assess the health of the computer algorithms research community by analyzing four top-tier and prestigious computer algorithm conferences (ESA, ICALP, SOCG and SODA) over the period between 2006 and 2015 based on different criteria. We study dynamics in the membership of the committees of the different editions of these conferences. Finally, we report about the major contributing scholars in the committees of these conferences as a mean of acknowledging their impact in the community. This knowledge can be used by prospective authors to decide in which conferences to publish and by conference steering committees or PC chairs to assess their selection process.