{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:57:35Z","timestamp":1725937055024},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319727509"},{"type":"electronic","value":"9783319727516"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72751-6_3","type":"book-chapter","created":{"date-parts":[[2017,12,30]],"date-time":"2017-12-30T16:03:05Z","timestamp":1514649785000},"page":"26-40","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Parameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor Networks"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Bentert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"van Bevern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Nichterlein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,31]]},"reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"3_CR2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s11276-005-5275-x","volume":"12","author":"E Althaus","year":"2006","unstructured":"Althaus, E., C\u0103linescu, G., Mandoiu, I.I., Prasad, S.K., Tchervenski, N., Zelikovsky, A.: Power efficient range assignment for symmetric connectivity in static ad hoc wireless networks. Wirel. Netw. 12(3), 287\u2013299 (2006)","journal-title":"Wirel. Netw."},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-662-55751-8_9","volume-title":"Fundamentals of Computation Theory","author":"M Bentert","year":"2017","unstructured":"Bentert, M., Fluschnik, T., Nichterlein, A., Niedermeier, R.: Parameterized aspects of triangle enumeration. In: Klasing, R., Zeitoun, M. (eds.) FCT 2017. LNCS, vol. 10472, pp. 96\u2013110. Springer, Heidelberg (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-662-55751-8_9"},{"key":"3_CR4","unstructured":"Betzler, N., van Bevern, R., Fellows, M.R., Komusiewicz, C., Niedermeier, R.: Parameterized algorithmics for finding connected motifs in biological networks. IEEE\/ACM Trans. Comput. Biol. 8(5), 1296\u20131308 (2011)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Betzler, N., Guo, J., Komusiewicz, C., Niedermeier, R.: Average parameterization and partial kernelization for computing medians. J. Comput. Syst. Sci. 77(4), 774\u2013789 (2011)","DOI":"10.1016\/j.jcss.2010.07.005"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"van Bevern, R., Komusiewicz, C., Sorge, M.: A parameterized approximation algorithm for the mixed and windy capacitated arc routing problem: theory and experiments. Networks (2017, in press)","DOI":"10.1002\/net.21742"},{"issue":"3","key":"3_CR7","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1089\/cmb.2009.0170","volume":"17","author":"S Bruckner","year":"2010","unstructured":"Bruckner, S., H\u00fcffner, F., Karp, R.M., Shamir, R., Sharan, R.: Topology-free querying of protein interaction networks. J. Comput. Biol. 17(3), 237\u2013252 (2010)","journal-title":"J. Comput. Biol."},{"issue":"2","key":"3_CR8","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s00453-006-1230-1","volume":"47","author":"P Carmi","year":"2007","unstructured":"Carmi, P., Katz, M.J.: Power assignment in radio networks with two power levels. Algorithmica 47(2), 183\u2013201 (2007)","journal-title":"Algorithmica"},{"issue":"2","key":"3_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/B:MONE.0000013624.32948.87","volume":"9","author":"AE Clementi","year":"2004","unstructured":"Clementi, A.E., Penna, P., Silvestri, R.: On the power assignment problem in radio networks. Mob. Netw. Appl. 9(2), 125\u2013140 (2004)","journal-title":"Mob. Netw. Appl."},{"issue":"7","key":"3_CR10","doi-asserted-by":"crossref","first-page":"913","DOI":"10.1089\/cmb.2007.0172","volume":"15","author":"B Dost","year":"2008","unstructured":"Dost, B., Shlomi, T., Gupta, N., Ruppin, E., Bafna, V., Sharan, R.: Qnet: a tool for querying protein interaction networks. J. Comput. Biol. 15(7), 913\u2013925 (2008)","journal-title":"J. Comput. Biol."},{"key":"3_CR11","doi-asserted-by":"publisher","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-1-4471-5559-1","DOI":"10.1007\/978-1-4471-5559-1"},{"issue":"1","key":"3_CR12","first-page":"12","volume":"20","author":"AI Erzin","year":"2013","unstructured":"Erzin, A.I., Plotnikov, R.V., Shamardin, Y.V.: O nekotorykh polinomial\u2019no razreshimykh sluchayakh i priblizh\u00ebnnykh algoritmakh dlya zadachi postroyeniya optimal\u2019nogo kommunikatsionnogo dereva. Diskretn. Anal. Issled. Oper. 20(1), 12\u201327 (2013)","journal-title":"Diskretn. Anal. Issled. Oper."},{"key":"3_CR13","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/j.cor.2016.05.010","volume":"78","author":"AI Erzin","year":"2017","unstructured":"Erzin, A.I., Mladenovic, N., Plotnikov, R.V.: Variable neighborhood search variants for min-power symmetric connectivity problem. Comput. Oper. Res. 78, 557\u2013563 (2017)","journal-title":"Comput. Oper. Res."},{"key":"3_CR14","unstructured":"Giacometti, A.: River networks. In: Complex Networks, Encyclopedia of Life Support Systems (EOLSS), pp. 155\u2013180. EOLSS Publishers\/UNESCO (2010)"},{"issue":"1","key":"3_CR15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.jcss.2016.06.001","volume":"83","author":"G Gutin","year":"2017","unstructured":"Gutin, G., Wahlstr\u00f6m, M., Yeo, A.: Rural postman parameterized by the number of components of required edges. J. Comput. Syst. Sci. 83(1), 121\u2013131 (2017)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"3_CR16","doi-asserted-by":"crossref","first-page":"155","DOI":"10.7155\/jgaa.00352","volume":"19","author":"S Hartung","year":"2015","unstructured":"Hartung, S., Komusiewicz, C., Nichterlein, A.: Parameterized algorithmics and computational experiments for finding 2-clubs. J. Graph Algorithms Appl. 19(1), 155\u2013190 (2015)","journal-title":"J. Graph Algorithms Appl."},{"key":"3_CR17","unstructured":"Hoffmann, S., Wanke, E.: Minimum power range assignment for symmetric connectivity in sensor networks with two power levels (2016). \narXiv:1605.01752"},{"issue":"2","key":"3_CR18","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of \n            $$k$$\n            \n              \n                k\n              \n            \n          -SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"3_CR19","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR20","unstructured":"Mertzios, G.B., Nichterlein, A., Niedermeier, R.: Linear-time algorithm for maximum-cardinality matching on cocomparability graphs. In: MFCS 2017. LIPIcs, vol. 83, pp. 46:1\u201346:14, Schloss Dagstuhl \u2013 Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"11","key":"3_CR21","doi-asserted-by":"crossref","first-page":"2891","DOI":"10.1016\/j.cor.2004.04.017","volume":"32","author":"R Montemanni","year":"2005","unstructured":"Montemanni, R., Gambardella, L.: Exact algorithms for the minimum power symmetric connectivity problem in wireless networks. Comput. Oper. Res. 32(11), 2891\u20132904 (2005)","journal-title":"Comput. Oper. Res."},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Panigrahi, D.: Survivable network design problems in wireless networks. In: Proceedings of 22nd SODA, pp. 1014\u20131027. SIAM (2011)","DOI":"10.1137\/1.9781611973082.78"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In: Proceedings of 29th STOC, pp. 475\u2013484. ACM (1997)","DOI":"10.1145\/258533.258641"},{"issue":"2","key":"3_CR24","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1089\/cmb.2006.13.133","volume":"13","author":"J Scott","year":"2006","unstructured":"Scott, J., Ideker, T., Karp, R.M., Sharan, R.: Efficient algorithms for detecting signaling pathways in protein interaction networks. J. Comput. Biol. 13(2), 133\u2013144 (2006)","journal-title":"J. Comput. Biol."},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-25870-1_28","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Sorge","year":"2011","unstructured":"Sorge, M., van Bevern, R., Niedermeier, R., Weller, M.: From few components to an Eulerian graph by adding arcs. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 307\u2013318. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25870-1_28"},{"key":"3_CR26","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.jda.2012.04.007","volume":"16","author":"M Sorge","year":"2012","unstructured":"Sorge, M., van Bevern, R., Niedermeier, R., Weller, M.: A new view on rural postman based on Eulerian extension and matching. J. Discrete Alg. 16, 12\u201333 (2012)","journal-title":"J. Discrete Alg."},{"key":"3_CR27","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.tcs.2013.01.029","volume":"494","author":"J Uhlmann","year":"2013","unstructured":"Uhlmann, J., Weller, M.: Two-layer planarization parameterized by feedback edge set. Theoret. Comput. Sci. 494, 99\u2013111 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"3_CR28","doi-asserted-by":"crossref","first-page":"2446","DOI":"10.3390\/s90402446","volume":"9","author":"VV Zalyubovskiy","year":"2009","unstructured":"Zalyubovskiy, V.V., Erzin, A.I., Astrakov, S.N., Choo, H.: Energy-efficient area coverage by sensors with adjustable ranges. Sensors 9(4), 2446\u20132460 (2009)","journal-title":"Sensors"},{"issue":"1\u20132","key":"3_CR29","first-page":"89","volume":"1","author":"H Zhang","year":"2005","unstructured":"Zhang, H., Hou, J.C.: Maintaining sensing coverage and connectivity in large sensor networks. Ad Hoc Sens. Wirel. Netw. 1(1\u20132), 89\u2013124 (2005)","journal-title":"Ad Hoc Sens. Wirel. Netw."}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72751-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,30]],"date-time":"2017-12-30T16:04:02Z","timestamp":1514649842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72751-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319727509","9783319727516"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72751-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}