{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T16:02:24Z","timestamp":1781798544312,"version":"3.54.5"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1023\/a:1009771921595","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T17:50:41Z","timestamp":1040579441000},"page":"289-314","source":"Crossref","is-referenced-by-count":26,"title":["Constrained Graph Layout"],"prefix":"10.1007","volume":"3","author":[{"given":"Weiqing","family":"He","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"183540_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. (1994). Algorithms for drawing graphs: an annotated bibliography. Computational Geometry: Theory and Applications, 4:235-282.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"183540_CR2","doi-asserted-by":"crossref","unstructured":"K. B\u00f6hringer and F. N. Paulisch. (1990). Using constraints to achieve stability in automatic graph layout algorithms. In Proc. of Conference on Human Factors in Computing Systems, CHI'90, pages 43-51.","DOI":"10.1145\/97243.97250"},{"issue":"4","key":"183540_CR3","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1145\/357146.357147","volume":"3","author":"A. Borning","year":"1981","unstructured":"A. Borning. (1981). The programming language aspects of ThingLab, a constraint-oriented simulation laboratory. ACM Transactions on Programming Languages and Systems, 3(4):252-387.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"183540_CR4","unstructured":"M. J. Box, D. Davies, and W. H. Swann. (1969). Non-linear Optimization Techniques. Oliver & Boyd."},{"key":"183540_CR5","doi-asserted-by":"crossref","unstructured":"F. J. Brandenburg. (1994). Designing graph drawings by layout graph grammars. In Proceedings of DIMACS International Workshop, GD'94, LNCS 894, pages 416-427, Princeton, New Jersey, USA. Springer-Verlag.","DOI":"10.1007\/3-540-58950-3_395"},{"key":"183540_CR6","doi-asserted-by":"crossref","unstructured":"F. J. Brandenburg, M. Himsolt, and C. Rohrer. (1995). An experimental comparison of force-directed and randomized graph drawing algorithms. In Symposium on Graph Drawing, GD'95, LNCS 1027, pages 76-87, Passau, Germany. Springer-Verlag.","DOI":"10.1007\/BFb0021792"},{"key":"183540_CR7","unstructured":"K.W. Cattermole. (1979). Graph theory and communications networks. In R. J. Wilson and L.W. Beineke, editors, Applications of Graph Theory, pages 17-57. Academic Press."},{"key":"183540_CR8","doi-asserted-by":"crossref","unstructured":"S. S. Chok and K. Marriott. (1995). Automatic construction of user interfaces from constraint multiset grammars. In IEEE Symposium on Visual Languages, pages 242-249.","DOI":"10.1109\/VL.1995.520815"},{"key":"183540_CR9","doi-asserted-by":"crossref","unstructured":"P. \u0136ikusts and P. Ru\u010devskis. (1995). Layout algorithm of graph-like diagrams for grade windows graphic editors. In Symposium on Graph Drawing, GD'95, LNCS 1027, pages 361-364, Passau, Germany. Springer-Verlag.","DOI":"10.1007\/BFb0021819"},{"key":"183540_CR10","doi-asserted-by":"crossref","unstructured":"I. F. Cruz and A. Garg. (1994). Drawing graphs by example efficiently: trees and planar acyclic digraphs. In Proceedings of DIMACS International Workshop, GD'94, Princeton, New Jersey, USA, October 1994, LNCS 894, pages 404-415. Springer-Verlag.","DOI":"10.1007\/3-540-58950-3_394"},{"key":"183540_CR11","unstructured":"R. Davidson and D. Harel. (1991). Drawing graphs nicely using simulated annealing. Technical report, Department of Applied Mathematics and Computer Science."},{"key":"183540_CR12","doi-asserted-by":"crossref","unstructured":"E. Dengler, M. Friedell, and J. Marks. (1993). Constraint-driven diagram layout. In Proceedings of the 1993 IEEE Symposium on Visual Languages, pages 330-335.","DOI":"10.1109\/VL.1993.269619"},{"key":"183540_CR13","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"P. Eades. (1984). A heuristic for graph drawing. Congressus Numerantium, 42:149-160.","journal-title":"Congressus Numerantium"},{"key":"183540_CR14","unstructured":"P. Eades, W. Lai, K. Misue, and K. Sugiyama. (1991). Preserving the mental map of a diagram. In Proceedings of Compugraphics'91, pages 24-33."},{"key":"183540_CR15","unstructured":"P. Eades, T. Lin, and X. Lin. (1990). Two tree drawing conventions. Technical Report 174, Key Centre for Software Technology, Department of Computer Science, The University of Queensland."},{"issue":"4","key":"183540_CR16","first-page":"424","volume":"13","author":"P. Eades","year":"1990","unstructured":"P. Eades and K. Sugiyama. (1990). How to draw a directed graph. Journal of Information Processing, 13(4):424-437.","journal-title":"Journal of Information Processing"},{"key":"183540_CR17","unstructured":"R. Fletcher. (1987). Practical Methods of Optimization. John Wiley & Sons."},{"key":"183540_CR18","doi-asserted-by":"crossref","unstructured":"A. Frick, A. Ludwig, and H. Mehldau. (1994). A fast adaptive layout algorithm for undirected graphs. In Proceedings of DIMACS International Workshop, GD'94, LNCS 894, pages 388-403, Princeton, New Jersey, USA. Springer-Verlag.","DOI":"10.1007\/3-540-58950-3_393"},{"issue":"11","key":"183540_CR19","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. (1991). Graph drawing by force-directed placement. Software-Practice and Experience, 21(11):1129-1164.","journal-title":"Software-Practice and Experience"},{"issue":"3","key":"183540_CR20","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"E. R. Gansner","year":"1993","unstructured":"E. R. Gansner, E. Koutsofios, S. C. North, and K. Vo. (1993). A technique for drawing directed graphs. IEEE Transactions on Software Engineering, 19(3):214-230.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"183540_CR21","doi-asserted-by":"crossref","unstructured":"A. Garg, M. T. Goodrich, and R. Tamassia. (1994). Area-efficient upward tree drawing. In Proceedings of the 9th Annual Symposium on Computational Geometry, ACM, pages 359-368.","DOI":"10.1145\/160985.161165"},{"key":"183540_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591962","volume":"27","author":"D. Goldfarb","year":"1983","unstructured":"D. Goldfarb and A. Idnani. (1983). A numerically stable dual method for solving strictly convex quadratic programs. Math. Prog., 27:1-33.","journal-title":"Math. Prog."},{"key":"183540_CR23","series-title":"LNCS","first-page":"217","volume-title":"Proceedings of International Symposium on Graph Drawing, GD'96","author":"W. He","year":"1997","unstructured":"W. He and K. Marriott. (1997). Constrained graph layout. In Proceedings of International Symposium on Graph Drawing, GD'96, LNCS 1190, pages 217-232, Berkeley, California, USA. New York: Springer."},{"key":"183540_CR24","doi-asserted-by":"crossref","unstructured":"R. Helm and K. Marriott. (1986). Declarative graphics. In Proc. of the 3rd International Conference on Logic Programming, LNCS 225, pages 513-527, London, England. Springer-Verlag.","DOI":"10.1007\/3-540-16492-8_99"},{"key":"183540_CR25","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. (1991). A declarative specification and semantics for visual languages. Journal of Visual Languages and Computing, 2:311-331.","journal-title":"Journal of Visual Languages and Computing"},{"key":"183540_CR26","doi-asserted-by":"crossref","unstructured":"R. Helm, K. Marriott, T. Huynh, and J. Vlissides. (1995). An object-oriented architecture for constraint-based graphical editing. In Object-Oriented Programming for Graphics, pages 217-238. Springer-Verlag.","DOI":"10.1007\/978-3-642-79192-5_16"},{"issue":"7","key":"183540_CR27","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. (1990). A node-position algorithm for general tree. Software-Practice and Experience, 20(7):685-705.","journal-title":"Software-Practice and Experience"},{"key":"183540_CR28","doi-asserted-by":"crossref","DOI":"10.1142\/0922","volume-title":"Visualizing Abstract Objects and Relations: a Constraints-based Approach, volume 5 of Computer Science","author":"T. Kamada","year":"1989","unstructured":"T. Kamada. (1989). Visualizing Abstract Objects and Relations: a Constraints-based Approach, volume 5 of Computer Science. Singapore, New Jersey: World Scientific."},{"issue":"1","key":"183540_CR29","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. (1989). An algorithm for drawing general undirected graphs. Information Processing Letters, 31(1):7-15.","journal-title":"Information Processing Letters"},{"key":"183540_CR30","doi-asserted-by":"crossref","unstructured":"T. Kamps, J. Kleinz, and J. Read. (1995). Constraint-based spring-model algorithm for graph layout. In Symposium on Graph Drawing, GD'95, LNCS 1027, pages 349-360, Passau, Germany. Springer-Verlag.","DOI":"10.1007\/BFb0021818"},{"key":"183540_CR31","unstructured":"T. Lin and P. Eades. (1994). 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."},{"issue":"11","key":"183540_CR32","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1002\/spe.4380251102","volume":"25","author":"P. L\u00fcders","year":"1995","unstructured":"P. L\u00fcders, R. Ernst, and S. Stille. (1995). An approach to automatic display layout using combinatorial optimization. Software-Practice and Experience, 25(11):1183-1202.","journal-title":"Software-Practice and Experience"},{"key":"183540_CR33","unstructured":"K. A. Lyons. (1992). Cluster busting in anchored graph drawing. In Proceedings of CASCON'92, pages 7-17, Toronto."},{"key":"183540_CR34","doi-asserted-by":"crossref","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. (1995). Layout adjustment and the mental map. Journal of Visual Languages and Computing, 6:183-210.","journal-title":"Journal of Visual Languages and Computing"},{"key":"183540_CR35","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. (1990). Garnet: comprehensive support for graphical highly interactive user interfaces. Computer, pages 71-85.","DOI":"10.1109\/2.60882"},{"key":"183540_CR36","doi-asserted-by":"crossref","unstructured":"S. C. North. (1995). Incremental layout in DynaDAG. In Symposium on Graph Drawing, GD'95, LNCS 1027, pages 409-418, Passau, Germany. Springer-Verlag.","DOI":"10.1007\/BFb0021824"},{"key":"183540_CR37","series-title":"LNCS","first-page":"371","volume-title":"Proceedings of International Symposium on Graph Drawing, GD'96","author":"A. Papakostas","year":"1997","unstructured":"A. Papakostas, J. M. Six, and I. G. Tollis. (1997). Experimental and theoretical results in interactive orthogonal graph drawing. In Proceedings of International Symposium on Graph Drawing, GD'96, LNCS 1190, pages 371-386, Berkeley, California, USA. New York: Springer."},{"key":"183540_CR38","unstructured":"F. N. Paulisch. (1993). The Design of an Extendible Graph Editor. Springer-Verlag. LNCS 704."},{"issue":"2","key":"183540_CR39","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. (1981). Tidier drawing of trees. IEEE Transaction on Software Engineering, SE-7(2):223-228.","journal-title":"IEEE Transaction on Software Engineering"},{"key":"183540_CR40","doi-asserted-by":"crossref","unstructured":"M. D. Storey and H. A. M\u00fcller. (1995). Graph layout adjustment strategies. In Symposium on Graph Drawing, GD'95, LNCS 1027, pages 487-499, Passau, Germany. Springer-Verlag.","DOI":"10.1007\/BFb0021833"},{"key":"183540_CR41","doi-asserted-by":"crossref","unstructured":"K. Sugiyama and K. Misue. (1995). Graph drawing by magnetic-spring model. J.Visual Lang. Comput., 6(3). Special issue on Graph Visualization edited by I.F. Cruz and P. Eades.","DOI":"10.1006\/jvlc.1995.1013"},{"issue":"2","key":"183540_CR42","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"SMC-11","author":"K. Sugiyama","year":"1981","unstructured":"K. Sugiyama, S. Tagawa, and M. Toda. (1981). Methods for visual understanding of hierarchical system structures. IEEE Transaction on Systems, Man, and Cybernetics, SMC-11(2):109-125.","journal-title":"IEEE Transaction on Systems, Man, and Cybernetics"},{"key":"183540_CR43","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF00289576","volume":"18","author":"K. J. Supowit","year":"1983","unstructured":"K. J. Supowit and E. M. Reingold. (1983). The complexity of drawing trees nicely. Acta Informatica, 18:377-392.","journal-title":"Acta Informatica"},{"key":"183540_CR44","unstructured":"K. Tsuchida, Y. Adachi, Y. Oi, Y. Miyadera, and T. Yaku. (1995). Constraints and algorithms for drawing tree-structured diagrams. In Proceedings of the International Workshop on Constraints for Graphics and Visualization, CGV'95, pages 87-101, Cassis, France."},{"key":"183540_CR45","unstructured":"D. Tunkelang. (1994). A practical approach to drawing undirected graphs. Carnegie Mellon University."},{"key":"183540_CR46","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1002\/spe.4380100706","volume":"10","author":"J. G. Vaucher","year":"1980","unstructured":"J. G. Vaucher. (1980). Pretty-printing of trees. Software-Practice and Experience, 10:553-561.","journal-title":"Software-Practice and Experience"},{"key":"183540_CR47","doi-asserted-by":"crossref","unstructured":"L. Weitzman and K. Wittenburg. (1993). Relation grammars for interactive design. In Proceedings of IEEE Visual Languages, pages 4-11.","DOI":"10.1109\/VL.1993.269572"},{"issue":"5","key":"183540_CR48","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. (1979). Tidy drawing of trees. IEEE Transaction on Software Engineering, SE-5(5):514-520.","journal-title":"IEEE Transaction on Software Engineering"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009771921595.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009771921595\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009771921595.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T04:10:07Z","timestamp":1752379807000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009771921595"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":48,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["183540"],"URL":"https:\/\/doi.org\/10.1023\/a:1009771921595","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}