David E. Narváez

Orcid: 0000-0003-3704-1060

According to our database1, David E. Narváez authored at least 24 papers between 2017 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On Some Generalized Vertex Folkman Numbers.
Graphs Comb., June, 2023

Feedback Tools and Motivation to Persist in Intro CS Theory.
Proceedings of the 54th ACM Technical Symposium on Computer Science Education, Volume 2, 2023

Search versus Search for Collapsing Electoral Control Types.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

Separating and Collapsing Electoral Control Types.
Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, 2023

2022
The Resolution of Keller's Conjecture.
J. Autom. Reason., 2022

Effective Succinct Feedback for Intro CS Theory: A JFLAP Extension.
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.
Proceedings of the Intelligent Computer Mathematics - 15th International Conference, 2022

2021
Existence versus exploitation: the opacity of backdoors and backbones.
Prog. Artif. Intell., 2021

The opacity of backbones.
Inf. Comput., 2021

Star-critical Ramsey numbers for cycles versus <i>K<sub>4</sub></i>.
Discuss. Math. Graph Theory, 2021

On Lev Gordeev's "On P Versus NP".
CoRR, 2021

On Salum's Algorithm for X3SAT.
CoRR, 2021

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

Witness Feedback for Introductory CS Theory Assignments.
Proceedings of the SIGCSE '21: The 52nd ACM Technical Symposium on Computer Science Education, 2021

Toward Determining NFA Equivalence via QBFs (Student Abstract).
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

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

Prototype of an Automated Feedback Tool for Intro CS Theory.
Proceedings of the 51st ACM Technical Symposium on Computer Science Education, 2020

A QSAT Benchmark Based on Vertex-Folkman Problems (Student Abstract).
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.
Proceedings of the SOFSEM 2019: Theory and Practice of Computer Science, 2019

Formalizing CNF SAT Symmetry Breaking in PVS.
Proceedings of the NASA Formal Methods - 11th International Symposium, 2019

Very Hard Electoral Control Problems.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Exploring the Use of Shatter for AllSAT Through Ramsey-Type Problems.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

Constraint Satisfaction Techniques for Combinatorial Problems.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
The Opacity of Backbones and Backdoors Under a Weak Assumption.
CoRR, 2017


  Loading...