{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:54:51Z","timestamp":1752461691535,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540624950"},{"type":"electronic","value":"9783540680482"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62495-3_50","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:38:03Z","timestamp":1330295883000},"page":"217-232","source":"Crossref","is-referenced-by-count":14,"title":["Constrained graph layout"],"prefix":"10.1007","author":[{"given":"Weiqing","family":"He","sequence":"first","affiliation":[]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G.D. Battisa","year":"1994","unstructured":"G.D. Battisa, P. Eades, R. Tamassia, and I.G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications, 4:235\u2013282, 1994.","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"4","key":"18_CR2","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1145\/357146.357147","volume":"3","author":"A. Borning","year":"1981","unstructured":"A. Borning. The programming language aspects of ThingLab, a constraint-oriented simulation laboratory. ACM Transactions on Programming Languages and Systems, 3(4):252\u2013387, 1981.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"unstructured":"M.J. Box, D. Davies, and W.H. Swann. Non-linear optimization techniques. Oliver & Boyd, 1969.","key":"18_CR3"},{"key":"18_CR4","volume-title":"LNCS 894","author":"F. J. Brandenburg","year":"1994","unstructured":"F. J. Brandenburg. Designing graph drawings by layout graph grammars. In Proceedings of DIMACS International Workshop, GD'94, LNCS 894, Princeton, New Jersey, USA, October 1994. Springer-Verlag."},{"key":"18_CR5","volume-title":"LNCS 1027","author":"F. J. Brandenburg","year":"1995","unstructured":"F. J. Brandenburg, M. Himsolt, and C. Rohrer. An experimental comparison of force-directed and randomized graph drawing algorithms. In Symposium on Graph Drawing, GD'95, LNCS 1027, Passau, Germany, September 1995. Springer-Verlag."},{"doi-asserted-by":"crossref","unstructured":"S.S. Chok and K. Marriott. Automatic construction of user interfaces from constraint multiset grammars. In IEEE Symposium on Visual Languages, 1995.","key":"18_CR6","DOI":"10.1109\/VL.1995.520815"},{"key":"18_CR7","volume-title":"LNCS 894","author":"I. F. Cruz","year":"1994","unstructured":"I. F. Cruz and A. Garg. Drawing graphs by example efficiently: trees and planar acylic digraphs. In Proceedings of DIMACS International Workshop, GD'94, Princeton, New Jersey, USA, October 1994, LNCS 894, Princeton, New Jersey, USA, October 1994. Springer-Verlag."},{"unstructured":"R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. Technical report, Department of Applied Mathematics and Computer Science, 1991.","key":"18_CR8"},{"doi-asserted-by":"crossref","unstructured":"E. Dengler, M. Friedell, and J. Marks. Constraint-driven diagram layout. In Proceedings of the 1993 IEEE Symposium on Visual Languages, 1993.","key":"18_CR9","DOI":"10.1109\/VL.1993.269619"},{"key":"18_CR10","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149\u2013160, 1984.","journal-title":"Congressus Numerantium"},{"unstructured":"P. Eades, W. Lai, K. Misue, and K. Sugiyama. Preserving the mental map of a diagram. In Proceedings of Compugraphics '91, pages 24\u201333, 1991.","key":"18_CR11"},{"key":"18_CR12","volume-title":"LNCS 1027","author":"P. Eades","year":"1995","unstructured":"P. Eades and J. Marks. Graph-drawing contest report. In Symposium on Graph Drawing, GD'95, LNCS 1027, Passau, Germany, September 1995. Springer-Verlag."},{"unstructured":"R. Fletcher. Practical Methods of Optimization. John Wiley & Sons, 1987.","key":"18_CR13"},{"key":"18_CR14","volume-title":"LNCS 894","author":"A. Frick","year":"1994","unstructured":"A. Frick, A. Ludwig, and H. Mehldau. A fast adaptive layout algorithm for undirected graphs. In Proceedings of DIMACS International Workshop, GD'94, LNCS 894, Princeton, New Jersey, USA, October 1994. Springer-Verlag."},{"issue":"11","key":"18_CR15","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T. M. J. Fruchterman","year":"1991","unstructured":"T. M. J. Fruchterman and E. M. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, 21(11):1129\u20131164, November 1991.","journal-title":"Software-Practice and Experience"},{"doi-asserted-by":"crossref","unstructured":"A. Garg, M. T. Goodrich, and R. Tamassia. Area-efficient upward tree drawing. In Proceedings of the 9th Annual Symposium on Computational Geometry, ACM, 1994.","key":"18_CR16","DOI":"10.1145\/160985.161165"},{"key":"18_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591962","volume":"27","author":"D Goldfarb","year":"1983","unstructured":"D Goldfarb and A Idnani. A numerically stable dual method for solving strictly convex quadratic programs. Math. Prog., 27:1\u201333, 1983.","journal-title":"Math. Prog."},{"key":"18_CR18","first-page":"513","volume-title":"LNCS 225","author":"R. Helm","year":"1986","unstructured":"R. Helm and K. Marriott. Declarative graphics. In Proc. of the 3rd International Conference on Logic Programming, LNCS 225, pages 513\u2013527, London, England, 1986. Springer-Verlag."},{"key":"18_CR19","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S1045-926X(05)80002-3","volume":"2","author":"R. Helm","year":"1991","unstructured":"R. Helm and K. Marriott. A declarative specification and semantics for visual languages. Journal of Visual Languages and Computing, 2:311\u2013331, 1991.","journal-title":"Journal of Visual Languages and Computing"},{"doi-asserted-by":"crossref","unstructured":"R. Helm, K. Marriott, T. Huynh, and J. Vlissides. An object-oriented architecture for constraint-based graphical editing. In Object-Oriented Programming for Graphics, pages 217\u2013238. Springer-Verlag, 1995.","key":"18_CR20","DOI":"10.1007\/978-3-642-79192-5_16"},{"issue":"7","key":"18_CR21","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1002\/spe.4380200705","volume":"20","author":"J. Q. Walker II","year":"1990","unstructured":"J. Q. Walker II. A node-position algorithm for general tree. Software-Practice and Experience, 20(7):685\u2013705, July 1990.","journal-title":"Software-Practice and Experience"},{"key":"18_CR22","volume-title":"volume 5 of Computer Science","author":"T. Kamada","year":"1989","unstructured":"T. Kamada. Visualizing abstract objects and relations:a constraints-based approach, volume 5 of Computer Science. Singapore, New Jersey:World Scientific, 1989."},{"issue":"1","key":"18_CR23","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T. Kamada","year":"1989","unstructured":"T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31(1):7\u201315, April 1989.","journal-title":"Information Processing Letters"},{"key":"18_CR24","volume-title":"LNCS 1027","author":"T. Kamps","year":"1995","unstructured":"T. Kamps, J. Kleinz, and J. Read. Constraint-based spring-model algorithm for graph layout. In Symposium on Graph Drawing, GD'95, LNCS 1027, Passsu, Germany, September 1995. Springer-Verlag."},{"key":"18_CR25","volume-title":"LNCS 1027","author":"P. Kikusts","year":"1995","unstructured":"P. Kikusts and P. Rucevskis. Layout algorithm of graph-like diagrams for grade windows graphic editors. In Symposium on Graph Drawing, GD'95, LNCS 1027, Passau, Germany, September 1995. Springer-Verlag."},{"unstructured":"T. Lin and P. Eades. Integration of declarative and algorithmic approaches for layout creation. Technical Report TR-HJ-94-10, CSIRO Division of Information Technology, Centre for Spatial Information Systems, 1994.","key":"18_CR26"},{"issue":"11","key":"18_CR27","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1002\/spe.4380251102","volume":"25","author":"P. Luders","year":"1995","unstructured":"P. Luders, R. Ernst, and S. Stille. An approach to automatic display layout using combinatorial optimization. Software-Practice and Experience, 25(11):1183\u20131202, 1995.","journal-title":"Software-Practice and Experience"},{"key":"18_CR28","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jvlc.1995.1010","volume":"6","author":"K. Misue","year":"1995","unstructured":"K. Misue, P. Eades, W. Lai, and K. Sugiyama. Layout adjustment and the mental map. Journal of Visual Languages and Computing, 6:183\u2013210, 1995.","journal-title":"Journal of Visual Languages and Computing"},{"doi-asserted-by":"crossref","unstructured":"B. A. Myers, D. A. Giuse, R. B. Dannenberg, B. V. Zanden, D. S. Kosbie, E. Pervin, A. Mickish, and P. Marchal. Garnet: comprehensive support for graphical highly interactive user interfaces. Computer, pages 71\u201385, November 1990.","key":"18_CR29","DOI":"10.1109\/2.60882"},{"key":"18_CR30","volume-title":"LNCS 1027","author":"S. C. North","year":"1995","unstructured":"S. C. North. Incremental layout in dynadag. In Symposium on Graph Drawing, GD'95, LNCS 1027, Passau, Germany, September 1995. Springer-Verlag."},{"unstructured":"T. Lin P. Eades and X. Lin. Two tree drawing conventions. Technical Report 174, Key Centre for Software Technology, Department of Computer Science, The University of Queensland, 1990.","key":"18_CR31"},{"unstructured":"F. N. Paulisch. The design of an extendible graph editor. LNCS 704, Springer-Verlag, 1993.","key":"18_CR32"},{"issue":"2","key":"18_CR33","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"SE-7","author":"E. M. Reingold","year":"1981","unstructured":"E. M. Reingold and J. S. Tilford. Tidier drawing of trees. IEEE Trans. on Software Engineering, SE-7(2):223\u2013228, March 1981.","journal-title":"IEEE Trans. on Software Engineering"},{"key":"18_CR34","volume-title":"LNCS 894","author":"K. Sugiyama","year":"1994","unstructured":"K. Sugiyama and K. Misue. A simple and unified method for drawing graphs: magnetic-spring algorithm. In Proceedings of DIMACS International Workshop, GD'94, LNCS 894, Princeton, New Jersey, USA, 1994. Springer-Verlag."},{"unstructured":"K. Tsuchida, Y. Adachi, Y. Oi, Y. Miyadera, and T. Yaku. Constraints and algorithm for drawing tree-structured diagrams. In Proceedings of the International Workshop on Constraints for Graphics and Visualization, CGV '95, Cassis, France, September 1995.","key":"18_CR35"},{"unstructured":"D. Tunkelang. A practical approach to drawing undirected graphs. Carnegie Mellon University, 1994.","key":"18_CR36"},{"key":"18_CR37","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1002\/spe.4380100706","volume":"10","author":"J. G. Vaucher","year":"1980","unstructured":"J. G. Vaucher. Pretty-printing of trees. Softwart-Practice and Experience, 10:553\u2013561, 1980.","journal-title":"Softwart-Practice and Experience"},{"doi-asserted-by":"crossref","unstructured":"L. Weitzman and K. Wittenburg. Relation grammars for interactive design. In Proceedings of IEEE Visual Languages, pages 4\u201311, 1993.","key":"18_CR38","DOI":"10.1109\/VL.1993.269572"},{"issue":"5","key":"18_CR39","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/TSE.1979.234212","volume":"SE-5","author":"C. Wetherell","year":"1979","unstructured":"C. Wetherell and A. Shannon. Tidy drawing of trees. IEEE Trans. on Software Engineering, SE-5(5):514\u2013520, September 1979.","journal-title":"IEEE Trans. on Software Engineering"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62495-3_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:29:12Z","timestamp":1742599752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62495-3_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540624950","9783540680482"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/3-540-62495-3_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}