{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T03:33:53Z","timestamp":1769571233590,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540001584","type":"print"},{"value":"9783540361510","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36151-0_13","type":"book-chapter","created":{"date-parts":[[2007,11,16]],"date-time":"2007-11-16T17:14:14Z","timestamp":1195233254000},"page":"130-141","source":"Crossref","is-referenced-by-count":13,"title":["Simple and Efficient Bilayer Cross Counting"],"prefix":"10.1007","author":[{"given":"Wilhelm","family":"Barth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"J\u00fcnger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1016\/0022-0000(86)90025-5","volume":"32","author":"B. Chazelle","year":"1986","unstructured":"B. Chazelle, Reporting and counting segment intersections. Journal of Computer and System Sciences 32 (1986) 156\u2013182.","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/147508.147511","volume":"39","author":"B. Chazelle","year":"1992","unstructured":"B. Chazelle and H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane. Journal of the ACM 39 (1992) 1\u201354.","journal-title":"Journal of the ACM"},{"key":"13_CR3","volume-title":"Introduction to algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to algorithms. MIT Press, Cambridge, MA, 1990."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P. Eades","year":"1994","unstructured":"P. Eades and N. Wormald, Edge crossings in drawings of bipartite graphs. Algorithmica 11 (1994) 379\u2013403.","journal-title":"Algorithmica"},{"key":"13_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/3-540-45875-1_24","volume-title":"Software Visualization, International Dagstuhl Seminar on Software Visualization 2001","author":"C. Gutwenger","year":"2002","unstructured":"C. Gutwenger, M. J\u00fcnger, G. W. Klau, S. Leipert, and P. Mutzel, Graph Drawing Algorithm Engineering with AGD. in: S. Diehl (ed.), Software Visualization, International Dagstuhl Seminar on Software Visualization 2001, Lecture Notes in Computer Science 2269, Springer, 2002, pp. 307\u2013323, see also: \n                    http:\/\/www.mpi-sb.mpg.de\/AGD\/"},{"key":"13_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"M. J\u00fcnger","year":"1997","unstructured":"M. J\u00fcnger and P. Mutzel, 2-layer straight line crossing minimization: performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications 1 (1997) 1\u201325.","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"13_CR7","volume-title":"The Stanford GraphBase: A platform for combinatorial computing","author":"D. E. Knuth","year":"1993","unstructured":"D. E. Knuth, The Stanford GraphBase: A platform for combinatorial computing. Addison-Wesley, Reading, Massachusetts, 1993"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"G. S. Lueker, A data structure for orthogonal range queries. Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, 1978, pp. 28\u201334.","DOI":"10.1109\/SFCS.1978.1"},{"key":"13_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-58950-3_371","volume-title":"Graph Drawing 1994","author":"G. Sander","year":"1995","unstructured":"G. Sander, Graph Layout through the VCG Tool. in: R. Tamassia and I. G. Tollis (eds): Graph Drawing 1994, Lecture Notes in Computer Science 894, Springer, 1995, pp. 194\u2013205, see also: \n                    http:\/\/rw4.cs.uni-sb.de\/users\/sander\/html\/gsvcg1.html"},{"key":"13_CR10","volume-title":"Visualisierungstechniken f\u00fcr den Compilerbau","author":"G. Sander","year":"1996","unstructured":"G. Sander, Visualisierungstechniken f\u00fcr den Compilerbau. Pirrot Verlag & Druck, Saarbr\u00fccken, 1996."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K. Sugiyama","year":"1981","unstructured":"K. Sugiyama, S. Tagawa, and M. Toda, Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics 11 (1981) 109\u2013125.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"13_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-46648-7_6","volume-title":"Graph Drawing 1999","author":"V. Waddle","year":"1999","unstructured":"V. Waddle and A. Malhotra, An E log E line crossing algorithm for levelled graphs. in: J. Kratochv\u00edl (ed.) Graph Drawing 1999, Lecture Notes in Computer Science 1731, Springer, 1999, pp. 59\u201370."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36151-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T16:14:01Z","timestamp":1551111241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36151-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001584","9783540361510"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-36151-0_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}