{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:17:19Z","timestamp":1763468239676},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,3,31]],"date-time":"2015-03-31T00:00:00Z","timestamp":1427760000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s11590-015-0876-5","type":"journal-article","created":{"date-parts":[[2015,3,29]],"date-time":"2015-03-29T21:33:52Z","timestamp":1427664832000},"page":"33-45","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Approximating the minimum hub cover problem on planar graphs"],"prefix":"10.1007","volume":"10","author":[{"given":"Belma","family":"Yelbay","sequence":"first","affiliation":[]},{"given":"\u015e. \u0130lker","family":"Birbil","sequence":"additional","affiliation":[]},{"given":"Kerem","family":"B\u00fclb\u00fcl","sequence":"additional","affiliation":[]},{"given":"Hasan","family":"Jamil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,31]]},"reference":[{"key":"876_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B Baker","year":"1994","unstructured":"Baker, B.: Approximation algorithms for $${\\cal NP}$$ NP -complete problems. J. Assoc. Comput. Mach. 41, 153\u2013180 (1994)","journal-title":"J. Assoc. Comput. Mach."},{"key":"876_CR2","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1109\/TIP.2009.2039372","volume":"19","author":"S Baloch","year":"2010","unstructured":"Baloch, S., Krim, H.: Object recognition through topo-geometric shape models using error-tolerant subgraph isomorphisms. IEEE Trans. Image Process. 19, 1191\u20131200 (2010)","journal-title":"IEEE Trans. Image Process."},{"key":"876_CR3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF01840379","volume":"5","author":"D Bienstock","year":"1990","unstructured":"Bienstock, D., Monma, C.: On the complexity of embedding planar graphs to minimize certain distance measures. Algorithmica 5, 93\u2013109 (1990)","journal-title":"Algorithmica"},{"key":"876_CR4","doi-asserted-by":"crossref","unstructured":"Cook, S.: The complexity of theorem-proving procedures. In: 3rd ACM Symposium on Theory of Computing, pp. 151\u2013158. Ohio (1971)","DOI":"10.1145\/800157.805047"},{"key":"876_CR5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M Garey","year":"1976","unstructured":"Garey, M., Johnson, D., Stockmeyer, L.: Some simplified np-complete graph problems. Theor. Comput. Sci. 1, 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"876_CR6","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J Hopcroft","year":"1974","unstructured":"Hopcroft, J., Tarjan, R.: Efficient planarity testing. J. ACM 21, 549\u2013568 (1974)","journal-title":"J. ACM"},{"key":"876_CR7","doi-asserted-by":"crossref","unstructured":"Jamil, H.M.: Computing subgraph isomorphic queries using structural unification and minimum graph structures. In: SAC, pp. 1053\u20131058 (2011)","DOI":"10.1145\/1982185.1982415"},{"key":"876_CR8","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-3-540-75520-3_33","volume":"4698","author":"F Kammer","year":"2007","unstructured":"Kammer, F.: Determining the smallest $$k$$ k such that $$g$$ g is $$k-$$ k - outerplanar. Lect. Notes Comput. Sci. 4698, 359\u2013370 (2007)","journal-title":"Lect. Notes Comput. Sci."},{"key":"876_CR9","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/s10618-009-0132-7","volume":"19","author":"V Lipets","year":"2009","unstructured":"Lipets, V., Vanetik, N., Gudes, E.: Subsea: an efficient heuristic algorithm for subgraph isomorphism. Data Min. Knowl. Discov. 19, 320\u2013350 (2009)","journal-title":"Data Min. Knowl. Discov."},{"key":"876_CR10","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1109\/34.954603","volume":"23","author":"J Llados","year":"2001","unstructured":"Llados, J., Marti, E., Villanueva, J.: Symbol recognition by error-tolerant subgraph matching between region adjacency graphs. IEEE Trans. Pattern Anal. Mach. Intell. 23, 1137\u20131143 (2001)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"876_CR11","doi-asserted-by":"crossref","unstructured":"Neuhaus, M., Bunke, H.: A graph matching based approach to fingerprint classification using directional variance. In: Audio-and Video-Based Biometric Person Authentication, Lecture Notes in Computer Science, vol. 3546, pp. 191\u2013200 (2004)","DOI":"10.1007\/11527923_20"},{"key":"876_CR12","doi-asserted-by":"crossref","unstructured":"Rivero, C., Jamil, H.M.: On isomorphic matching of large disk resident graphs using an xquery engine. International Workshop on Graph Data Management, Techniques and Applications (2014)","DOI":"10.1109\/ICDEW.2014.6818296"},{"key":"876_CR13","unstructured":"Rivero, C.R., Jamil, H.M.: Exact subgraph isomorphism using graphlets and minimum hub covers (2014) (Work-in-process)"},{"key":"876_CR14","doi-asserted-by":"crossref","unstructured":"Shang, H., Zhang, Y., Lin, X., Yu, J.: Taming verification hardness: An efficient algorithm for testing subgraph isomorphism. In: Journal Proceedings of the VLDB Endowment, vol. 1, pp. 364\u2013375. Auckland, New Zealand (2008)","DOI":"10.14778\/1453856.1453899"},{"key":"876_CR15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J Ullmann","year":"1976","unstructured":"Ullmann, J.: An algorithm for subgraph isomorphism. J. ACM 23, 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"876_CR16","doi-asserted-by":"crossref","first-page":"2011","DOI":"10.1016\/j.patrec.2012.04.017","volume":"33","author":"M Weber","year":"2012","unstructured":"Weber, M., Liwicki, M., Dengel, A.: Faster subgraph isomorphism detection by well-founded total order indexing. Pattern Recognit. Lett. 33, 2011\u20132019 (2012)","journal-title":"Pattern Recognit. Lett."},{"key":"876_CR17","unstructured":"Yelbay, B.: Minimum hub cover problem: Solution methods and applications. Ph.D. thesis, Sabanci University (2014)"},{"key":"876_CR18","unstructured":"Yelbay, B., \u015e. \u0130. Birbil, B\u00fclb\u00fcl, K., Jamil, H.M.: Trade-offs computing minimum hub cover toward optimized graph query processing (2013). arXiv:1311.1626"},{"key":"876_CR19","doi-asserted-by":"crossref","unstructured":"Zhu, K., Zhang, Y., Lin, X., Zhu, G., Wang, W.: A novel and efficient framework for finding subgraph isomorphism mappings in large graphs. In: 15th International Conference on Database Systems for Advanced Applications, pp. 140\u2013154. Tsukuba, Japan (2010)","DOI":"10.1007\/978-3-642-12026-8_13"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0876-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0876-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0876-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T12:18:17Z","timestamp":1566476297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0876-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,31]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["876"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0876-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,31]]}}}