{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:43:47Z","timestamp":1765233827043,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T00:00:00Z","timestamp":1719964800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"State of Idaho appropriated funding for the Center for Advanced Energy Studies (CAES)"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,3]]},"DOI":"10.1145\/3649217.3653544","type":"proceedings-article","created":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T18:30:20Z","timestamp":1720031420000},"page":"255-261","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Redux: An Interactive, Dynamic Knowledge Base for Teaching NP-completeness"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-4028-1657","authenticated-orcid":false,"given":"Kaden","family":"Marchetti","sequence":"first","affiliation":[{"name":"Idaho State University, Pocatello, ID, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1077-0837","authenticated-orcid":false,"given":"Andrija","family":"Sevaljevic","sequence":"additional","affiliation":[{"name":"Idaho State University, Pocatello, ID, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9841-3449","authenticated-orcid":false,"given":"Alex","family":"Diviney","sequence":"additional","affiliation":[{"name":"Idaho State University, Pocatello, ID, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9711-4458","authenticated-orcid":false,"given":"Caleb","family":"Eardley","sequence":"additional","affiliation":[{"name":"Idaho State University, Pocatello, ID, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2986-7889","authenticated-orcid":false,"given":"Russell","family":"Phillips","sequence":"additional","affiliation":[{"name":"Idaho State University, Pocatello, ID, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2251-8751","authenticated-orcid":false,"given":"Rajiv","family":"Khadka","sequence":"additional","affiliation":[{"name":"Idaho State University, Pocatello, ID, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-4906-5319","authenticated-orcid":false,"given":"Daniel","family":"Igbokwe","sequence":"additional","affiliation":[{"name":"Idaho State University, Pocatello, ID, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5941-0069","authenticated-orcid":false,"given":"Paul","family":"Bodily","sequence":"additional","affiliation":[{"name":"Idaho State University, Pocatello, ID, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,7,3]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"CGM: A context-free grammar manipulator. CoRTA'2008","author":"Almeida Andr\u00e9","year":"2008","unstructured":"Andr\u00e9 Almeida, Jos\u00e9 Alves, Nelma Moreira, and Rog\u00e9rio Reis. 2008. CGM: A context-free grammar manipulator. CoRTA'2008 (2008), 44."},{"key":"e_1_3_2_1_2_1","volume-title":"IEEE transactions on visualization and computer graphics","author":"Bostock Michael","year":"2011","unstructured":"Michael Bostock, Vadim Ogievetsky, and Jeffrey Heer. 2011. D$^3$ data-driven documents. IEEE transactions on visualization and computer graphics, Vol. 17, 12 (2011), 2301--2309."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_1_5_1","volume-title":"Australasian Conference on Computer Science Education. Australian Computer Society Inc.","author":"Brookes WC","year":"2004","unstructured":"WC Brookes. 2004. Computing theory with relevance. In Australasian Conference on Computer Science Education. Australian Computer Society Inc."},{"key":"e_1_3_2_1_6_1","unstructured":"Joshua Joseph Cogliati et al. 2004. Visualizing the pumping lemma for regular languages. Ph. D. Dissertation. Montana State University-Bozeman College of Engineering."},{"key":"e_1_3_2_1_7_1","volume-title":"The vertex-cover problem. Introduction to Algorithms","author":"Cormen TH","year":"2001","unstructured":"TH Cormen, EC Leiserson, LR Rivest, and C Stein. 2001. Section 35.1: The vertex-cover problem. Introduction to Algorithms (2nd ed.) MIT Press and McGraw-Hill (2001), 10241027.","edition":"2"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1822090.1822175"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2462476.2465582"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Edsger W Dijkstra et al. 1959. A note on two problems in connexion with graphs. Numerische mathematik Vol. 1 1 (1959) 269--271.","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_11_1","unstructured":"Felix Erlacher et al. 2009. Pushdown automata simulator. PhD Institut f\u00fcr Informatik Universit\u00e4t Innsbruck (2009)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009191"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2325296.2325373"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0402008"},{"key":"e_1_3_2_1_15_1","volume-title":"Informatics in Schools: Local Proceedings of the 6th International Conference ISSEP 2013--Selected Papers. 35","author":"Kim Seungyon","year":"2013","unstructured":"Seungyon Kim and Seongbin Park. 2013. Teaching NP completeness in secondary schools. In Informatics in Schools: Local Proceedings of the 6th International Conference ISSEP 2013--Selected Papers. 35."},{"key":"e_1_3_2_1_16_1","volume-title":"Dancing links. arXiv preprint cs\/0011047","author":"Knuth Donald E","year":"2000","unstructured":"Donald E Knuth. 2000. Dancing links. arXiv preprint cs\/0011047 (2000)."},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the 54th ACM Technical Symposium on Computer Science Education V. 1. 284--290","author":"Luu Michael","year":"2023","unstructured":"Michael Luu, Matthew Ferland, Varun Nagaraj Rao, Arushi Arora, Randy Huynh, Frederick Reiber, Jennifer Wong-Ma, and Michael Shindler. 2023. What is an algorithms course? Survey results of introductory undergraduate algorithms courses in the US. In Proceedings of the 54th ACM Technical Symposium on Computer Science Education V. 1. 284--290."},{"key":"e_1_3_2_1_18_1","unstructured":"Nabanita Maji. 2015. An interactive tutorial for NP-completeness. Ph. D. Dissertation. Virginia Tech."},{"key":"e_1_3_2_1_19_1","volume-title":"Redux: An Interactive, Dynamic Tool for Learning NP-Completeness and Mapping Reductions. Ph.,D. Dissertation","author":"Marchetti Kaden","year":"2023","unstructured":"Kaden Marchetti. 2023. Redux: An Interactive, Dynamic Tool for Learning NP-Completeness and Mapping Reductions. Ph.,D. Dissertation. Idaho State University."},{"key":"e_1_3_2_1_20_1","first-page":"13","article-title":"FASharpSim: A Software Simulator for Deterministic and Nondeterministic Finite Automata","volume":"2","author":"Ni\u00c8 Georgiana Mihaela","year":"2017","unstructured":"Georgiana Mihaela Ni\u00c8 et al. 2017. FASharpSim: A Software Simulator for Deterministic and Nondeterministic Finite Automata. Journal of Electrical Engineering, Electronics, Control and Computer Science, Vol. 2, 2 (2017), 13--20.","journal-title":"Journal of Electrical Engineering, Electronics, Control and Computer Science"},{"key":"e_1_3_2_1_21_1","volume-title":"ACM Computer Science Curricula","author":"Joint Task Force on Computing Curricula. 2023.","year":"2023","unstructured":"Joint Task Force on Computing Curricula. 2023. ACM Computer Science Curricula 2023. Technical Report. Association for Computing Machinery. https:\/\/www.acm.org\/binaries\/content\/assets\/education\/cs2023-final-report.pdf"},{"key":"e_1_3_2_1_22_1","unstructured":"Susan H Rodger and Thomas W Finley. 2006. JFLAP: an interactive formal languages and automata package. Jones & Bartlett Learning."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508865.1509011"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1002\/cae.22135"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/230514.571645"}],"event":{"name":"ITiCSE 2024: Innovation and Technology in Computer Science Education","sponsor":["SIGCSE ACM Special Interest Group on Computer Science Education"],"location":"Milan Italy","acronym":"ITiCSE 2024"},"container-title":["Proceedings of the 2024 on Innovation and Technology in Computer Science Education V. 1"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649217.3653544","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649217.3653544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T14:50:23Z","timestamp":1755787823000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649217.3653544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,3]]},"references-count":25,"alternative-id":["10.1145\/3649217.3653544","10.1145\/3649217"],"URL":"https:\/\/doi.org\/10.1145\/3649217.3653544","relation":{},"subject":[],"published":{"date-parts":[[2024,7,3]]},"assertion":[{"value":"2024-07-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}