{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:43:21Z","timestamp":1725453801144},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387678"},{"type":"electronic","value":"9783642387685"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38768-5_32","type":"book-chapter","created":{"date-parts":[[2013,5,17]],"date-time":"2013-05-17T04:31:28Z","timestamp":1368765088000},"page":"349-360","source":"Crossref","is-referenced-by-count":4,"title":["On the Treewidth of Dynamic Graphs"],"prefix":"10.1007","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","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<125::AID-NET1>3.0.CO;2-P","volume":"28","author":"K.A. Berman","year":"1996","unstructured":"Berman, K.A.: Vulnerability of scheduled networks and a generalization of Menger\u2019s theorem. Networks\u00a028, 125\u2013134 (1996)","journal-title":"Networks"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-540-39611-6_23","volume-title":"Ad-Hoc, Mobile, and Wireless Networks","author":"S. Bhadra","year":"2003","unstructured":"Bhadra, S., Ferreira, A.: Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks. In: Pierre, S., Barbeau, M., Kranakis, E. (eds.) ADHOC-NOW 2003. LNCS, vol.\u00a02865, pp. 259\u2013270. Springer, Heidelberg (2003)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/3-540-57899-4_45","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H.L. Bodlaender","year":"1994","unstructured":"Bodlaender, H.L.: Dynamic algorithms for graphs with treewidth 2. In: van Leeuwen, J. (ed.) WG 1993. LNCS, vol.\u00a0790, pp. 112\u2013124. Springer, Heidelberg (1994)"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-22212-2_20","volume-title":"Structural Information and Communication Complexity","author":"B. Brejov\u00e1","year":"2011","unstructured":"Brejov\u00e1, B., Dobrev, S., Kr\u00e1lovi\u010d, R., Vina\u0159, T.: Routing in carrier-based mobile networks. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol.\u00a06796, pp. 222\u2013233. Springer, Heidelberg (2011)"},{"issue":"2","key":"32_CR5","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1142\/S0129054103001728","volume":"14","author":"B.-M. Bui-Xuan","year":"2003","unstructured":"Bui-Xuan, B.-M., Ferreira, A., Jarry, A.: Computing shortest, fastest, and foremost journeys in dynamic networks. Int. J. Found. Comput. Sci.\u00a014(2), 267\u2013285 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-11476-2_11","volume-title":"Structural Information and Communication Complexity","author":"A. Casteigts","year":"2010","unstructured":"Casteigts, A., Chaumette, S., Ferreira, A.: Characterizing topological assumptions of distributed algorithms in dynamic networks. In: Kutten, S., \u017derovnik, J. (eds.) SIROCCO 2009. LNCS, vol.\u00a05869, pp. 126\u2013140. Springer, Heidelberg (2010)"},{"key":"32_CR7","series-title":"IFIP AICT","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-15240-5_9","volume-title":"Theoretical Computer Science","author":"A. Casteigts","year":"2010","unstructured":"Casteigts, A., Flocchini, P., Mans, B., Santoro, N.: Deterministic computations in time-varying graphs: Broadcasting under unstructured mobility. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol.\u00a0323, pp. 111\u2013124. Springer, Heidelberg (2010)"},{"issue":"5","key":"32_CR8","first-page":"387","volume":"27","author":"A. Casteigts","year":"2012","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. IJPEDS\u00a027(5), 387\u2013408 (2012)","journal-title":"IJPEDS"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Chaintreau, A., Mtibaa, A., Massouli\u00e9, L., Diot, C.: The diameter of opportunistic mobile networks. In: CoNEXT, p. 12 (2007)","DOI":"10.1145\/1364654.1364670"},{"issue":"6","key":"32_CR10","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1016\/j.adhoc.2010.09.002","volume":"9","author":"A.E.F. Clementi","year":"2011","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Modelling mobility: A discrete revolution. Ad Hoc Networks\u00a09(6), 998\u20131014 (2011)","journal-title":"Ad Hoc Networks"},{"key":"32_CR11","unstructured":"Cohen, R.F., Sairam, S., Tamassia, R., Vitter, J.S.: Dynamic algorithms for optimization problems in bounded tree-width graphs. In: Rinaldi, G., Wolsey, L.A. (eds.) Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, pp. 99\u2013112. CIACO (1993)"},{"issue":"1","key":"32_CR12","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Information and Computation\u00a085(1), 12\u201375 (1990)","journal-title":"Information and Computation"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The monadic second-order logic of graphs xvi: Canonical graph decompositions. Logical Methods in Computer Science\u00a02(2) (2006)","DOI":"10.2168\/LMCS-2(2:2)2006"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Dvo\u0159\u00e1k, Z., Kr\u00e1l, D., Thomas, R.: Deciding first-order properties for sparse graphs. In: 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, Las Vegas, Nevada, pp. 133\u2013142. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.20"},{"issue":"5","key":"32_CR15","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/MNET.2004.1337732","volume":"18","author":"A. Ferreira","year":"2004","unstructured":"Ferreira, A.: Building a reference combinatorial model for manets. IEEE Network\u00a018(5), 24\u201329 (2004)","journal-title":"IEEE Network"},{"key":"32_CR16","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2012.10.029","volume":"469","author":"P. Flocchini","year":"2013","unstructured":"Flocchini, P., Mans, B., Santoro, N.: On the exploration of time-varying networks. Theor. Comput. Sci.\u00a0469, 53\u201368 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR17","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory. Springer (2006)"},{"issue":"3","key":"32_CR18","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/PL00009227","volume":"22","author":"G.N. Frederickson","year":"1998","unstructured":"Frederickson, G.N.: Maintaining regular properties dynamically in k-terminal graphs. Algorithmica\u00a022(3), 330\u2013350 (1998)","journal-title":"Algorithmica"},{"issue":"6","key":"32_CR19","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1145\/504794.504798","volume":"48","author":"M. Frick","year":"2001","unstructured":"Frick, M., Grohe, M.: Deciding first-order properties of locally tree-decomposable structures. Journal of the ACM\u00a048(6), 1184\u20131206 (2001)","journal-title":"Journal of the ACM"},{"issue":"3","key":"32_CR20","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/s004530010021","volume":"27","author":"T. Hagerup","year":"2000","unstructured":"Hagerup, T.: Dynamic algorithms for graphs of bounded treewidth. Algorithmica\u00a027(3), 292\u2013315 (2000)","journal-title":"Algorithmica"},{"issue":"7","key":"32_CR21","doi-asserted-by":"publisher","first-page":"1192","DOI":"10.1109\/JSAC.2009.090915","volume":"27","author":"P. Jacquet","year":"2009","unstructured":"Jacquet, P., Mans, B., M\u00fchlethaler, P., Rodolakis, G.: Opportunistic routing in wireless ad hoc networks: Upper bounds for the packet propagation speed. IEEE Journal on Selected Areas in Communications\u00a027(7), 1192\u20131202 (2009)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"1","key":"32_CR22","doi-asserted-by":"publisher","first-page":"5001","DOI":"10.1109\/TIT.2010.2059830","volume":"56","author":"P. Jacquet","year":"2010","unstructured":"Jacquet, P., Mans, B., Rodolakis, G.: Information Propagation Speed in Mobile and Delay Tolerant Networks. IEEE Transactions on Information Theory\u00a056(1), 5001\u20135015 (2010)","journal-title":"IEEE Transactions on Information Theory"},{"key":"32_CR23","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J.M., Kumar, A.: Connectivity and inference problems for temporal networks. In: STOC, pp. 504\u2013513 (2000)","DOI":"10.1145\/335305.335364"},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N.A., Oshman, R.: Distributed computation in dynamic networks. In: STOC, pp. 513\u2013522 (2010)","DOI":"10.1145\/1806689.1806760"},{"issue":"1","key":"32_CR25","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/1959045.1959064","volume":"42","author":"F. Kuhn","year":"2011","unstructured":"Kuhn, F., Oshman, R.: Dynamic networks: models and algorithms. SIGACT News\u00a042(1), 82\u201396 (2011)","journal-title":"SIGACT News"},{"issue":"1","key":"32_CR26","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.ipl.2007.09.009","volume":"106","author":"I.A. Stewart","year":"2008","unstructured":"Stewart, I.A.: On the fixed-parameter tractability of parameterized model-checking problems. Information Processing Letters\u00a0106(1), 33\u201336 (2008)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38768-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T02:11:50Z","timestamp":1557713510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38768-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387678","9783642387685"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38768-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}