Formal Models of Heavy-Tailed Behavior in Combinatorial Search. - Hubie Chen; Carla P. Gomes; Bart Selman (CP, 2001)

Polynomial Programs and the Razborov-Smolensky Method - Hubie Chen (Electron. Colloquium Comput. Complex., 2001)

Arithmetic Versions of Constant Depth Circuit Complexity Classes - Hubie Chen (Electron. Colloquium Comput. Complex., 2001)

Periodic Constraint Satisfaction Problems: Polynomial-Time Algorithms. - Hubie Chen (CP, 2003)

Inverse Circumscription. - Hubie Chen (IJCAI, 2003)

A Theory of Average-Case Compilability in Knowledge Representation. - Hubie Chen (IJCAI, 2003)

Arithmetic Constant-Depth Circuit Complexity Classes. - Hubie Chen (MFCS, 2003)

An Algorithm for SAT Above the Threshold. - Hubie Chen (SAT, 2003)

Collapsibility and Consistency in Quantified Constraint Satisfaction. - Hubie Chen (AAAI, 2004)

Learnability of Relatively Quantified Generalized Formulas. - Andrei A. Bulatov; Hubie Chen; Víctor Dalmau (ALT, 2004)

Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms. - Hubie Chen (CP, 2004)

(Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability. - Hubie Chen; Víctor Dalmau (CP, 2004)

Owned Policies for Information Security. - Hubie Chen; Stephen Chong (CSFW, 2004)

Quantified Constraint Satisfaction and Bounded Treewidth. - Hubie Chen (ECAI, 2004)

Optimization, Games, and Quantified Constraint Satisfaction. - Hubie Chen; Martin Pál (MFCS, 2004)

Looking Algebraically at Tractable Quantified Boolean Formulas. - Hubie Chen; Víctor Dalmau (SAT, 2004)

A coalgebraic approach to Kleene algebra with tests. - Hubie Chen; Riccardo Pucella (Theor. Comput. Sci., 2004)

The Computational Complexity of Quantified Constraint Satisfaction. - Hubert Ming Chen (2004)

Beyond Hypertree Width: Decomposition Methods Without Decompositions. - Hubie Chen; Víctor Dalmau (CP, 2005)

From Pebble Games to Tractability: An Ambidextrous Consistency Algorithm for Quantified Constraint Satisfaction. - Hubie Chen; Víctor Dalmau (CSL, 2005)

Parameterized Compilability. - Hubie Chen (IJCAI, 2005)

A Model for Generating Random Quantified Boolean Formulas. - Hubie Chen; Yannet Interian (IJCAI, 2005)

The expressive rate of constraints. - Hubie Chen (Ann. Math. Artif. Intell., 2005)

Periodic Constraint Satisfaction Problems: Tractable Subclasses. - Hubie Chen (Constraints An Int. J., 2005)

Quantified Constraint Satisfaction, Maximal Constraint Languages, and Symmetric Polymorphisms - Hubie Chen (Electron. Colloquium Comput. Complex., 2005)

Collapsibility in Infinite-Domain Quantified Constraint Satisfaction. - Manuel Bodirsky; Hubie Chen (CSL, 2006)

Logic Column 17: A Rendezvous of Logic, Complexity, and Algebra - Hubie Chen (CoRR, 2006)

A rendezvous of logic, complexity, and algebra. - Hubie Chen (SIGACT News, 2006)

Act Local, Think Global: Width Notions for Tractable Planning. - Hubie Chen; Omer Giménez (ICAPS, 2007)

Learning intersection-closed classes with signatures. - Andrei A. Bulatov; Hubie Chen; Víctor Dalmau (Theor. Comput. Sci., 2007)

Quantified Constraint Satisfaction and the Polynomially Generated Powers Property. - Hubie Chen (ICALP (2), 2008)

Inverse NP Problems. - Hubie Chen (Comput. Complex., 2008)

The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case. - Hubie Chen (SIAM J. Comput., 2008)

On-the-Fly Macros. - Hubie Chen; Omer Giménez (WoLLIC, 2009)

Relatively quantified constraint satisfaction. - Manuel Bodirsky; Hubie Chen (Constraints An Int. J., 2009)

The complexity of constraint satisfaction games and QCSP. - Ferdinand Börner; Andrei A. Bulatov; Hubie Chen; Peter Jeavons 001; Andrei A. Krokhin (Inf. Comput., 2009)

Existentially restricted quantified constraint satisfaction. - Hubie Chen (Inf. Comput., 2009)

Qualitative Temporal and Spatial Reasoning Revisited. - Manuel Bodirsky; Hubie Chen (J. Log. Comput., 2009)

Maximal infinite-valued constraint languages. - Manuel Bodirsky; Hubie Chen; Jan Kára; Timo von Oertzen (Theor. Comput. Sci., 2009)

Causal graphs and structurally restricted planning. - Hubie Chen; Omer Giménez (J. Comput. Syst. Sci., 2010)

Constraint satisfaction with succinctly specified relations. - Hubie Chen; Martin Grohe (J. Comput. Syst. Sci., 2010)

The reducts of equality up to primitive positive interdefinability. - Manuel Bodirsky; Hubie Chen; Michael Pinsker (J. Symb. Log., 2010)

Quantified Equality Constraints. - Manuel Bodirsky; Hubie Chen (SIAM J. Comput., 2010)

Peek arc consistency. - Manuel Bodirsky; Hubie Chen (Theor. Comput. Sci., 2010)

Meditations on Quantified Constraint Satisfaction. - Hubie Chen (Logic and Program Semantics, 2012)

Guarded Ord-Horn: A Tractable Fragment of Quantified Constraint Satisfaction. - Hubie Chen; Michal Wrona (TIME, 2012)

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction - Hubie Chen; Moritz Müller (Log. Methods Comput. Sci., 2012)

On the Expression Complexity of Equivalence and Isomorphism of Primitive Positive Formulas. - Simone Bova; Hubie Chen; Matthew Valeriote (Theory Comput. Syst., 2012)

On the Complexity of MMSNP. - Manuel Bodirsky; Hubie Chen; Tomás Feder (SIAM J. Discret. Math., 2012)

Block-Sorted Quantified Conjunctive Queries. - Hubie Chen; Dániel Marx (ICALP (2), 2013)

The fine classification of conjunctive queries and parameterized logarithmic space complexity. - Hubie Chen; Moritz Müller (PODS, 2013)

Generic expression hardness results for primitive positive formula comparison. - Simone Bova; Hubie Chen; Matthew Valeriote (Inf. Comput., 2013)

Bounded rationality, strategy simplification, and equilibrium. - Hubie Chen (Int. J. Game Theory, 2013)

Arc consistency and friends. - Hubie Chen; Víctor Dalmau; Berit Grußien (J. Log. Comput., 2013)

The Complexity of Width Minimization for Existential Positive Queries. - Simone Bova; Hubie Chen (ICDT, 2014)

Beyond Q-Resolution and Prenex Form: A Proof System for Quantified Constraint Satisfaction. - Hubie Chen (Log. Methods Comput. Sci., 2014)

An Algebraic Hardness Criterion for Surjective Constraint Satisfaction. - Hubie Chen (CoRR, 2014)

Tractability of quantified temporal constraints to the max. - Manuel Bodirsky; Hubie Chen; Michal Wrona (Int. J. Algebra Comput., 2014)

On the complexity of existential positive queries. - Hubie Chen (ACM Trans. Comput. Log., 2014)

Learnability of Solutions to Conjunctive Queries: The Full Dichotomy. - Hubie Chen; Matthew Valeriote (COLT, 2015)

A Trichotomy in the Complexity of Counting Answers to Conjunctive Queries. - Hubie Chen; Stefan Mengel (ICDT, 2015)

Parameter Compilation. - Hubie Chen (IPEC, 2015)

The Logic of Counting Query Answers: A Study via Existential Positive Queries. - Hubie Chen; Stefan Mengel (CoRR, 2015)

Quantified Constraints and Containment Problems. - Hubie Chen; Florent R. Madelaine; Barnaby Martin (Log. Methods Comput. Sci., 2015)

The complexity of equivalence, entailment, and minimization in existential positive logic. - Simone Bova; Hubie Chen (J. Comput. Syst. Sci., 2015)

The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space. - Hubie Chen; Moritz Müller (ACM Trans. Comput. Theory, 2015)

Quantified Constraint Satisfaction on Monoids. - Hubie Chen; Peter Mayr 001 (CSL, 2016)

Testing Assignments to Constraint Satisfaction Problems. - Hubie Chen; Matthew Valeriote; Yuichi Yoshida (FOCS, 2016)

Counting Answers to Existential Positive Queries: A Complexity Classification. - Hubie Chen; Stefan Mengel (PODS, 2016)

Decomposing Quantified Conjunctive (or Disjunctive) Formulas. - Hubie Chen; Víctor Dalmau (SIAM J. Comput., 2016)

The logic of counting query answers. - Hubie Chen; Stefan Mengel (LICS, 2017)

Homomorphisms are indeed a good basis for counting: Three fixed-template dichotomy theorems, for the price of one. - Hubie Chen (CoRR, 2017)

The Tractability Frontier of Graph-Like First-Order Query Sets. - Hubie Chen (J. ACM, 2017)

The Parameterized Space Complexity of Embedding Along a Path. - Hubie Chen; Moritz Müller (Theory Comput. Syst., 2017)

One Hierarchy Spawns Another: Graph Deconstructions and the Complexity Classification of Conjunctive Queries. - Hubie Chen; Moritz Müller (ACM Trans. Comput. Log., 2017)

Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness. - Hubie Chen (ACM Trans. Comput. Theory, 2017)

Asking the Metaquestions in Constraint Tractability. - Hubie Chen; Benoît Larose (ACM Trans. Comput. Theory, 2017)

The Computational Complexity of Distinctive Feature Minimization in Phonology. - Hubie Chen; Mans Hulden (NAACL-HLT (2), 2018)

Compiling Existential Positive Queries to Bounded-Variable Fragments. - Christoph Berkholz; Hubie Chen (PODS, 2019)

The Selfish Models Property: Bounding the Complexity of Query Containment and Entailment Problems. - Hubie Chen (PODS, 2019)

Testability of Homomorphism Inadmissibility: Property Testing Meets Database Theory. - Hubie Chen; Yuichi Yoshida (PODS, 2019)

The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms. - Hubie Chen; Radu Curticapean; Holger Dell (WG, 2019)

Learnability of Solutions to Conjunctive Queries. - Hubie Chen; Matthew Valeriote (J. Mach. Learn. Res., 2019)

How Many Variables are Needed to Express an Existential Positive Query? - Simone Bova; Hubie Chen (Theory Comput. Syst., 2019)

Constant-Query Testability of Assignments to Constraint Satisfaction Problems. - Hubie Chen; Matt Valeriote; Yuichi Yoshida (SIAM J. Comput., 2019)

Semantic Width and the Fixed-Parameter Tractability of Constraint Satisfaction Problems. - Hubie Chen; Georg Gottlob; Matthias Lanzinger; Reinhard Pichler (IJCAI, 2020)

Sparsification Lower Bounds for List H-Coloring. - Hubie Chen; Bart M. P. Jansen; Karolina Okrasa; Astrid Pieterse; Pawel Rzazewski (ISAAC, 2020)

Best-Case and Worst-Case Sparsifiability of Boolean CSPs. - Hubie Chen; Bart M. P. Jansen; Astrid Pieterse (Algorithmica, 2020)

Counting Solutions to Conjunctive Queries: Structural and Hybrid Tractability. - Hubie Chen; Gianluigi Greco; Stefan Mengel; Francesco Scarcello (CoRR, 2023)

Sparsification Lower Bounds for List H-Coloring. - Hubie Chen; Bart M. P. Jansen; Karolina Okrasa; Astrid Pieterse; Pawel Rzazewski (ACM Trans. Comput. Theory, 2023)

Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity. - Hubie Chen; Stefan Mengel (ICDT, 2024)

Intermediate Relation Size Bounds for Select-Project-Join Query Plans: Asymptotically Tight Characterizations. - Hubie Chen; Markus Schneider (CoRR, 2024)

Algebraic Global Gadgetry for Surjective Constraint Satisfaction. - Hubie Chen (Comput. Complex., 2024)