{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:20:02Z","timestamp":1787502002275,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540709039","type":"print"},{"value":"9783540709046","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70904-6_22","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T11:44:43Z","timestamp":1179402283000},"page":"220-233","source":"Crossref","is-referenced-by-count":3,"title":["Parameterized st-Orientations of Graphs: Algorithms and Experiments"],"prefix":"10.1007","author":[{"given":"Charalampos","family":"Papamanthou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ioannis G.","family":"Tollis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/11618058_32","volume-title":"Graph Drawing","author":"C. Papamanthou","year":"2006","unstructured":"Papamanthou, C., Tollis, I.G.: Applications of parameterized st-orientations in graph drawing algorithms. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 355\u2013367. Springer, Heidelberg (2006)"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Disc. and Comp. Geom.\u00a01, 321\u2013341 (1986)","journal-title":"Disc. and Comp. Geom."},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0925-7721(97)00017-5","volume":"9","author":"A. Papakostas","year":"1998","unstructured":"Papakostas, A., Tollis, I.G.: Algorithms for area-efficient orthogonal drawings. Computational Geometry: Theory and Applications\u00a09, 83\u2013110 (1998)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","volume":"4","author":"G.D. Battista","year":"1994","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Annotated bibliography on graph drawing algorithms. Computational Geometry: Theory and Applications\u00a04, 235\u2013282 (1994)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"22_CR5","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G.D. Battista","year":"1999","unstructured":"Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs (1999)"},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"11","author":"K. Sugiyama","year":"1981","unstructured":"Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical systems. IEEE Trans. on Systems, Man, and Cybernetics (SMC)\u00a011(2), 109\u2013125 (1981)","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics (SMC)"},{"issue":"2","key":"22_CR7","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1137\/S0895480198333290","volume":"13","author":"F. Annexstein","year":"2000","unstructured":"Annexstein, F., Berman, K.: Directional routing via generalized st-numberings. SIAM J. Discrete Math.\u00a013(2), 268\u2013279 (2000)","journal-title":"SIAM J. Discrete Math."},{"issue":"3-4","key":"22_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/B:TELS.0000014786.39265.c0","volume":"25","author":"M.M. Akon","year":"2004","unstructured":"Akon, M.M., Asaduzzaman, S., Rahman, M.S., Matsumoto, M.: Proposal for st-routing. Tellecommunication Systems\u00a025(3-4), 287\u2013298 (2004)","journal-title":"Tellecommunication Systems"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0020-0190(97)00083-5","volume":"62","author":"S. Nakano","year":"1997","unstructured":"Nakano, S., Rahman, M.S., Nishizeki, T.: A linear-time algorithm for four-partitioning four-connected planar graphs. Information Processing Letters\u00a062, 315\u2013322 (1997)","journal-title":"Information Processing Letters"},{"key":"22_CR10","first-page":"115","volume-title":"Theory of Graphs","author":"A. Lempel","year":"1968","unstructured":"Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Rosenstieh, P. (ed.) Theory of Graphs, Tihany, pp. 115\u2013118. Academic Press, New York (1968)"},{"key":"22_CR11","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"Even, S., Tarjan, R.: Computing an st-numbering. Theoretical Computer Science\u00a02, 339\u2013344 (1976)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"22_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF02253293","volume":"30","author":"J. Ebert","year":"1983","unstructured":"Ebert, J.: st-ordering the vertices of biconenected graphs. Computing\u00a030(1), 19\u201333 (1983)","journal-title":"Computing"},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3233\/FI-1986-9105","volume":"9","author":"R. Tarjan","year":"1986","unstructured":"Tarjan, R.: Two streamlined depth-first search algorithms. Fundamentae Informatica\u00a09, 85\u201394 (1986)","journal-title":"Fundamentae Informatica"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.: Rectilinear planar layout and bipolar orientation of planar graphs. Discrete Comput. Geom.\u00a01, 343\u2013353 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"22_CR15","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0304-3975(86)90153-2","volume":"47","author":"Y. Maon","year":"1986","unstructured":"Maon, Y., Schieber, B., Vishkin, U.: Parallel ear decomposition search (eds) and st-numbering in graphs. Theoret. Comput. Sci.\u00a047, 277\u2013298 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-45749-6_25","volume-title":"Algorithms - ESA 2002","author":"U. Brandes","year":"2002","unstructured":"Brandes, U.: Eager st-ordering. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 247\u2013256. Springer, Heidelberg (2002)"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/0166-218X(94)00085-R","volume":"56","author":"H.D. Fraysseix","year":"1995","unstructured":"Fraysseix, H.D., de Mendez, P.O., Rosenstiehl, P.: Bipolar orientations revisited. Discrete Applied Mathematics\u00a056, 157\u2013179 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR18","unstructured":"Papamanthou, C., Tollis, I.G.: st-numberings and longest paths. Manuscript, ICS-FORTH (2004)"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1145\/362248.362272","volume":"16","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Tarjan, R.: Efficient algorithms for graph manipulation. Comm. ACM\u00a016, 372\u2013378 (1973)","journal-title":"Comm. ACM"},{"issue":"4","key":"22_CR20","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1145\/502090.502095","volume":"48","author":"J. Holm","year":"2001","unstructured":"Holm, J., de Lichtenberg, K., Thorup, M.: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity. J. ACM\u00a048(4), 723\u2013760 (2001)","journal-title":"J. ACM"},{"key":"22_CR21","unstructured":"Lukovszki, T., Strothmann, W.-B.: Decremental biconnectivity on planar graphs technical report, university of paderborn, tr-ri-97-186"},{"key":"22_CR22","unstructured":"Gallai, T.: On directed paths and circuits. In: Erdos, P. (ed.) Theory of Graphs: International Symposium, July 1966, pp. 215\u2013232 (1967)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70904-6_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T17:49:46Z","timestamp":1628876986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70904-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709039","9783540709046"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70904-6_22","relation":{},"subject":[]}}