Jiehua Chen
Associate Prof. Dr.in rer.nat.

Jiehua Chen

Research Interests

  • Optimization problems related to graphs and hypergraphs
  • Computational Social Choice:
    • Computational problems around voting
    • Domain restrictions
    • Preference-based stable matching problems

Recent Publications

Multidimensional Manhattan Preferences
Theoretical Informatics (LATIN'22) (Castañeda, Armando and Rodríguez-Henríquez, Francisco), volume 13568 of LNCS, pages 273-289, 2022, Springer.
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere), pages 146-152, 2020, ijcai.org.
How many variables are needed to express an existential positive query?
Proceeding of the Twentieth International Conference on Database Theory (ICDT), March 21-24, 2017, Venice, Italy, 2017.
Note: Best Paper Award
The complexity of equivalence, entailment, and minimization in existential positive logic
Journal of Computer and System Sciences, volume 81, number AC-TR-15-007, pages 443-457, 2015.