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

2025

Multidimensional Manhattan Preferences

2022

Stable Matchings with Diversity Constraints: Affirmative Action is beyond NP

2020

How many variables are needed to express an existential positive query?

2017

The complexity of equivalence, entailment, and minimization in existential positive logic

2015

The Complexity of Width Minimization for Existential Positive Queries

2014

Generic expression hardness results for primitive positive formula comparison

2013

On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas

2012

The Complexity of Planning Revisited - A Parameterized Analysis

2012