Adam A Testbed for Distributed Virtual Environments. - Jan Sablatnig; Jiehua Chen 001; Ruedi Seiler; Sven Grottke; Andreas Köpke; Adam Wolisz (ICDCS Workshops, 2008)

Measures for Inconsistency in Distributed Virtual Environments. - Sven Grottke; Jan Sablatnig; Jiehua Chen 001; Ruedi Seiler; Andreas Köpke; Adam Wolisz (ICPADS, 2008)

Scalability of a distributed virtual environment based on a structured peer-to-peer architecture. - Jiehua Chen 001; Sven Grottke; Jan Sablatnig; Ruedi Seiler; Adam Wolisz (COMSNETS, 2011)

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. - Robert Bredereck; Jiehua Chen 001; Sepp Hartung; Rolf Niedermeier; Ondrej Suchý 001; Stefan Kratsch (AAAI, 2012)

Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective. - Nadja Betzler; Robert Bredereck; Jiehua Chen 001; Rolf Niedermeier (The Multivariate Algorithmic Revolution and Beyond, 2012)

Effective and Efficient Data Reduction for the Subset Interconnection Design Problem. - Jiehua Chen 001; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge; Ondrej Suchý 001; Mathias Weller (ISAAC, 2013)

On Explaining Integer Vectors by Few Homogenous Segments. - Robert Bredereck; Jiehua Chen 001; Sepp Hartung; Christian Komusiewicz; Rolf Niedermeier; Ondrej Suchý 001 (WADS, 2013)

A characterization of the single-crossing domain. - Robert Bredereck; Jiehua Chen 001; Gerhard J. Woeginger (Soc. Choice Welf., 2013)

Star Partitions of Perfect Graphs. - René van Bevern; Robert Bredereck; Laurent Bulteau; Jiehua Chen 001; Vincent Froese; Rolf Niedermeier; Gerhard J. Woeginger (ICALP (1), 2014)

Network-Based Dissolution. - René van Bevern; Robert Bredereck; Jiehua Chen 001; Vincent Froese; Rolf Niedermeier; Gerhard J. Woeginger (MFCS (2), 2014)

Combinatorial Voter Control in Elections. - Jiehua Chen 001; Piotr Faliszewski; Rolf Niedermeier; Nimrod Talmon (MFCS (2), 2014)

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges. - Robert Bredereck; Jiehua Chen 001; Piotr Faliszewski; Jiong Guo; Rolf Niedermeier; Gerhard J. Woeginger (CoRR, 2014)

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda. - Robert Bredereck; Jiehua Chen 001; Sepp Hartung; Stefan Kratsch; Rolf Niedermeier; Ondrej Suchý 001; Gerhard J. Woeginger (J. Artif. Intell. Res., 2014)

Approximability and parameterized complexity of multicover by c-intervals. - René van Bevern; Jiehua Chen 001; Falk Hüffner; Stefan Kratsch; Nimrod Talmon; Gerhard J. Woeginger (Inf. Process. Lett., 2015)

On explaining integer vectors by few homogeneous segments. - Robert Bredereck; Jiehua Chen 001; Sepp Hartung; Christian Komusiewicz; Rolf Niedermeier; Ondrej Suchý 001 (J. Comput. Syst. Sci., 2015)

Network-Based Vertex Dissolution. - René van Bevern; Robert Bredereck; Jiehua Chen 001; Vincent Froese; Rolf Niedermeier; Gerhard J. Woeginger (SIAM J. Discret. Math., 2015)

Polynomial-Time Data Reduction for the Subset Interconnection Design Problem. - Jiehua Chen 001; Christian Komusiewicz; Rolf Niedermeier; Manuel Sorge; Ondrej Suchý 001; Mathias Weller (SIAM J. Discret. Math., 2015)

Combinatorial voter control in elections. - Laurent Bulteau; Jiehua Chen 001; Piotr Faliszewski; Rolf Niedermeier; Nimrod Talmon (Theor. Comput. Sci., 2015)

How to Put Through Your Agenda in Collective Binary Decisions. - Noga Alon; Robert Bredereck; Jiehua Chen 001; Stefan Kratsch; Rolf Niedermeier; Gerhard J. Woeginger (ACM Trans. Economics and Comput., 2015)

Prices matter for the parameterized complexity of shift bribery. - Robert Bredereck; Jiehua Chen 001; Piotr Faliszewski; André Nichterlein; Rolf Niedermeier (Inf. Comput., 2016)

