{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:54:37Z","timestamp":1725890077006},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540639381"},{"type":"electronic","value":"9783540696742"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63938-1_48","type":"book-chapter","created":{"date-parts":[[2006,7,18]],"date-time":"2006-07-18T11:35:47Z","timestamp":1153222547000},"page":"37-46","source":"Crossref","is-referenced-by-count":1,"title":["Bipartite crossing numbers of meshes and hypercubes"],"prefix":"10.1007","author":[{"given":"Farhad","family":"Shahrokhi","sequence":"first","affiliation":[]},{"given":"Ondrej","family":"Sykora","sequence":"additional","affiliation":[]},{"given":"L\u00e1szl\u00f3 A.","family":"Sz\u00e9kely","sequence":"additional","affiliation":[]},{"given":"Imrich","family":"Vrt'o","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0893-9659(95)00015-I","volume":"8","author":"R. Ahlswede","year":"1995","unstructured":"Ahlswede, R., Bezrukov, S. L., Edge isoperimetric theorems for integer point arrays, Appl. Math. Lett.\n8 (1995), 75\u201380.","journal-title":"Appl. Math. Lett."},{"key":"4_CR2","unstructured":"Bezrukov, S. L., Edge isoperimetric problems on graphs, Technical Report, Department of Computer Science, University of Paderborn, 1997."},{"key":"4_CR3","unstructured":"Bollob\u00e1s, B., Combinatorics, Chapter 16, Cambridge Uni. Press, 1986."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/BF01275667","volume":"11","author":"B. Bollob\u00e1s","year":"1991","unstructured":"Bollob\u00e1s, B., Leader, I., Edge-isoperimetric inequalities in the grid, Combinatorica\n11 (1991), 299\u2013314.","journal-title":"Combinatorica"},{"key":"4_CR5","unstructured":"Bollob\u00e1s, B., Leader, I., Matchings and paths in cubes, SIAM J. Discrete Mathematics, to appear."},{"key":"4_CR6","unstructured":"Brandenburg, F. J., J\u00fcnger, M., Mutzel, P., Algorithms for automatic graph drawing, Technical Report, Max Planck Institute, MPI-I-97-1-007, Saarbr\u00fccken, March 1997, (in German)."},{"key":"4_CR7","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/21.364865","volume":"25","author":"T. Catarci","year":"1995","unstructured":"Catarci, T., The assignment heuristics for crossing reduction, IEEE transactions on Systems, Man and Cybernetics\n25 (1995), 515\u2013521.","journal-title":"IEEE transactions on Systems, Man and Cybernetics"},{"key":"4_CR8","series-title":"Regional Conference Series in Mathematics","volume-title":"Spectral Graph Theory","author":"F. R. K. Chung","year":"1997","unstructured":"Chung, F. R. K., Spectral Graph Theory, Regional Conference Series in Mathematics Number 92, American Mathematical Society, Providence, RI, 1997."},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/0097-3165(88)90034-9","volume":"49","author":"F. R. K. Chung","year":"1988","unstructured":"Chung, F. R. K., F\u00fcredi, Z., Graham, R. L., Seymour, P. D., On induced subgraphs of the cube, J. Combinatorial Theory (A) 49 (1988), 180\u2013187.","journal-title":"J. Combinatorial Theory (A)"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"J. Battista Di","year":"1994","unstructured":"Di Battista, J., Eades, P., Tamassia, R., Tollis, I.G., Algorithms for drawing graphs: an annotated bibliography, Computational Geometry\n4 (1994), 235\u2013282.","journal-title":"Computational Geometry"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P. Eades","year":"1994","unstructured":"Eades, P., Wormald, N., Edge crossings in drawings of bipartite graphs, Algorithmica\n11 (1994), 379\u2013403.","journal-title":"Algorithmica"},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"M.R. Garey","year":"1983","unstructured":"Garey, M.R., Johnson, D.S., Crossing number is NP-complete, SIAM J. Algebraic and Discrete Methods\n4 (1983), 312\u2013316.","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1080\/0025570X.1969.11975950","volume":"42","author":"F. Harary","year":"1969","unstructured":"Harary, F., Determinants, permanents and bipartite graphs, Mathematical Magazine\n42 (1969), 146\u2013148.","journal-title":"Mathematical Magazine"},{"key":"4_CR14","first-page":"203","volume":"1","author":"F. Harary","year":"1972","unstructured":"Harary, F., Schwenk, A., A new crossing number for bipartite graphs, Utilitas Mathematica\n1 (1972), 203\u2013209.","journal-title":"Utilitas Mathematica"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1137\/0112012","volume":"12","author":"L. H. Harper","year":"1964","unstructured":"Harper, L. H., Optimal assignements of numbers to vertices, SIAM J. Applied Mathematics\n12 (1964), 131\u2013135.","journal-title":"SIAM J. Applied Mathematics"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BFb0021817","volume-title":"Proc. Graph Drawing'95","author":"M. J\u00fcnger","year":"1996","unstructured":"J\u00fcnger, M., Mutzel, P., Exact and heuristic algorithm for 2-layer straightline crossing number, in: Proc. Graph Drawing'95, Lecture Notes in Computer Science 1027, Springer Verlag, Berlin, 1996, 337\u2013348."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0166-218X(92)90229-4","volume":"36","author":"M. Juvan","year":"1992","unstructured":"Juvan, M., Mohar, B., Optimal linear labelings and eigenvalues of graphs, Discrete Applied Mathematics\n36 (1992), 153\u2013168.","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR18","first-page":"21","volume":"70","author":"D.O. Muradyan","year":"1980","unstructured":"Muradyan, D.O., Piliposian, T.E., Minimal numberings of vertices of a rectangular lattice, Akad. Nauk Armjan. SSR Doklady 70 (1980), 21\u201327, (in Russian).","journal-title":"Akad. Nauk Armjan. SSR Doklady"},{"key":"4_CR19","first-page":"85","volume":"17","author":"M. May","year":"1988","unstructured":"May, M., Szkatula, K., On the bipartite crossing number, Control and Cybernetics\n17 (1988), 85\u201398.","journal-title":"Control and Cybernetics"},{"key":"4_CR20","unstructured":"Shahrokhi, F., S\u00fdkora, 0., Sz\u00e9kely, L. A., Vr6, On bipartite crossings, biplanar subgraphs, and the linear arrangement problem, in: Proc. 5th Workshop Algorithms and Data Structures, (WADS'97), August 6\u20138, 1997 Halifax, Nova Scotia, Canada, Lecture Notes in Computer Science Vol. 1272, Springer-Verlag, 55\u201368."},{"key":"4_CR21","series-title":"Lecture Notes Computer Science","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/3-540-58950-3_364","volume-title":"Crossing numbers of graphs, lower bound techniques and algorithms: a survey","author":"F. Shahrokhi","year":"1995","unstructured":"F. Shahrokhi, L. A. Sz\u00e9kely, I. Vrt'o, Crossing numbers of graphs, lower bound techniques and algorithms: a survey, in: Proc. DIMACS Workshop on Graph Drawing'94, Lecture Notes Computer Science 894, Springer Verlag, Berlin, 1995, 131\u2013142."},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","volume":"19","author":"J. Spinrad","year":"1987","unstructured":"Spinrad, J., Brandst\u00e4dt, A., Stewart, L., Bipartite permutation graphs, Discrete Applied Mathematics\n19, 1987, 279\u2013292.","journal-title":"Discrete Applied Mathematics"},{"key":"4_CR23","doi-asserted-by":"crossref","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 systems structures, IEEE Transactions on Systems, Man and Cybernetics\n11 (1981), 109\u2013125.","journal-title":"Man and Cybernetics"},{"key":"4_CR24","volume-title":"Graph Theory","author":"W. T. Tutte","year":"1984","unstructured":"Tutte, W. T., Graph Theory, Addison Wesley Publishing Company, Reading, 1984."},{"key":"4_CR25","first-page":"502","volume":"7","author":"J. Warfield","year":"1977","unstructured":"Warfield, J., Crossing theory and hierarchy mapping, IEEE Dnnsactions on Systems, Man and Cybernetics\n7 (1977), 502\u2013523.","journal-title":"IEEE Dnnsactions on Systems, Man and Cybernetics"},{"key":"4_CR26","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1111\/j.1749-6632.1970.tb56499.x","volume":"175","author":"M.E. Watkins","year":"1970","unstructured":"Watkins, M.E., A special crossing number for bipartite graphs: a research problem, Annals of New York Academy Sciences\n175 (1970), 405\u2013410.","journal-title":"Annals of New York Academy Sciences"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63938-1_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T16:31:31Z","timestamp":1549211491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63938-1_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540639381","9783540696742"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-63938-1_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}