{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:07:20Z","timestamp":1751879240756},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514985"},{"type":"electronic","value":"9783540481805"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51498-8_7","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:02:25Z","timestamp":1330185745000},"page":"68-77","source":"Crossref","is-referenced-by-count":8,"title":["The jump number problem for biconvex graphs and rectangle covers of rectangular regions"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, D. Kratsch, On the restriction of some NP-complete graph problems to permutation graphs, Report N\/84\/80, Friedrich-Schiller-Universit\u00e4t Jena, appeared in FCT'85, LNCS 199, 53\u201362","DOI":"10.1007\/BFb0028791"},{"key":"7_CR2","first-page":"165","volume":"58","author":"A. Brandst\u00e4dt","year":"1987","unstructured":"A. Brandst\u00e4dt, J. Spinrad, L. Stewart, Bipartite permutation graphs are bipartite tolerance graphs, Congressus Numerantium Vol. 58, 1987, 165\u2013174","journal-title":"Congressus Numerantium"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"S. Chaiken, D.J. Kleitman, M. Saks, J. Shearer, Covering Regions by Rectangles, SIAM J. Alg. Discr. Math. 1981, 394\u2013410","DOI":"10.1137\/0602042"},{"key":"7_CR4","first-page":"183","volume":"16","author":"G. Chaty","year":"1979","unstructured":"G. Chaty, M. Chein, Ordered matchings and matchings without alternating cycles in bipartite graphs, Utilitas Mathematica 16, 1979, 183\u2013187","journal-title":"Utilitas Mathematica"},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0167-5060(08)70060-8","volume":"9","author":"M. Chein","year":"1980","unstructured":"M. Chein, M. Habib, The jump number of dags and posets: an introduction, Ann. Discr. Math. 9, 1980, 189\u2013194","journal-title":"Ann. Discr. Math."},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1145\/321707.321710","volume":"19","author":"S. Even","year":"1972","unstructured":"S. Even, A. Pnueli, A. Lempel, Permutation graphs and transitive graphs, J. ACM 19, 1972, 400\u2013410","journal-title":"J. ACM"},{"key":"7_CR7","unstructured":"H. Fauck, Ein optimaler sequentieller und ein paralleler Algorithmus zur Konstruktion minimaler \u00dcberdeckungen einfacher, rechtwinkliger, monotoner Polygone in der Ebene durch Rechtecke, Diploma thesis 1988, Humboldt-Universit\u00e4t Berlin"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"D. Franzblau, D.J. Kleitman, An Algorithm for Constructing Regions with Rectangles: Independence and Minimum Generating Sets for Collections of Intervals, 16th STOC 1984, 167\u2013174","DOI":"10.1145\/800057.808678"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"M. Habib, Comparability invariants, in Ordres: Description et Roles, ed. M. Pouzet and D. Richard, 371\u2013386, North-Holland 1984","DOI":"10.1016\/S0304-0208(08)73832-5"},{"key":"7_CR10","unstructured":"H. Jung, H. Fauck, personal communication"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"R.H. M\u00f6hring, Algorithmic aspects of comparability graphs and interval graphs, in Graphs and Orders, ed. I. Rival, 41\u2013101, D. Reidel Publ. Co. 1985","DOI":"10.1007\/978-94-009-5315-4_2"},{"key":"7_CR12","unstructured":"H. M\u00fcller, Alternating-cycle-free matchings in chordal bipartite graphs, 1988, submitted to Order"},{"key":"7_CR13","unstructured":"W.R. Pulleyblank, On minimizing setups in precedence constrained scheduling, to appear in Discr. Appl. Math."},{"key":"7_CR14","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","volume":"18","author":"J. Spinrad","year":"1987","unstructured":"J. Spinrad, A. Brandst\u00e4dt, L. Stewart, Bipartite permutation graphs, Discr. Appl. Math. 18 (1987), 279\u2013292","journal-title":"Discr. Appl. Math."},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/BF00340778","volume":"3","author":"G. Steiner","year":"1987","unstructured":"G. Steiner, L. Stewart, A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders, Order 3 (1987), 359\u2013367","journal-title":"Order"},{"key":"7_CR16","unstructured":"L. Stewart, Permutation Graph Structure and Algorithms, Ph. D. thesis, University of Toronto, 1985"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00396269","volume":"1","author":"M. M. Sys\u0142o","year":"1984","unstructured":"M. M. Sys\u0142o, Minimizing the jump number for partially ordered sets: A graph-theoretic approach, Order 1 (1984) 7\u201319","journal-title":"Order"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"M. M. Sys\u0142o, A graph-theoretic approach to the jump number problem, in Graphs and orders, ed. I. Rival, 185\u2013215 D. Reidel Publ. co. 1985","DOI":"10.1007\/978-94-009-5315-4_6"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51498-8_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:21:40Z","timestamp":1605630100000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51498-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514985","9783540481805"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-51498-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}