{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:59:12Z","timestamp":1725559152913},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_68","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"793-804","source":"Crossref","is-referenced-by-count":1,"title":["Dynamic Tree Cross Products"],"prefix":"10.1007","author":[{"given":"Marcus","family":"Raitner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"68_CR1","first-page":"215","volume-title":"Graph Drawing Software. Mathematics and Visualization","author":"F.J. Brandenburg","year":"2003","unstructured":"Brandenburg, F.J., Forster, M., Pick, A., Raitner, M., Schreiber, F.: Biopath \u2013 exploration and visualization of biochemical pathways. In: Mutzel, P., J\u00fcnger, M. (eds.) Graph Drawing Software. Mathematics and Visualization, pp. 215\u2013236. Springer, Heidelberg (2003)"},{"key":"68_CR2","unstructured":"Buchsbaum, A.L., Westbrook, J.R.: Maintaining hierarchical graph views. In: Proc. 11th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 566\u2013575 (2000)"},{"key":"68_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/3-540-45253-2_12","volume-title":"Algorithms - ESA 2000","author":"A.L. Buchsbaum","year":"2000","unstructured":"Buchsbaum, A.L., Goodrich, M.T., Westbrook, J.R.: Range searching over tree cross products. In: Paterson, M. (ed.) ESA 2000. LNCS, vol.\u00a01879, pp. 120\u2013131. Springer, Heidelberg (2000)"},{"key":"68_CR4","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1109\/21.108304","volume":"21","author":"K. Sugiyama","year":"1991","unstructured":"Sugiyama, K., Misue, K.: Visualization of structural information: Automatic drawing of compound digraphs. IEEE Transactions on Systems, Man, and Cybernetics\u00a021, 876\u2013892 (1991)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"68_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BFb0030816","volume-title":"Computing and Combinatorics","author":"Q.W. Feng","year":"1995","unstructured":"Feng, Q.W., Cohen, R.F., Eades, P.: How to draw a planar clustered graph. In: Li, M., Du, D.-Z. (eds.) COCOON 1995. LNCS, vol.\u00a0959, pp. 21\u201330. Springer, Heidelberg (1995)"},{"key":"68_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-45749-6_17","volume-title":"Algorithms - ESA 2002","author":"M.A. Bender","year":"2002","unstructured":"Bender, M.A., Cole, R., Demaine, E.D., Farach-Colton, M., Zito, J.: Two simplified algorithms for maintaining order in a list. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 152\u2013164. Springer, Heidelberg (2002)"},{"key":"68_CR7","doi-asserted-by":"crossref","unstructured":"Dietz, P.F., Sleator, D.D.: Two algorithms for maintaining order in a list. In: 9th ACM Symposium on Theory of Computing (STOC), pp. 365\u2013372 (1987)","DOI":"10.1145\/28395.28434"},{"key":"68_CR8","doi-asserted-by":"crossref","unstructured":"Willard, D.E.: Good worst-case algorithms for inserting and deleting records in dense sequential files. In: Proceedings of the 1986 ACM SIGMOD International Conference on Management of Data, pp. 251\u2013260 (1986)","DOI":"10.1145\/16894.16879"},{"key":"68_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF01683268","volume":"10","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Mathematical Systems Theory\u00a010, 99\u2013127 (1977)","journal-title":"Mathematical Systems Theory"},{"key":"68_CR10","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/S0022-0000(05)80002-9","volume":"48","author":"O. Berkman","year":"1994","unstructured":"Berkman, O., Vishkin, U.: Finding level ancestors in trees. Journal of Computer and System Sciences\u00a048, 214\u2013230 (1994)","journal-title":"Journal of Computer and System Sciences"},{"key":"68_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/3-540-45995-2_44","volume-title":"LATIN 2002: Theoretical Informatics","author":"M.A. Bender","year":"2002","unstructured":"Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol.\u00a02286, pp. 508\u2013515. Springer, Heidelberg (2002)"},{"key":"68_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-45022-X_8","volume-title":"Automata, Languages and Programming","author":"S. Alstrup","year":"2000","unstructured":"Alstrup, S., Holm, J.: Improved algorithms for finding level ancestors in dynamic trees. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 73\u201384. Springer, Heidelberg (2000)"},{"key":"68_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0028247","volume-title":"Algorithms and Data Structures","author":"P.F. Dietz","year":"1991","unstructured":"Dietz, P.F.: Finding level ancestors in dynamic trees. In: Dehne, F.K.H.A., Sack, J.R., Santoro, N. (eds.) WADS 1991. LNCS, vol.\u00a0519, pp. 32\u201340. Springer, Heidelberg (1991)"},{"key":"68_CR14","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing\u00a013, 338\u2013355 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"68_CR15","unstructured":"Buchsbaum, A.L.: Personal communication"},{"key":"68_CR16","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1145\/42411.42414","volume":"31","author":"D. Harel","year":"1988","unstructured":"Harel, D.: On visual formalisms. Comm. of the ACM\u00a031, 588\u2013600 (1988)","journal-title":"Comm. of the ACM"},{"key":"68_CR17","unstructured":"Lai, W., Eades, P.: A graph model which supports flexible layout functions. Technical Report 96\u201315, University of Newcastle (1996)"},{"key":"68_CR18","series-title":"LNCS","first-page":"236","volume-title":"Proc. 10th Intl. Symposium on Graph Drawing (GD)","author":"M. Raitner","year":"2002","unstructured":"Raitner, M.: HGV: A library for hierarchies, graphs, and views. In: Goodrich, M.T., Kobourov, S.G. (eds.) Proc. 10th Intl. Symposium on Graph Drawing (GD). LNCS, vol.\u00a01528, pp. 236\u2013243. Springer, Heidelberg (2002)"},{"key":"68_CR19","unstructured":"Raitner, M.: Maintaining hierarchical graph views for dynamic graphs. Technical Report MIP-0403, Universit\u00e4t Passau (2004)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:42Z","timestamp":1620012582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}