| Are there any nicely structured preference profiles nearby? R Bredereck, J Chen, GJ Woeginger Mathematical Social Sciences 79, 61-73, 2016 | 89 | 2016 |
| A characterization of the single-crossing domain R Bredereck, J Chen, GJ Woeginger Social Choice and Welfare 41, 989-998, 2013 | 85 | 2013 |
| Prices matter for the parameterized complexity of shift bribery R Bredereck, J Chen, P Faliszewski, A Nichterlein, R Niedermeier Information and Computation 251, 140-164, 2016 | 65 | 2016 |
| Parameterized algorithmics for computational social choice: Nine research challenges R Bredereck, J Chen, P Faliszewski, J Guo, R Niedermeier, ... Tsinghua Science and Technology 19 (4), 358-373, 2014 | 62 | 2014 |
| Elections with Few Voters: Candidate Control Can Be Easy. J Chen, P Faliszewski, R Niedermeier, N Talmon AAAI 15, 2045-2051, 2015 | 57 | 2015 |
| A multivariate complexity analysis of lobbying in multiple referenda R Bredereck, J Chen, S Hartung, S Kratsch, R Niedermeier, O Suchy, ... Journal of Artificial Intelligence Research 50, 409-446, 2014 | 39 | 2014 |
| Stable Marriage with Multi-Modal Preferences J Chen, R Niedermeier, P Skowron Proceedings of the 2018 ACM Conference on Economics and Computation, 269-286, 2018 | 38 | 2018 |
| Matchings under Preferences: Strength of Stability and Trade-offs J Chen, P Skowron, M Sorge arXiv preprint arXiv:1902.10535, 2019 | 32 | 2019 |
| Combinatorial voter control in elections L Bulteau, J Chen, P Faliszewski, R Niedermeier, N Talmon Theoretical Computer Science 589, 99-120, 2015 | 30* | 2015 |
| Studies in Computational Aspects of Voting-A Parameterized Complexity Perspective. N Betzler, R Bredereck, J Chen, R Niedermeier The Multivariate Algorithmic Revolution and Beyond, 318-363, 2012 | 29 | 2012 |
| The one-dimensional Euclidean domain: Finitely many obstructions are not enough J Chen, KR Pruhs, GJ Woeginger Social Choice and Welfare, 1-24, 2015 | 28 | 2015 |
| Stable roommates with narcissistic, single-peaked, and single-crossing preferences R Bredereck, J Chen, UP Finnendahl, R Niedermeier Autonomous Agents and Multi-Agent Systems 34 (2), 1-29, 2020 | 25 | 2020 |
| Cluster editing in multi-layer and temporal graphs J Chen, H Molter, M Sorge, O Suchý 29th International Symposium on Algorithms and Computation (ISAAC 2018), 2018 | 25 | 2018 |
| Partitioning Perfect Graphs into Stars R Bevern, R Bredereck, L Bulteau, J Chen, V Froese, R Niedermeier, ... Journal of Graph Theory, 2016 | 25* | 2016 |
| How hard is it to satisfy (almost) all roommates? J Chen, D Hermelin, M Sorge, H Yedidsion arXiv preprint arXiv:1707.04316, 2017 | 21 | 2017 |
| Network-based vertex dissolution R Van Bevern, R Bredereck, J Chen, V Froese, R Niedermeier, ... SIAM Journal on Discrete Mathematics 29 (2), 888-914, 2015 | 21* | 2015 |
| Polynomial-Time Data Reduction for the Subset Interconnection Design Problem J Chen, C Komusiewicz, R Niedermeier, M Sorge, O Suchý, M Weller SIAM Journal on Discrete Mathematics 29 (1), 1-25, 2015 | 21* | 2015 |
| Efficient fully dynamic elimination forests with applications to detecting long paths and cycles J Chen, W Czerwiński, Y Disser, AE Feldmann, D Hermelin, W Nadara, ... Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 17 | 2021 |
| Adapting stable matchings to evolving preferences R Bredereck, J Chen, D Knop, J Luo, R Niedermeier Proceedings of the AAAI Conference on Artificial Intelligence 34 (02), 1830-1837, 2020 | 17 | 2020 |
| Good Things Come to Those Who Swap Objects on Paths M Bentert, J Chen, V Froese, GJ Woeginger arXiv preprint arXiv:1905.04219, 2019 | 15 | 2019 |
Robert BredereckTU ClausthalVerified email at tu-clausthal.de
