{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:24:59Z","timestamp":1725686699855},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308697"},{"type":"electronic","value":"9783642308703"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30870-3_19","type":"book-chapter","created":{"date-parts":[[2012,5,27]],"date-time":"2012-05-27T22:56:12Z","timestamp":1338159372000},"page":"193-202","source":"Crossref","is-referenced-by-count":0,"title":["Confluence in Data Reduction: Bridging Graph Transformation and Kernelization"],"prefix":"10.1007","author":[{"given":"Hartmut","family":"Ehrig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudia","family":"Ermel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Falk","family":"H\u00fcffner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Runge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"AGG: Attributed Graph Grammar Tool. TU Berlin (2011), \n                  \n                    http:\/\/tfs.cs.tu-berlin.de\/agg"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-11269-0_2","volume-title":"Parameterized and Exact Computation","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L.: Kernelization: New Upper and Lower Bound Techniques. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 17\u201337. Springer, Heidelberg (2009)"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0022-0000(87)90030-4","volume":"34","author":"P. B\u00f6hm","year":"1987","unstructured":"B\u00f6hm, P., Fonio, H.R., Habel, A.: Amalgamation of graph transformations: a synchronization mechanism. Journal of Computer and System Sciences\u00a034, 377\u2013408 (1987)","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Cygan, M., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Wahlstr\u00f6m, M.: Clique cover and graph separation: New incompressibility results. Tech. Rep. arXiv:1111.0570v1 [cs.DS], arXiv (2011)","DOI":"10.1007\/978-3-642-31594-7_22"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"19_CR6","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. EATCS Monographs in Theoretical Computer Science. Springer (2006)"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Kreowski, H.J., Montanari, U., Rozenberg, G. (eds.): Handbook of Graph Grammars and Computing by Graph Transformation. Concurrency, Parallelism and Distribution, vol.\u00a03. World Scientific (1999)","DOI":"10.1142\/4181"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Ehrig, H., Pfender, M., Schneider, H.: Graph grammars: an algebraic approach. In: Proc. IEEE Symposium on Switching and Automata Theory, pp. 167\u2013180. IEEE (1973)","DOI":"10.1109\/SWAT.1973.11"},{"key":"19_CR9","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"key":"19_CR10","first-page":"1","volume":"13","author":"J. Gramm","year":"2008","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Data reduction and exact algorithms for clique cover. ACM Journal of Experimental Algorithmics\u00a013, 2.2:1\u20132.2:15 (2008)","journal-title":"ACM Journal of Experimental Algorithmics"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. ACM SIGACT News\u00a038(1), 31\u201345 (2007)","journal-title":"ACM SIGACT News"},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0012-365X(90)90168-H","volume":"85","author":"A. Gy\u00e1rf\u00e1s","year":"1990","unstructured":"Gy\u00e1rf\u00e1s, A.: A simple lower bound on edge coverings by cliques. Discrete Mathematics\u00a085(1), 103\u2013104 (1990)","journal-title":"Discrete Mathematics"},{"issue":"4","key":"19_CR13","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1145\/322217.322230","volume":"27","author":"G. Huet","year":"1980","unstructured":"Huet, G.: Confluent reductions: Abstract properties and applications to term rewriting systems. Journal of the ACM\u00a027(4), 797\u2013821 (1980)","journal-title":"Journal of the ACM"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1137\/080715482","volume":"23","author":"J. Kneis","year":"2009","unstructured":"Kneis, J., M\u00f6lle, D., Richter, S., Rossmanith, P.: A bound on the pathwidth of sparse graphs with applications to exact algorithms. SIAM Journal on Discrete Mathematics\u00a023(1), 407\u2013427 (2009)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"19_CR15","unstructured":"van Leeuwen, J. (ed.): Handbook of Theoretical Computer Science. MIT Press (1990)"},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00453-003-1032-7","volume":"37","author":"R.M. McConnell","year":"2003","unstructured":"McConnell, R.M.: Linear-time recognition of circular-arc graphs. Algorithmica\u00a037(2), 93\u2013147 (2003)","journal-title":"Algorithmica"},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M.H.A. Newman","year":"1942","unstructured":"Newman, M.H.A.: On theories with a combinatorial definition of equivalence. Annals of Mathematics\u00a043(2), 223\u2013242 (1942)","journal-title":"Annals of Mathematics"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, vol.\u00a031. Oxford University Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.003.0001"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/11601548_16","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"D. Plump","year":"2005","unstructured":"Plump, D.: Confluence of Graph Transformation Revisited. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol.\u00a03838, pp. 280\u2013308. Springer, Heidelberg (2005)"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Rozenberg, G.: Handbook of Graph Grammars and Computing by Graph Transformations: Foundations, vol.\u00a01. World Scientific (1997)","DOI":"10.1142\/9789812384720"}],"container-title":["Lecture Notes in Computer Science","How the World Computes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30870-3_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:32:20Z","timestamp":1620113540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30870-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308697","9783642308703"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30870-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}