{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:57Z","timestamp":1725664077384},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540589501"},{"type":"electronic","value":"9783540491552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-58950-3_363","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:53:44Z","timestamp":1330275224000},"page":"119-130","source":"Crossref","is-referenced-by-count":4,"title":["The polyhedral approach to the maximum planar subgraph problem: New chances for related problems"],"prefix":"10.1007","author":[{"given":"Michael","family":"J\u00fcnger","sequence":"first","affiliation":[]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"13_CR1","first-page":"626","volume":"265","author":"H.K.B. Beck","year":"1992","unstructured":"Beck, H.K.B., H.-P. Galil, R. Henkel, and E. Sedlmayr: Chemistry in circumstellar shells, I. Chromospheric radiation fields and dust formation in optically thin shells of M-giants. Astron. Astrophys. 265 (1992) 626\u2013642","journal-title":"Astron. Astrophys."},{"key":"13_CR2","unstructured":"Cimikowski, R.J.: An Empirical Analysis of Graph Planarization Heuristics. Computer Science Dept., Montana State Univ. (1992)"},{"key":"13_CR3","unstructured":"Eades, P.: Personal communication (1993)"},{"key":"13_CR4","unstructured":"Eades, P. and J. Marks: Personal communication (1994)"},{"key":"13_CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A. Frank","year":"1992","unstructured":"Frank, A.: Augmenting graphs to meet edge-connectivity requirements. SIAM J. Discr. Math. 5 (1992) 25\u201353","journal-title":"SIAM J. Discr. Math."},{"key":"13_CR6","unstructured":"Himsolt, M.: Konzeption und Implementierung von Grapheneditoren. Dissertation, Universit\u00e4t Passau (1993)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Hsu, T.-S. and V. Ramachandran: A linear time algorithm for triconnectivity augmentation. Proc. 32th Annual Symp. on Found. of Comp. Science, Puerto Rico (1991) 548\u2013559","DOI":"10.1109\/SFCS.1991.185418"},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. Hopcroft","year":"1974","unstructured":"Hopcroft, J., and R.E. Tarjan: Efficient planarity testing. J. ACM 21 (1974) 549\u2013568","journal-title":"J. ACM"},{"key":"13_CR9","unstructured":"J\u00fcnger, M. and P. Mutzel: Solving the Maximum Planar Subgraph Problem by Branch and Cut. Proceedings of the 3rd International Conference on Integer Programming and Combinatorial Optimization (IPCO 3), Erice (1993) 479\u2013492"},{"key":"13_CR10","unstructured":"J\u00fcnger, M. and P. Mutzel: Maximum planar subgraphs and nice embeddings: Practical layout tools. to appear in Algorithmica, special issue on Graph Drawing, Edit. by G. Di Battista und R. Tamassia (1994)"},{"key":"13_CR11","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/43.21845","volume":"8","author":"R. Jayakumar","year":"1989","unstructured":"Jayakumar, R., K. Thulasiraman and M.N.S. Swamy: O(n\n2) Algorithms for Graph Planarization. IEEE Trans. on Computer-aided Design 8 (1989) 257\u2013267","journal-title":"IEEE Trans. on Computer-aided Design"},{"key":"13_CR12","unstructured":"Kant, G.: An O(n\n2) Maximal Planarization Algorithm based on PQ-trees. Technical Report, RUU-CS-92-03, Dept. of Computer Science, Utrecht University (1992)"},{"key":"13_CR13","unstructured":"Kant, G.: Algorithms for Drawing Planar Graphs. Ph.D.-Thesis, Utrecht University (1993)"},{"key":"13_CR14","unstructured":"Mutzel, P.: The Maximum Planar Subgraph Problem. Dissertation, Universit\u00e4t K\u00f6ln (1994)"},{"key":"13_CR15","unstructured":"Mutzel, P.: s-Chorded Cycle Graphs and their Relation to the Planar Subgraph Polytope. Technical Report No. 94-161, Angewandte Mathematik und Informatik, Universit\u00e4t zu K\u00f6ln (1994)"},{"key":"13_CR16","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1137\/0206003","volume":"6","author":"A. Rosenthal","year":"1977","unstructured":"Rosenthal, A. and A. Goldner: Smallest augmentation to biconnect a graph SIAM J. on Computing 6 (1977) 55\u201366","journal-title":"SIAM J. on Computing"},{"key":"13_CR17","volume-title":"Lecture Notes in Mathematics","author":"M. Stoer","year":"1992","unstructured":"Stoer, M.: Design of Survivable Networks. Lecture Notes in Mathematics, Springer-Verlag, Berlin (1992)"},{"key":"13_CR18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"2","author":"K. Sugiyama","year":"1981","unstructured":"Sugiyama, K., S. Tagawa, and M. Toda: Methods for Visual Understanding of Hierarchical Systems. IEEE Trans. on Systems, Man and Cybernetics, SMC-11, 2 (1981) 109\u2013125","journal-title":"IEEE Trans. on Systems, Man and Cybernetics, SMC-11"},{"key":"13_CR19","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 16 (1987) 421\u2013444","journal-title":"SIAM J. Comput."},{"key":"13_CR20","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","volume":"18","author":"R. Tamassia","year":"1988","unstructured":"Tamassia, R., G. Di Battista, and C. Batini: Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics 18 (1988) 61\u201379","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58950-3_363.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:21:25Z","timestamp":1619572885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58950-3_363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589501","9783540491552"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-58950-3_363","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}