{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:08:48Z","timestamp":1742936928243,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_17","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T14:50:06Z","timestamp":1470322206000},"page":"237-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Weak Unit Disk and Interval Representation of Graphs"],"prefix":"10.1007","author":[{"given":"M. J.","family":"Alam","sequence":"first","affiliation":[]},{"given":"S. G.","family":"Kobourov","sequence":"additional","affiliation":[]},{"given":"S.","family":"Pupyrev","sequence":"additional","affiliation":[]},{"given":"J.","family":"Toeniskoetter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-642-45043-3_4","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"MJ Alam","year":"2013","unstructured":"Alam, M.J., Chaplick, S., Fijav\u017e, G., Kaufmann, M., Kobourov, S.G., Pupyrev, S.: Threshold-coloring and unit-cube contact representation of graphs. In: Brandst\u00e4dt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol. 8165, pp. 26\u201337. Springer, Heidelberg (2013)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-319-07890-8_3","volume-title":"Fun with Algorithms","author":"MJ Alam","year":"2014","unstructured":"Alam, M.J., Kobourov, S.G., Pupyrev, S., Toeniskoetter, J.: Happy edges: threshold-coloring of regular lattices. In: Ferro, A., Luccio, F., Widmayer, P. (eds.) FUN 2014. LNCS, vol. 8496, pp. 28\u201339. Springer, Heidelberg (2014)"},{"issue":"1","key":"17_CR3","doi-asserted-by":"crossref","first-page":"R26","DOI":"10.37236\/1779","volume":"11","author":"MO Albertson","year":"2004","unstructured":"Albertson, M.O., Chappell, G.G., Kierstead, H.A., K\u00fcndgen, A., Ramamurthi, R.: Coloring with no 2-colored P4. Electron. J. Combin. 11(1), R26 (2004)","journal-title":"Electron. J. Combin."},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0012-365X(98)00393-8","volume":"206","author":"O Borodin","year":"1999","unstructured":"Borodin, O., Kostochka, A., Ne\u0161et\u0159il, J., Raspaud, A., Sopena, E.: On the maximum average degree and the oriented chromatic number of a graph. Dis. Math. 206(1), 77\u201389 (1999)","journal-title":"Dis. Math."},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-642-36763-2_17","volume-title":"Graph Drawing","author":"D Bremner","year":"2013","unstructured":"Bremner, D., Evans, W., Frati, F., Heyer, L., Kobourov, S.G., Lenhart, W.J., Liotta, G., Rappaport, D., Whitesides, S.H.: On representing graphs by touching cuboids. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 187\u2013198. Springer, Heidelberg (2013)"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0925-7721(97)00014-X","volume":"9","author":"H Breu","year":"1998","unstructured":"Breu, H., Kirkpatrick, D.G.: Unit disk graph recognition is NP-hard. Comput. Geom. 9(1), 3\u201324 (1998)","journal-title":"Comput. Geom."},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/jgt.20392","volume":"62","author":"Y Bu","year":"2009","unstructured":"Bu, Y., Cranston, D.W., Montassier, M., Raspaud, A., Wang, W.: Star coloring of sparse graphs. J. Graph. Theory 62(3), 201\u2013219 (2009)","journal-title":"J. Graph. Theory"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"R Duffin","year":"1965","unstructured":"Duffin, R.: Topology of series-parallel networks. J. Math. Anal. Appl. 10, 303\u2013318 (1965)","journal-title":"J. Math. Anal. Appl."},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0095-8956(85)90039-5","volume":"39","author":"R Eggleton","year":"1985","unstructured":"Eggleton, R., Erd\u00f6s, P., Skilton, D.: Colouring the real line. J. Comb. Theory, Ser. B 39(1), 86\u2013100 (1985)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-25878-7_17","volume-title":"Graph Drawing","author":"W Evans","year":"2011","unstructured":"Evans, W., Gansner, E.R., Kaufmann, M., Liotta, G., Meijer, H., Spillner, A.: Approximate proximity drawings. In: Speckmann, B. (ed.) GD 2011. LNCS, vol. 7034, pp. 166\u2013178. Springer, Heidelberg (2011)"},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0020-0190(95)00133-W","volume":"56","author":"CM Herrera de Fegueiredo","year":"1995","unstructured":"Herrera de Fegueiredo, C.M., Meidanis, J., Picinin de Mello, C.: A linear-time algorithm for proper interval graph recognition. Inf. Process. Lett. 56(3), 179\u2013184 (1995)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1017\/S0963548304006637","volume":"14","author":"M Ferrara","year":"2005","unstructured":"Ferrara, M., Kohayakawa, Y., R\u00f6dl, V.: Distance graphs on the integers. Comb. Probab. Comput. 14(1), 107\u2013131 (2005)","journal-title":"Comb. Probab. Comput."},{"issue":"3","key":"17_CR13","first-page":"259","volume":"18","author":"KR Gabriel","year":"1969","unstructured":"Gabriel, K.R., Sokal, R.R.: A new statistical approach to geographic variation analysis. Syst. Biol. 18(3), 259\u2013278 (1969)","journal-title":"Syst. Biol."},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1006\/jagm.1995.1047","volume":"19","author":"MC Golumbic","year":"1995","unstructured":"Golumbic, M.C., Kaplan, H., Shamir, R.: Graph sandwich problems. J. Algorithms 19(3), 449\u2013473 (1995)","journal-title":"J. Algorithms"},{"issue":"12","key":"17_CR15","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE 68(12), 1497\u20131514 (1980)","journal-title":"Proc. IEEE"},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(90)90092-Q","volume":"28","author":"PL Hammer","year":"1990","unstructured":"Hammer, P.L., Peled, U.N., Sun, X.: Difference graphs. Dis. App. Math. 28(1), 35\u201344 (1990)","journal-title":"Dis. App. Math."},{"issue":"1","key":"17_CR17","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0012-365X(00)00204-1","volume":"229","author":"P Hlin\u011bn\u1ef3","year":"2001","unstructured":"Hlin\u011bn\u1ef3, P., Kratochv\u00edl, J.: Representing graphs by disks and balls (a survey of recognition-complexity results). Discrete Math. 229(1), 101\u2013124 (2001)","journal-title":"Discrete Math."},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-3-662-45803-7_12","volume-title":"Graph Drawing","author":"L Kleist","year":"2014","unstructured":"Kleist, L., Rahman, B.: Unit contact representations of grid subgraphs with regular polytopes in 2D and 3D. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 137\u2013148. Springer, Heidelberg (2014)"},{"issue":"5","key":"17_CR19","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/s11276-007-0045-6","volume":"14","author":"F Kuhn","year":"2008","unstructured":"Kuhn, F., Wattenhofer, R., Zollinger, A.: Ad hoc networks beyond unit disk graphs. Wireless Netw. 14(5), 715\u2013729 (2008)","journal-title":"Wireless Netw."},{"key":"17_CR20","volume-title":"Handbook of Graph Drawing and Visualization","author":"G Liotta","year":"2007","unstructured":"Liotta, G.: Proximity drawings. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. Chapman & Hall\/CRC, Boca Raton (2007)"},{"key":"17_CR21","volume-title":"Threshold Graphs and Related Topics","author":"NV Mahadev","year":"1995","unstructured":"Mahadev, N.V., Peled, U.N.: Threshold Graphs and Related Topics. North Holland, Amsterdam (1995)"},{"issue":"1","key":"17_CR22","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.jctb.2012.09.004","volume":"103","author":"C McDiarmid","year":"2013","unstructured":"McDiarmid, C., M\u00fcller, T.: Integer realizations of disk and segment graphs. J. Comb. Theory, Ser. B 103(1), 114\u2013143 (2013)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"17_CR23","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1006\/jctb.1995.1057","volume":"65","author":"C Thomassen","year":"1995","unstructured":"Thomassen, C.: Decomposing a planar graph into degenerate graphs. J. Comb. Theory, Ser. B 65(2), 305\u2013314 (1995)","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"1","key":"17_CR24","doi-asserted-by":"crossref","first-page":"R124","DOI":"10.37236\/848","volume":"15","author":"C Timmons","year":"2008","unstructured":"Timmons, C.: Star coloring high girth planar graphs. Electron. J. Comb. 15(1), R124 (2008)","journal-title":"Electron. J. Comb."},{"key":"17_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/3-540-17218-1_57","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M Wiegers","year":"1987","unstructured":"Wiegers, M.: Recognizing outerplanar graphs in linear time. In: Tinhofer, G., Schmidt, G. (eds.) WG 1986. LNCS, vol. 246, pp. 165\u2013176. Springer, Heidelberg (1987)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T19:48:08Z","timestamp":1600976888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Garching","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2015","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2015","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2015","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2015","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}