{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:49Z","timestamp":1759063789729},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319946665"},{"type":"electronic","value":"9783319946672"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-94667-2_1","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T03:56:24Z","timestamp":1530590184000},"page":"1-13","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Collision-Free Routing Problem with Restricted L-Path"],"prefix":"10.1007","author":[{"given":"Jammigumpula","family":"Ajay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sasanka","family":"Roy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"key":"1_CR1","unstructured":"Ajaykumar, J., Das, A., Saikia, N., Karmakar, A.: Problems on one way road networks. In: CCCG 2016, pp. 303\u2013308 (2016)"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1007\/978-3-319-26626-8_46","volume-title":"Combinatorial Optimization and Applications","author":"A Lahiri","year":"2015","unstructured":"Lahiri, A., Mukherjee, J., Subramanian, C.R.: Maximum independent set on $$B_1$$-VPG graphs. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 633\u2013646. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-26626-8_46"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-319-21840-3_19","volume-title":"Algorithms and Data Structures","author":"P Dasler","year":"2015","unstructured":"Dasler, P., Mount, D.M.: On the complexity of an unregulated traffic crossing. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 224\u2013235. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21840-3_19"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"H Johan","year":"1999","unstructured":"Johan, H.: Clique is hard to approximate within $$n^{1 - \\epsilon }$$. Acta Mathematica 182(1), 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"issue":"3","key":"1_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"PK Agarwal","year":"1998","unstructured":"Agarwal, P.K., van Kerveld, M., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom. 11(3), 209\u2013218 (1998)","journal-title":"Comput. Geom."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.ipl.2017.07.007","volume":"127","author":"SC Nandy","year":"2017","unstructured":"Nandy, S.C., Pandit, S., Roy, S.: Faster approximation for maximum independent set on unit disk graph. Inf. Process. Lett. 127, 58\u201361 (2017)","journal-title":"Inf. Process. Lett."},{"key":"1_CR7","first-page":"116","volume":"38","author":"D K\u0151nig","year":"1931","unstructured":"K\u0151nig, D.: Gr\u00e1fok \u00e9s m\u00e1trixok. Matematikai \u00e9s Fizikai Lapok 38, 116\u2013119 (1931)","journal-title":"Matematikai \u00e9s Fizikai Lapok"},{"issue":"6","key":"1_CR8","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0020-0190(78)90016-9","volume":"7","author":"VM Malhotra","year":"1978","unstructured":"Malhotra, V.M., Pramodh Kumar, M., Maheshwari, S.N.: An $$O(|V|^3)$$ algorithm for finding maximum flows in networks. Inf. Process. Lett. 7(6), 277\u2013278 (1978)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"DJ Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5(2), 266\u2013283 (1976)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94667-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T03:56:59Z","timestamp":1530590219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-94667-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319946665","9783319946672"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94667-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}