| 2024 | ICDT | Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity. | Hubie Chen, Stefan Mengel |
| 2020 | IJCAI | Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. | Hubie Chen, Georg Gottlob, Matthias Lanzinger, Reinhard Pichler |
| 2020 | ISAAC | Sparsification Lower Bounds for List H-Coloring. | Hubie Chen, Bart M. P. Jansen, Karolina Okrasa, Astrid Pieterse, Pawel Rzazewski |
| 2019 | PODS | Compiling Existential Positive Queries to Bounded-Variable Fragments. | Christoph Berkholz, Hubie Chen |
| 2019 | PODS | The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems. | Hubie Chen |
| 2019 | PODS | Testability of Homomorphism Inadmissibility: Property Testing Meets Database Theory. | Hubie Chen, Yuichi Yoshida |
| 2019 | WG | The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. | Hubie Chen, Radu Curticapean, Holger Dell |
| 2018 | NAACL | The Computational Complexity of Distinctive Feature Minimization in Phonology. | Hubie Chen, Mans Hulden |
| 2017 | ICDT | How Many Variables Are Needed to Express an Existential Positive Query?. | Simone Bova, Hubie Chen |
| 2017 | LICS | The logic of counting query answers. | Hubie Chen, Stefan Mengel |
| 2016 | CSL | Quantified Constraint Satisfaction on Monoids. | Hubie Chen, Peter Mayr |
| 2016 | FOCS | Testing Assignments to Constraint Satisfaction Problems. | Hubie Chen, Matthew Valeriote, Yuichi Yoshida |
| 2016 | ICALP | Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness. | Hubie Chen |
| 2016 | PODS | Counting Answers to Existential Positive Queries: A Complexity Classification. | Hubie Chen, Stefan Mengel |
| 2015 | COLT | Learnability of Solutions to Conjunctive Queries: The Full Dichotomy. | Hubie Chen, Matthew Valeriote |
| 2015 | ICDT | A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. | Hubie Chen, Stefan Mengel |
| 2014 | CSL | The tractability frontier of graph-like first-order query sets. | Hubie Chen |
| 2014 | CSL | One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries. | Hubie Chen, Moritz Mller |
| 2014 | ICDT | The Complexity of Width Minimization for Existential Positive Queries. | Simone Bova, Hubie Chen |
| 2013 | ICALP | Block-Sorted Quantified Conjunctive Queries. | Hubie Chen, Dniel Marx |
| 2013 | PODS | The fine classification of conjunctive queries and parameterized logarithmic space complexity. | Hubie Chen, Moritz Mller |
| 2012 | LICS | Decomposing Quantified Conjunctive (or Disjunctive) Formulas. | Hubie Chen, Vctor Dalmau |
| 2012 | LICS | An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction. | Hubie Chen, Moritz Mller |
| 2012 | TIME | Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction. | Hubie Chen, Michal Wrona |
| 2011 | ICALP | Generic Expression Hardness Results for Primitive Positive Formula Comparison. | Simone Bova, Hubie Chen, Matthew Valeriote |
| 2009 | WoLLIC | On-the-Fly Macros. | Hubie Chen, Omer Gimnez |
| 2008 | ICALP | Quantified Constraint Satisfaction and the Polynomially Generated Powers Property. | Hubie Chen |
| 2008 | LICS | Quantified Constraints and Containment Problems. | Hubie Chen, Florent R. Madelaine, Barnaby Martin |
| 2007 | CSL | Qualitative Temporal and Spatial Reasoning Revisited. | Manuel Bodirsky, Hubie Chen |
| 2007 | ICALP | Maximal Infinite-Valued Constraint Languages. | Manuel Bodirsky, Hubie Chen, Jan Kra, Timo von Oertzen |
| 2007 | LICS | Quantified Equality Constraints. | Manuel Bodirsky, Hubie Chen |
| 2006 | CSL | Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. | Manuel Bodirsky, Hubie Chen |
| 2005 | CP | Beyond Hypertree Width: Decomposition Methods Without Decompositions. | Hubie Chen, Vctor Dalmau |
| 2005 | CSL | From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. | Hubie Chen, Vctor Dalmau |
| 2005 | IJCAI | Parameterized Compilability. | Hubie Chen |
| 2005 | IJCAI | A Model for Generating Random Quantified Boolean Formulas. | Hubie Chen, Yannet Interian |
| 2005 | STACS | Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms. | Hubie Chen |
| 2004 | AAAI | Collapsibility and Consistency in Quantified Constraint Satisfaction. | Hubie Chen |
| 2004 | ALT | Learnability of Relatively Quantified Generalized Formulas. | Andrei A. Bulatov, Hubie Chen, Vctor Dalmau |
| 2004 | CP | Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms. | Hubie Chen |
| 2004 | CP | (Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability. | Hubie Chen, Vctor Dalmau |
| 2004 | ECAI | Quantified Constraint Satisfaction and Bounded Treewidth. | Hubie Chen |
| 2004 | ISAIM | The Expressive Rate of Constraints. | Hubie Chen |
| 2004 | MFCS | Optimization, Games, and Quantified Constraint Satisfaction. | Hubie Chen, Martin Pl |
| 2004 | SAT | Looking Algebraically at Tractable Quantified Boolean Formulas. | Hubie Chen, Vctor Dalmau |
| 2004 | SAT | Looking Algebraically at Tractable Quantified Boolean Formulas. | Hubie Chen, Vctor Dalmau |
| 2003 | CP | Periodic Constraint Satisfaction Problems: Polynomial-Time Algorithms. | Hubie Chen |
| 2003 | IJCAI | Inverse Circumscription. | Hubie Chen |
| 2003 | IJCAI | A Theory of Average-Case Compilability in Knowledge Representation. | Hubie Chen |
| 2003 | MFCS | Arithmetic Constant-Depth Circuit Complexity Classes. | Hubie Chen |
| 2003 | MFCS | Inverse NP Problems. | Hubie Chen |
| 2003 | SAT | An Algorithm for SAT Above the Threshold. | Hubie Chen |
| 2001 | CP | Formal Models of Heavy-Tailed Behavior in Combinatorial Search. | Hubie Chen, Carla P. Gomes, Bart Selman |