Scholar
Bernardo Subercaseaux
Google Scholar ID: 0EOonpYAAAAJ
Carnegie Mellon University
SAT
Computational Complexity
Algorithms
Logic
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
396
H-index
9
i10-index
8
Publications
20
Co-authors
20
list available
Publications
19 items
Coloring Queens with Thousands of Encodings
2026
Cited
0
A SAT Attack on Tarski's High School Algebra Problem
2026
Cited
0
ExplAIner: A Declarative Query Language for Explaining Classification Models
2026
Cited
0
On the Complexity of Counting Orderings in Graphs
2026
Cited
0
Doubly Saturated Ramsey Graphs: A Case Study in Computer-Assisted Mathematical Discovery
2026
Cited
0
Near-Optimal Encodings of Cardinality Constraints
2026
Cited
0
Automated Reencoding Meets Graph Theory
2026
Cited
0
Accelerating Scientific Research with Gemini: Case Studies and Common Techniques
2026
Cited
0
Load more
Co-authors
14 total
Pablo Barceló
Institute for Mathematical and Computational Engineering, PUC Chile & IMFD Chile & CENIA Chile
Jorge Pérez
Cero.ai
Marijn Heule
Associate Professor of Computer Science, Carnegie Mellon University
Marcelo Arenas
Professor of Computer Science, Pontificia Universidad Católica de Chile and IMFD Chile.
Miguel Romero Orth
Department of Computer Science, Pontificia Universidad Católica de Chile
Daniel Lokshtanov
Professor of Computer Science, UCSB
Debmalya Panigrahi
Professor of Computer Science at Duke University
Anupam Gupta
Professor of Computer Science at New York University
