Jiehua Chen

Orcid: 0000-0002-8163-1327

Affiliations:
  • Technische Universität Wien, Austria
  • Technische Universität Berlin, Germany (former)


According to our database1, Jiehua Chen authored at least 65 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Cutsets and EF1 Fair Division of Graphs.
CoRR, 2024

2023
Algorithms and Complexity for Congested Assignments.
CoRR, 2023

Optimal Seat Arrangement: What Are the Hard and Easy Cases?
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Efficient Algorithms for Monroe and CC Rules in Multi-Winner Elections with (Nearly) Structured Preferences.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Hedonic Games With Friends, Enemies, and Neutrals: Resolving Open Questions and Fine-Grained Complexity.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Optimal Capacity Modification for Many-To-One Matching Problems.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Game Implementation: What Are the Obstructions?
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Algorithms for Participatory Democracy (Dagstuhl Seminar 22271).
Dagstuhl Reports, July, 2022

2-Dimensional Euclidean Preferences.
CoRR, 2022

Cores in Friend-Oriented Hedonic Games: Verification is Surprisingly Harder than Searching.
CoRR, 2022

Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule.
CoRR, 2022

Multidimensional Manhattan Preferences.
Proceedings of the LATIN 2022: Theoretical Informatics, 2022

Multi-Dimensional Stable Roommates in 2-Dimensional Euclidean Space.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Participatory Budgeting with Donations and Diversity Constraints.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Matchings under Preferences: Strength of Stability and Tradeoffs.
ACM Trans. Economics and Comput., 2021

Small one-dimensional Euclidean preference profiles.
Soc. Choice Welf., 2021

Euclidean 3D Stable Roommates is NP-hard.
CoRR, 2021

Efficient fully dynamic elimination forests with applications to detecting long paths and cycles.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

On (Coalitional) Exchange-Stable Matching.
Proceedings of the Algorithmic Game Theory - 14th International Symposium, 2021

Fractional Matchings under Preferences: Stability and Optimality.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020
On Dynamic Parameterized k-Path.
CoRR, 2020

Stable roommates with narcissistic, single-peaked, and single-crossing preferences.
Auton. Agents Multi Agent Syst., 2020

Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Adapting Stable Matchings to Evolving Preferences.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Stable Matchings in Divorce Graphs.
CoRR, 2019

Good Things Come to Those Who Swap Objects on Paths.
CoRR, 2019

Computational Complexity of Stable Marriage and Stable Roommates and Their Variants.
CoRR, 2019

On Computing Centroids According to the p-Norms of Hamming Distance Vectors.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Matchings under Preferences: Strength of Stability and Trade-Offs.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
Parameterized complexity of team formation in social networks.
Theor. Comput. Sci., 2018

On the number of single-peaked narcissistic or single-crossing narcissistic preference profiles.
Discret. Math., 2018

A Note on Clustering Aggregation.
CoRR, 2018

Stable Marriage with Multi-Modal Preferences.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Cluster Editing in Multi-Layer and Temporal Graphs.
Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

How Hard Is It to Satisfy (Almost) All Roommates?.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
The one-dimensional Euclidean domain: finitely many obstructions are not enough.
Soc. Choice Welf., 2017

Partitioning Perfect Graphs into Stars.
J. Graph Theory, 2017

Elections with Few Voters: Candidate Control Can Be Easy.
J. Artif. Intell. Res., 2017

Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty.
J. Artif. Intell. Res., 2017

A Parameterized View on Multi-Layer Cluster Editing.
CoRR, 2017

On the Computational Complexity of Variants of Combinatorial Voter Control in Elections.
Proceedings of the Theory and Applications of Models of Computation, 2017

Stable Roommate with Narcissistic, Single-Peaked, and Single-Crossing Preferences.
Proceedings of the Algorithmic Decision Theory - 5th International Conference, 2017

Teams in Online Scheduling Polls: Game-Theoretic Aspects.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Exploiting structure in computationally hard voting problems.
PhD thesis, 2016

Are there any nicely structured preference profiles nearby?
Math. Soc. Sci., 2016

Prices matter for the parameterized complexity of shift bribery.
Inf. Comput., 2016

2015
How to Put Through Your Agenda in Collective Binary Decisions.
ACM Trans. Economics and Comput., 2015

Combinatorial voter control in elections.
Theor. Comput. Sci., 2015

Polynomial-Time Data Reduction for the Subset Interconnection Design Problem.
SIAM J. Discret. Math., 2015

Network-Based Vertex Dissolution.
SIAM J. Discret. Math., 2015

On explaining integer vectors by few homogeneous segments.
J. Comput. Syst. Sci., 2015

Approximability and parameterized complexity of multicover by c-intervals.
Inf. Process. Lett., 2015

2014
A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.
J. Artif. Intell. Res., 2014

Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges.
CoRR, 2014

Combinatorial Voter Control in Elections.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Network-Based Dissolution.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Star Partitions of Perfect Graphs.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
A characterization of the single-crossing domain.
Soc. Choice Welf., 2013

On Explaining Integer Vectors by Few Homogenous Segments.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Effective and Efficient Data Reduction for the Subset Interconnection Design Problem.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

2012
Studies in Computational Aspects of Voting - A Parameterized Complexity Perspective.
Proceedings of the Multivariate Algorithmic Revolution and Beyond, 2012

A Multivariate Complexity Analysis of Lobbying in Multiple Referenda.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Scalability of a distributed virtual environment based on a structured peer-to-peer architecture.
Proceedings of the Third International Conference on Communication Systems and Networks, 2011

2008
Measures for Inconsistency in Distributed Virtual Environments.
Proceedings of the 14th International Conference on Parallel and Distributed Systems, 2008

Adam A Testbed for Distributed Virtual Environments.
Proceedings of the 28th IEEE International Conference on Distributed Computing Systems Workshops (ICDCS 2008 Workshops), 2008


  Loading...