{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T05:28:01Z","timestamp":1780637281342,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642311543","type":"print"},{"value":"9783642311550","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31155-0_17","type":"book-chapter","created":{"date-parts":[[2012,6,12]],"date-time":"2012-06-12T22:21:27Z","timestamp":1339539687000},"page":"189-200","source":"Crossref","is-referenced-by-count":25,"title":["Annotating Simplices with a Homology Basis and Its Applications"],"prefix":"10.1007","author":[{"given":"Oleksiy","family":"Busaryev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergio","family":"Cabello","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chao","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tamal K.","family":"Dey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yusu","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1137\/100810794","volume":"25","author":"S. Cabello","year":"2011","unstructured":"Cabello, S., Colin de Verdi\u00e8re, \u00c9., Lazarus, F.: Finding cycles with topological properties in embedded graphs. SIAM J. Disc. Math.\u00a025(4), 1600\u20131614 (2011)","journal-title":"SIAM J. Disc. Math."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Chambers, E., Erickson, J., Nayyeri, A.: Minimum cuts and shortest homologous cycles. In: Proc. ACM Symp. on Computational Geometry (SOCG), pp. 377\u2013385 (2009)","DOI":"10.1145\/1542362.1542426"},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s00454-010-9322-8","volume":"45","author":"C. Chen","year":"2011","unstructured":"Chen, C., Freedman, D.: Hardness results for homology localization. Discrete and Computational Geometry\u00a045(3), 425\u2013448 (2011)","journal-title":"Discrete and Computational Geometry"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Dey, T.K., Sun, J., Wang, Y.: Approximating loops in a shortest homology basis from point data. In: Proc. ACM Symp. on Computational Geometry (SOCG), pp. 166\u2013175 (2010)","DOI":"10.1145\/1810959.1810989"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Erickson, J., Nayyeri, A.: Minimum cuts and shortest non-separating cycles via homology covers. In: Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1166\u20131176 (2011)","DOI":"10.1137\/1.9781611973082.88"},{"key":"17_CR6","unstructured":"Erickson, J., Whittlesey, K.: Greedy optimal homotopy and homology generators. In: Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1038\u20131046 (2005)"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1137\/100800245","volume":"40","author":"T.K. Dey","year":"2011","unstructured":"Dey, T.K., Hirani, A., Krishnamoorthy, B.: Optimal homologous cycles, total unimodularity, and linear programming. SIAM J. Comput.\u00a040, 1026\u20131044 (2011)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"17_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput.\u00a09(3), 251\u2013280 (1990)","journal-title":"J. Symb. Comput."},{"key":"17_CR9","unstructured":"Chen, C., Freedman, D.: Quantifying homology classes. In: Proc. Symp. on Theoretical Aspects of Computer Science (STACS), pp. 169\u2013180 (2008)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Italiano, G.F., Nussbaum, Y., Sankowski, P., Wulff-Nilsen, C.: Improved algorithms for min cut and max flow in undirected planar graphs. In: Proc. ACM Symp. on Theory of Computing (STOC), pp. 313\u2013322 (2011)","DOI":"10.1145\/1993636.1993679"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1090\/S0025-5718-1974-0331751-8","volume":"28","author":"J. Bunch","year":"1974","unstructured":"Bunch, J., Hopcroft, J.: Triangular factorization and inversion by fast matrix multiplication. Math. Comp.\u00a028, 231\u2013236 (1974)","journal-title":"Math. Comp."},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0196-6774(82)90007-4","volume":"3","author":"O. Ibarra","year":"1982","unstructured":"Ibarra, O., Moran, S., Hui, R.: A generalization of the fast LUP matrix decomposition algorithm and applications. Journal of Algorithms\u00a03(1), 45\u201356 (1982)","journal-title":"Journal of Algorithms"},{"key":"17_CR13","unstructured":"Jeannerod, C.: LSP matrix decomposition revisited (2006), \n                  \n                    http:\/\/www.ens-lyon.fr\/LIP\/Pub\/Rapports\/RR\/RR2006\/RR2006-28.pdf"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31155-0_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:48:28Z","timestamp":1620114508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31155-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311543","9783642311550"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31155-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}