{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,16]],"date-time":"2025-06-16T12:09:34Z","timestamp":1750075774358},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662447765"},{"type":"electronic","value":"9783662447772"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44777-2_13","type":"book-chapter","created":{"date-parts":[[2014,8,16]],"date-time":"2014-08-16T06:43:15Z","timestamp":1408171395000},"page":"149-160","source":"Crossref","is-referenced-by-count":6,"title":["Fast Witness Extraction Using a Decision Oracle"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Bj\u00f6rklund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petteri","family":"Kaski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Kowalik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Narrow sieves for parameterized paths and packings. arXiv 1007.1161 (2010)"},{"key":"13_CR2","unstructured":"Bj\u00f6rklund, A., Kaski, P., Kowalik, \u0141.: Probably optimal graph motifs. In: Proc. STACS 2013, pp. 20\u201331 (2013)"},{"issue":"6","key":"13_CR3","doi-asserted-by":"publisher","first-page":"2526","DOI":"10.1137\/080716475","volume":"38","author":"J. Chen","year":"2009","unstructured":"Chen, J., Kneis, J., Lu, S., M\u00f6lle, D., Richter, S., Rossmanith, P., Sze, S.H., Zhang, F.: Randomized divide-and-conquer: Improved path, matching, and packing algorithms. SIAM Journal on Computing\u00a038(6), 2526\u20132547 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR4","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer (to appear)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Cygan, M., Kratsch, S., Nederlof, J.: Fast hamiltonicity checking via bases of perfect matchings. In: Proc. STOC 2013, pp. 301\u2013310. ACM (2013)","DOI":"10.1145\/2488608.2488646"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0166-218X(93)90011-C","volume":"45","author":"D.Z. Du","year":"1993","unstructured":"Du, D.Z., Hwang, F.K.: Competitive group testing. Discrete Appl. Math.\u00a045(3), 221\u2013232 (1993)","journal-title":"Discrete Appl. Math."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications. Series on Applied Mathematics, vol.\u00a012. World Scientific Publishing Co. Inc. (2000)","DOI":"10.1142\/4252"},{"issue":"2","key":"13_CR8","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.spl.2007.05.011","volume":"78","author":"B. Eisenberg","year":"2008","unstructured":"Eisenberg, B.: On the expectation of the maximum of IID geometric random variables. Statistics & Probability Letters\u00a078(2), 135 (2008)","journal-title":"Statistics & Probability Letters"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Fellows, M.R., Langston, M.A.: On search decision and the efficiency of polynomial-time algorithms. In: Proc. STOC 1989, pp. 501\u2013512. ACM (1989)","DOI":"10.1145\/73007.73055"},{"issue":"14","key":"13_CR10","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/j.ipl.2010.04.011","volume":"110","author":"S. Gueron","year":"2010","unstructured":"Gueron, S., Kounavis, M.: Efficient implementation of the Galois Counter Mode using a carry-less multiplier and a fast reduction algorithm. Information Processing Letters\u00a0110(14), 549\u2013553 (2010)","journal-title":"Information Processing Letters"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-40104-6_34","volume-title":"Algorithms and Data Structures","author":"A. Hassidim","year":"2013","unstructured":"Hassidim, A., Keller, O., Lewenstein, M., Roditty, L.: Finding the minimum-weight k-path. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol.\u00a08037, pp. 390\u2013401. Springer, Heidelberg (2013)"},{"issue":"22","key":"13_CR12","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/j.ipl.2012.08.008","volume":"112","author":"I. Koutis","year":"2012","unstructured":"Koutis, I.: Constrained multilinear detection for faster functional motif discovery. Inform. Process. Lett.\u00a0112(22), 889\u2013892 (2012)","journal-title":"Inform. Process. Lett."},{"issue":"6","key":"13_CR13","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ipl.2008.11.004","volume":"109","author":"R. Williams","year":"2009","unstructured":"Williams, R.: Finding paths of length k in O *(2 k ) time. Inform. Process. Lett.\u00a0109(6), 315\u2013318 (2009)","journal-title":"Inform. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44777-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T18:25:28Z","timestamp":1649960728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44777-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662447765","9783662447772"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44777-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}