{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T12:10:26Z","timestamp":1737288626003,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":55,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433231"},{"type":"electronic","value":"9783540458753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45875-1_22","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T16:17:29Z","timestamp":1184602649000},"page":"285-294","source":"Crossref","is-referenced-by-count":1,"title":["Chapter 4 Graphs in Software Visualization"],"prefix":"10.1007","author":[{"given":"Petra","family":"Mutzel","sequence":"first","affiliation":[]},{"given":"Peter","family":"Eades","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,10]]},"reference":[{"key":"22_CR1","series-title":"Lect Notes Comput Sci","first-page":"434","volume-title":"Tulip, a huge graphs visualization software","author":"D. Auber","year":"2002","unstructured":"D. Auber. Tulip, a huge graphs visualization software. In P. Mutzel, M. J\u00fcnger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 434\u2013435. Springer-Verlag, 2002."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"S. Bassil and R. K. Keller. Software visualization tools: Survey and analysis. In Proceedings of the Ninth InternationalWorkshop on Program Comprehension (IWPC\u20192001), pages 7\u201317, Toronto, ON, 2001. IEEE.","DOI":"10.1109\/WPC.2001.921708"},{"issue":"2","key":"22_CR3","first-page":"47","volume":"21","author":"V. Batagelj","year":"1998","unstructured":"V. Batagelj and A. Mrvar. Pajek \u2014 program for large network analysis. Connection, 21(2):47\u201357, 1998.","journal-title":"Connection"},{"key":"22_CR4","series-title":"Lect Notes Comput Sci","first-page":"474","volume-title":"Pajek \u2014 analysis and visualization of large networks","author":"V. Batagelj","year":"2002","unstructured":"V. Batagelj and A. Mrvar. Pajek \u2014 analysis and visualization of large networks. In P. Mutzel, M. J\u00fcnger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 474\u2013475. Springer-Verlag, 2002."},{"key":"22_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/3-540-45848-4_5","volume-title":"Planarization of clustered graphs","author":"G. Battista Di","year":"2002","unstructured":"G. Di Battista, W. Didimo, and A. Marcandalli. Planarization of clustered graphs. In P. Mutzel, M. J\u00fcnger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 60\u201374. Springer-Verlag, 2002."},{"key":"22_CR6","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Graph Drawing. Prentice Hall, 1999."},{"key":"22_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-46648-7_36","volume-title":"A force-directed algorithm that preserves edge crossing properties","author":"F. Bertault","year":"1999","unstructured":"F. Bertault. A force-directed algorithm that preserves edge crossing properties. In J. Kratochv\u00edl, editor, Graph Drawing (Proc. GD\u2019 99), volume 1731 of Lecture Notes in Computer Science, pages 351\u2013358. Springer-Verlag, 1999."},{"key":"22_CR8","series-title":"Lect Notes Comput Sci","first-page":"331","volume-title":"WADS\u2019 97","author":"P. Bertolazzi","year":"1998","unstructured":"P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. In WADS\u2019 97, volume 1272 of Lecture Notes in Computer Science, pages 331\u2013344, 1998."},{"key":"22_CR9","unstructured":"F. Brandenburg and M. Himsolt. Graphlet. Available via \u201c http:\/\/infosun.fmi.unipassau. de\/Graphlet\/ \u201d."},{"key":"22_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/BFb0021792","volume-title":"An experimental comparison of force-directed and randomized graph drawing algorithms","author":"F.J. Brandenburg","year":"1996","unstructured":"F.J. Brandenburg, M. Himsolt, and C. Rohrer. An experimental comparison of force-directed and randomized graph drawing algorithms. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes in Computer Science, pages 76\u201387. Springer-Verlag, 1996."},{"key":"22_CR11","series-title":"Lect Notes Comput Sci","first-page":"497","volume-title":"GraphML progress report","author":"U. Brandes","year":"2002","unstructured":"U. Brandes, M. Eiglsperger, I. Herman, M. Himsolt, and M. S. Marshall. GraphML progress report. In P. Mutzel, M. J\u00fcnger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, page 497. Springer-Verlag, 2002."},{"key":"22_CR12","series-title":"Lect Notes Comput Sci","first-page":"303","volume-title":"Interactive giotto: An algorithm for interactive orthogonal graph drawing","author":"S. S. Bridgeman","year":"1998","unstructured":"S. S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara. Interactive giotto: An algorithm for interactive orthogonal graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes in Computer Science, pages 303\u2013308. Springer-Verlag, 1998."},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"E. G. Coffman","year":"1972","unstructured":"E. G. Coffman and R. L. Graham. Optimal scheduling for two processor systems. Acta Informatica, 1:200\u2013213, 1972.","journal-title":"Acta Informatica"},{"issue":"11","key":"22_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1145\/264645.264657","volume":"4","author":"J. Cohen","year":"1997","unstructured":"J. Cohen. Drawing graphs to convey proximity: an incremental arrangement method. ACM Transactions on Computer-Human Interfaces, 4(11):197\u2013229, 1997.","journal-title":"ACM Transactions on Computer-Human Interfaces"},{"key":"22_CR15","series-title":"Lect Notes Comput Sci","first-page":"203","volume-title":"User hints for directed graph drawing","author":"H.A.D. d. Nascimento","year":"2002","unstructured":"H.A.D. do Nascimento and P. Eades. User hints for directed graph drawing. In P. Mutzel, M. J\u00fcnger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 203\u2013217. Springer-Verlag, 2002."},{"key":"22_CR16","series-title":"Lect Notes Comput Sci","first-page":"440","volume-title":"Wilmascope interactive 3d graph visualisation system","author":"T. Dwyer","year":"2002","unstructured":"T. Dwyer and P. Eckersley. Wilmascope interactive 3d graph visualisation system. In P. Mutzel, M. J\u00fcnger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 440\u2013441. Springer-Verlag, 2002."},{"key":"22_CR17","first-page":"149","volume":"42","author":"P. Eades","year":"1984","unstructured":"P. Eades. A heuristic for graph drawing. Congr. Numer., 42:149\u2013160, 1984.","journal-title":"Congr. Numer."},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Holger Eichelberger and J\u00fcrgen Wol. v. Gudenberg. On the Visualization of Java Programs. In Proceedings of DagstuhlSeminar on Software Visualization, 2001.","DOI":"10.1007\/3-540-45875-1_23"},{"key":"22_CR19","series-title":"Lect Notes Comput Sci","first-page":"480","volume-title":"Graphviz \u2014 open source graph drawing tools","author":"J. Ellson","year":"2002","unstructured":"J. Ellson, E. Gansner, L. Koutsofios, S. North, and G. Woodhull. Graphviz \u2014 open source graph drawing tools. In P. Mutzel, M. J\u00fcnger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 480\u2013481. Springer-Verlag, 2002."},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Alexander A. Evstiougov-Babaev. Call Graph and Control Flow Graph Visualization for Developers of Embedded Applications. In Proceedings of DagstuhlSeminar on Software Visualization, 2001.","DOI":"10.1007\/3-540-45875-1_26"},{"key":"22_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/BFb0021809","volume-title":"Drawing high degree graphs with low bend numbers","author":"U. F\u00f6\u00dfmeier","year":"1996","unstructured":"U. F\u00f6\u00dfmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD\u2019 95), volume 1027 of Lecture Notes in Computer Science, pages 254\u2013266. Springer-Verlag, 1996."},{"issue":"3","key":"22_CR22","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1109\/32.221135","volume":"19","author":"E. Gansner","year":"1993","unstructured":"E. Gansner, E. Koutsofios, S. North, and K. Vo. A technique for drawing directed graphs. In IEEE Transactions on Software Engineering, volume 19 (3), pages 214\u2013229, 1993.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"22_CR23","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/3-540-37623-2_28","volume-title":"Improved force-directed layouts","author":"E. R. Gansner","year":"1998","unstructured":"E. R. Gansner and S. C. North. Improved force-directed layouts. In S. H. Whitesides, editor, Graph Drawing (Proc. GD\u2019 99), volume 1547 of Lecture Notes in Computer Science, pages 364\u2013373. Springer-Verlag, 1998."},{"key":"22_CR24","series-title":"Lect Notes Comput Sci","first-page":"211","volume-title":"A fast multi-dimensional algorithm for drawing large graphs","author":"P. Gayer","year":"2001","unstructured":"P. Gayer, M. Goodrich, and S. Kobourov. A fast multi-dimensional algorithm for drawing large graphs. In J. Marks, editor, Graph Drawing (Proc. 2000), volume 1984 of Lecture Notes in Computer Science, pages 211\u2013221. Springer-Verlag, 2001."},{"key":"22_CR25","series-title":"Lect Notes Comput Sci","volume-title":"Automatic layout of uml class diagrams","author":"C. Gutwenger","year":"2002","unstructured":"C. Gutwenger, M. J\u00fcnger, K. Klein, J. Kupke, S. Leipert, and P. Mutzel. Automatic layout of uml class diagrams. In P. Mutzel, M. J\u00fcnger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science. Springer-Verlag, 2002."},{"key":"22_CR26","unstructured":"C. Gutwenger, P. Mutzel, and R. Weiskircher. Inserting an edge into a planar graph. In Proceedings of the Ninth AnnualA CM-SIAM Symposium on Discrete Algorithms (SODA\u2019 2001), pages 246\u2013255, Washington, DC, 2001. ACM Press."},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Carsten Gutwenger, Michael J\u00fcnger, Gunnar Klau, Sebastian Leipert, and Petra Mutzel. Graph Drawing Algorithm Engineering with AGD. In Proceedings of DagstuhlSeminar on Software Visualization, 2001.","DOI":"10.1007\/3-540-45875-1_24"},{"key":"22_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/3-540-46648-7_21","volume-title":"The vertex-exchange graph: a new concept for multilevel crossing minimization","author":"P. Healy","year":"1999","unstructured":"P. Healy and A. Kuusik. The vertex-exchange graph: a new concept for multilevel crossing minimization. In J. Kratochv\u00edl, editor, Graph Drawing (Proc. GD\u2019 99), volume 1731 of Lecture Notes in Computer Science, pages 205\u2013216. Springer-Verlag, 1999."},{"key":"22_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-45848-4_2","volume-title":"How to layer a directed acyclic graph","author":"P. Healy","year":"2002","unstructured":"P. Healy and N. S. Nikolov. How to layer a directed acyclic graph. In P. Mutzel, M. J\u00fcnger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 16\u201330. Springer-Verlag, 2002."},{"key":"22_CR30","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/3-540-37623-2_29","volume-title":"A fully animated interactive system for clustering and navigating huge graphs","author":"M. Huang","year":"1998","unstructured":"M. Huang and P. Eades. A fully animated interactive system for clustering and navigating huge graphs. In S. H. Whitesides, editor, Graph Drawing (Proc. GD\u2019 99), volume 1547 of Lecture Notes in Computer Science, pages 374\u2013383. Springer-Verlag, 1998."},{"key":"22_CR31","unstructured":"A. E. Jacobsen. Interaktion und Lernverfahren beim Zeichnen von Graphen mit Hilfe evolution\u00e4rer Algorithmen. Master\u2019s thesis, Institut AIFB, Universit\u00e4t zu Karlsruhe, 76128 Karlsruhe, Germany, 2001."},{"issue":"1","key":"22_CR32","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 straightline crossing minimization: Performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications (JGAA) ( http:\/\/www.cs.brown.edu\/publications\/jgaa\/ ), 1(1):1\u201325, 1997.","journal-title":"Journal of Graph Algorithms and Applications (JGAA)"},{"key":"22_CR33","series-title":"Lect Notes Comput Sci","volume-title":"Drawing graphs: methods and models","year":"2001","unstructured":"M. Kaufmann and D. Wagner, editors. Drawing graphs: methods and models, volume 2025 of Lecture Notes in Computer Science Tutorial. Springer, 2001."},{"key":"22_CR34","series-title":"Lect Notes Comput Sci","volume-title":"An experimental comparison of orthogonal compaction algorithms","author":"G. W. Klau","year":"2001","unstructured":"G. W. Klau, K. Klein, and P. Mutzel. An experimental comparison of orthogonal compaction algorithms. In Graph Drawing (Proc. 2000), LNCS. Springer Verlag, 2001."},{"key":"22_CR35","unstructured":"G. W. Klau and P. Mutzel. Quasi-orthogonal drawing of planar graphs. Technical Report MPI-I-98-1-013, Max-Planck-Institut f\u00fcr Informatik, Saarbr\u00fccken, 1998."},{"key":"22_CR36","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/3-540-48777-8_23","volume-title":"Optimal compaction of orthogonal grid drawings","author":"G. W. Klau","year":"1999","unstructured":"G. W. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. In G. P. Cornuejols, editor, Integer Programming and CombinatorialOptimization (IPCO\u2019 99), Proceedings of the Seventh Conference, volume 1610 of Lecture Notes in Computer Science, pages 304\u2013319. Springer-Verlag, 1999."},{"key":"22_CR37","unstructured":"R. Koschke. Survey on software visualization for software maintenance, reengineering, and reverse engineering. http:\/\/www.informatik.uni-stuttgart.de\/i.\/ps\/rainer\/softviz."},{"key":"22_CR38","doi-asserted-by":"crossref","unstructured":"Rainer Koschke. Software Visualization for Reverse Engineering. In Proceedings of DagstuhlSeminar on Software Visualization, 2001.","DOI":"10.1007\/3-540-45875-1_11"},{"key":"22_CR39","unstructured":"D. L\u00fctke-H\u00fcttmann. Knickminimales zeichnen 4-planarer clustergraphen. Master\u2019s thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany, 1999."},{"key":"22_CR40","series-title":"Lect Notes Comput Sci","volume-title":"Graph Drawing (Proc. GD 2000)","year":"2001","unstructured":"J. Marks, editor. Graph Drawing (Proc. GD 2000), volume 1984of Lecture Notes in Computer Science. Springer-Verlag, 2001."},{"issue":"4","key":"22_CR41","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1137\/S1052623498334013","volume":"11","author":"P. Mutzel","year":"2001","unstructured":"P. Mutzel. An alternative method to crossing minimization on hierarchical graphs. SIAM Journalon Optimization, 11(4):1065\u20131080, 2001.","journal-title":"SIAM Journalon Optimization"},{"key":"22_CR42","series-title":"Lect Notes Comput Sci","volume-title":"Graph Drawing 2001","year":"2002","unstructured":"P. Mutzel, M. J\u00fcnger, and S. Leipert, editors. Graph Drawing 2001, volume 2265 of Lecture Notes in Computer Science. Springer-Verlag, 2002."},{"key":"22_CR43","doi-asserted-by":"crossref","unstructured":"P. Mutzel and R. Weiskircher. Bend minimization in orthogonal drawings via integer programming, 2001. submitted.","DOI":"10.1007\/3-540-45655-4_52"},{"key":"22_CR44","series-title":"Lect Notes Comput Sci","first-page":"230","volume-title":"On-line hierarchical graph drawing","author":"S. North","year":"2002","unstructured":"S. North and G. Woodhull. On-line hierarchical graph drawing. In P. Mutzel, M. J\u00fcnger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 230\u2013244. Springer-Verlag, 2002."},{"key":"22_CR45","series-title":"Lect Notes Comput Sci","first-page":"248","volume-title":"Which aesthetic has the greatest effect on human understanding?","author":"H. Purchase","year":"2002","unstructured":"H. Purchase. Which aesthetic has the greatest effect on human understanding? In G. Di Battista, editor, Graph Drawing (Proc. GD\u2019 97), volume 1353 of Lecture Notes in Computer Science, pages 248\u2013261. Springer-Verlag, 1997."},{"key":"22_CR46","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/3-540-44541-2_19","volume-title":"Fade: Graph drawing, clustering, and visual abstraction","author":"A. Quigley","year":"2001","unstructured":"A. Quigley and P. Eades. Fade: Graph drawing, clustering, and visual abstraction. In J. Marks, editor, Graph Drawing (Proc. 2000), volume 1984 of Lecture Notes in Computer Science, pages 197\u2013210. Springer-Verlag, 2001."},{"issue":"2","key":"22_CR47","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"SE-7","author":"E. M. ReingoldTilford","year":"1981","unstructured":"E. M. Reingold and Tilford. Tidier drawing of trees. IEEE Trans. Softw. Eng., SE-7(2):223\u2013228, 1981.","journal-title":"IEEE Trans. Softw. Eng."},{"key":"22_CR48","series-title":"Lect Notes Comput Sci","first-page":"476","volume-title":"Glide","author":"K. Ryall","year":"2002","unstructured":"K. Ryall. Glide. In P. Mutzel, M. J\u00fcnger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 476\u2013477. Springer-Verlag, 2002."},{"key":"22_CR49","doi-asserted-by":"crossref","unstructured":"K. Sugiyama, editor. Graph drawing and applications for software and knowledge engineers. World Scientific, 2002. to appear","DOI":"10.1142\/4902"},{"issue":"4","key":"22_CR50","first-page":"876","volume":"21","author":"K. Sugiyama","year":"1991","unstructured":"K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Trans. Softw. Eng., 21(4):876\u2013892, 1991.","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"2","key":"22_CR51","doi-asserted-by":"publisher","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. Methods for visual understanding of hierarchical systems. IEEE Trans. Syst. Man Cybern., SMC-11(2):109\u2013125, 1981.","journal-title":"IEEE Trans. Syst. Man Cybern."},{"issue":"3","key":"22_CR52","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1137\/0216030","volume":"16","author":"R. Tamassia","year":"1987","unstructured":"R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421\u2013444, 1987.","journal-title":"SIAM J. Comput."},{"key":"22_CR53","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/3-540-44541-2_17","volume-title":"A Multilevel Algorithm for Force-Directed Graph Drawing","author":"C. Walshaw","year":"2001","unstructured":"C. Walshaw. A Multilevel Algorithm for Force-Directed Graph Drawing. In J. Marks, editor, Graph Drawing (Proc. 2000), volume 1984 of Lecture Notes in Computer Science, pages 171\u2013182. Springer, 2001."},{"key":"22_CR54","series-title":"Lect Notes Comput Sci","first-page":"482","volume-title":"Exchanging graphs with GXL","author":"A. Winter","year":"2002","unstructured":"A. Winter. Exchanging graphs with GXL. In P. Mutzel, M. J\u00fcnger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 482\u2013496. Springer-Verlag, 2002."},{"key":"22_CR55","doi-asserted-by":"crossref","unstructured":"Andreas Winter, Bernt Kullbach, and Volker Riediger. An Overview of the GXL Graph Exchange Language. In Proceedings of DagstuhlSeminar on Software Visualization, 2001.","DOI":"10.1007\/3-540-45875-1_25"}],"container-title":["Lecture Notes in Computer Science","Software Visualization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45875-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T11:51:24Z","timestamp":1737287484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45875-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433231","9783540458753"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/3-540-45875-1_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}