Follow
David E. NarvŠez
David E. NarvŠez
Postdoctoral Associate, Bradley Department of Electrical and Computer Engineering, Virginia Tech
Verified email at computer.org - Homepage
Title
Cited by
Cited by
Year
The resolution of Keller’s conjecture
J Brakensiek, M Heule, J Mackey, D NarvŠez
International Joint Conference on Automated Reasoning, 48-65, 2020
512020
The opacity of backbones
LA Hemaspaandra, DE NarvŠez
Thirty-First AAAI Conference on Artificial Intelligence, 2017
152017
Existence Versus Exploitation: The Opacity of Backdoors and Backbones Under a Weak Assumption
LA Hemaspaandra, DE NarvŠez
International Conference on Current Trends in Theory and Practice of†…, 2019
62019
Existence versus Exploitation: The Opacity of Backbones and Backdoors Under a Weak Assumption
LA Hemaspaandra, DE NarvŠez
arXiv preprint arXiv:1706.04582, 2017
6*2017
Very hard electoral control problems
Z Fitzsimmons, E Hemaspaandra, A Hoover, DE NarvŠez
Proceedings of the AAAI Conference on Artificial Intelligence 33, 1933-1940, 2019
52019
Star-critical Ramsey Numbers for Cycles Versus K4
CJ Jayawardene, D NarvŠez, S Radziszowski
52018
Existence versus exploitation: the opacity of backdoors and backbones
LA Hemaspaandra, DE NarvŠez
Progress in Artificial Intelligence 10 (3), 297-308, 2021
42021
Constraint Satisfaction Techniques for Combinatorial Problems
DE NarvŠez
Thirty-Second AAAI Conference on Artificial Intelligence, 2018
42018
Prototype of an Automated Feedback Tool for Intro CS Theory
I BezŠkovŠ, E Hemaspaandra, A Lieberman, H Miller, DE NarvŠez
Proceedings of the 51st ACM Technical Symposium on Computer Science†…, 2020
32020
Effective Succinct Feedback for Intro CS Theory: A JFLAP Extension
I BezŠkovŠ, K Fluet, E Hemaspaandra, H Miller, DE NarvŠez
Proceedings of the 53rd ACM Technical Symposium on Computer Science†…, 2022
22022
On Some Generalized Vertex Folkman Numbers
ZR Hassan, Y Jiang, DE NarvŠez, S Radziszowski, X Xu
arXiv preprint arXiv:2110.03121, 2021
22021
Formalizing CNF SAT symmetry breaking in PVS
DE NarvŠez
NASA Formal Methods Symposium, 341-354, 2019
22019
The opacity of backbones and backdoors under a weak assumption
L Hemaspaandra, D NarvŠez
arXiv preprint arXiv:1706.04582, 2017
22017
Las OntologŪas y el Lenguaje OWL 2
D NarvŠez
Prisma Tecnolůgico 2, 31-34, 2010
22010
Witness Feedback for Introductory CS Theory Assignments
I BezŠkovŠ, K Fluet, E Hemaspaandra, H Miller, DE NarvŠez
Proceedings of the 52nd ACM Technical Symposium on Computer Science†…, 2021
12021
Effective Feedback for Introductory CS Theory: A JFLAP Extension and Student Persistence
I BezŠkovŠ, K Fluet, E Hemaspaandra, H Miller, DE NarvŠez
arXiv preprint arXiv:2012.01546, 2020
12020
Exploring the use of Shatter for ALLSAT through Ramsey-type problems
DE NarvŠez
Thirty-Second AAAI Conference on Artificial Intelligence, 2018
12018
Formal Methods for NFA Equivalence: QBFs, Witness Extraction, and Encoding Verification
E Hemaspaandra, DE NarvŠez
International Conference on Intelligent Computer Mathematics, 241-255, 2022
2022
Toward Determining NFA Equivalence via QBFs (Student Abstract)
H Miller, DE NarvŠez
Proceedings of the AAAI Conference on Artificial Intelligence 35 (18), 15849†…, 2021
2021
A QSAT Benchmark Based on Vertex-Folkman Problems (Student Abstract)
DE NarvŠez
Proceedings of the AAAI Conference on Artificial Intelligence 34 (10), 13881†…, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–20