乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T05:18:03Z","timestamp":1712294283686},"reference-count":84,"publisher":"Wiley","issue":"11","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":5722,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw: Pract. Exper."],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1002\/1097-024x(200009)30:11<1235::aid-spe339>3.0.co;2-b","type":"journal-article","created":{"date-parts":[[2002,9,11]],"date-time":"2002-09-11T01:20:53Z","timestamp":1031707253000},"page":"1235-1284","source":"Crossref","is-referenced-by-count":9,"title":["Experimental studies on graph drawing algorithms"],"prefix":"10.1002","volume":"30","author":[{"given":"Luca","family":"Vismara","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Di Battista","sequence":"additional","affiliation":[]},{"given":"Ashim","family":"Garg","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[]},{"given":"Francesco","family":"Vargiu","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2000]]},"reference":[{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"Di Battista","year":"1994","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB2","series-title":"Lecture Notes","volume-title":"Graph Drawing (Proceedings of GD '95)","author":"Brandenburg","year":"1996","unstructured":"(ed.). Graph Drawing (Proceedings of GD '95) (Lecture Notes in Computer Science, vol. 1027). Springer-Verlag, 1996."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB3","series-title":"Lecture Notes","volume-title":"Graph Drawing (Proceedings of GD '97)","author":"Di Battista","year":"1997","unstructured":"(ed.). Graph Drawing (Proceedings of GD '97) (Lecture Notes in Computer Science, vol. 1353). Springer-Verlag, 1997."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB4","author":"Di Battista","year":"1993","unstructured":"(eds.). Graph Drawing '93 (Proceedings of the ALCOM International Workshop on Graph Drawing), 1993. http:\/\/www.cs.brown.edu\/people\/rt\/gd-93.html ."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB5","series-title":"Lecture Notes","volume-title":"Graph Drawing (Proceedings of GD '96)","author":"North","year":"1997","unstructured":"(ed.). Graph Drawing (Proceedings of GD '96) (Lecture Notes in Computer Science, vol. 1190). Springer-Verlag, 1997."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB6","series-title":"Lecture Notes","volume-title":"Graph Drawing (Proceedings of GD '94)","author":"Tamassia","year":"1995","unstructured":"(eds.). Graph Drawing (Proceedings of GD '94) (Lecture Notes in Computer Science, vol. 894). Springer-Verlag, 1995."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB7","series-title":"Lecture Notes","volume-title":"Graph Drawing (Proceedings of GD '98)","author":"Whitesides","year":"1998","unstructured":"(ed.). Graph Drawing (Proceedings of GD '98) (Lecture Notes in Computer Science, vol. 1547) Springer-Verlag, 1998."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB8","doi-asserted-by":"crossref","DOI":"10.1006\/jvlc.1995.1012","volume":"6","author":"Cruz","year":"1995","journal-title":"J. Visual Lang. Comput."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB9","doi-asserted-by":"crossref","DOI":"10.1007\/BF02086605","volume":"16","author":"Di Battista","year":"1996","journal-title":"Algorithmica"},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB10","doi-asserted-by":"crossref","DOI":"10.1016\/S0925-7721(97)00012-6","volume":"9","author":"Di Battista","year":"1998","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB11","volume-title":"Graph Drawing","author":"Di Battista","year":"1999","unstructured":"Graph Drawing. Prentice Hall: Upper Saddle River, NJ, 1999."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB12","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","volume":"SMC-18","author":"Tamassia","year":"1988","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB13","series-title":"Lecture Notes","first-page":"248","volume-title":"Graph Drawing (Proceedings of GD '97)","author":"Purchase","year":"1997","unstructured":"Which aesthetic has the greatest effect on human understanding? Graph Drawing (Proceedings of GD '97) (Lecture Notes in Computer Science, vol. 1353), (ed.). Springer-Verlag, 1997; 248-261."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB14","volume":"2","author":"Purchase","year":"1997","journal-title":"ACM J. Experim. Algorithmics"},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB15","author":"Johnson","year":"1996","unstructured":"A theoretician's guide to the experimental analysis of algorithms. Preliminary, partial draft, 1996; http:\/www.research.att.com\/?dsj\/papers\/exper.ps."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB16","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1006\/jvlc.1995.1015","volume":"6","author":"Himsolt","year":"1995","journal-title":"J. Visual Lang. Comput."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB17","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0925-7721(96)00005-3","volume":"7","author":"Di Battista","year":"1997","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB18","series-title":"Lecture Notes","first-page":"371","volume-title":"Graph Drawing (Proceedings of GD '96)","author":"Papakostas","year":"1997","unstructured":"Experimental and theoretical results in interactive orthogonal graph drawing. Graph Drawing (Proceedings of GD '96) (Lecture Notes in Computer Science, vol. 1190), (ed.). Springer-Verlag, 1997; 371-386."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB19","author":"Papakostas","year":"1999","unstructured":"Interactive orthogonal graph drawing: An experimental study. Technical Report UTDCS-3-99, Dept. Comput. Sci., Univ. Texas Dallas, May 1999."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB20","series-title":"Lecture Notes","first-page":"76","volume-title":"Graph Drawing (Proceedings of GD '96)","author":"Di Battista","year":"1997","unstructured":"Drawing directed acyclic graphs: An experimental study. Graph Drawing (Proceedings of GD '96) (Lecture Notes in Computer Science, vol. 1190), (ed.). Springer-Verlag, 1997; 76-91."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB21","author":"Di Battista","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00001","volume":"1","author":"J\u00fcnger","year":"1997","journal-title":"J. Graph Algorithms Appl."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB23","series-title":"Lecture Notes","first-page":"76","volume-title":"Graph Drawing (Proceedings of GD '95)","author":"Brandenburg","year":"1996","unstructured":"An experimental comparison of force-directed and randomized graph drawing algorithms. Graph Drawing (Proceedings of GD '95) (Lecture Notes in Computer Science, vol. 1027), (ed.). Springer-Verlag, 1996; 76-87."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB24","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1006\/jvlc.1995.1013","volume":"6","author":"Sugiyama","year":"1995","journal-title":"J. Visual Lang. Comput."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB25","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1109\/31.34669","volume":"CAS-36","author":"Tamassia","year":"1989","journal-title":"IEEE Trans. Circuits Syst."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB26","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","volume":"9","author":"Biedl","year":"1998","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB27","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"Tamassia","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB28","series-title":"Lecture Notes","first-page":"40","volume-title":"Graph Drawing (Proceedings of GD '94)","author":"Papakostas","year":"1995","unstructured":"Improved algorithms and bounds for orthogonal drawings. Graph Drawing (Proceedings of GD '94) (Lecture Notes in Computer Science, vol. 894), (eds.). Springer-Verlag, 1995; 40-51."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB29","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0925-7721(97)00017-5","volume":"9","author":"Papakostas","year":"1998","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB30","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1109\/12.736444","volume":"C-47","author":"Papakostas","year":"1998","journal-title":"IEEE Trans. Comput."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB31","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"SMC-11","author":"Sugiyama","year":"1981","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB32","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"Eades","year":"1994","journal-title":"Algorithmica"},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB33","first-page":"121","volume-title":"Operations Research Proceedings 1994","author":"Dresbach","year":"1994","unstructured":"A new heuristic layout algorithm for DAGs. Operations Research Proceedings 1994, (eds.). Springer-Verlag, 1994; 121-126."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB34","first-page":"89","volume":"21.A","author":"Eades","year":"1986","journal-title":"Ars Combin."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB35","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1109\/21.364865","volume":"SMC-25","author":"Catarci","year":"1995","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB36","author":"Koutsofios","year":"1993","unstructured":"Drawing graphs with dot. 1993. ftp:\/\/ftp.research.att.com\/dist\/drawdag\/dotdoc.ps.Z."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB37","author":"Di Battista","year":"1989","unstructured":"Automatic layout of PERT diagrams with XPERT. Proceedings of the IEEE Workshop on Visual Languages (VL'89), 1989; 171-176."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB38","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","volume":"61","author":"Di Battista","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB39","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF02187850","volume":"7","author":"Di Battista","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB40","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"Fruchterman","year":"1991","journal-title":"Softw.?Pract. Exp."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB41","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"Kamada","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB42","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"Davidson","year":"1996","journal-title":"ACM Trans. Graph."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB43","author":"Tunkelang","year":"1994","unstructured":"A practical approach to drawing undirected graphs. Technical Report CMU-CS-94-161, School Comput. Sci., Carnegie Mellon Univ., June 1994."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB44","series-title":"Lecture Notes","first-page":"388","volume-title":"Graph Drawing (Proceedings of GD '94)","author":"Frick","year":"1995","unstructured":"A fast adaptive layout algorithm for undirected graphs. Graph Drawing (Proceedings of GD '94), (Lecture Notes in Computer Science, vol. 894). (eds.). Springer-Verlag, 1995; 388-403."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB45","author":"Kant","year":"1993","unstructured":"Algorithms for Drawing Planar Graphs. PhD Thesis, Dept. Comput. Sci., Univ. Utrecht, Utrecht, The Netherlands, 1993."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB46","first-page":"171","volume-title":"Proceedings of the International Conference on Electronic Publishing","author":"Trickey","year":"1988","unstructured":"Drag: A graph drawing system. Proceedings of the International Conference on Electronic Publishing, 1988. Cambridge University Press, 171-182."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB47","author":"Di Battista","year":"1990","unstructured":"The architecture of Diagram Server. Proceedings of the IEEE Workshop on Visual Languages, 1990; 60-65."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB48","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1006\/jvlc.1995.1016","volume":"6","author":"Di Battista","year":"1995","journal-title":"J. Visual Lang. Comput."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB49","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"Garey","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB50","author":"Batini","year":"1985","unstructured":"What is a good diagram? A pragmatic approach. Proceedings of the 4th International Conference on the Entity-Relationship Approach, 1985; 312-319."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB51","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","volume":"SE-12","author":"Batini","year":"1986","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB52","author":"Eades","year":"1991","unstructured":"Preserving the mental map of a diagram. Proceedings of the 1st International Conference on Computational Graphics and Visualisation Techniques, 1991: 34-43."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB53","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"Misue","year":"1995","journal-title":"J. Visual Lang. Comput."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB54","doi-asserted-by":"crossref","first-page":"970","DOI":"10.1137\/S0097539792235724","volume":"24","author":"Cohen","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB55","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/52.56447","volume":"7","author":"Moen","year":"1990","journal-title":"IEEE Softw."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB56","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"SE-7","author":"Reingold","year":"1981","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB57","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1002\/spe.4380201307","volume":"20","author":"Newbery Paulish","year":"1990","journal-title":"Softw.?Pract. Exp."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB58","author":"Bohringer","year":"1990","unstructured":"Using constraints to achieve stability in automatic graph layout algorithms. Proceedings of the ACM Conference on Human Factors in Computing Systems, 1990; 43-51."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB59","series-title":"Lecture Notes","first-page":"409","volume-title":"Graph Drawing (Proceedings of GD '95)","author":"North","year":"1996","unstructured":"Incremental layout in DynaDAG. Graph Drawing (Proceedings of GD '95) (Lecture Notes in Computer Science, vol. 1027), (ed.). Springer-Verlag, 1996; 409-418."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB60","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1109\/CASE.1993.634832","volume-title":"Proceedings of the 6th International Workshop on Computer-Aided Software Engineering","author":"Miriyala","year":"1993","unstructured":"An incremental approach to aesthetic graph layout. Proceedings of the 6th International Workshop on Computer-Aided Software Engineering. IEEE Computer Society, 1993; 297-308."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB61","series-title":"Lecture Notes","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-63397-9_4","volume-title":"Algorithms (Proceedings of ESA'97)","author":"Biedl","year":"1997","unstructured":"Area-efficient static and incremental graph drawings. Algorithms (Proceedings of ESA'97) (Lecture Notes in Computer Science, vol. 1284), (eds.). Springer-Verlag, 1997; 37-52."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB62","series-title":"Lecture Notes","first-page":"303","volume-title":"Graph Drawing (Proceedings of GD '97)","author":"Bridgeman","year":"1997","unstructured":"InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. Graph Drawing (Proceedings of GD '97) (Lecture Notes in Computer Science, vol. 1353), (ed.). Springer-Verlag, 1997; 303-308."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB63","series-title":"Lecture Notes","first-page":"236","volume-title":"Graph Drawing (Proceedings of GD '97)","author":"Brandes","year":"1997","unstructured":"A bayesian paradigm for dynamic graph layout. Graph Drawing (Proceedings of GD '97) (Lecture Notes in Computer Science, vol. 1353), (ed.). Springer-Verlag, 1997; 236-247."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB64","first-page":"149","volume":"42","author":"Eades","year":"1984","journal-title":"Congr. Numer."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB65","series-title":"Lecture Notes","first-page":"385","volume-title":"Graph Drawing (Proceedings of GD '95)","author":"Madden","year":"1996","unstructured":"Portable graph layout and editing. Graph Drawing (Proceedings of GD '95) (Lecture Notes in Computer Science, vol. 1027), (ed.). Springer-Verlag, 1996; 385-395."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB66","series-title":"Lecture Notes","first-page":"169","volume-title":"Graph Drawing (Proceedings of GD '96)","author":"Frick","year":"1997","unstructured":"Upper bounds on the number of hidden nodes in Sugiyama's algorithm. Graph Drawing (Proceedings of GD '96) (Lecture Notes in Computer Science, vol. 1190), (ed.). Springer-Verlag, 1997; 169-183."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB67","author":"Eades","year":"1986","unstructured":"On an edge crossing problem. Proceedings of the 9th Australian Computer Science Conference, 1986; 327-334."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB68","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/00207169008803921","volume":"36","author":"M\u00e4kinen","year":"1990","journal-title":"Int. J. Comput. Math."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB69","series-title":"Lecture Notes","first-page":"318","volume-title":"Graph Drawing (Proceedings of GD '96)","author":"Mutzel","year":"1997","unstructured":"An alternative method to crossing minimization on hierarchical graphs. Graph Drawing (Proceedings of GD '96) (Lecture Notes in Computer Science, vol. 1190), (ed.). Springer-Verlag, 1997; 318-333."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB70","series-title":"Lecture Notes","first-page":"69","volume-title":"Algorithms and Computation (Proceedings of ISAAC'98)","author":"Mutzel","year":"1998","unstructured":"Two-layer planarization in graph drawing. Algorithms and Computation (Proceedings of ISAAC'98) (Lecture Notes in Computer Science, vol. 1533), (eds.). Springer-Verlag, 1998; 69-78."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB71","series-title":"Lecture Notes","first-page":"13","volume-title":"Graph Drawing (Proceedings of GD '97)","author":"J\u00fcnger","year":"1997","unstructured":"A polyhedral approach to the multi-layer crossing minimization problem. Graph Drawing (Proceedings of GD '97) (Lecture Notes in Computer Science, vol. 1353), (ed.) Springer-Verlag, 1997; 13-24."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB72","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/32.221135","volume":"SE-19","author":"Gansner","year":"1993","journal-title":"IEEE Trans. Softw. Eng."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB73","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1002\/spe.4380181104","volume":"18","author":"Gansner","year":"1988","journal-title":"Softw. Pract. Exp."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB74","series-title":"Lecture Notes","first-page":"111","volume-title":"Graph Drawing (Proceedings of GD '95)","author":"Buti","year":"1996","unstructured":"GD-Workbench: A system for prototyping and testing graph drawing algorithms. Graph Drawing (Proceedings of GD '95) (Lecture Notes in Computer Science, vol. 1027), (ed.). Springer-Verlag, 1996; 111-122."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB75","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"Rosenstiehl","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB76","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"Tamassia","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB77","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(92)90072-4","volume":"41","author":"Di Battista","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB78","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01108622","volume":"12","author":"Garg","year":"1995","journal-title":"Order"},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB79","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-94-017-0697-1_9","volume-title":"Algebras and Orders","author":"Rival","year":"1993","unstructured":"Reading, drawing, and order. Algebras and Orders, (eds.). Kluwer Academic Publishers, 1993; 359-404."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB80","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1142\/S0218195994000215","volume":"4","author":"Bertolazzi","year":"1994","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB81","author":"Chrobak","year":"1996","unstructured":"Convex drawings of graphs in two and three dimensions. Proceedings of the 12th Annual ACM Symposium Comput. Geom., 1996; 319-328."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB82","series-title":"Lecture Notes","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1007\/BFb0049393","volume-title":"Algorithms (Proceedings of ESA'94)","author":"Garg","year":"1994","unstructured":"Planar drawings and angular resolution: Algorithms and bounds. Algorithms (Proceedings of ESA'94) (Lecture Notes in Computer Science, vol. 855), (ed.). Springer-Verlag, 1994; 12-23."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB83","author":"North","year":"1995","unstructured":"5114 directed graphs, 1995. ftp:\/\/ftp.research.att.com\/dist\/drawdag\/dg.gz."},{"key":"10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B-BIB84","series-title":"Lecture Notes","first-page":"182","volume-title":"Graph Drawing (Proceedings of GD '94)","author":"Himsolt","year":"1995","unstructured":"GraphEd: A graphical platform for the implementation of graph algorithms. Graph Drawing (Proceedings of GD '94) (Lecture Notes in Computer Science, vol. 894), (eds.). Springer-Verlag, 1995; 182-193."}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2F1097-024X(200009)30:11%3C1235::AID-SPE339%3E3.0.CO;2-B","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/1097-024X(200009)30:11%3C1235::AID-SPE339%3E3.0.CO;2-B","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T01:13:05Z","timestamp":1625101985000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":84,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2000,9]]}},"URL":"https:\/\/doi.org\/10.1002\/1097-024x(200009)30:11<1235::aid-spe339>3.0.co;2-b","relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000]]}}}