{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T16:11:02Z","timestamp":1746115862425,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385261"},{"type":"electronic","value":"9783642385278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38527-8_30","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T13:23:02Z","timestamp":1368019382000},"page":"337-353","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number"],"prefix":"10.1007","author":[{"given":"Mathias","family":"Weller","sequence":"first","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Chaudhary, A., Chen, D.Z., Whitton, K., Niemier, M.T., Ravichandran, R.: Eliminating wire crossings for molecular quantum-dot cellular automata implementation. In: Proc. 2005 ICCAD, pp. 565\u2013571. IEEE Computer Society (2005)","key":"30_CR1","DOI":"10.1109\/ICCAD.2005.1560130"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00453-005-1181-y","volume":"45","author":"V. Dujmovi\u0107","year":"2006","unstructured":"Dujmovi\u0107, V., Fellows, M., Hallett, M., Kitching, M., McCartin, G.L.C., Nishimura, N., Ragde, P., Rosamond, F., Suderman, M., Whitesides, S., Wood, D.R.: A fixed-parameter approach to 2-layer planarization. Algorithmica\u00a045(2), 159\u2013182 (2006)","journal-title":"Algorithmica"},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00453-007-9151-1","volume":"52","author":"V. Dujmovi\u0107","year":"2008","unstructured":"Dujmovi\u0107, V., Fellows, M., Hallett, M., Kitching, M., McCartin, G.L.C., Nishimura, N., Ragde, P., Rosamond, F., Suderman, M., Whitesides, S., Wood, D.R.: On the parameterized complexity of layered graph drawing. Algorithmica\u00a052(2), 267\u2013292 (2008)","journal-title":"Algorithmica"},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(94)90179-1","volume":"131","author":"P. Eades","year":"1994","unstructured":"Eades, P., Whitesides, S.: Drawing graphs in two layers. Theor. Comp. Sci.\u00a0131(2), 361\u2013374 (1994)","journal-title":"Theor. Comp. Sci."},{"issue":"2","key":"30_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.7155\/jgaa.00106","volume":"9","author":"H. Fernau","year":"2005","unstructured":"Fernau, H.: Two-layer planarization: Improving on parameterized algorithmics. J. Graph Algorithms Appl.\u00a09(2), 205\u2013238 (2005)","journal-title":"J. Graph Algorithms Appl."},{"doi-asserted-by":"crossref","unstructured":"J\u00fcnger, M., Mutzel, P.: 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. J. Graph Algorithms Appl.\u00a01 (1997)","key":"30_CR6","DOI":"10.7155\/jgaa.00001"},{"doi-asserted-by":"crossref","unstructured":"Koenig, P.-Y., Melanc\u0328on, G., Bohan, C., Gautier, B.: Combining DagMaps and Sugiyama layout for the navigation of hierarchical data. In: Proc. 11th IV, pp. 447\u2013452. IEEE Computer Society (2007)","key":"30_CR7","DOI":"10.1109\/IV.2007.36"},{"doi-asserted-by":"crossref","unstructured":"Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. Wiley (1990)","key":"30_CR8","DOI":"10.1007\/978-3-322-92106-2_3"},{"issue":"4","key":"30_CR9","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1137\/S1052623498334013","volume":"11","author":"P. Mutzel","year":"2001","unstructured":"Mutzel, P.: An alternative method to crossing minimization on hierarchical graphs. SIAM J. Optim.\u00a011(4), 1065\u20131080 (2001)","journal-title":"SIAM J. Optim."},{"unstructured":"Suderman, M.: Layered Graph Drawing. PhD thesis, School of Computer Science, McGill University Montr\u00e9al (2005)","key":"30_CR10"},{"issue":"1","key":"30_CR11","doi-asserted-by":"publisher","first-page":"149","DOI":"10.7155\/jgaa.00103","volume":"9","author":"M. Suderman","year":"2005","unstructured":"Suderman, M., Whitesides, S.: Experiments with the fixed-parameter approach for two-layer planarization. J. Graph Algorithms Appl.\u00a09(1), 149\u2013163 (2005)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"30_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K. Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst., Man, Cybern.\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. Syst., Man, Cybern."},{"issue":"6","key":"30_CR13","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/0020-0190(74)90003-9","volume":"2","author":"R.E. Tarjan","year":"1974","unstructured":"Tarjan, R.E.: A note on finding the bridges of a graph. Inf. Process. Lett.\u00a02(6), 160\u2013161 (1974)","journal-title":"Inf. Process. Lett."},{"doi-asserted-by":"crossref","unstructured":"Uhlmann, J., Weller, M.: Two-layer planarization parameterized by feedback edge set. Theor. Comp. Sci. (2013), doi:10.1016\/j.tcs.2013.01.029","key":"30_CR14","DOI":"10.1016\/j.tcs.2013.01.029"},{"issue":"2","key":"30_CR15","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF02460022","volume":"48","author":"M.S. Waterman","year":"1986","unstructured":"Waterman, M.S., Griggs, J.R.: Interval graphs and maps of DNA. Bulletin of Mathematical Biology\u00a048(2), 189\u2013195 (1986)","journal-title":"Bulletin of Mathematical Biology"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38527-8_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T09:14:16Z","timestamp":1746004456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38527-8_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385261","9783642385278"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38527-8_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}