{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:24:52Z","timestamp":1742959492842,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030108007"},{"type":"electronic","value":"9783030108014"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-10801-4_30","type":"book-chapter","created":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T09:38:37Z","timestamp":1547113117000},"page":"379-391","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A 116\/13-Approximation Algorithm for L(2,\u00a01)-Labeling of Unit Disk Graphs"],"prefix":"10.1007","author":[{"given":"Hirotaka","family":"Ono","sequence":"first","affiliation":[]},{"given":"Hisato","family":"Yamanaka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,11]]},"reference":[{"issue":"2","key":"30_CR1","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1093\/comjnl\/47.2.193","volume":"47","author":"HL Bodlaender","year":"2004","unstructured":"Bodlaender, H.L., Kloks, T., Tan, R.B., Van Leeuwen, J.: Approximations for $$\\lambda $$-colorings of graphs. Comput. J. 47(2), 193\u2013204 (2004)","journal-title":"Comput. J."},{"issue":"1","key":"30_CR2","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":"8","key":"30_CR3","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1093\/comjnl\/bxr037","volume":"54","author":"T Calamoneri","year":"2011","unstructured":"Calamoneri, T.: The $${L} (h, k)$$-labelling problem: an updated survey and annotated bibliography. Comput. J. 54(8), 1344\u20131371 (2011)","journal-title":"Comput. J."},{"issue":"2","key":"30_CR4","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"GJ Chang","year":"1996","unstructured":"Chang, G.J., Kuo, D.: The $${L}(2,1)$$-labeling problem on graphs. SIAM J. Discrete Math. 9(2), 309\u2013316 (1996)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"30_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Math. 86(1), 165\u2013177 (1990)","journal-title":"Discrete Math."},{"issue":"1","key":"30_CR6","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.tcs.2004.06.026","volume":"326","author":"J Fiala","year":"2004","unstructured":"Fiala, J., Fishkin, A.V., Fomin, F.: On distance constrained labeling of disk graphs. Theor. Comput. Sci. 326(1), 261\u2013292 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/11523468_30","volume-title":"Automata, Languages and Programming","author":"J Fiala","year":"2005","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Distance constrained labelings of graphs of bounded treewidth. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 360\u2013372. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11523468_30"},{"issue":"1","key":"30_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0166-218X(00)00387-5","volume":"113","author":"J Fiala","year":"2001","unstructured":"Fiala, J., Kloks, T., Kratochv\u00edl, J.: Fixed-parameter complexity of $$\\lambda $$-labelings. Discrete Appl. Math. 113(1), 59\u201372 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"30_CR9","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1016\/j.disc.2007.07.075","volume":"308","author":"D Gon\u00e7alves","year":"2008","unstructured":"Gon\u00e7alves, D.: On the $${L}(p,1)$$-labelling of graphs. Discrete Math. 308(8), 1405\u20131414 (2008). Third European Conference on Combinatorics","journal-title":"Discrete Math."},{"issue":"4","key":"30_CR10","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM J. Discrete Math. 5(4), 586\u2013595 (1992)","journal-title":"SIAM J. Discrete Math."},{"issue":"12","key":"30_CR11","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":"3","key":"30_CR12","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1007\/s00453-012-9657-z","volume":"66","author":"T Hasunuma","year":"2013","unstructured":"Hasunuma, T., Ishii, T., Ono, H., Uno, Y.: A linear time algorithm for $${L} (2, 1)$$-labeling of trees. Algorithmica 66(3), 654\u2013681 (2013)","journal-title":"Algorithmica"},{"issue":"2","key":"30_CR13","doi-asserted-by":"publisher","first-page":"251","DOI":"10.15803\/ijnc.4.2_251","volume":"4","author":"T Hasunuma","year":"2014","unstructured":"Hasunuma, T., Ishii, T., Ono, H., Uno, Y.: Algorithmic aspects of distance constrained labeling: a survey. Int. J. Netw. Comput. 4(2), 251\u2013259 (2014)","journal-title":"Int. J. Netw. Comput."},{"key":"30_CR14","unstructured":"Junosza-Szaniawski, K., Rza\u017cewski, P., Sok\u00f3\u0142, J., Wesek, K.: Coloring and $$L(2, 1)$$-labeling of unit disk intersection graphs. In: European Workshop on Computational Geometry (EuroCG), pp. 83\u201386 (2016)"},{"key":"30_CR15","unstructured":"Koller, A.E.: The frequency assignment problem. Ph.D. thesis. Brunel University, School of Information Systems, Computing and Mathematics (2005)"},{"issue":"2","key":"30_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0012-365X(91)90258-4","volume":"93","author":"FS Roberts","year":"1991","unstructured":"Roberts, F.S.: $${T}$$-colorings of graphs: recent results and open problems. Discrete Math. 93(2), 229\u2013245 (1991)","journal-title":"Discrete Math."},{"issue":"11","key":"30_CR17","doi-asserted-by":"publisher","first-page":"1188","DOI":"10.1016\/j.aml.2007.12.020","volume":"21","author":"Z Shao","year":"2008","unstructured":"Shao, Z., Yeh, R.K., Poon, K.K., Shiu, W.C.: The $${L}(2,1)$$-labeling of $${K}_{1, n}$$-free graphs and its applications. Appl. Math. Lett. 21(11), 1188\u20131193 (2008)","journal-title":"Appl. Math. Lett."},{"issue":"12","key":"30_CR18","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/j.disc.2005.11.029","volume":"306","author":"RK Yeh","year":"2006","unstructured":"Yeh, R.K.: A survey on labeling graphs with a condition at distance two. Discrete Math. 306(12), 1217\u20131231 (2006)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2019: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10801-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:17:52Z","timestamp":1709810272000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10801-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030108007","9783030108014"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10801-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/beda.dcs.fmph.uniba.sk\/sofsem2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}