{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T21:13:29Z","timestamp":1771190009581,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540359043","type":"print"},{"value":"9783540359050","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_24","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T06:46:45Z","timestamp":1151477205000},"page":"262-273","source":"Crossref","is-referenced-by-count":14,"title":["Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems"],"prefix":"10.1007","author":[{"given":"Virginia","family":"Vassilevska","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryan","family":"Williams","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raphael","family":"Yuster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/BF01940874","volume":"16","author":"N. Alon","year":"1996","unstructured":"Alon, N., Naor, M.: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica\u00a016, 434\u2013449 (1996)","journal-title":"Algorithmica"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. Journal of the ACM\u00a042, 844\u2013856 (1995)","journal-title":"Journal of the ACM"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF02523189","volume":"17","author":"N. Alon","year":"1997","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. Algorithmica\u00a017, 209\u2013223 (1997)","journal-title":"Algorithmica"},{"issue":"2","key":"24_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.jalgor.2005.08.001","volume":"57","author":"M. Bender","year":"2005","unstructured":"Bender, M., Farach-Colton, M., Pemmasani, G., Skiena, S., Sumazin, P.: Lowest common ancestors in trees and directed acyclic graphs. J. Algorithms\u00a057(2), 75\u201394 (2005)","journal-title":"J. Algorithms"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/11534273_28","volume-title":"Algorithms and Data Structures","author":"T.M. Chan","year":"2005","unstructured":"Chan, T.M.: All-Pairs Shortest Paths with Real Weights in O(n\n                           3\/logn) Time. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 318\u2013324. Springer, Heidelberg (2005)"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, L.: Arboricity and subgraph listing algorithms. SIAM Journal on Computing\u00a014, 210\u2013223 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1006\/jcom.1997.0438","volume":"13","author":"D. Coppersmith","year":"1997","unstructured":"Coppersmith, D.: Rectangular matrix multiplication revisited. Journal of Complexity\u00a013, 42\u201349 (1997)","journal-title":"Journal of Complexity"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symbol. Comput.\u00a09, 251\u2013280 (1990)","journal-title":"J. Symbol. Comput."},{"issue":"1-2","key":"24_CR9","first-page":"109","volume":"141","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness II. On completeness for W[1]\u00a0141(1-2), 109\u2013131 (1995)","journal-title":"On completeness for W[1]"},{"issue":"1-3","key":"24_CR10","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2004.05.009","volume":"326","author":"F. Eisenbrand","year":"2004","unstructured":"Eisenbrand, F., Grandoni, F.: On the complexity of fixed parameter clique and dominating set. Theoret. Comput. Sci.\u00a0326(1-3), 57\u201367 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"24_CR11","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U. Feige","year":"2001","unstructured":"Feige, U., Kortsarz, G., Peleg, D.: The Dense k-Subgraph Problem. Algorithmica\u00a029(3), 410\u2013421 (2001)","journal-title":"Algorithmica"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/0205006","volume":"5","author":"M.L. Fredman","year":"1976","unstructured":"Fredman, M.L.: New bounds on the complexity of the shortest path problem. SIAM Journal on Computing\u00a05, 49\u201360 (1976)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/0304-3975(76)90078-5","volume":"1","author":"M.L. Fredman","year":"1976","unstructured":"Fredman, M.L.: How good is the information theory bound in sorting? Theoret. Comput. Sci.\u00a01, 355\u2013361 (1976)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"24_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1998","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n\n                           1\u2009\u2212\u2009\u03b5\n                           . Acta Math.\u00a0182(1), 105\u2013142 (1998)","journal-title":"Acta Math."},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1006\/jcom.1998.0476","volume":"14","author":"X. Huang","year":"1998","unstructured":"Huang, X., Pan, V.Y.: Fast rectangular matrix multiplications and applications. Journal of Complexity\u00a014, 257\u2013299 (1998)","journal-title":"Journal of Complexity"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"Itai, A., Rodeh, M.: Finding a minimum circuit in a graph. SIAM Journal on Computing\u00a07, 413\u2013423 (1978)","journal-title":"SIAM Journal on Computing"},{"issue":"3-4","key":"24_CR17","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0020-0190(00)00047-8","volume":"74","author":"T. Kloks","year":"2000","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Finding and counting small induced subgraphs efficiently. Inf. Process. Lett.\u00a074(3-4), 115\u2013121 (2000)","journal-title":"Inf. Process. Lett."},{"key":"24_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11523468_20","volume-title":"Automata, Languages and Programming","author":"M. Kowaluk","year":"2005","unstructured":"Kowaluk, M., Lingas, A.: LCA Queries in Directed Acyclic Graphs. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 241\u2013248. Springer, Heidelberg (2005)"},{"issue":"2","key":"24_CR19","first-page":"415","volume":"26","author":"J. Ne\u0161et\u0159il","year":"1985","unstructured":"Ne\u0161et\u0159il, J., Poljak, S.: On the complexity of the subgraph problem. Comment. Math. Univ. Carolin.\u00a026(2), 415\u2013419 (1985)","journal-title":"Comment. Math. Univ. Carolin."},{"key":"24_CR20","volume-title":"Proceedings of the 16th International Workshop on Graph-Theoretic Concepts in Computer Science (WG)","author":"J. Plehn","year":"1991","unstructured":"Plehn, J., Voigt, B.: Finding Minimally Weighted Subgraphs. In: Proceedings of the 16th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Springer, Heidelberg (1991)"},{"issue":"3","key":"24_CR21","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1006\/jcss.1995.1078","volume":"51","author":"R. Seidel","year":"1995","unstructured":"Seidel, R.: On the All-Pairs-Shortest-Path Problem in Unweighted Undirected Graphs. J. Comput. Syst. Sci.\u00a051(3), 400\u2013403 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"24_CR22","unstructured":"Vassilevska, V., Williams, R.: Finding a maximum weight triangle in n\n                           3\u2009\u2212\u2009\u03b4\n                            time, with applications. In: Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC) (to appear)"},{"key":"24_CR23","unstructured":"Yuster, R., Zwick, U.: Detecting short directed cycles using rectangular matrix multiplication and dynamic programming. In: Proc. of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 247\u2013253. ACM\/SIAM (2004)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:32:29Z","timestamp":1558294349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11786986_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}