David E. Narváez

According to our database, David E. Narváez authored at least 28 papers between 2017 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

CF-GKAT: Efficient Validation of Control-Flow Transformations.

Cheng Zhang, Tobias Kappé, David E. Narváez, Nico Naus

Proc. ACM Program. Lang., 2025

2024

Separating and Collapsing Electoral Control Types.

Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles

J. Artif. Intell. Res., 2024

Formalizing Finite Ramsey Theory in Lean 4.

David E. Narváez, Cruise Song, Ningxin Zhang

Proceedings of the Intelligent Computer Mathematics - 17th International Conference, 2024

Search Versus Search for Collapsing Electoral Control Types.

Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra, David E. Narváez, Conor Taliancich, Henry B. Welles

Proceedings of the Multi-Agent Systems - 21st European Conference, 2024

2023

On Some Generalized Vertex Folkman Numbers.

Zohair Raza Hassan, Yu Jiang, David E. Narváez, Stanislaw P. Radziszowski, Xiaodong Xu

Graphs Comb., June, 2023

Feedback Tools and Motivation to Persist in Intro CS Theory.

Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez

Proceedings of the 54th ACM Technical Symposium on Computer Science Education, Volume 2, 2023

2022

Formal Methods for NFA Equivalence: QBFs, Witness Extraction, and Encoding Verification.

Edith Hemaspaandra, David E. Narváez

Dataset, July, 2022

The Resolution of Keller's Conjecture.

Joshua Brakensiek, Marijn Heule, John Mackey, David E. Narváez

J. Autom. Reason., 2022

Effective Succinct Feedback for Intro CS Theory: A JFLAP Extension.

Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez

Proceedings of the SIGCSE 2022: The 53rd ACM Technical Symposium on Computer Science Education, 2022

Formal Methods for NFA Equivalence: QBFs, Witness Extraction, and Encoding Verification.

Edith Hemaspaandra, David E. Narváez

Proceedings of the Intelligent Computer Mathematics - 15th International Conference, 2022

2021

Existence versus exploitation: the opacity of backdoors and backbones.

Lane A. Hemaspaandra, David E. Narváez

Prog. Artif. Intell., 2021

The opacity of backbones.

Lane A. Hemaspaandra, David E. Narváez

Inf. Comput., 2021

Star-critical Ramsey numbers for cycles versus <i>K₄</i>.

Chula J. Jayawardene, David E. Narváez, Stanislaw P. Radziszowski

Discuss. Math. Graph Theory, 2021

On Lev Gordeev's "On P Versus NP".

David E. Narváez, Patrick A. Phillips

CoRR, 2021

On Salum's Algorithm for X3SAT.

Arian Nadjimzadah, David E. Narváez

CoRR, 2021

On Arroyo-Figueroa's Proof that $\mathrm{P} \neq \mathrm{NP}$.

Mandar Juvekar, David E. Narváez, Melissa Welsh

CoRR, 2021

Witness Feedback for Introductory CS Theory Assignments.

Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez

Proceedings of the SIGCSE '21: The 52nd ACM Technical Symposium on Computer Science Education, 2021

Toward Determining NFA Equivalence via QBFs (Student Abstract).

Hannah Miller, David E. Narváez

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

The Resolution of Keller's Conjecture - Computation Logs.

Joshua Brakensiek, Marijn Heule, John Mackey, David E. Narváez

Dataset, April, 2020

Effective Feedback for Introductory CS Theory: A JFLAP Extension and Student Persistence.

Ivona Bezáková, Kimberly Fluet, Edith Hemaspaandra, Hannah Miller, David E. Narváez

CoRR, 2020

Prototype of an Automated Feedback Tool for Intro CS Theory.

Ivona Bezáková, Edith Hemaspaandra, Aryeh Lieberman, Hannah Miller, David E. Narváez

Proceedings of the 51st ACM Technical Symposium on Computer Science Education, 2020

A QSAT Benchmark Based on Vertex-Folkman Problems (Student Abstract).

David E. Narváez

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Existence Versus Exploitation: The Opacity of Backdoors and Backbones Under a Weak Assumption.

Lane A. Hemaspaandra, David E. Narváez

Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Formalizing CNF SAT Symmetry Breaking in PVS.

David E. Narváez

Proceedings of the NASA Formal Methods - 11th International Symposium, 2019

Very Hard Electoral Control Problems.

Zack Fitzsimmons, Edith Hemaspaandra, Alexander Hoover, David E. Narváez

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Exploring the Use of Shatter for AllSAT Through Ramsey-Type Problems.

David E. Narváez

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Constraint Satisfaction Techniques for Combinatorial Problems.

David E. Narváez

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

The Opacity of Backbones and Backdoors Under a Weak Assumption.

Lane A. Hemaspaandra, David E. Narváez

CoRR, 2017