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

An Introduction to and Survey of Biological Network Visualization
Ehlers, Henry, Brich, Nicolas, Jiehua Chen, Krone, Michael, Martin Nöllenburg, Natsukawa, Hiroaki, Hai Xia, Wu, Hsiang-Yun
Computers & Graphics, volume 126, pages 104115, 2025.
Cite DOI
Multidimensional Manhattan Preferences
Jiehua Chen, Martin Nöllenburg, Simola, Sofia, Villedieu, Anaïs, Wallinger, Markus
Theoretical Informatics (LATIN'22) (Castañeda, Armando and Rodríguez-Henríquez, Francisco), volume 13568 of LNCS, pages 273-289, 2022, Springer.
Cite Project Project DOI
Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP
Jiehua Chen
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020 (Christian Bessiere), pages 146-152, 2020, ijcai.org.
PDF Cite Project
How many variables are needed to express an existential positive query?
Jiehua Chen
Proceeding of the Twentieth International Conference on Database Theory (ICDT), March 21-24, 2017, Venice, Italy, 2017.
Note: Best Paper Award
Cite
The complexity of equivalence, entailment, and minimization in existential positive logic
Simone Bova, Jiehua Chen
Journal of Computer and System Sciences, volume 81, number AC-TR-15-007, pages 443-457, 2015.
PDF Cite
The Complexity of Width Minimization for Existential Positive Queries
Jiehua Chen
Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014., pages 235-244, 2014.
Cite
Generic expression hardness results for primitive positive formula comparison
Jiehua Chen
Inf. Comput., volume 222, pages 108-120, 2013.
Cite
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas
Jiehua Chen
Theory Comput. Syst., volume 50, number 2, pages 329-353, 2012.
Cite
The Complexity of Planning Revisited - A Parameterized Analysis
Christer Bäckström, Jiehua Chen, Peter Jonsson, Sebastian Ordyniak, Stefan Szeider
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada (Jörg Hoffmann and Bart Selman), 2012, AAAI Press.
Cite
Generic Expression Hardness Results for Primitive Positive Formula Comparison
Jiehua Chen
Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II, pages 344-355, 2011.
Cite