Publications: Jiehua Chen

⬅️ Zurück zum Profil


2025

An Introduction to and Survey of Biological Network Visualization
Computers \& Graphics, volume 126, pages 104115, 2025.

2022

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.

2020

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.

2017

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

2015

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.

2014

The Complexity of Width Minimization for Existential Positive Queries
Proc. 17th International Conference on Database Theory (ICDT), Athens, Greece, March 24-28, 2014., pages 235–244, 2014.

2013

Generic expression hardness results for primitive positive formula comparison
Inf. Comput., volume 222, pages 108–120, 2013.

2012

The Complexity of Planning Revisited - A Parameterized Analysis
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.
On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas
Theory Comput. Syst., volume 50, number 2, pages 329–353, 2012.

2011

Generic Expression Hardness Results for Primitive Positive Formula Comparison
Automata, Languages and Programming - 38th International Colloquium, ICALP 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part II, pages 344–355, 2011.
AC Admin
AC Admin

Website maintainer