{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:16:01Z","timestamp":1759637761039},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403125"},{"type":"electronic","value":"9783642403132"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40313-2_34","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T14:36:43Z","timestamp":1376663803000},"page":"373-384","source":"Crossref","is-referenced-by-count":2,"title":["On the Recognition of Four-Directional Orthogonal Ray Graphs"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Felsner","sequence":"first","affiliation":[]},{"given":"George B.","family":"Mertzios","sequence":"additional","affiliation":[]},{"given":"Irina","family":"Musta","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-642-33090-2_22","volume-title":"Algorithms \u2013 ESA 2012","author":"S. Cabello","year":"2012","unstructured":"Cabello, S., Cardinal, J., Langerman, S.: The clique problem in ray intersection graphs. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol.\u00a07501, pp. 241\u2013252. Springer, Heidelberg (2012)"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Chalopin, J., Gon\u00e7alves, D.: Every planar graph is the intersection graph of segments in the plane: extended abstract. In: Proc STOC 2009, pp. 631\u2013638 (2009)","DOI":"10.1145\/1536414.1536500"},{"issue":"3","key":"34_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. Journal of Symbolic Computation\u00a09(3), 251\u2013280 (1990)","journal-title":"Journal of Symbolic Computation"},{"issue":"1-3","key":"34_CR4","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0012-365X(00)00092-3","volume":"223","author":"V. Estivill-Castro","year":"2000","unstructured":"Estivill-Castro, V., Noy, M., Urrutia, J.: On the chromatic number of tree graphs. Discrete Mathematics\u00a0223(1-3), 363\u2013366 (2000)","journal-title":"Discrete Mathematics"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s004939970003","volume":"19","author":"T. Feder","year":"1999","unstructured":"Feder, T., Hell, P., Huang, J.: List homomorphisms and circular arc graphs. Combinatorica\u00a019, 487\u2013505 (1999)","journal-title":"Combinatorica"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/BF01108596","volume":"11","author":"S. Felsner","year":"1994","unstructured":"Felsner, S.: 3-interval irreducible partially ordered sets. Order\u00a011, 12\u201315 (1994)","journal-title":"Order"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/S089548019121885X","volume":"7","author":"S. Felsner","year":"1994","unstructured":"Felsner, S., Habib, M., M\u00f6hring, R.H.: On the interplay of interval dimension and dimension. SIAM Journal on Discrete Mathematics\u00a07, 32\u201340 (1994)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"34_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1142\/S0129054199000125","volume":"10","author":"M. Habib","year":"1999","unstructured":"Habib, M., Paul, C., Viennot, L.: Partition refinement techniques: An interesting algorithmic tool kit. Int. J. Found. Comput. Sci.\u00a010(2), 147\u2013170 (1999)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1","key":"34_CR9","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0012-365X(91)90069-E","volume":"87","author":"I.-A. Hartman","year":"1991","unstructured":"Hartman, I.-A., Newman, I., Ziv, R.: On grid intersection graphs. Discrete Mathematics\u00a087(1), 41\u201352 (1991)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"34_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0166-218X(94)90143-0","volume":"52","author":"J. Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J.: A special planar satisfiability problem and a consequence of its NP-completeness. Discrete Applied Mathematics\u00a052(3), 233\u2013252 (1994)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"34_CR11","first-page":"761","volume":"30","author":"J. Kratochv\u00edl","year":"1989","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: NP-hardness results for intersection graphs. Commentationes Mathematicae Universitatis Carolinae\u00a030(4), 761\u2013773 (1989)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"issue":"2","key":"34_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jctb.1994.1071","volume":"62","author":"J. Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Matou\u0161ek, J.: Intersection graphs of segments. J. Comb. Theory, Ser. B\u00a062(2), 289\u2013315 (1994)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"McConnell, R.: Linear-time recognition of circular-arc graphs. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 386\u2013394 (2001)","DOI":"10.1109\/SFCS.2001.959913"},{"key":"34_CR14","unstructured":"Musta\u0163\u0103, I., Pergel, M.: Unit grid intersection graphs: recognition and properties (in preparation, 2013)"},{"issue":"17","key":"34_CR15","doi-asserted-by":"publisher","first-page":"2383","DOI":"10.1016\/j.dam.2007.07.010","volume":"155","author":"Y. Otachi","year":"2007","unstructured":"Otachi, Y., Okamoto, Y., Yamazaki, K.: Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs. Discrete Applied Mathematics\u00a0155(17), 2383\u20132390 (2007)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"34_CR16","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/MDT.2009.14","volume":"26","author":"W. Rao","year":"2009","unstructured":"Rao, W., Orailoglu, A., Karri, R.: Logic mapping in crossbar-based nanoarchitectures. IEEE Design & Test of Computers\u00a026(1), 68\u201377 (2009)","journal-title":"IEEE Design & Test of Computers"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Richerby, D.: Interval bigraphs are unit grid intersection graphs. Discrete Mathematics, 1718\u20131719 (2009)","DOI":"10.1016\/j.disc.2008.02.006"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Shrestha, A., Tayu, S., Ueno, S.: Orthogonal ray graphs and nano-PLA design. In: Proc. IEEE ISCAS 2009, pp. 2930\u20132933 (2009)","DOI":"10.1109\/ISCAS.2009.5118416"},{"issue":"15","key":"34_CR19","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1016\/j.dam.2010.06.002","volume":"158","author":"A.M.S. Shrestha","year":"2010","unstructured":"Shrestha, A.M.S., Tayu, S., Ueno, S.: On orthogonal ray graphs. Discrete Appl. Math.\u00a0158(15), 1650\u20131659 (2010)","journal-title":"Discrete Appl. Math."},{"key":"34_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-20807-2_31","volume-title":"Integer Programming and Combinatoral Optimization","author":"J.A. Soto","year":"2011","unstructured":"Soto, J.A., Telha, C.: Jump number of two-directional orthogonal ray graphs. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol.\u00a06655, pp. 389\u2013403. Springer, Heidelberg (2011)"},{"key":"34_CR21","doi-asserted-by":"crossref","unstructured":"Trotter, W.: Combinatorics and Partially Ordered Sets. The Johns Hopkins University Press (1992)","DOI":"10.56021\/9780801844256"},{"key":"34_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-77891-2_3","volume-title":"WALCOM: Algorithms and Computation","author":"R. Uehara","year":"2008","unstructured":"Uehara, R.: Simple geometrical intersection graphs. In: Nakano, S.-I., Rahman, M. S. (eds.) WALCOM 2008. LNCS, vol.\u00a04921, pp. 25\u201333. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40313-2_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T22:35:11Z","timestamp":1688423711000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40313-2_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403125","9783642403132"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40313-2_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}