Bernardo Subercaseaux
Scholar

Bernardo Subercaseaux

Google Scholar ID: 0EOonpYAAAAJ
Carnegie Mellon University
SATComputational ComplexityAlgorithmsLogic
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
396
 
H-index
9
 
i10-index
8
 
Publications
20
 
Co-authors
20
list available
Contact
No contact links provided.
Publications
14 items
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
Price of Locality in Permutation Mastermind: Are TikTok influencers Chaotic Enough?
2026
Cited
0
Optimal and Efficient Partite Decompositions of Hypergraphs
2025
Cited
0
From the Finite to the Infinite: Sharper Asymptotic Bounds on Norin's Conjecture via SAT
2025
Cited
0
Asymptotically Smaller Encodings for Graph Problems and Scheduling
2025
Cited
0
Unfolding Boxes with Local Constraints
2025
Cited
0
Resume (English only)
Co-authors
20 total
Pablo Barceló
Pablo Barceló
Institute for Mathematical and Computational Engineering, PUC Chile & IMFD Chile & CENIA Chile
Co-author 2
Co-author 2
Marijn Heule
Marijn Heule
Associate Professor of Computer Science, Carnegie Mellon University
Marcelo Arenas
Marcelo Arenas
Professor of Computer Science, Pontificia Universidad Católica de Chile and IMFD Chile.
Miguel Romero Orth
Miguel Romero Orth
Department of Computer Science, Pontificia Universidad Católica de Chile
Co-author 6
Co-author 6
Co-author 7
Co-author 7
Daniel Lokshtanov
Daniel Lokshtanov
Professor of Computer Science, UCSB