{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:54:52Z","timestamp":1725897292224},"publisher-location":"Wiesbaden","reference-count":13,"publisher":"Vieweg+Teubner Verlag","isbn-type":[{"type":"print","value":"9783815420331"},{"type":"electronic","value":"9783322952332"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/978-3-322-95233-2_20","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T05:17:04Z","timestamp":1366175824000},"page":"349-358","source":"Crossref","is-referenced-by-count":0,"title":["Eine O(e log e) \u2014 Heuristik f\u00fcr ein Flu\u00dfproblem"],"prefix":"10.1007","author":[{"given":"Hans Georg","family":"Osthof","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","volume-title":"Optimale Einbettung von Graphen mit festem Rand","author":"U Becker-Groh","year":"1983","unstructured":"U. Becker-Groh. Optimale Einbettung von Graphen mit festem Rand Master\u2019s thesis, Fachbereich Informatik, Universit\u00e4t des Saarlandes, Im Stadtwald, W-6600 Saarbr\u00fccken 11, FRG, 1983."},{"issue":"5","key":"20_CR2","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1137\/0216061","volume":"16","author":"B Becker","year":"1987","unstructured":"B. Becker and G. Hotz. On the optimal layout of planar graphs with fixed boundary. SIAM Journal on Computing, 16(5), October 1987.","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"20_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0890-5401(87)90039-3","volume":"73","author":"B Becker","year":"1987","unstructured":"B. Becker and H.G. Osthof. Layouts with wires of balanced length. Information and Computation, 73(1):45\u201358, April 1987.","journal-title":"Information and Computation"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BFb0032035","volume-title":"Proceedings of the 17th International Colloqium on Automata, Languages and Programming (ICALP90)","author":"J Cheriyan","year":"1990","unstructured":"J. Cheriyan, T. Hagerup, and K. Mehlhorn. Can a maximum flow be computed in o(nm) time ? In Proceedings of the 17th International Colloqium on Automata, Languages and Programming (ICALP90), pages 235\u2013248, Springer, 1990."},{"key":"20_CR5","first-page":"136","volume-title":"Proceedings of the 18th Annual ACM Symposium on Theory of Computing","author":"AV Goldberg","year":"1986","unstructured":"A.V. Goldberg and R.E. Tarjan. A new approach to the maximum flow problem. In Proceedings of the 18th Annual ACM Symposium on Theory of Computing, pages 136\u2013146, 1986."},{"key":"20_CR6","series-title":"Technical Report 860","doi-asserted-by":"crossref","first-page":"14853","DOI":"10.21236\/ADA214689","volume-title":"Network Flow Algorithms","author":"AV Goldberg","year":"1989","unstructured":"A.V. Goldberg, E. Tardos, and R.E. Tarjan. Network Flow Algorithms Technical Report 860, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853\u20137501, September 1989."},{"key":"20_CR7","first-page":"23","volume-title":"Proceedings of the conference held at K\u00f6ln-Porz at November","author":"W Hackbusch","year":"1981","unstructured":"W. Hackbusch and eds. U. Trottenberg. Multigrid methods. In Proceedings of the conference held at K\u00f6ln-Porz at November, 23\u201327, Springer Verlag, 1981."},{"key":"20_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69672-5","volume-title":"Data Structures and Algorithms 1: Sorting and Searching. EATCS Monographs on Theoretical Computer Science","author":"K Mehlhorn","year":"1984","unstructured":"K. Mehlhorn. Data Structures and Algorithms 1: Sorting and Searching. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin Heidelberg New York Tokio, 1984."},{"key":"20_CR9","first-page":"88","volume-title":"Proceedings of the Annual Symposium on Mathematical Foundations of Computer Science (MFCS89)","author":"K Mehlhorn","year":"1989","unstructured":"K. Mehlhorn and St. N\u00e4her. A library of efficient data types and algorithms. In Proceedings of the Annual Symposium on Mathematical Foundations of Computer Science (MFCS89), pages 88\u2013106, Springer, 1989."},{"key":"20_CR10","first-page":"173","volume-title":"Optimale Grapheinbettungen und ihre Anwendungen","author":"HG Osthof","year":"1990","unstructured":"H.G. Osthof. Optimale Grapheinbettungen und ihre Anwendungen PhD thesis, Fachbereich Informatik, Universit\u00e4t des Saarlandes, Im Stadtwald, W-6600 Saarbr\u00fccken 11, FRG, 1990. 173 Seiten."},{"key":"20_CR11","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"CH Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity Prentice Hall, Inc., Englewood Cliffs, New Jersey, 1982."},{"key":"20_CR12","unstructured":"J. Ruge and K. St\u00fcben. Efficient solution of finite difference and finite elemente equation by Algebraic Multigrid (AMG) Technical Report 89, GMD, Bonn."},{"key":"20_CR13","series-title":"Technical Report 23","volume-title":"Algebraic Multigrid (AMG): Experiences and Comparisons","author":"K St\u00fcben","year":"1983","unstructured":"K. St\u00fcben. Algebraic Multigrid (AMG): Experiences and Comparisons Technical Report 23, GMD, Bonn, March 1983."}],"container-title":["TEUBNER-TEXTE zur Informatik","Informatik"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-322-95233-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T10:33:37Z","timestamp":1557657217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-322-95233-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783815420331","9783322952332"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-322-95233-2_20","relation":{},"ISSN":["1615-4584"],"issn-type":[{"type":"print","value":"1615-4584"}],"subject":[],"published":{"date-parts":[[1992]]}}}