{"type":"ScholarlyArticle","title":"How Hard Is It to Impact the Impact of Your Paper?","authors":[{"name":"Yongjie Yang","slug":"yongjie-yang","given":"Yongjie","family":"Yang","affiliation":"Chair of Economic Theory , Saarland University , Saarbrücken , Germany"}],"abstract":"Consolidation-disruption index (CD index) is a new metric for qualitatively measuring the contribution of a patent or a research paper. \r\nWe embark on the study of the complexity of the CD index manipulation problems, which model scenarios where scholars seek to enhance the CD indices of their papers through the merging, addition, or deletion of papers. \r\nWe show that these problems are generally computationally hard, even when restricted to very realistic special cases. Specifically, we analyze how various parameters influence the parameterized complexity of these problems.","doi":"10.24963/ijcai.2024/335","url":"https://ijcai.org/proceedings/2024/335","pdf":"https://ijcai.org/proceedings/2024/0335.pdf","markdown":"https://ijcai.org/proceedings/2024/335.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/335","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Game Theory and Economic Paradigms","track":"Main Track","number":335,"pages":{"first":3023,"last":3031},"keywords":["Game Theory and Economic Paradigms: GTEP: Computational social choice"],"videos":[],"references":[{"position":1,"raw":"[Bang-Jensen and Gutin, 2018] J. Bang-Jensen and G. Z. Gutin, editors. Classes of Directed Graphs. Springer, 2018.","title":"Classes of Directed Graphs","authors":"Bang-Jensen, Gutin","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bartholdi III et al., 1992] J. J. Bartholdi III, C. A. Tovey, and M. A. Trick. How hard is it to control an election? Math. Comput. Model., 16(8-9):27-40, 1992.","title":"How hard is it to control an election?","authors":"Iii Bartholdi","year":"1992","venue":"Math. Comput. Model","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baumeister and Rothe, 2016] D. Baumeister and J. Rothe. Preference aggregation by voting. In J. Rothe, editor, Eco- nomics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Di- vision, chapter 4, pages 197-325. Springer, 2016.","title":"Preference aggregation by voting","authors":"D Baumeister, J Rothe","year":"2016","venue":"Economics and Computation: An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Bergamini et al., 2018] E. Bergamini, P. Crescenzi, G. D'Angelo, H. Meyerhenke, L. Severini, and Y. Velaj. Improving the betweenness centrality of a node by adding links. ACM J. Exp. Algorithmics, 23:Nr. 1.5, 2018.","title":"Improving the betweenness centrality of a node by adding links","authors":"E Bergamini, P Crescenzi, G D'angelo, H Meyerhenke, L Severini, Y Velaj","year":"2018","venue":"ACM J. Exp. Algorithmics","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Betzler et al., 2014] N. Betzler, H. L. Bodlaender, R. Bred- ereck, R. Niedermeier, and J. Uhlmann. On making a dis- tinguished vertex of minimum degree by vertex deletion. Algorithmica, 68(3):715-738, 2014.","title":"On making a distinguished vertex of minimum degree by vertex deletion","authors":"N Betzler, H L Bodlaender, R Bredereck, R Niedermeier, J Uhlmann","year":"2014","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Cygan et al., 2015] M. Cygan, F. V. Fomin, L. Kowalik, D. Lokshtanov, D. Marx, M. Pilipczuk, M. Pilipczuk, and S. Saurabh. Parameterized Algorithms. Springer, 2015.","title":"Parameterized Algorithms","authors":"M Cygan, F V Fomin, L Kowalik, D Lokshtanov, D Marx, M Pilipczuk, M Pilipczuk, S Saurabh","year":"2015","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[D'Angelo et al., 2015] G. D'Angelo, L. Severini, and Y. Ve- laj. On the maximum betweenness improvement problem. In ICTCS, pages 153-168, 2015.","title":"On the maximum betweenness improvement problem","authors":"G D Angelo, L Severini, Y Velaj","year":"2015","venue":"ICTCS","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[D'Angelo et al., 2019] G. D'Angelo, M. Olsen, and L. Sev- erini. Coverage centrality maximization in undirected net- works. In AAAI, pages 501-508, 2019.","title":"Coverage centrality maximization in undirected networks","authors":"G D'angelo, M Olsen, L Severini","year":"2019","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Das et al., 2018] K. Das, S. Samanta, and M. Pal. Study on centrality measures in social networks: A survey. Soc. Netw. Anal. Min., 8(1):Nr. 13, 2018.","title":"Study on centrality measures in social networks: A survey","authors":"K Das, S Samanta, M Pal","year":"2018","venue":"Soc. Netw. Anal. Min","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Erdélyi et al., 2020] G. Erdélyi, C. Reger, and Y. Yang. The complexity of bribery and control in group identification. Auton. Agent Multi-Ag., 34(1):Nr. 8, 2020.","title":"The complexity of bribery and control in group identification","authors":"G Erdélyi, C Reger, Y Yang","year":"2020","venue":"Auton. Agent Multi-Ag","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Erdélyi et al., 2021] G. Erdélyi, M. Neveling, C. Reger, J. Rothe, Y. Yang, and R. Zorn. Towards completing the puzzle: Complexity of control by replacing, adding, and deleting candidates or voters. Auton. Agent Multi-Ag., 35(2):Nr. 41, 2021.","title":"Towards completing the puzzle: Complexity of control by replacing, adding, and deleting candidates or voters","authors":"G Erdélyi, M Neveling, C Reger, J Rothe, Y Yang, R Zorn","year":"2021","venue":"Auton. Agent Multi-Ag","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Faliszewski and Rothe, 2016] P. Faliszewski and J. Rothe. Control and bribery in voting. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. Procaccia, editors, Handbook of Computational Social Choice, chapter 7, pages 146- 168. Cambridge University Press, 2016.","title":"Control and bribery in voting","authors":"P Faliszewski, J Rothe","year":"2016","venue":"Handbook of Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Fellows et al., 2009] M. R. Fellows, D. Hermelin, F. A. Rosamond, and S. Vialette. On the parameterized com- plexity of multiple-interval graph problems. Theor. Com- put. Sci., 410(1):53-61, 2009.","title":"On the parameterized complexity of multiple-interval graph problems","authors":"M R Fellows, D Hermelin, F A Rosamond, S Vialette","year":"2009","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Funk and Owen-Smith, 2017] R. J. Funk and J. Owen- Smith. A dynamic network measure of technological change. Manag. Sci., 63(3):791-817, 2017.","title":"A dynamic network measure of technological change","authors":"R J Funk, J Owen-Smith","year":"2017","venue":"Manag. Sci","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Hopcroft and Karp, 1973] J. E. Hopcroft and R. M. Karp. An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM J. Comput., 2(4):225-231, 1973.","title":"An n 5/2 algorithm for maximum matchings in bipartite graphs","authors":"J E Hopcroft, R M Karp","year":"1973","venue":"SIAM J. Comput","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Jiang and Liu, 2023] Y. Jiang and X. Liu. A construction and empirical research of the journal disruption index based on open citation data. Scientometrics, 128(7):3935- 3958, 2023.","title":"A construction and empirical research of the journal disruption index based on open citation data","authors":"Y Jiang, X Liu","year":"2023","venue":"Scientometrics","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[König, 1916] D. König. Über Graphen und ihre Anwen- dung auf Determinantentheorie und Mengenlehre. Math. Ann., 77(4):453-465, 1916.","title":"Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre","authors":"D König","year":"1916","venue":"Math. Ann","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Leibel and Bornmann, 2024] C. Leibel and L. Bornmann. What do we know about the disruption index in sciento- metrics? An overview of the literature. Scientometrics, 129(1):601-639, 2024.","title":"What do we know about the disruption index in scientometrics? An overview of the literature","authors":"C Leibel, L Bornmann","year":"2024","venue":"Scientometrics","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Leydesdorff et al., 2021] L. Leydesdorff, A. Tekles, and L. Bornmann. A proposal to revise the disruption index. Profesional de la información, 30:Nr. e300121, 2021.","title":"A proposal to revise the disruption index","authors":"L Leydesdorff, A Tekles, L Bornmann","year":"2021","venue":"Profesional de la información","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Li et al., 2023] J. Li, W. Li, Y. Yang, and X. Yang. On the parameterized complexity of minimum/maximum degree vertex deletion on several special graphs. Frontiers Com- put. Sci., 17(4):Nr. 174405, 2023.","title":"On the parameterized complexity of minimum/maximum degree vertex deletion on several special graphs","authors":"J Li, W Li, Y Yang, X Yang","year":"2023","venue":"Frontiers Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Liu et al., 2023] X. Liu, C. Zhang, and J. Li. Conceptual and technical work: Who will disrupt science? J. Infor- metrics, 17(3):Nr. 101432, 2023.","title":"Conceptual and technical work: Who will disrupt science?","authors":"Liu","year":"2023","venue":"J. Informetrics","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Lovász and Plummer, 1986] L. Lovász and M. D. Plummer. Matching Theory. North Holland, 1986.","title":"Matching Theory","authors":"L Lovász, M D Plummer","year":"1986","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Mathieson and Szeider, 2008] L. Mathieson and S. Szeider. The parameterized complexity of regular subgraph prob- lems and generalizations. In CATS, pages 79-86, 2008.","title":"The parameterized complexity of regular subgraph problems and generalizations","authors":"L Mathieson, S Szeider","year":"2008","venue":"CATS","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Mishra et al., 2015] S. Mishra, A. Pananjady, and N. S. Devi. On the complexity of making a distinguished ver- tex minimum or maximum degree by vertex deletion. J. Discrete Algorithms, 33:71-80, 2015.","title":"On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion","authors":"S Mishra, A Pananjady, N S Devi","year":"2015","venue":"J. Discrete Algorithms","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Park et al., 2023] M. Park, E. Leahey, and R. J. Funk. Pa- pers and patents are becoming less disruptive over time. Nature, 613(7942):138-144, 2023.","title":"Papers and patents are becoming less disruptive over time","authors":"M Park, E Leahey, R J Funk","year":"2023","venue":"Nature","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Pavlou and Elkind, 2016] C. Pavlou and E. Elkind. Manipu- lating citation indices in a social context. In AAMAS, pages 32-40, 2016.","title":"Manipulating citation indices in a social context","authors":"C Pavlou, E Elkind","year":"2016","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Singh, 2022] R. R. Singh. Centrality measures: A tool to identify key actors in social networks. In A. Biswas, R. Patgiri, and B. Biswas, editors, Principles of Social Networking: The New Horizon and Emerging Challenges, pages 1-27. Springer, 2022.","title":"Centrality measures: A tool to identify key actors in social networks","authors":"R R Singh","year":"2022","venue":"Principles of Social Networking: The New Horizon and Emerging Challenges","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[van Bevern et al., 2016] R. van Bevern, C. Komusiewicz, R. Niedermeier, M. Sorge, and T. Walsh. H-index ma- nipulation by merging articles: Models, theory, and exper- iments. Artif. Intell., 240:19-35, 2016.","title":"H-index manipulation by merging articles: Models, theory, and experiments","authors":"R Van Bevern, C Komusiewicz, R Niedermeier, M Sorge, T Walsh","year":"2016","venue":"Artif. Intell","doi":null,"url":null,"internal_url":"/proceedings/2015/119"},{"position":29,"raw":"[van Bevern et al., 2020] R. van Bevern, C. Komusiewicz, H. Molter, R. Niedermeier, M. Sorge, and T. Walsh. h- index manipulation by undoing merges. Quant. Sci. Stud., 1(4):1529-1552, 2020.","title":"hindex manipulation by undoing merges","authors":"R Van Bevern, C Komusiewicz, H Molter, R Niedermeier, M Sorge, T Walsh","year":"2020","venue":"Quant. Sci. Stud","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Wan et al., 2021] Z. Wan, Y. Mahajan, B. W. Kang, T. J. Moore, and J.-H. Cho. A survey on centrality metrics and their network resilience analysis. IEEE Access, 9:104773- 104819, 2021.","title":"A survey on centrality metrics and their network resilience analysis","authors":"Z Wan, Y Mahajan, B W Kang, T J Moore, J.-H Cho","year":"2021","venue":"IEEE Access","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Wang et al., 2023] R. Wang, Y. Zhou, and A. Zeng. Eval- uating scientists by citation and disruption of their repre- sentative works. Scientometrics, 128(3):1689-1710, 2023.","title":"Evaluating scientists by citation and disruption of their representative works","authors":"R Wang, Y Zhou, A Zeng","year":"2023","venue":"Scientometrics","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Waniek et al., 2022] M. Waniek, T. P. Michalak, M. J. Wooldridge, and T. Rahwan. How members of covert net- works conceal the identities of their leaders. ACM Trans. Intell. Syst. Technol., 13(1):Nr. 12, 2022.","title":"How members of covert networks conceal the identities of their leaders","authors":"M Waniek, T P Michalak, M J Wooldridge, T Rahwan","year":"2022","venue":"ACM Trans. Intell. Syst. Technol","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Waniek et al., 2023] M. Waniek, J. Woźnica, K. Zhou, Y. Vorobeychik, T. P. Michalak, and T. Rahwan. Hid- ing from centrality measures: A Stackelberg game per- spective. IEEE Trans. Knowl. Data Eng., 35(10):10058- 10071, 2023.","title":"Hiding from centrality measures: A Stackelberg game perspective","authors":"M Waniek, J Woźnica, K Zhou, Y Vorobeychik, T P Michalak, T Rahwan","year":"2023","venue":"IEEE Trans. Knowl. Data Eng","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[West, 2000] D. B. West. Introduction to Graph Theory. Prentice-Hall, 2000.","title":"Introduction to Graph Theory","authors":"D B West","year":"2000","venue":null,"doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Wu et al., 2019] L. Wu, D. Wang, and J. A. Evans. Large teams develop and small teams disrupt science and tech- nology. Nature, 566(7744):378-382, 2019.","title":"Large teams develop and small teams disrupt science and technology","authors":"L Wu, D Wang, J A Evans","year":"2019","venue":"Nature","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Yanai and Lercher, 2023] I. Yanai and M. J. Lercher. Make science disruptive again. Nat. Biotechnol., 41(4):450-451, 2023.","title":"Make science disruptive again","authors":"Lercher Yanai, ] I Yanai, M J Lercher","year":"2023","venue":"Nat. Biotechnol","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Yang et al., 2023] A. J. Yang, H. Hu, Y. Zhao, H. Wang, and S. Deng. From consolidation to disruption: A novel way to measure the impact of scientists and identify laureates. Inf. Process. Manag., 60(5):103420, 2023.","title":"From consolidation to disruption: A novel way to measure the impact of scientists and identify laureates","authors":"A J Yang, H Hu, Y Zhao, H Wang, S Deng","year":"2023","venue":"Inf. Process. Manag","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Yang, 2019] Y. Yang. Complexity of manipulating and con- trolling approval-based multiwinner voting. In IJCAI, pages 637-643, 2019.","title":"Complexity of manipulating and controlling approval-based multiwinner voting","authors":"Y Yang","year":"2019","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2019/90"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}