Are there any nicely structured preference profiles nearby? - Robert Bredereck; Jiehua Chen 001; Gerhard J. Woeginger (Math. Soc. Sci., 2016)

Exploiting structure in computationally hard voting problems. - Jiehua Chen 001 (2016)

Teams in Online Scheduling Polls: Game-Theoretic Aspects. - Robert Bredereck; Jiehua Chen 001; Rolf Niedermeier; Svetlana Obraztsova; Nimrod Talmon (AAAI, 2017)

Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences. - Robert Bredereck; Jiehua Chen 001; Ugo Paavo Finnendahl; Rolf Niedermeier (ADT, 2017)

On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. - Leon Kellerhals; Viatcheslav Korenwein; Philipp Zschoche; Robert Bredereck; Jiehua Chen 001 (TAMC, 2017)

A Parameterized View on Multi-Layer Cluster Editing. - Jiehua Chen 001; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (CoRR, 2017)

Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty. - Robert Bredereck; Jiehua Chen 001; Rolf Niedermeier; Toby Walsh (J. Artif. Intell. Res., 2017)

Elections with Few Voters: Candidate Control Can Be Easy. - Jiehua Chen 001; Piotr Faliszewski; Rolf Niedermeier; Nimrod Talmon (J. Artif. Intell. Res., 2017)

Partitioning Perfect Graphs into Stars. - René van Bevern; Robert Bredereck; Laurent Bulteau; Jiehua Chen 001; Vincent Froese; Rolf Niedermeier; Gerhard J. Woeginger (J. Graph Theory, 2017)

The one-dimensional Euclidean domain: finitely many obstructions are not enough. - Jiehua Chen 001; Kirk Pruhs; Gerhard J. Woeginger (Soc. Choice Welf., 2017)

How Hard Is It to Satisfy (Almost) All Roommates?. - Jiehua Chen 001; Danny Hermelin; Manuel Sorge; Harel Yedidsion (ICALP, 2018)

Stable Marriage with Multi-Modal Preferences. - Jiehua Chen 001; Rolf Niedermeier; Piotr Skowron 001 (EC, 2018)

A Note on Clustering Aggregation. - Jiehua Chen 001; Danny Hermelin; Manuel Sorge (CoRR, 2018)

On the number of single-peaked narcissistic or single-crossing narcissistic preference profiles. - Jiehua Chen 001; Ugo Paavo Finnendahl (Discret. Math., 2018)

Parameterized complexity of team formation in social networks. - Robert Bredereck; Jiehua Chen 001; Falk Hüffner; Stefan Kratsch (Theor. Comput. Sci., 2018)

Matchings under Preferences: Strength of Stability and Trade-Offs. - Jiehua Chen 001; Piotr Skowron 001; Manuel Sorge (EC, 2019)

On Computing Centroids According to the p-Norms of Hamming Distance Vectors. - Jiehua Chen 001; Danny Hermelin; Manuel Sorge (ESA, 2019)

Computational Complexity of Stable Marriage and Stable Roommates and Their Variants. - Jiehua Chen 001 (CoRR, 2019)

Good Things Come to Those Who Swap Objects on Paths. - Matthias Bentert; Jiehua Chen 001; Vincent Froese; Gerhard J. Woeginger (CoRR, 2019)

Stable Matchings in Divorce Graphs. - Jiehua Chen 001 (CoRR, 2019)

Adapting Stable Matchings to Evolving Preferences. - Robert Bredereck; Jiehua Chen 001; Dusan Knop; Junjie Luo 001; Rolf Niedermeier (AAAI, 2020)

Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP. - Jiehua Chen 001; Robert Ganian; Thekla Hamm (IJCAI, 2020)

Stable roommates with narcissistic, single-peaked, and single-crossing preferences. - Robert Bredereck; Jiehua Chen 001; Ugo Paavo Finnendahl; Rolf Niedermeier (Auton. Agents Multi Agent Syst., 2020)

On Dynamic Parameterized k-Path. - Jiehua Chen 001; Wojciech Czerwinski; Yann Disser; Andreas Emil Feldmann; Danny Hermelin; Wojciech Nadara; Michal Pilipczuk; Marcin Pilipczuk; Manuel Sorge; Bartlomiej Wróblewski 002; Anna Zych-Pawlewicz (CoRR, 2020)

Fractional Matchings under Preferences: Stability and Optimality. - Jiehua Chen 001; Sanjukta Roy 001; Manuel Sorge (IJCAI, 2021)

