{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,18]],"date-time":"2026-09-18T00:26:08Z","timestamp":1789691168035,"version":"4.0.1"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T00:00:00Z","timestamp":1450656000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Sloan Fellowship"},{"name":"NSF CAREER award","award":["CCF-1149048, CCF-1212372,"],"award-info":[{"award-number":["CCF-1149048, CCF-1212372,"]}]},{"name":"Microsoft Research Fellowship"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2015,12,21]]},"abstract":"<jats:p>Algorithmic solutions to tough computational problems are making an impressive comeback.<\/jats:p>","DOI":"10.1145\/2742544","type":"journal-article","created":{"date-parts":[[2015,12,22]],"date-time":"2015-12-22T06:22:54Z","timestamp":1450765374000},"page":"98-105","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":23,"title":["Algebraic fingerprints for faster algorithms"],"prefix":"10.1145","volume":"59","author":[{"given":"Ioannis","family":"Koutis","sequence":"first","affiliation":[{"name":"University of Puerto Rico, Rio Piedras"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryan","family":"Williams","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,12,21]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btn163"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210337"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321111"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.24"},{"key":"e_1_2_1_5_1","volume-title":"27th International Symposium on Theoretical Aspects of Computer Science, STACS","volume":"5","author":"Bj\u00f6rklund A.","year":"2010"},{"key":"e_1_2_1_6_1","unstructured":"Bj\u00f6rklund A. Husfeldt T. Kaski P. Koivisto M. Narrow sieves for parameterized paths and packings. CoRR abs\/1007.1161 2010.  Bj\u00f6rklund A. Husfeldt T. Kaski P. Koivisto M. Narrow sieves for parameterized paths and packings. CoRR abs\/1007.1161 2010."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095255"},{"key":"e_1_2_1_8_1","volume-title":"30th International Symposium on Theoretical Aspects of Computer Science, STACS","volume":"20","author":"Bj\u00f6rklund A.","year":"2013"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.12.009"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Chen J.","year":"2007"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.23"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703427203"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2428556.2428575"},{"key":"e_1_2_1_15_1","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the Algorithms -- ESA 2014 -- 22th Annual European Symposium, Wroclaw, Poland, September 8--10","author":"Fomin F.V.","year":"2014"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.10.001"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1562164.1562186"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9600-8"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/0110015"},{"key":"e_1_2_1_20_1","volume-title":"Complexity of Computer Computations","author":"Karp R.M."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.12.005"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_47"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2012.08.008"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_54"},{"key":"e_1_2_1_25_1","first-page":"239","article-title":"How to find long paths efficiently","volume":"25","author":"Monien B","year":"1985","journal-title":"Ann. Dis. Math."},{"key":"e_1_2_1_26_1","volume-title":"USA","author":"Motwani R.","year":"1995"},{"key":"e_1_2_1_27_1","unstructured":"Rosamond F. Fellows M. Table of FPT Races. http:\/\/fpt.wikidot.com\/fpt-races\/.  Rosamond F. Fellows M. Table of FPT Races. http:\/\/fpt.wikidot.com\/fpt-races\/."},{"key":"e_1_2_1_28_1","volume-title":"Graduate Texts in Mathematics. Springer Verlag","author":"Royle G.","year":"1997"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2006.13.133"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.11.004"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722240"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2742544","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2742544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:00:33Z","timestamp":1750230033000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2742544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,21]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12,21]]}},"alternative-id":["10.1145\/2742544"],"URL":"https:\/\/doi.org\/10.1145\/2742544","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,21]]},"assertion":[{"value":"2015-12-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}