{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:07:30Z","timestamp":1725538050345},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642034084"},{"type":"electronic","value":"9783642034091"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03409-1_27","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T10:05:18Z","timestamp":1252922718000},"page":"298-309","source":"Crossref","is-referenced-by-count":1,"title":["NP-Completeness of st-Orientations for Plane Graphs"],"prefix":"10.1007","author":[{"given":"Sadish","family":"Sadasivam","sequence":"first","affiliation":[]},{"given":"Huaming","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","first-page":"268","volume":"13","author":"F. Annexstein","year":"2000","unstructured":"Annexstein, F., Berman, K.: Directional routing via generalized st-numberings. Discrete Mathematics\u00a013, 268\u2013279 (2000)","journal-title":"Discrete Mathematics"},{"key":"27_CR2","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)"},{"key":"27_CR3","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.E.: Computing an st-Numbering. Theoretical Computer Science\u00a02, 339\u2013344 (1976)","journal-title":"Theoretical Computer Science"},{"key":"27_CR4","unstructured":"Gallai, T.: On directed paths and circuits. In: Theory of Graphs: International Symposium, pp. 215\u2013232 (1968)"},{"key":"27_CR5","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1990","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"27_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/3-540-58950-3_360","volume-title":"Graph Drawing","author":"X. He","year":"1995","unstructured":"He, X., Kao, M.: Regular edge labelings and drawings of planar graphs. In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol.\u00a0894, pp. 96\u2013103. Springer, Heidelberg (1995)"},{"key":"27_CR7","unstructured":"Lempel, A., Even, S., Cederbaum, I.: An algorithm for planarity testing of graphs. In: Theory of Graphs. Proc. of an International Symposium, Rome, July 1966, pp. 215\u2013232 (1967)"},{"key":"27_CR8","unstructured":"Mendez, P.O.: Orientations bipolaires, PhD thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris (1994)"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/B:TELS.0000014786.39265.c0","volume":"25","author":"A. Mursalin","year":"2004","unstructured":"Mursalin, A., Asaduzzaman, S., Saidur, R., Matsumoto, M.: Proposal for st-routing. Telecommunication Systems\u00a025, 287\u2013298 (2004)","journal-title":"Telecommunication Systems"},{"key":"27_CR10","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., Saidur, M.R., 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":"27_CR11","doi-asserted-by":"publisher","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":"27_CR12","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":"27_CR13","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.tcs.2008.08.012","volume":"408","author":"C. Papamanthou","year":"2008","unstructured":"Papamanthou, C., Tollis, I.G.: Algorithms for computing a parameterized st-orientation. Theoretical Computer Science\u00a0408, 224\u2013240 (2008)","journal-title":"Theoretical Computer Science"},{"key":"27_CR14","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosenstiehl","year":"1986","unstructured":"Rosenstiehl, P., Tarjan, R.E.: Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs. Discrete & Computational Geometry\u00a01, 343\u2013353 (1986)","journal-title":"Discrete & Computational Geometry"},{"key":"27_CR15","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. Discrete and Computational Geometry\u00a01, 321\u2013341 (1986)","journal-title":"Discrete and Computational Geometry"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03409-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T14:22:55Z","timestamp":1552141375000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03409-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642034084","9783642034091"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03409-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}