{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:36:47Z","timestamp":1743086207009,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319605906"},{"type":"electronic","value":"9783319605913"}],"license":[{"start":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T00:00:00Z","timestamp":1497484800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-60591-3_51","type":"book-chapter","created":{"date-parts":[[2017,6,14]],"date-time":"2017-06-14T03:42:39Z","timestamp":1497411759000},"page":"562-572","source":"Crossref","is-referenced-by-count":0,"title":["Finding the Maximal Day-Time Dependent Component of a Subway System"],"prefix":"10.1007","author":[{"given":"Marian Sorin","family":"Nistor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doina","family":"Bein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horia Nicolai","family":"Teodorescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan Wolfgang","family":"Pickl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,15]]},"reference":[{"issue":"4","key":"51_CR1","first-page":"469","volume":"25","author":"H-NL Teodorescu","year":"2016","unstructured":"Teodorescu, H.-N.L.: Revisiting models of vulnerabilities of the networks. Stud. Inform. Control 25(4), 469\u2013478 (2016)","journal-title":"Stud. Inform. Control"},{"key":"51_CR2","volume-title":"Introduction to Graph Theory","author":"DB West","year":"1996","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, Upper Saddle River (1996)"},{"issue":"1","key":"51_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959)","journal-title":"Numer. Math."},{"issue":"7","key":"51_CR4","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1002\/(SICI)1520-6750(199610)43:7<985::AID-NAV4>3.0.CO;2-9","volume":"43","author":"HF Lee","year":"1996","unstructured":"Lee, H.F., Dooly, D.R.: Algorithms for the constrained maximum-weight connected graph problem. Nav. Res. Logist. (NRL) 43(7), 985\u20131008 (1996)","journal-title":"Nav. Res. Logist. (NRL)"},{"key":"51_CR5","unstructured":"El-Kebir, M., Klau, G.W.: Solving the maximum-weight connected subgraph problem to optimality. arXiv preprint \narXiv:1409.5308\n\n (2014)"},{"key":"51_CR6","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/978-3-642-38171-3_20","volume-title":"International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"E \u00c1lvarez-Miranda","year":"2013","unstructured":"\u00c1lvarez-Miranda, E., Ljubi\u0107, I., Mutzel, P.: The rooted maximum node-weight connected subgraph problem. In: Gomes, C., Sellmann, M. (eds.) International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 300\u2013315. Springer, Heidelberg (2013)"},{"issue":"4","key":"51_CR7","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/s10255-008-8829-8","volume":"25","author":"Z Li","year":"2009","unstructured":"Li, Z., Zhang, S., Zhang, X.-S., Chen, L.: Exploring the constrained maximum edge-weight connected graph problem. Acta Math. Applicatae Sin. 25(4), 697\u2013708 (2009). English Series","journal-title":"Acta Math. Applicatae Sin."},{"issue":"13","key":"51_CR8","doi-asserted-by":"crossref","first-page":"i223","DOI":"10.1093\/bioinformatics\/btn161","volume":"24","author":"MT Dittrich","year":"2008","unstructured":"Dittrich, M.T., Klau, G.W., Rosenwald, A., Dandekar, T., M\u00fcller, T.: Identifying functional modules in protein-protein interaction networks: an integrated exact approach. Bioinformatics 24(13), i223\u2013i231 (2008)","journal-title":"Bioinformatics"},{"issue":"16","key":"51_CR9","doi-asserted-by":"crossref","first-page":"2121","DOI":"10.1093\/bioinformatics\/btm294","volume":"23","author":"Z Guo","year":"2007","unstructured":"Guo, Z., Li, Y., Gong, X., Yao, C., Ma, W., Wang, D., Li, Y., Zhu, J., Zhang, M., Yang, D., et al.: Edge-based scoring and searching method for identifying condition-responsive protein-protein interaction sub-network. Bioinformatics 23(16), 2121\u20132128 (2007)","journal-title":"Bioinformatics"},{"issue":"11","key":"51_CR10","doi-asserted-by":"crossref","first-page":"2498","DOI":"10.1101\/gr.1239303","volume":"13","author":"P Shannon","year":"2003","unstructured":"Shannon, P., Markiel, A., Ozier, O., Baliga, N.S., Wang, J.T., Ramage, D., Amin, N., Schwikowski, B., Ideker, T.: Cytoscape: a software environment for integrated models of biomolecular interaction networks. Genome Res. 13(11), 2498\u20132504 (2003)","journal-title":"Genome Res."},{"issue":"1","key":"51_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jeem.2011.08.001","volume":"63","author":"JM Conrad","year":"2012","unstructured":"Conrad, J.M., Gomes, C.P., van Hoeve, W.-J., Sabharwal, A., Suter, J.F.: Wildlife corridors as a connected subgraph problem. J. Environ. Econ. Manag. 63(1), 1\u201318 (2012)","journal-title":"J. Environ. Econ. Manag."},{"key":"51_CR12","first-page":"102","volume-title":"International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming","author":"B Dilkina","year":"2010","unstructured":"Dilkina, B., Gomes, C.P.: Solving connected subgraph problems in wildlife conservation. In: Lodi, A., Milano, M., Toth, P. (eds.) International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, pp. 102\u2013116. Springer, Heidelberg (2010)"},{"issue":"4","key":"51_CR13","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1287\/opre.2013.1183","volume":"61","author":"R Carvajal","year":"2013","unstructured":"Carvajal, R., Constantino, M., Goycoolea, M., Vielma, J.P., Weintraub, A.: Imposing connectivity constraints in forest planning models. Oper. Res. 61(4), 824\u2013836 (2013)","journal-title":"Oper. Res."},{"key":"51_CR14","doi-asserted-by":"crossref","unstructured":"Chen, C.-Y., Grauman, K.: Efficient activity detection with max-subgraph search. In: 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1274\u20131281 (2012)","DOI":"10.1109\/CVPR.2012.6247811"},{"key":"51_CR15","doi-asserted-by":"crossref","unstructured":"Nistor, M.S., Bein, D., Bein, W., Dehmer, M., Pickl, S.: Time-based estimation of vulnerable points in the munich subway network. In: Doerner, K., Ljubic, I., Pflug, G., Tragler, G. (eds.) Operations Research Proceedings 2015: Selected Papers of the International Conference of the German, Austrian and Swiss Operations Research Societies (GOR, \u00d6GOR, SVOR\/ASRO), Vienna, Austria, 1\u20134 September 2015, pp. 355\u2013360. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-42902-1_48"},{"key":"51_CR16","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12384","author":"MS Nistor","year":"2017","unstructured":"Nistor, M.S., Pickl, S.W., Raap, M., Zsifkovits, M.: Network efficiency and vulnerability analysis using the flow-weighted efficiency measure. Int. Trans. Oper. Res. (2017). doi:\n10.1111\/itor.12384","journal-title":"Int. Trans. Oper. Res."},{"key":"51_CR17","unstructured":"M\u00fcnchner Verkehrsgesellschaft mbH (MVG): MVG in figures (2016). \nhttps:\/\/www.mvg.de\/dam\/mvg\/ueber\/unternehmensprofil\/mvg-in-figures-s\n\n. Accessed 12 Mar 2017"},{"key":"51_CR18","unstructured":"MVV - M\u00fcnchner Verkehrs- und Tarifverbund: MVV GmbH (2017). \nhttp:\/\/www.mvv-muenchen.de\/\n\n. Accessed 12 Mar 2017"},{"key":"51_CR19","unstructured":"MVV - M\u00fcnchner Verkehrs- und Tarifverbund: Alle Informationen zu den Bahnh\u00f6fen im MVV (2015). \nhttp:\/\/www.mvv-muenchen.de\/de\/netz-bahnhoefe\/bahnhofsinformation\/index.html\n\n. Accessed 12 Mar 2017"}],"container-title":["Advances in Intelligent Systems and Computing","Advances in Human Factors in Simulation and Modeling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60591-3_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,11]],"date-time":"2017-08-11T23:57:49Z","timestamp":1502495869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60591-3_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,15]]},"ISBN":["9783319605906","9783319605913"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60591-3_51","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2017,6,15]]}}}