| 2024 | EUMAS | Search Versus Search for Collapsing Electoral Control Types. | Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narvez, Conor Taliancich, Henry B. Welles |
| 2023 | SIGCSE | Feedback Tools and Motivation to Persist in Intro CS Theory. | Ivona Bezkov, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narvez |
| 2022 | SIGCSE | Effective Succinct Feedback for Intro CS Theory: A JFLAP Extension. | Ivona Bezkov, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narvez |
| 2021 | AAAI | Toward Determining NFA Equivalence via QBFs (Student Abstract). | Hannah Miller, David E. Narvez |
| 2021 | SIGCSE | Witness Feedback for Introductory CS Theory Assignments. | Ivona Bezkov, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narvez |
| 2020 | AAAI | A QSAT Benchmark Based on Vertex-Folkman Problems (Student Abstract). | David E. Narvez |
| 2020 | CADE | The Resolution of Keller's Conjecture. | Joshua Brakensiek, Marijn Heule, John Mackey, David E. Narvez |
| 2020 | SIGCSE | Prototype of an Automated Feedback Tool for Intro CS Theory. | Ivona Bezkov, Edith Hemaspaandra, Aryeh Lieberman, Hannah Miller, David E. Narvez |
| 2019 | AAAI | Very Hard Electoral Control Problems. | Zack Fitzsimmons, Edith Hemaspaandra, Alexander Hoover, David E. Narvez |
| 2019 | SOFSEM | Existence Versus Exploitation: The Opacity of Backdoors and Backbones Under a Weak Assumption. | Lane A. Hemaspaandra, David E. Narvez |
| 2018 | AAAI | Constraint Satisfaction Techniques for Combinatorial Problems. | David E. Narvez |
| 2018 | AAAI | Exploring the Use of Shatter for AllSAT Through Ramsey-Type Problems. | David E. Narvez |
| 2017 | AAAI | The Opacity of Backbones. | Lane A. Hemaspaandra, David E. Narvez |