{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:59:46Z","timestamp":1725494386002},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423065"},{"type":"electronic","value":"9783540477389"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-47738-1_35","type":"book-chapter","created":{"date-parts":[[2007,11,6]],"date-time":"2007-11-06T22:52:49Z","timestamp":1194389569000},"page":"370-380","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Illuminating Both Sides of Line Segments"],"prefix":"10.1007","author":[{"given":"Csaba D.","family":"T\u00f3th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,20]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B. S. Baker","year":"1994","unstructured":"Baker, B. S.: Approximation algorithms for NP-complete problems on planar graphs. J. Assoc. Comput. Math. 41 (1994) 153\u2013180","journal-title":"J. Assoc. Comput. Math."},{"key":"35_CR2","first-page":"258","volume":"247","author":"C. Berge","year":"1958","unstructured":"Berge, C.: Sur le couplage maximum d\u2019un graphe. C. R. Acad. Sciences, Paris 247 (1958) 258\u2013259","journal-title":"C. R. Acad. Sciences, Paris"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0196-6774(90)90001-U","volume":"11","author":"F. Berman","year":"1990","unstructured":"Berman, F., Johnson, D., Leighton, T., Shor, P. W., Snyder, L.: Generalized planar matching. J. Algorithms 11 (1990) 153\u2013184.","journal-title":"J. Algorithms"},{"key":"35_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1007\/3-540-51542-9_27","volume-title":"Galleries, light matchings and visibility graphs. Algorithms and data structures","author":"J. Czyzowicz","year":"1989","unstructured":"Czyzowicz, J., Rival, I., Urrutia, J.: Galleries, light matchings, and visibility graphs. In: Galleries, light matchings and visibility graphs. Algorithms and data structures (Ottawa, ON, 1989), Lecture Notes in Comput. Sci. 382, Springer-Verlag, Berlin, (1989) 316\u2013324"},{"key":"35_CR5","unstructured":"Czyzowicz, J., Rivera-Campo, E., Urrutia, J.: Illuminating rectangles and triangles in the plane. J. Combin. Theory Ser. B (1993) 1\u201317"},{"key":"35_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/3-540-55121-2_10","volume-title":"Graph-theoretic concepts in computer science","author":"J. Czyzowicz","year":"1992","unstructured":"Czyzowicz, J., Rivera-Campo, E., Santoro, N., Urrutia, J., Zaks, J.: Tight bounds for the rectangular art gallery problem, in: Graph-theoretic concepts in computer science (Fischbachau, 1991), Lecture Notes in Comput. Sci. 570, Springer-Verlag, Berlin, (1992) 105\u2013112"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0012-365X(93)E0127-P","volume":"137","author":"J. Czyzowicz","year":"1995","unstructured":"Czyzowicz, J., Rivera-Campo, E., Urrutia, J., Zaks, J.: On illuminating line segments in the plane. Discrete Math. 137 (1995) 147\u2013153","journal-title":"Discrete Math."},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Eidenbenz, S., Stamm, C., Widmayer, P.: Inapproximately of some art gallery problems, in: Proceedings 10th Canadian Conference on Computational Geometry (Montr\u00e9al, 1998)","DOI":"10.1016\/S0925-7721(97)00029-1"},{"key":"35_CR9","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/BF01895856","volume":"29","author":"T. L. Fejex","year":"1977","unstructured":"Fejex, T\u00f3th, L.: Illumination of convex disks. Acta Math. Acad. Sci. Hungar. 29 (1977) 355\u2013360","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"35_CR10","unstructured":"Hartvigsen, D., Hell, P.: The k-piece packing problem. Manuscript (2000)"},{"key":"35_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/BFb0032069","volume-title":"Proc ICALP","author":"F. Hoffmann","year":"1990","unstructured":"Hoffmann, F.: On the rectilinear Art Gallery Problem. in: Proc ICALP, Lecture Notes in Comput. Sci. 90, Springer-Verlag (1990) 717\u2013728"},{"key":"35_CR12","unstructured":"Kaneko, A.: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two. Submitted"},{"key":"35_CR13","unstructured":"Kano, M., Katona, G. Y., Kir\u00e1ly, Z.: On path-factors and subfactors of graphs without paths of length one. Submitted"},{"key":"35_CR14","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"Karp, R. M.: Reducibility among combinatorial problems, in: Complexity of Computer Computations (R. Miller and J. Thatcher, eds.). Plenum Press, New York (1972) 85\u2013103"},{"key":"35_CR15","first-page":"240","volume-title":"Proc. 10th Ann. ACM Symp. on Theory of Computing","author":"D. G. Kirkpatrick","year":"1978","unstructured":"Kirkpatrick, D. G., Hell, P.: On the completeness of a generalized matching problem, in: Proc. 10th Ann. ACM Symp. on Theory of Computing (San Diego, Calif., 1978), ACM, New York (1978) 240\u2013245"},{"key":"35_CR16","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TIT.1986.1057165","volume":"32","author":"D. T. Lee","year":"1986","unstructured":"Lee, D. T., Lin, A. K.: Computational complexity of art gallery problems. IEEE Trans. Inform. Theory 32 (1986) 276\u2013282","journal-title":"IEEE Trans. Inform. Theory"},{"key":"35_CR17","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0012-365X(79)90133-X","volume":"28","author":"T. Nishizeki","year":"1979","unstructured":"Nishizeki, T., Baybars, I.: Lower bounds on the cardinality of the maximum matchings of planar graphs. Discrete Math. 28 (1979) 255\u2013267","journal-title":"Discrete Math."},{"key":"35_CR18","first-page":"237","volume-title":"Advances in Discrete and Computational Geometry","author":"J. O\u2019Rourke","year":"1998","unstructured":"O\u2019Rourke, J.: Open problems in the combinatorics of visibility and illumination, in: Advances in Discrete and Computational Geometry (B. Chazelle, J. E. Goodman, and R. Pollack, eds.) (Contemporary Mathematics), AMS, Providence (1998) 237\u2013243"},{"key":"35_CR19","volume-title":"The International Series of Monographs on Computer Science","author":"J. O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art gallery theorems and algorithms. The International Series of Monographs on Computer Science, Oxford University Press, New York (1987)"},{"key":"35_CR20","unstructured":"T\u00f3th, Cs. D.: Illumination in the presence of opaque line segments in the plane. Submitted"},{"key":"35_CR21","unstructured":"T\u00f3th, Cs. D.: Illuminating disjoint line segments in the plane. Submitted"},{"key":"35_CR22","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1016\/B978-044482537-7\/50023-1","volume-title":"Handbook on Computational Geometry","author":"J. Urrutia","year":"2000","unstructured":"Urrutia, J.: Art Gallery and Illumination Problems. in: Handbook on Computational Geometry (J. R. Sack, J. Urrutia eds.), Elsevier Science Publishers, Amsterdam (2000) 973\u20131027"},{"key":"35_CR23","unstructured":"Zaks, J.: A note on illuminating line segments in the plane. Manuscript (1993)"}],"container-title":["Lecture Notes in Computer Science","Discrete and Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47738-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T16:45:56Z","timestamp":1684082756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47738-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423065","9783540477389"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-47738-1_35","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"20 September 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}