{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:47Z","timestamp":1759638767461},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382321"},{"type":"electronic","value":"9783642382338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_21","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T12:57:16Z","timestamp":1368622636000},"page":"246-263","source":"Crossref","is-referenced-by-count":2,"title":["Finding All Convex Cuts of a Plane Graph in Cubic Time"],"prefix":"10.1007","author":[{"given":"Roland","family":"Glantz","sequence":"first","affiliation":[]},{"given":"Henning","family":"Meyerhenke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"17","key":"21_CR1","doi-asserted-by":"publisher","first-page":"1968","DOI":"10.1016\/j.disc.2011.05.023","volume":"311","author":"D. Artigas","year":"2011","unstructured":"Artigas, D., Dantas, S., Dourado, M., Szwarcfiter, J.: Partitioning a graph into convex sets. Discrete Mathematics\u00a0311(17), 1968\u20131977 (2011)","journal-title":"Discrete Mathematics"},{"issue":"4","key":"21_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1016\/j.jda.2008.07.008","volume":"7","author":"P. Balister","year":"2009","unstructured":"Balister, P., Gerke, S., Gutin, G., Johnstone, A., Reddington, J., Scott, E., Soleimanfallah, A., Yeo, A.: Algorithms for generating convex sets in acyclic digraphs. Journal of Discrete Algorithms\u00a07(4), 509\u2013518 (2009)","journal-title":"Journal of Discrete Algorithms"},{"unstructured":"Bichot, C., Siarry, P.: Graph Partitioning. Wiley (2011)","key":"21_CR3"},{"doi-asserted-by":"crossref","unstructured":"Bj\u00f6rner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.: Oriented Matroids, 2nd edn. Encyclopedia of Mathematics and its Applications, vol.\u00a046. Cambridge University Press (1999)","key":"21_CR4","DOI":"10.1017\/CBO9780511586507"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(97)00066-8","volume":"80","author":"S. Chepoi","year":"1997","unstructured":"Chepoi, S.: Clin d\u2019\u0153il on L 1-embeddable planar graphs. Discrete Applied Mathematics\u00a080, 3\u201319 (1997)","journal-title":"Discrete Applied Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Delling, D., Goldberg, A.V., Razenshteyn, I., Werneck, R.F.F.: Graph partitioning with natural cuts. In: Proc. 25th IEEE Intl. Parallel and Distributed Processing Symposium (IPDPS 2011), pp. 1135\u20131146 (2011)","key":"21_CR6","DOI":"10.1109\/IPDPS.2011.108"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0095-8956(73)90010-5","volume":"14","author":"D. Djokovi\u0107","year":"1973","unstructured":"Djokovi\u0107, D.: Distance-Preserving Subgraphs of Hypercubes. Journal of Combinatorial Theory B\u00a014, 263\u2013267 (1973)","journal-title":"Journal of Combinatorial Theory B"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00373-011-1049-7","volume":"28","author":"M. Dourado","year":"2012","unstructured":"Dourado, M., Protti, F., Rautenbach, D., Szwarcfiter, J.: On the convexity number of graphs. Graphs and Combinatorics\u00a028, 333\u2013345 (2012)","journal-title":"Graphs and Combinatorics"},{"doi-asserted-by":"crossref","unstructured":"Eppstein, D.: Cubic Partial Cubes from Simplicial Arrangements. The Electronic Journal of Combinatorics 13, #R79 (2006)","key":"21_CR9","DOI":"10.37236\/1105"},{"doi-asserted-by":"crossref","unstructured":"Glantz, R., Meyerhenke, H.: Finding all convex cuts of a plane graph in cubic time. Technical Report 2012,22, Karlsruhe Institute of Technology, Department of Informatics (2012)","key":"21_CR10","DOI":"10.1007\/978-3-642-38233-8_21"},{"issue":"4","key":"21_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ipl.2004.07.006","volume":"92","author":"I. Katriel","year":"2004","unstructured":"Katriel, I.: On the algebraic complexity of set equality and inclusion. Information Processing Letters\u00a092(4), 175\u2013178 (2004)","journal-title":"Information Processing Letters"},{"doi-asserted-by":"crossref","unstructured":"Meyerhenke, H., Monien, B., Sauerwald, T.: A new diffusion-based multilevel algorithm for computing graph partitions. Journal of Parallel and Distributed Computing\u00a069(9), 750\u2013761 (2009); Best Paper Awards and Panel Summary: IPDPS 2008","key":"21_CR12","DOI":"10.1016\/j.jpdc.2009.04.005"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"5597","DOI":"10.1016\/j.disc.2007.10.025","volume":"308","author":"S. Ovchinnikov","year":"2008","unstructured":"Ovchinnikov, S.: Partial cubes: Structures, characterizations, and constructions. Discrete Mathematics\u00a0308, 5597\u20135621 (2008)","journal-title":"Discrete Mathematics"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"116","DOI":"10.2307\/2324180","volume":"99","author":"C. Thomassen","year":"1992","unstructured":"Thomassen, C.: The Jordan-Sch\u00f6nflies Theorem and the Classification of Surfaces. The American Mathematical Monthly\u00a099, 116\u2013130 (1992)","journal-title":"The American Mathematical Monthly"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0095-8956(90)90073-9","volume":"14","author":"E. Wilkeit","year":"1990","unstructured":"Wilkeit, E.: Isometric Embeddings in Hamming Graphs. Journal of Combinatorial Theory B\u00a014, 179\u2013197 (1990)","journal-title":"Journal of Combinatorial Theory B"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,17]],"date-time":"2022-02-17T02:45:32Z","timestamp":1645065932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}