On (Coalitional) Exchange-Stable Matching. - Jiehua Chen 001; Adrian Chmurovic; Fabian Jogl; Manuel Sorge (SAGT, 2021)

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles. - Jiehua Chen 001; Wojciech Czerwinski; Yann Disser; Andreas Emil Feldmann; Danny Hermelin; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk; Manuel Sorge; Bartlomiej Wróblewski 002; Anna Zych-Pawlewicz (SODA, 2021)

Euclidean 3D Stable Roommates is NP-hard. - Jiehua Chen 001; Sanjukta Roy 001 (CoRR, 2021)

Small one-dimensional Euclidean preference profiles. - Jiehua Chen 001; Sven Grottke (Soc. Choice Welf., 2021)

Matchings under Preferences: Strength of Stability and Tradeoffs. - Jiehua Chen 001; Piotr Skowron 001; Manuel Sorge (ACM Trans. Economics and Comput., 2021)

Participatory Budgeting with Donations and Diversity Constraints. - Jiehua Chen 001; Martin Lackner; Jan Maly 001 (AAAI, 2022)

Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space. - Jiehua Chen 001; Sanjukta Roy 001 (ESA, 2022)

Multidimensional Manhattan Preferences. - Jiehua Chen 001; Martin Nöllenburg; Sofia Simola; Anaïs Villedieu; Markus Wallinger (LATIN, 2022)

Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule. - Jiehua Chen 001; Sanjukta Roy 001 (CoRR, 2022)

Cores in Friend-Oriented Hedonic Games: Verification is Surprisingly Harder than Searching. - Jiehua Chen 001; Gergely Csáji; Sanjukta Roy 001; Sofia Simola (CoRR, 2022)

2-Dimensional Euclidean Preferences. - Laurent Bulteau; Jiehua Chen 001 (CoRR, 2022)

Algorithms for Participatory Democracy (Dagstuhl Seminar 22271). - Markus Brill; Jiehua Chen 001; Andreas Darmann; David M. Pennock; Matthias Greger (Dagstuhl Reports, 2022)

Game Implementation: What Are the Obstructions? - Jiehua Chen 001; Seyedeh Negar Layegh Khavidaki; Sebastian Vincent Haydn; Sofia Simola; Manuel Sorge (AAAI, 2023)

Optimal Capacity Modification for Many-To-One Matching Problems. - Jiehua Chen 001; Gergely Csáji (AAMAS, 2023)

Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity. - Jiehua Chen 001; Gergely Csáji; Sanjukta Roy 001; Sofia Simola (AAMAS, 2023)

Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences. - Jiehua Chen 001; Christian Hatschka; Sofia Simola (ECAI, 2023)

Optimal Seat Arrangement: What Are the Hard and Easy Cases? - Esra Ceylan; Jiehua Chen 001; Sanjukta Roy 001 (IJCAI, 2023)

Algorithms and Complexity for Congested Assignments. - Jiehua Chen 001; Jiong Guo; Yinghui Wen (CoRR, 2023)

Cutsets and EF1 Fair Division of Graphs. - Jiehua Chen 001; William S. Zwicker (AAMAS, 2024)

Parameterized Algorithms for Optimal Refugee Resettlement. - Jiehua Chen 001; Ildikó Schlotter; Sofia Simola (ECAI, 2024)

Multi-Winner Reconfiguration. - Jiehua Chen 001; Christian Hatschka; Sofia Simola (NeurIPS, 2024)

Computational Social Choice: Parameterized Complexity and Challenges. - Jiehua Chen 001; Christian Hatschka; Sofia Simola (CoRR, 2024)

A note on clustering aggregation for binary clusterings. - Jiehua Chen 001; Danny Hermelin; Manuel Sorge (Oper. Res. Lett., 2024)

Cluster Editing for Multi-Layer and Temporal Graphs. - Jiehua Chen 001; Hendrik Molter; Manuel Sorge; Ondrej Suchý 001 (Theory Comput. Syst., 2024)

Control in Stable Marriage and Stable Roommates: Complexity and Algorithms. - Jiehua Chen 001; Ildikó Schlotter (CoRR, 2025)

Multi-Organizational Scheduling: Individual Rationality, Optimality, and Complexity. - Jiehua Chen 001; Martin Durand; Christian Hatschka (CoRR, 2025)

FPT-Approximability of Stable Matching Problems. - Jiehua Chen 001; Sanjukta Roy 001; Sofia Simola (CoRR, 2025)