{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:56Z","timestamp":1760245076636},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1007\/bf02574056","type":"journal-article","created":{"date-parts":[[2007,3,22]],"date-time":"2007-03-22T08:15:26Z","timestamp":1174551326000},"page":"459-468","source":"Crossref","is-referenced-by-count":34,"title":["A left-first search algorithm for planar graphs"],"prefix":"10.1007","volume":"13","author":[{"given":"H.","family":"de Fraysseix","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. O.","family":"de Mendez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Pach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1995,6,1]]},"reference":[{"key":"BF02574056_CR1","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0020-0190(90)90045-Y","volume":"36","author":"G. DiBattista","year":"1990","unstructured":"[DLR] G. DiBattista, W. P. Liu, and I. Rival: Bipartite graphs, drawings and planarity,Inform. Process. Lett. 36 (1990), 317\u2013322.","journal-title":"Inform. Process. Lett."},{"key":"BF02574056_CR2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02253293","volume":"30","author":"J. Ebert","year":"1983","unstructured":"[E] J. Ebert:st-ordering of the vertices of biconnected graphs,Computing 30 (1983), 19\u201333.","journal-title":"Computing"},{"key":"BF02574056_CR3","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1016\/0095-8956(76)90022-8","volume":"21","author":"G. Ehrlich","year":"1976","unstructured":"[EET] G. Ehrlich, S. Even, and R. E. Tarjan: Intersection graphs of curves on the plane.J. Combin. Theory Ser. B 21 (1976), 8\u201320.","journal-title":"J. Combin. Theory Ser. B"},{"key":"BF02574056_CR4","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"[ET] S. Even and R. E. Tarjan: Computing anst-numbering.Theoret. Comput. Sci. 2 (1976), 339\u2013344.","journal-title":"Theoret. Comput. Sci."},{"key":"BF02574056_CR5","unstructured":"[FMP] H. de Fraysseix, P. O. de Mendez, and J. Pach: Representation of planar graphs by segments, in:Intuitive Geometry (K. B\u00f6r\u00f6czky and G. Fejes T\u00f3th, eds.), Colloquia Mathematica Societatis J. Bolyai, North-Holland, Amsterdam, to appear."},{"key":"BF02574056_CR6","doi-asserted-by":"crossref","unstructured":"[FMR] H. de Fraysseix, P. O. de Mendez, and P. Rosenstiehl: Bipolar orientations revisited,Discrete Math., to appear.","DOI":"10.1016\/0166-218X(94)00085-R"},{"key":"BF02574056_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix De","year":"1990","unstructured":"[FPP] H. De Fraysseix, J. Pach, and R. Pollack: How to draw a planar graph on a grid,Combinatorica 10 (1990), 41\u201351.","journal-title":"Combinatorica"},{"key":"BF02574056_CR8","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0012-365X(92)90343-E","volume":"102","author":"S. F\u00f6ldes","year":"1992","unstructured":"[FRU] S. F\u00f6ldes, I. Rival, and J. Urrutia: Light sources, obstructions and spherical orders,Discrete Math. 102 (1992), 13\u201323.","journal-title":"Discrete Math."},{"key":"BF02574056_CR9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0012-365X(91)90069-E","volume":"87","author":"I. B.-A. Hartman","year":"1991","unstructured":"[HNZ] I. B.-A. Hartman, I. Newman, and R. Ziv: On grid intersection graphs,Discrete Math. 87 (1991), 41\u201352.","journal-title":"Discrete Math."},{"key":"BF02574056_CR10","first-page":"215","volume-title":"Theory of Graphs","author":"A. Lempel","year":"1967","unstructured":"[LEC] A. Lempel, S. Even, and I. Cederbaum: An algorithm for planarity testing of graphs, in:Theory of Graphs (Internat. Symp., Rome, July 1996, P. Rosenstiehl, ed.), Gordon and Breach, New York, 1967, pp. 215\u2013232."},{"key":"BF02574056_CR11","unstructured":"[OW] R. H. J. M. Otten and J. G. van Wijk: Graph representations in interactive layout design,Proc. IEEE Internat. Symp. on Circuits and Systems, 1978, pp. 914\u2013918."},{"key":"BF02574056_CR12","unstructured":"[P1] V. Petrovi\u010d: Decomposition of some planar graphs into trees,Proc. Internat. Conf. on Combinatorics, Keszthely, 1993, p. 48."},{"key":"BF02574056_CR13","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/0095-8956(76)90024-1","volume":"21","author":"C. R. Platt","year":"1976","unstructured":"[P2] C. R. Platt: Planar lattices and planar graphs.J. Combin. Theory Ser. B 21 (1976), 30\u201339.","journal-title":"J. Combin. Theory Ser. B"},{"key":"BF02574056_CR14","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1002\/jgt.3190170610","volume":"17","author":"G. Ringel","year":"1993","unstructured":"[R1] G. Ringel: Two trees in maximal planar bipartite graphs.J. Graph Theory 17 (1993), 755\u2013758.","journal-title":"J. Graph Theory"},{"key":"BF02574056_CR15","series-title":"NATO ASI Series C","volume-title":"Algorithms and Order","author":"I. Rival","year":"1989","unstructured":"[R2] I. Rival: Graphical data structures for ordered sets, in:Algorithms and Order (I. Rival, ed.), NATO ASI Series C, Vol. 255, Kluwer, Dordrecht, 1989."},{"key":"BF02574056_CR16","doi-asserted-by":"crossref","unstructured":"[R3] P. Rosentiehl: Embedding in the plane with orientation constraints: the angle graph,Ann. N.Y. Acad. Sci. 1983, pp. 340\u2013346.","DOI":"10.1111\/j.1749-6632.1989.tb22470.x"},{"key":"BF02574056_CR17","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","volume":"1","author":"P. Rosentiehl","year":"1986","unstructured":"[RT] P. Rosentiehl and R. E. Tarjan: Rectilinear planar layouts and bipolar orientations of planar graphs.Discrete Comput. Geom. 1 (1986), 343\u2013353.","journal-title":"Discrete Comput. Geom."},{"key":"BF02574056_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1007\/3-540-19488-6_143","volume-title":"Automata, Languages and Programming","author":"R. Tamassia","year":"1988","unstructured":"[T1] R. Tamassia: A dynamic data structure for planar graph embedding, in:Automata, Languages and Programming (T. Lepist\u00f6 and A. Salomaa, eds.), Lecture Notes in Computer Science, Vol. 317. Springer-Verlag, Berlin, 1988, pp. 576\u2013590."},{"key":"BF02574056_CR19","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","volume":"1","author":"R. Tamassia","year":"1986","unstructured":"[TT1] R. Tamassia and I. G. Tollis: A unified approach to visibility representations of planar graphs.Discrete Comput. Geom. 1 (1986), 321\u2013341.","journal-title":"Discrete Comput. Geom."},{"key":"BF02574056_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-17218-1_63","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"R. Tamassia","year":"1987","unstructured":"[TT2] R. Tamassia and I. G. Tollis: Centipede graphs and visibility on a cylinder, in:Graph-Theoretic Concepts in Computer Science (G. Tinhofer and G. Schmidt, eds.), Lecture Notes in Computer Science, Vol. 246, Springer-Verlag, Berlin, 1987, pp. 252\u2013263."},{"key":"BF02574056_CR21","unstructured":"[TT3] R. Tamassia and I. G. Tollis: Tessellation representations of planar graphs,Proc. 27th Allerton Conf. on Communications, Control, and Computing, 1989, pp. 48\u201357."},{"key":"BF02574056_CR22","first-page":"85","volume":"9","author":"R. E. Tarjan","year":"1986","unstructured":"[T2] R. E. Tarjan Two streamlined depth-first search algorithms,Fund. Inform. 9 (1986), 85\u201394.","journal-title":"Fund. Inform."},{"key":"BF02574056_CR23","doi-asserted-by":"crossref","first-page":"236","DOI":"10.2307\/2371126","volume":"55","author":"H. Whitney","year":"1933","unstructured":"[W] H. Whitney: On the classification of graphs,Amer. J. Math. 55 (1933), 236\u2013244.","journal-title":"Amer. J. Math."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02574056.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02574056\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02574056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T12:19:18Z","timestamp":1558181958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02574056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":23,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["BF02574056"],"URL":"https:\/\/doi.org\/10.1007\/bf02574056","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}