{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T22:40:09Z","timestamp":1749768009401,"version":"3.41.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,11,28]],"date-time":"2016-11-28T00:00:00Z","timestamp":1480291200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00224-016-9729-6","type":"journal-article","created":{"date-parts":[[2016,11,28]],"date-time":"2016-11-28T06:47:12Z","timestamp":1480315632000},"page":"3-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Incremental Problems in the Parameterized Complexity Setting"],"prefix":"10.1007","volume":"60","author":[{"given":"Bernard","family":"Mans","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luke","family":"Mathieson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,28]]},"reference":[{"key":"9729_CR1","unstructured":"Batagelj, V., Zaversnik, M.: AnO(m)algorithm for cores decomposition of networks. arXiv: cs\/0310049 (2003)"},{"key":"9729_CR2","doi-asserted-by":"crossref","unstructured":"Crowston, R., Gutin, G., Jones, M., Raman, V., Saurabh, S.: Parameterized Complexity of MaxSat Above Average. In: Theoretical Informatics - 10th Latin American Symposium LATIN\u201912. LNCS 7256, pp. 184\u2013194 (2012)","DOI":"10.1007\/978-3-642-29344-3_16"},{"key":"9729_CR3","doi-asserted-by":"crossref","unstructured":"Desikan, P., Pathak, N., Srivastava, J., Kumar, V.: Incremental page rank computation on evolving graphs. In: Special interest tracks and posters of the 14th international conference on World Wide Web, WWW\u201905, pp. 1094\u20131095. ACM (2005)","DOI":"10.1145\/1062745.1062885"},{"key":"9729_CR4","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"1","key":"9729_CR5","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1007\/s00224-015-9635-3","volume":"59","author":"H Fernau","year":"2016","unstructured":"Fernau, H., Schmid, M.L., Villanger, Y.: On the parameterised complexity of string morphism problems. Theory of Computing Systems 59(1), 24\u201351 (2016)","journal-title":"Theory of Computing Systems"},{"key":"9729_CR6","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory. Springer (2006)"},{"issue":"3","key":"9729_CR7","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s00224-007-1309-3","volume":"41","author":"J Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of vertex cover variants. Theory of Computing Systems 41(3), 501\u2013520 (2007)","journal-title":"Theory of Computing Systems"},{"issue":"5","key":"9729_CR8","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/j.cad.2008.08.004","volume":"41","author":"M Held","year":"2009","unstructured":"Held, M., Huber, S.: Topology-oriented incremental computation of voronoi diagrams of circular arcs and straight-line segments. Comput. Aided Des. 41(5), 327\u2013338 (2009)","journal-title":"Comput. Aided Des."},{"key":"9729_CR9","unstructured":"Jakub \u0141., Sankowski, P.: Optimal decremental connectivity in planar graphs. Theory of Computing Systems 59(1), 1\u201317 (2016)"},{"issue":"1","key":"9729_CR10","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D Marx","year":"2008","unstructured":"Marx, D.: The Parameterized complexity approximation algorithms. Comput. J. 51(1), 60\u201378 (2008)","journal-title":"Comput. J."},{"issue":"34-36","key":"9729_CR11","doi-asserted-by":"crossref","first-page":"3181","DOI":"10.1016\/j.tcs.2010.05.015","volume":"411","author":"L Mathieson","year":"2010","unstructured":"Mathieson, L.: The parameterized complexity of editing graphs for bounded degeneracy. Theor. Comput. Sci. 411(34-36), 3181\u20133187 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"9729_CR12","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0304-3975(94)90159-7","volume":"130","author":"PB Miltersen","year":"1994","unstructured":"Miltersen, P.B., Subramanian, S., Vitter, J.S., Tamassia, R.: Complexity models for incremental computation. Theor. Comput. Sci. 130(1), 203\u2013236 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"9729_CR13","doi-asserted-by":"crossref","unstructured":"Mouawad, A.E., Nishimura, N., Raman, V., Simjour, N., Suzuki, A.: On the Parameterized Complexity of Reconfiguration Problems. In: Proceedings of the 8th International Symposium on Parameterized and Exact Computation, IPEC\u201913, pp. 281\u2013294. Springer (2013)","DOI":"10.1007\/978-3-319-03898-8_24"},{"key":"9729_CR14","doi-asserted-by":"crossref","unstructured":"Protti, F., da Silva, M.D., Szwarcfiter, J.L.: Applying Modular Decomposition to Parameterized Cluster Editing Problems. Theory of Computing Systems 44(1), 91\u2013104 (2009)","DOI":"10.1007\/s00224-007-9032-7"},{"key":"9729_CR15","doi-asserted-by":"crossref","unstructured":"Ramalingam, G., Reps, T.: A categorized bibliography on incremental computation. In: Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages POPL\u201993, pp. 502\u2013510. ACM (1993)","DOI":"10.1145\/158511.158710"},{"issue":"1\u20132","key":"9729_CR16","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0304-3975(95)00079-8","volume":"158","author":"G Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: On the computational complexity of dynamic graph problems. Theoretical Computer Science 158(1\u20132), 233\u2013277 (1996)","journal-title":"Theoretical Computer Science"},{"key":"9729_CR17","doi-asserted-by":"crossref","unstructured":"Sundaresh, R.S., Hudak, P.: Incremental computation via partial evaluation. In: Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages POPL\u201991, pp. 1\u201313. ACM (1991)","DOI":"10.1145\/99583.99587"},{"issue":"4","key":"9729_CR18","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s00224-006-1312-0","volume":"40","author":"V Weber","year":"2007","unstructured":"Weber, V., Schwentick, T.: Dynamic complexity theory revisited. Theory of Computing Systems 40(4), 355\u2013377 (2007)","journal-title":"Theory of Computing Systems"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9729-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-016-9729-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-016-9729-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T22:06:57Z","timestamp":1749766017000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-016-9729-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,28]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9729"],"URL":"https:\/\/doi.org\/10.1007\/s00224-016-9729-6","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2016,11,28]]}}}