{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T19:49:54Z","timestamp":1672429794133},"reference-count":22,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7563,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1992,11]]},"DOI":"10.1016\/0166-218x(92)90018-6","type":"journal-article","created":{"date-parts":[[2002,7,28]],"date-time":"2002-07-28T20:40:59Z","timestamp":1027888859000},"page":"5-17","source":"Crossref","is-referenced-by-count":16,"title":["Some results on visibility graphs"],"prefix":"10.1016","volume":"40","author":[{"given":"Thomas","family":"Andreae","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90018-6_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0166-218X(92)90018-6_BIB2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0304-3975(88)90123-5","article-title":"Algorithms for plane representations of acyclic digraphs","volume":"61","author":"Di Battista","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(92)90018-6_BIB3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","article-title":"Minimum partition of a matroid into independent subsets","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"10.1016\/0166-218X(92)90018-6_BIB4","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/TCS.1976.1084138","article-title":"An application of graph coloring to printed circuit testing","volume":"23","author":"Garey","year":"1976","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0166-218X(92)90018-6_BIB5","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","article-title":"The planar Hamiltonian circuit problem is NP-complete","volume":"5","author":"Garey","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90018-6_BIB6","series-title":"Algorithms and Data Structures","first-page":"325","article-title":"Weighted visibility graphs of bars and related flow problems","volume":"382","author":"Kirkpatrik","year":"1989"},{"key":"10.1016\/0166-218X(92)90018-6_BIB7","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TCAD.1983.1270022","article-title":"An algorithm to compact a VLSI symbolic layout with mixed constraints","volume":"2","author":"Liao","year":"1983","journal-title":"IEEE Trans. Comput. Aided Design of Integr. Circuits and Systems"},{"key":"10.1016\/0166-218X(92)90018-6_BIB8_1","series-title":"VLSI: Algorithms and Architectures","first-page":"125","article-title":"A VLSI algorithm for a visibility problem","author":"Lodi","year":"1985"},{"key":"10.1016\/0166-218X(92)90018-6_BIB8_2","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1109\/TC.1986.1676685","volume":"35","author":"Lodi","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90018-6_BIB9","article-title":"Matching Theory","volume":"29","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/0166-218X(92)90018-6_BIB10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0012-365X(87)90190-7","article-title":"A note on visibility graphs","volume":"64","author":"Luccio","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)90018-6_BIB11","series-title":"Problem at the 6th Hungarian Colloquium on Combinatorics","author":"Melnikov","year":"1981"},{"key":"10.1016\/0166-218X(92)90018-6_BIB12","series-title":"Proceedings IEEE International Symposium on Circuits and Systems","first-page":"914","article-title":"Graph representation in interactive layout design","author":"Otten","year":"1978"},{"key":"10.1016\/0166-218X(92)90018-6_BIB13","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/BF00714475","article-title":"Representing orders by translating convex figures in the plane","volume":"4","author":"Rival","year":"1988","journal-title":"Order"},{"key":"10.1016\/0166-218X(92)90018-6_BIB14","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF02187706","article-title":"Rectilinear planar layouts and bipolar orientations of planar graphs","volume":"1","author":"Rosenstiehl","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0166-218X(92)90018-6_BIB15","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0167-9260(83)80019-4","article-title":"An algorithm for optimal two-dimensional compaction of VLSI layouts","volume":"1","author":"Schlag","year":"1983","journal-title":"Integration, VLSI J."},{"key":"10.1016\/0166-218X(92)90018-6_BIB16","first-page":"259","article-title":"A visibility problem in VLSI layout compaction","volume":"Vol. 2","author":"Schlag","year":"1985"},{"key":"10.1016\/0166-218X(92)90018-6_BIB17","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","article-title":"A unified approach to visibility representations of planar graphs","volume":"1","author":"Tamassia","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0166-218X(92)90018-6_BIB18","series-title":"Graph-Theoretic Concepts in Computer Science","first-page":"252","article-title":"Centipede-graphs and visibility on a cyclinder","volume":"246","author":"Tamassia","year":"1987"},{"key":"10.1016\/0166-218X(92)90018-6_BIB19","series-title":"Tech. Rept. CS-89-10","article-title":"Representations of graphs on a cylinder","author":"Tamassia","year":"1989"},{"key":"10.1016\/0166-218X(92)90018-6_BIB20","series-title":"Progress in Graph Theory","first-page":"43","article-title":"Plane representations of graphs","author":"Thomassen","year":"1984"},{"key":"10.1016\/0166-218X(92)90018-6_BIB21","series-title":"Proceedings of the ACM Symposium on Computational Geometry, Baltimore, MD","first-page":"147","article-title":"Characterizing bar line-of-sight graphs","author":"Wismath","year":"1985"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92900186?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X92900186?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T07:23:52Z","timestamp":1554967432000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X92900186"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["0166218X92900186"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90018-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}