Cabello, Sergio; Mulzer, Wolfgang Minimum cuts in geometric intersection graphs. (English) Zbl 07290997 Comput. Geom. 94, Article ID 101720, 10 p. (2021). MSC: 68U 68Q 52C PDF BibTeX XML Cite \textit{S. Cabello} and \textit{W. Mulzer}, Comput. Geom. 94, Article ID 101720, 10 p. (2021; Zbl 07290997) Full Text: DOI
Wang, Haitao; Xue, Jie Near-optimal algorithms for shortest paths in weighted unit-disk graphs. (English) Zbl 07303719 Discrete Comput. Geom. 64, No. 4, 1141-1166 (2020). MSC: 68Q 68R 68P 68R99 68Q25 68P05 PDF BibTeX XML Cite \textit{H. Wang} and \textit{J. Xue}, Discrete Comput. Geom. 64, No. 4, 1141--1166 (2020; Zbl 07303719) Full Text: DOI
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor; Marx, Dániel; van der Zanden, Tom C. A framework for exponential-time-hypothesis-tight algorithms and lower bounds in geometric intersection graphs. (English) Zbl 07294223 SIAM J. Comput. 49, No. 6, 1291-1331 (2020). MSC: 68U05 68W05 68Q25 05C10 05C69 PDF BibTeX XML Cite \textit{M. de Berg} et al., SIAM J. Comput. 49, No. 6, 1291--1331 (2020; Zbl 07294223) Full Text: DOI
Biniaz, Ahmad Plane hop spanners for unit disk graphs: simpler and better. (English) Zbl 1450.05083 Comput. Geom. 89, Article ID 101622, 12 p. (2020). MSC: 05C82 05C85 05C12 68R10 68M10 PDF BibTeX XML Cite \textit{A. Biniaz}, Comput. Geom. 89, Article ID 101622, 12 p. (2020; Zbl 1450.05083) Full Text: DOI
Banik, Aritra; Sahlot, Vibha; Saurabh, Saket Approximation algorithms for geometric conflict free covering problems. (English) Zbl 1444.68272 Comput. Geom. 89, Article ID 101591, 8 p. (2020). MSC: 68U05 05C62 68R10 68W25 PDF BibTeX XML Cite \textit{A. Banik} et al., Comput. Geom. 89, Article ID 101591, 8 p. (2020; Zbl 1444.68272) Full Text: DOI
Jallu, Ramesh K.; Jena, Sangram K.; Das, Gautam K. Liar’s domination in unit disk graphs. (English) Zbl 1454.68105 Theor. Comput. Sci. 845, 38-49 (2020). MSC: 68R10 05C62 05C69 68Q17 68W25 68W40 PDF BibTeX XML Cite \textit{R. K. Jallu} et al., Theor. Comput. Sci. 845, 38--49 (2020; Zbl 1454.68105) Full Text: DOI
Jallu, Ramesh K.; Das, Gautam K. Liar’s dominating set problem on unit disk graphs. (English) Zbl 1448.05151 Discrete Appl. Math. 286, 91-99 (2020). MSC: 05C69 05C85 68W25 68Q17 PDF BibTeX XML Cite \textit{R. K. Jallu} and \textit{G. K. Das}, Discrete Appl. Math. 286, 91--99 (2020; Zbl 1448.05151) Full Text: DOI
Liu, Pengcheng; Zhang, Zhao; Huang, Xiaohui Approximation algorithm for (connected) bounded-degree deletion problem on unit disk graphs. (English) Zbl 1452.68139 Theor. Comput. Sci. 836, 59-64 (2020). MSC: 68R10 05C22 05C62 68W25 PDF BibTeX XML Cite \textit{P. Liu} et al., Theor. Comput. Sci. 836, 59--64 (2020; Zbl 1452.68139) Full Text: DOI
Jena, Sangram K.; Das, Gautam K. Vertex-edge domination in unit disk graphs. (English) Zbl 1453.68137 Changat, Manoj (ed.) et al., Algorithms and discrete applied mathematics. 6th international conference, CALDAM 2020, Hyderabad, India, February 13–15, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12016, 67-78 (2020). MSC: 68R10 05C62 05C69 05C85 68Q17 68W25 PDF BibTeX XML Cite \textit{S. K. Jena} and \textit{G. K. Das}, Lect. Notes Comput. Sci. 12016, 67--78 (2020; Zbl 1453.68137) Full Text: DOI
Das, Gautam K.; da Fonseca, Guilherme D.; Jallu, Ramesh K. Efficient independent set approximation in unit disk graphs. (English) Zbl 1439.05176 Discrete Appl. Math. 280, 63-70 (2020). MSC: 05C69 05C62 05C85 68W25 68W40 PDF BibTeX XML Cite \textit{G. K. Das} et al., Discrete Appl. Math. 280, 63--70 (2020; Zbl 1439.05176) Full Text: DOI
Carmi, Paz; Chiu, Man Kwun; Katz, Matthew J.; Korman, Matias; Okamoto, Yoshio; van Renssen, André; Roeloffzen, Marcel; Shiitada, Taichi; Smorodinsky, Shakhar Balanced line separators of unit disk graphs. (English) Zbl 1433.68483 Comput. Geom. 86, Article ID 101575, 14 p. (2020). MSC: 68U05 05C62 68W40 PDF BibTeX XML Cite \textit{P. Carmi} et al., Comput. Geom. 86, Article ID 101575, 14 p. (2020; Zbl 1433.68483) Full Text: DOI
Garamvölgyi, Dániel; Jordán, Tibor Global rigidity of unit ball graphs. (English) Zbl 1431.52030 SIAM J. Discrete Math. 34, No. 1, 212-229 (2020). MSC: 52C25 05C62 68R10 PDF BibTeX XML Cite \textit{D. Garamvölgyi} and \textit{T. Jordán}, SIAM J. Discrete Math. 34, No. 1, 212--229 (2020; Zbl 1431.52030) Full Text: DOI
Ono, Hirotaka; Yamanaka, Hisato A 116/13-approximation algorithm for \(L(2,1)\)-labeling of unit disk graphs. (English) Zbl 1444.68152 Catania, Barbara (ed.) et al., SOFSEM 2019: theory and practice of computer science. 45th international conference on current trends in theory and practice of computer science, Nový Smokovec, Slovakia, January 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11376, 379-391 (2019). MSC: 68R10 05C62 68W25 PDF BibTeX XML Cite \textit{H. Ono} and \textit{H. Yamanaka}, Lect. Notes Comput. Sci. 11376, 379--391 (2019; Zbl 1444.68152) Full Text: DOI
Bhore, Sujoy; Jana, Satyabrata; Pandit, Supantha; Roy, Sasanka Balanced connected subgraph problem in geometric intersection graphs. (English) Zbl 1434.68347 Li, Yingshu (ed.) et al., Combinatorial optimization and applications. 13th international conference, COCOA 2019, Xiamen, China, December 13–15, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11949, 56-68 (2019). MSC: 68R10 05C15 05C62 68Q17 68W40 PDF BibTeX XML Cite \textit{S. Bhore} et al., Lect. Notes Comput. Sci. 11949, 56--68 (2019; Zbl 1434.68347) Full Text: DOI
Biniaz, Ahmad Plane hop spanners for unit disk graphs. (English) Zbl 07152206 Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer (ISBN 978-3-030-24765-2/pbk; 978-3-030-24766-9/ebook). Lecture Notes in Computer Science 11646, 140-154 (2019). MSC: 68P05 68Wxx PDF BibTeX XML Cite \textit{A. Biniaz}, Lect. Notes Comput. Sci. 11646, 140--154 (2019; Zbl 07152206) Full Text: DOI
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav Finding, hitting and packing cycles in subexponential time on unit disk graphs. (English) Zbl 1441.68178 Discrete Comput. Geom. 62, No. 4, 879-911 (2019). MSC: 68R10 05C62 68Q27 68U05 68W40 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., Discrete Comput. Geom. 62, No. 4, 879--911 (2019; Zbl 1441.68178) Full Text: DOI
Fukunaga, Takuro; Maehara, Takanori Computing a tree having a small vertex cover. (English) Zbl 1430.68203 Theor. Comput. Sci. 791, 48-61 (2019). MSC: 68R10 05C62 05C70 68W25 PDF BibTeX XML Cite \textit{T. Fukunaga} and \textit{T. Maehara}, Theor. Comput. Sci. 791, 48--61 (2019; Zbl 1430.68203) Full Text: DOI
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor The homogeneous broadcast problem in narrow and wide strips. II: Lower bounds. (English) Zbl 1421.68115 Algorithmica 81, No. 7, 2963-2990 (2019). MSC: 68R10 05C62 05C69 68Q17 PDF BibTeX XML Cite \textit{M. de Berg} et al., Algorithmica 81, No. 7, 2963--2990 (2019; Zbl 1421.68115) Full Text: DOI
de Berg, Mark; Bodlaender, Hans L.; Kisfaludi-Bak, Sándor The homogeneous broadcast problem in narrow and wide strips. I: Algorithms. (English) Zbl 1421.68114 Algorithmica 81, No. 7, 2934-2962 (2019). MSC: 68R10 05C62 05C69 68W40 PDF BibTeX XML Cite \textit{M. de Berg} et al., Algorithmica 81, No. 7, 2934--2962 (2019; Zbl 1421.68114) Full Text: DOI
Jena, Sangram K.; Jallu, Ramesh K.; Das, Gautam K.; Nandy, Subhas C. The maximum distance-\(d\) independent set problem on unit disk graphs. (English) Zbl 1446.68119 Chen, Jianer (ed.) et al., Frontiers in algorithmics. 12th international workshop, FAW 2018, Guangzhou, China, May 8–10, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10823, 68-80 (2018). MSC: 68R10 05C62 05C69 68Q17 68W25 PDF BibTeX XML Cite \textit{S. K. Jena} et al., Lect. Notes Comput. Sci. 10823, 68--80 (2018; Zbl 1446.68119) Full Text: DOI
Fukunaga, Takuro Approximation algorithms for highly connected multi-dominating sets in unit disk graphs. (English) Zbl 1414.05224 Algorithmica 80, No. 11, 3270-3292 (2018). MSC: 05C69 05C22 68W25 PDF BibTeX XML Cite \textit{T. Fukunaga}, Algorithmica 80, No. 11, 3270--3292 (2018; Zbl 1414.05224) Full Text: DOI
Fomin, Fedorr V.; Lokshtanov, Daniel; Saurabh, Saket Excluded grid minors and efficient polynomial-time approximation schemes. (English) Zbl 1426.68303 J. ACM 65, No. 2, Article No. 10, 44 p. (2018). MSC: 68W25 05C62 05C69 05C70 05C85 68Q25 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., J. ACM 65, No. 2, Article No. 10, 44 p. (2018; Zbl 1426.68303) Full Text: DOI
Fekete, Sándor P.; Keldenich, Phillip Conflict-free coloring of intersection graphs. (English) Zbl 1403.05045 Int. J. Comput. Geom. Appl. 28, No. 3, 289-307 (2018). MSC: 05C15 05C62 68Q17 68U05 PDF BibTeX XML Cite \textit{S. P. Fekete} and \textit{P. Keldenich}, Int. J. Comput. Geom. Appl. 28, No. 3, 289--307 (2018; Zbl 1403.05045) Full Text: DOI
Cabello, Sergio; Milinković, Lazar Two optimization problems for unit disks. (English) Zbl 1433.68638 Comput. Geom. 70-71, 1-12 (2018). MSC: 68W40 05C62 05C85 68R10 68U05 PDF BibTeX XML Cite \textit{S. Cabello} and \textit{L. Milinković}, Comput. Geom. 70--71, 1--12 (2018; Zbl 1433.68638) Full Text: DOI
Jallu, Ramesh K.; Jena, Sangram K.; Das, Gautam K. Liar’s Dominating Set in unit disk graphs. (English) Zbl 06946813 Wang, Lusheng (ed.) et al., Computing and combinatorics. 24th international conference, COCOON 2018, Qing Dao, China, July 2–4, 2018. Proceedings. Cham: Springer (ISBN 978-3-319-94775-4/pbk; 978-3-319-94776-1/ebook). Lecture Notes in Computer Science 10976, 516-528 (2018). MSC: 68Rxx PDF BibTeX XML Cite \textit{R. K. Jallu} et al., Lect. Notes Comput. Sci. 10976, 516--528 (2018; Zbl 06946813) Full Text: DOI
Atminas, Aistis; Zamaraev, Viktor On forbidden induced subgraphs for unit disk graphs. (English) Zbl 1394.05105 Discrete Comput. Geom. 60, No. 1, 57-97 (2018). MSC: 05C75 05C62 05C60 PDF BibTeX XML Cite \textit{A. Atminas} and \textit{V. Zamaraev}, Discrete Comput. Geom. 60, No. 1, 57--97 (2018; Zbl 1394.05105) Full Text: DOI arXiv
Chen, Lina; Huang, Xiaohui; Zhang, Zhao A simpler PTAS for connected \(k\)-path vertex cover in homogeneous wireless sensor network. (English) Zbl 1402.90139 J. Comb. Optim. 36, No. 1, 35-43 (2018). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{L. Chen} et al., J. Comb. Optim. 36, No. 1, 35--43 (2018; Zbl 1402.90139) Full Text: DOI
Junosza-Szaniawski, Konstanty; Rzążewski, Paweł; Sokół, Joanna; Wȩsek, Krzysztof Online coloring and \(L(2,1)\)-labeling of unit disk intersection graphs. (English) Zbl 1395.68341 SIAM J. Discrete Math. 32, No. 2, 1335-1350 (2018). MSC: 68W27 05C15 05C62 05C78 05C85 PDF BibTeX XML Cite \textit{K. Junosza-Szaniawski} et al., SIAM J. Discrete Math. 32, No. 2, 1335--1350 (2018; Zbl 1395.68341) Full Text: DOI
Kaplan, Haim; Mulzer, Wolfgang; Roditty, Liam; Seiferth, Paul Routing in unit disk graphs. (English) Zbl 1390.68503 Algorithmica 80, No. 3, 830-848 (2018). MSC: 68R10 68W15 PDF BibTeX XML Cite \textit{H. Kaplan} et al., Algorithmica 80, No. 3, 830--848 (2018; Zbl 1390.68503) Full Text: DOI
Devroye, L.; Morin, P. A note on interference in random networks. (English) Zbl 1416.05261 Comput. Geom. 67, 2-10 (2018). MSC: 05C82 52B05 60D05 PDF BibTeX XML Cite \textit{L. Devroye} and \textit{P. Morin}, Comput. Geom. 67, 2--10 (2018; Zbl 1416.05261) Full Text: DOI
Fekete, Sándor P.; Keldenich, Phillip Conflict-free coloring of intersection graphs. (English) Zbl 07278036 Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-054-5). LIPIcs – Leibniz International Proceedings in Informatics 92, Article 31, 12 p. (2017). MSC: 05C15 05C62 68Q17 68U05 PDF BibTeX XML Cite \textit{S. P. Fekete} and \textit{P. Keldenich}, LIPIcs -- Leibniz Int. Proc. Inform. 92, Article 31, 12 p. (2017; Zbl 07278036) Full Text: DOI
Fomin, Fedor V.; Lokshtanov, Daniel; Panolan, Fahad; Saurabh, Saket; Zehavi, Meirav Finding, hitting and packing cycles in subexponential time on unit disk graphs. (English) Zbl 1441.68179 Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 65, 15 p. (2017). MSC: 68R10 05C62 68Q27 68U05 68W40 PDF BibTeX XML Cite \textit{F. V. Fomin} et al., LIPIcs -- Leibniz Int. Proc. Inform. 80, Article 65, 15 p. (2017; Zbl 1441.68179) Full Text: DOI
Biró, Csaba; Bonnet, Édouard; Marx, Dániel; Miltzow, Tillmann; Rzążewski, Paweł Fine-grained complexity of coloring unit disks and balls. (English) Zbl 1417.68226 Aronov, Boris (ed.) et al., 33rd international symposium on computational geometry. SoCG 2017, Brisbane, Australia, July 4–7, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 77, Article 18, 16 p. (2017). MSC: 68U05 05C15 05C62 68Q25 68R10 PDF BibTeX XML Cite \textit{C. Biró} et al., LIPIcs -- Leibniz Int. Proc. Inform. 77, Article 18, 16 p. (2017; Zbl 1417.68226) Full Text: DOI
da Fonseca, Guilherme D.; Pereira de Sá, Vinícius Gusmão; Herrera de Figueiredo, Celina Miraglia Shifting coresets: obtaining linear-time approximations for unit disk graphs and other geometric intersection graphs. (English) Zbl 1386.68226 Int. J. Comput. Geom. Appl. 27, No. 4, 255-276 (2017). MSC: 68W25 05C62 05C85 PDF BibTeX XML Cite \textit{G. D. da Fonseca} et al., Int. J. Comput. Geom. Appl. 27, No. 4, 255--276 (2017; Zbl 1386.68226) Full Text: DOI
Díaz, Josep; Mertzios, George B. Minimum bisection is NP-hard on unit disk graphs. (English) Zbl 1376.68053 Inf. Comput. 256, 83-92 (2017). MSC: 68Q17 05C10 05C62 PDF BibTeX XML Cite \textit{J. Díaz} and \textit{G. B. Mertzios}, Inf. Comput. 256, 83--92 (2017; Zbl 1376.68053) Full Text: DOI
Nandy, Subhas C.; Pandit, Supantha; Roy, Sasanka Faster approximation for maximum independent set on unit disk graph. (English) Zbl 1414.68147 Inf. Process. Lett. 127, 58-61 (2017). MSC: 68W25 05C62 05C69 68U05 68W40 PDF BibTeX XML Cite \textit{S. C. Nandy} et al., Inf. Process. Lett. 127, 58--61 (2017; Zbl 1414.68147) Full Text: DOI
Jallu, Ramesh K.; Das, Guatam K. Liar’s Domination in 2D. (English) Zbl 06702490 Gaur, Daya (ed.) et al., Algorithms and discrete applied mathematics. Third international conference, CALDAM 2017, Sancoale, Goa, India, February 16–18, 2017. Proceedings. Cham: Springer (ISBN 978-3-319-53006-2/pbk; 978-3-319-53007-9/ebook). Lecture Notes in Computer Science 10156, 219-229 (2017). MSC: 68Wxx PDF BibTeX XML Cite \textit{R. K. Jallu} and \textit{G. K. Das}, Lect. Notes Comput. Sci. 10156, 219--229 (2017; Zbl 06702490) Full Text: DOI
Hayashi, Takashi; Kawamura, Akitoshi; Otachi, Yota; Shinohara, Hidehiro; Yamazaki, Koichi Thin strip graphs. (English) Zbl 1350.05122 Discrete Appl. Math. 216, Part 1, 203-210 (2017). MSC: 05C69 PDF BibTeX XML Cite \textit{T. Hayashi} et al., Discrete Appl. Math. 216, Part 1, 203--210 (2017; Zbl 1350.05122) Full Text: DOI
Fujita, Satoshi On the power of lookahead in greedy scheme for finding a minimum CDS for unit disk graphs. (English) Zbl 1404.68085 Int. J. Found. Comput. Sci. 27, No. 7, 829-843 (2016). MSC: 68R10 05C62 05C69 05C85 68Q17 68W25 PDF BibTeX XML Cite \textit{S. Fujita}, Int. J. Found. Comput. Sci. 27, No. 7, 829--843 (2016; Zbl 1404.68085) Full Text: DOI
Shao, Zhendong; Solis-Oba, Roberto A new characterization of disk graphs and its application. (English) Zbl 1413.05344 Ars Comb. 127, 421-434 (2016). MSC: 05C78 05C15 05C12 PDF BibTeX XML Cite \textit{Z. Shao} and \textit{R. Solis-Oba}, Ars Comb. 127, 421--434 (2016; Zbl 1413.05344)
Jallu, Ramesh K.; Das, Guatam K. Improved algorithm for maximum independent set on unit disk graph. (English) Zbl 1417.68288 Govindarajan, Sathish (ed.) et al., Algorithms and discrete applied mathematics. Second international conference, CALDAM 2016, Thiruvananthapuram, India, February 18–20, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9602, 212-223 (2016). MSC: 68W25 05C62 05C69 05C85 68U05 68W40 PDF BibTeX XML Cite \textit{R. K. Jallu} and \textit{G. K. Das}, Lect. Notes Comput. Sci. 9602, 212--223 (2016; Zbl 1417.68288) Full Text: DOI
Kamei, Sayaka; Izumi, Tomoko; Yamauchi, Yukiko An asynchronous self-stabilizing approximation for the minimum CDS with safe convergence in UDGs. (English) Zbl 1333.68293 Theor. Comput. Sci. 615, 102-119 (2016). MSC: 68W25 05C69 05C85 68R10 68W15 PDF BibTeX XML Cite \textit{S. Kamei} et al., Theor. Comput. Sci. 615, 102--119 (2016; Zbl 1333.68293) Full Text: DOI
Eftekhari, Mohsen; Kranakis, Evangelos; MacQuarrie, Fraser; Morales-Ponce, Oscar; Narayanan, Lata Strong connectivity of sensor networks with double antennae. (English) Zbl 1332.68169 Theor. Comput. Sci. 610, Part B, 192-203 (2016). MSC: 68R10 05C62 68Q17 68W25 PDF BibTeX XML Cite \textit{M. Eftekhari} et al., Theor. Comput. Sci. 610, Part B, 192--203 (2016; Zbl 1332.68169) Full Text: DOI
Abu-Affash, A. Karim; Biniaz, Ahmad; Carmi, Paz; Maheshwari, Anil; Smid, Michiel Approximating the bottleneck plane perfect matching of a point set. (English) Zbl 1332.65029 Comput. Geom. 48, No. 9, 718-731 (2015). Reviewer: H. P. Dikshit (Bhopal) MSC: 65D18 PDF BibTeX XML Cite \textit{A. K. Abu-Affash} et al., Comput. Geom. 48, No. 9, 718--731 (2015; Zbl 1332.65029) Full Text: DOI
Carmi, Paz; Das, Gautam K.; Jallu, Ramesh K.; Nandy, Subhas C.; Prasad, Prajwal R.; Stein, Yael Minimum dominating set problem for unit disks revisited. (English) Zbl 1344.68280 Int. J. Comput. Geom. Appl. 25, No. 3, 227-244 (2015). MSC: 68W25 05C62 05C69 68U05 PDF BibTeX XML Cite \textit{P. Carmi} et al., Int. J. Comput. Geom. Appl. 25, No. 3, 227--244 (2015; Zbl 1344.68280) Full Text: DOI
Bannoura, Amir; Ortolf, Christian; Reindl, Leonhard; Schindelhauer, Christian The wake up dominating set problem. (English) Zbl 1332.68290 Theor. Comput. Sci. 608, Part 2, 120-134 (2015). MSC: 68W27 05C69 05C85 68R10 PDF BibTeX XML Cite \textit{A. Bannoura} et al., Theor. Comput. Sci. 608, Part 2, 120--134 (2015; Zbl 1332.68290) Full Text: DOI
Dias da Fonseca, Guilherme; Pereira de Sá, Vinícius Gusmão; Santos Machado, Raphael Carlos; Miraglia Herrera de Figueiredo, Celina On the recognition of unit disk graphs and the distance geometry problem with ranges. (English) Zbl 1321.05167 Discrete Appl. Math. 197, 3-19 (2015). MSC: 05C62 05C12 05C10 PDF BibTeX XML Cite \textit{G. Dias da Fonseca} et al., Discrete Appl. Math. 197, 3--19 (2015; Zbl 1321.05167) Full Text: DOI
Biniaz, Ahmad; Maheshwari, Anil; Smid, Michiel On full Steiner trees in unit disk graphs. (English) Zbl 1319.05037 Comput. Geom. 48, No. 6, 453-458 (2015). Reviewer: T. Tamizh Chelvam (Tamilnadu) MSC: 05C05 05C22 68W25 PDF BibTeX XML Cite \textit{A. Biniaz} et al., Comput. Geom. 48, No. 6, 453--458 (2015; Zbl 1319.05037) Full Text: DOI
Cabello, Sergio; Jejčič, Miha Shortest paths in intersection graphs of unit disks. (English) Zbl 1312.05041 Comput. Geom. 48, No. 4, 360-367 (2015). MSC: 05C12 05C38 05C35 05C10 05C22 05C05 PDF BibTeX XML Cite \textit{S. Cabello} and \textit{M. Jejčič}, Comput. Geom. 48, No. 4, 360--367 (2015; Zbl 1312.05041) Full Text: DOI
Wang, Limin; Zhang, Xiaoyan; Zhang, Zhao; Broersma, Hajo A PTAS for the minimum weight connected vertex cover \(P_3\) problem on unit disk graphs. (English) Zbl 1312.68234 Theor. Comput. Sci. 571, 58-66 (2015). MSC: 68W25 05C62 05C70 05C85 68Q17 PDF BibTeX XML Cite \textit{L. Wang} et al., Theor. Comput. Sci. 571, 58--66 (2015; Zbl 1312.68234) Full Text: DOI
Das, Gautam K.; De, Minati; Kolay, Sudeshna; Nandy, Subhas C.; Sur-Kolay, Susmita Approximation algorithms for maximum independent set of a unit disk graph. (English) Zbl 1317.68272 Inf. Process. Lett. 115, No. 3, 439-446 (2015). MSC: 68W25 05C69 05C85 68Q25 68R10 PDF BibTeX XML Cite \textit{G. K. Das} et al., Inf. Process. Lett. 115, No. 3, 439--446 (2015; Zbl 1317.68272) Full Text: DOI
Bannoura, Amir; Ortolf, Christian; Schindelhauer, Christian; Reindl, Leonhard The wake up dominating set problem. (English) Zbl 1397.68132 Flocchini, Paola (ed.) et al., Algorithms for sensor systems. 9th international symposium on algorithms and experiments for sensor systems, wireless networks and distributed robotics, ALGOSENSORS 2013, Sophia Antipolis, France, September 5–6, 2013. Revised selected papers. Berlin: Springer (ISBN 978-3-642-45345-8/pbk; 978-3-642-45346-5/ebook). Lecture Notes in Computer Science 8243, 35-50 (2014). MSC: 68R10 05C69 05C85 PDF BibTeX XML Cite \textit{A. Bannoura} et al., Lect. Notes Comput. Sci. 8243, 35--50 (2014; Zbl 1397.68132) Full Text: DOI
Díaz, Josep; Mertzios, George B. Minimum bisection is NP-hard on unit disk graphs. (English) Zbl 1426.68100 Csuhaj-Varjú, Erzsébet (ed.) et al., Mathematical foundations of computer science 2014. 39th international symposium, MFCS 2014, Budapest, Hungary, August 25–29, 2014. Proceedings, Part II. Berlin: Springer. Lect. Notes Comput. Sci. 8635, 251-262 (2014). MSC: 68Q17 05C10 05C62 PDF BibTeX XML Cite \textit{J. Díaz} and \textit{G. B. Mertzios}, Lect. Notes Comput. Sci. 8635, 251--262 (2014; Zbl 1426.68100) Full Text: DOI arXiv
da Fonseca, Guilherme D.; de Figueiredo, Celina M. H.; Pereira de Sá, Vinícius G.; Machado, Raphael C. S. Efficient sub-5 approximations for minimum dominating sets in unit disk graphs. (English) Zbl 1418.68240 Theor. Comput. Sci. 540-541, 70-81 (2014). MSC: 68W25 05C62 05C69 68W40 PDF BibTeX XML Cite \textit{G. D. da Fonseca} et al., Theor. Comput. Sci. 540--541, 70--81 (2014; Zbl 1418.68240) Full Text: DOI
Pattillo, Jeffrey; Wang, Yiming; Butenko, Sergiy Approximating 2-cliques in unit disk graphs. (English) Zbl 1283.05207 Discrete Appl. Math. 166, 178-187 (2014). MSC: 05C69 05C12 68R10 68M10 68W25 PDF BibTeX XML Cite \textit{J. Pattillo} et al., Discrete Appl. Math. 166, 178--187 (2014; Zbl 1283.05207) Full Text: DOI
Bruhn, Henning Colouring stability two unit disk graphs. (English) Zbl 1317.05049 Contrib. Discrete Math. 8, No. 2, 60-74 (2013). MSC: 05C15 05C62 PDF BibTeX XML Cite \textit{H. Bruhn}, Contrib. Discrete Math. 8, No. 2, 60--74 (2013; Zbl 1317.05049) Full Text: Link arXiv
Liu, Qinghai; Zhang, Zhao; Hong, Yanmei; Wu, Weili; Du, Ding-Zhu A PTAS for weak minimum routing cost connected dominating set of unit disk graph. (English) Zbl 1308.90188 Chinchuluun, Altannar (ed.) et al., Optimization, simulation, and control. New York, NY: Springer (ISBN 978-1-4614-5130-3/hbk; 978-1-4614-5131-0/ebook). Springer Optimization and Its Applications 76, 131-142 (2013). MSC: 90C35 PDF BibTeX XML Cite \textit{Q. Liu} et al., Springer Optim. Appl. 76, 131--142 (2013; Zbl 1308.90188) Full Text: DOI
Lenzen, Christoph; Pignolet, Yvonne-Anne; Wattenhofer, Roger Distributed minimum dominating set approximations in restricted families of graphs. (English) Zbl 1271.68070 Distrib. Comput. 26, No. 2, 119-137 (2013). MSC: 68M14 68R10 05C69 68-02 PDF BibTeX XML Cite \textit{C. Lenzen} et al., Distrib. Comput. 26, No. 2, 119--137 (2013; Zbl 1271.68070) Full Text: DOI
Liu, Xianliang; Lu, Hongliang; Wang, Wei; Wu, Weili PTAS for the minimum \(k\)-path connected vertex cover problem in unit disk graphs. (English) Zbl 1275.90118 J. Glob. Optim. 56, No. 2, 449-458 (2013). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{X. Liu} et al., J. Glob. Optim. 56, No. 2, 449--458 (2013; Zbl 1275.90118) Full Text: DOI
Kanj, Iyad A.; Xia, Ge On certain geometric properties of the Yao-Yao graphs. (English) Zbl 1301.05240 Lin, Guohui (ed.), Combinatorial optimization and applications. 6th international conference, COCOA 2012, Banff, AB, Canada, August 5–9, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31769-9/pbk). Lecture Notes in Computer Science 7402, 223-233 (2012). MSC: 05C62 68M10 PDF BibTeX XML Cite \textit{I. A. Kanj} and \textit{G. Xia}, Lect. Notes Comput. Sci. 7402, 223--233 (2012; Zbl 1301.05240) Full Text: DOI
Eftekhari Hesari, Mohsen; Kranakis, Evangelos; MacQuarie, Fraser; Morales-Ponce, Oscar; Narayanan, Lata Strong connectivity of sensor networks with double antennae. (English) Zbl 1332.68168 Even, Guy (ed.) et al., Structural information and communication complexity. 19th international colloquium, SIROCCO 2012, Reykjavik, Iceland, June 30–July 2, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-31103-1/pbk). Lecture Notes in Computer Science 7355, 99-110 (2012). MSC: 68R10 05C62 68Q17 68W25 PDF BibTeX XML Cite \textit{M. Eftekhari Hesari} et al., Lect. Notes Comput. Sci. 7355, 99--110 (2012; Zbl 1332.68168) Full Text: DOI
Xin, Qin; Manne, Fredrik; Zhang, Yan; Wang, Xin Almost optimal distributed M2M multicasting in wireless mesh networks. (English) Zbl 1247.68030 Theor. Comput. Sci. 439, 69-82 (2012). MSC: 68M14 68M10 68W15 68R10 PDF BibTeX XML Cite \textit{Q. Xin} et al., Theor. Comput. Sci. 439, 69--82 (2012; Zbl 1247.68030) Full Text: DOI
Zhang, Wei; Zhang, Zhao; Wang, Wei; Zou, Feng; Lee, Wonjun Polynomial time approximation scheme for \(t\)-latency bounded information propagation problem in wireless networks. (English) Zbl 1245.90016 J. Comb. Optim. 23, No. 4, 451-461 (2012). MSC: 90B18 90C59 PDF BibTeX XML Cite \textit{W. Zhang} et al., J. Comb. Optim. 23, No. 4, 451--461 (2012; Zbl 1245.90016) Full Text: DOI
Du, Hongjie; Wu, Weili; Shan, Shan; Kim, Donghyun; Lee, Wonjun Constructing weakly connected dominating set for secure clustering in distributed sensor network. (English) Zbl 1242.90192 J. Comb. Optim. 23, No. 2, 301-307 (2012). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{H. Du} et al., J. Comb. Optim. 23, No. 2, 301--307 (2012; Zbl 1242.90192) Full Text: DOI
Yan, Chenyu; Xiang, Yang; Dragan, Feodor F. Compact and low delay routing labeling scheme for unit disk graphs. (English) Zbl 1252.68216 Comput. Geom. 45, No. 7, 305-325 (2012). MSC: 68R10 05C78 05C85 05C90 68M10 68U05 PDF BibTeX XML Cite \textit{C. Yan} et al., Comput. Geom. 45, No. 7, 305--325 (2012; Zbl 1252.68216) Full Text: DOI
Xu, Hongli; Huang, Liusheng; Liu, Wang; Zhang, Yindong; Sun, Yanjing Degree-bounded minimum spanning tree for unit disk graph. (English) Zbl 1236.68014 Theor. Comput. Sci. 418, 92-105 (2012). MSC: 68M10 68R10 68M14 05C05 PDF BibTeX XML Cite \textit{H. Xu} et al., Theor. Comput. Sci. 418, 92--105 (2012; Zbl 1236.68014) Full Text: DOI
Borodin, Allan; Ivan, Ioana; Ye, Yuli; Zimny, Bryce On sum coloring and sum multi-coloring for restricted families of graphs. (English) Zbl 1232.68061 Theor. Comput. Sci. 418, 1-13 (2012). MSC: 68Q17 05C15 68W25 05C85 PDF BibTeX XML Cite \textit{A. Borodin} et al., Theor. Comput. Sci. 418, 1--13 (2012; Zbl 1232.68061) Full Text: DOI
Fan, Lidan; Zhang, Zhao; Wang, Wei PTAS for minimum weighted connected vertex cover problem with \(c\)-local condition in unit disk graphs. (English) Zbl 1236.90135 J. Comb. Optim. 22, No. 4, 663-673 (2011). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{L. Fan} et al., J. Comb. Optim. 22, No. 4, 663--673 (2011; Zbl 1236.90135) Full Text: DOI
Dumitrescu, Adrian; Pach, János Minimum clique partition in unit disk graphs. (English) Zbl 1244.68086 Graphs Comb. 27, No. 3, 399-411 (2011). Reviewer: Ludovit Niepel (Safat) MSC: 68W25 05C85 05C70 05C69 68W20 PDF BibTeX XML Cite \textit{A. Dumitrescu} and \textit{J. Pach}, Graphs Comb. 27, No. 3, 399--411 (2011; Zbl 1244.68086) Full Text: DOI
Hassinen, Marja; Kaasinen, Joel; Kranakis, Evangelos; Polishchuk, Valentin; Suomela, Jukka; Wiese, Andreas Analysing local algorithms in location-aware quasi-unit-disk graphs. (English) Zbl 1228.05273 Discrete Appl. Math. 159, No. 15, 1566-1580 (2011). MSC: 05C85 PDF BibTeX XML Cite \textit{M. Hassinen} et al., Discrete Appl. Math. 159, No. 15, 1566--1580 (2011; Zbl 1228.05273) Full Text: DOI
Kanj, Iyad A.; Wiese, Andreas; Zhang, Fenghui Local algorithms for edge colorings in UDGs. (English) Zbl 1223.68082 Theor. Comput. Sci. 412, No. 35, 4704-4714 (2011). MSC: 68R10 05C15 68W25 68W10 PDF BibTeX XML Cite \textit{I. A. Kanj} et al., Theor. Comput. Sci. 412, No. 35, 4704--4714 (2011; Zbl 1223.68082) Full Text: DOI
Sun, Yan; Jiang, Qiangfeng; Singhal, Mukesh A Pre-Processed Cross Link Detection Protocol for geographic routing in mobile ad hoc and sensor networks under realistic environments with obstacles. (English) Zbl 1219.68056 J. Parallel Distrib. Comput. 71, No. 7, 1047-1054 (2011). MSC: 68M14 68M12 PDF BibTeX XML Cite \textit{Y. Sun} et al., J. Parallel Distrib. Comput. 71, No. 7, 1047--1054 (2011; Zbl 1219.68056) Full Text: DOI
Shang, Weiping; Wang, Xiumei Algorithms for minimum connected capacitated dominating set problem. (English) Zbl 1214.68470 Discrete Math. Algorithms Appl. 3, No. 1, 9-15 (2011). MSC: 68W25 05C69 05C85 68R10 PDF BibTeX XML Cite \textit{W. Shang} and \textit{X. Wang}, Discrete Math. Algorithms Appl. 3, No. 1, 9--15 (2011; Zbl 1214.68470) Full Text: DOI
Barbeau, Michel; Bose, Prosenjit; Carmi, Paz; Couture, Mathieu; Kranakis, Evangelos Location-oblivious distributed unit disk graph coloring. (English) Zbl 1215.68167 Algorithmica 60, No. 2, 236-249 (2011). MSC: 68R10 68W15 68W25 05C15 PDF BibTeX XML Cite \textit{M. Barbeau} et al., Algorithmica 60, No. 2, 236--249 (2011; Zbl 1215.68167) Full Text: DOI
Czyzowicz, J.; Dobrev, S.; González-Aguilar, H.; Kralovic, R.; Kranakis, E.; Opatrny, J.; Stacho, L.; Urrutia, J. Local 7-coloring for planar subgraphs of unit disk graphs. (English) Zbl 1216.05155 Theor. Comput. Sci. 412, No. 18, 1696-1704 (2011). MSC: 05C85 05C15 PDF BibTeX XML Cite \textit{J. Czyzowicz} et al., Theor. Comput. Sci. 412, No. 18, 1696--1704 (2011; Zbl 1216.05155) Full Text: DOI
Li, Xiuying; Zhang, Zhao Two algorithms for minimum 2-connected \(r\)-hop dominating set. (English) Zbl 1379.68355 Inf. Process. Lett. 110, No. 22, 986-991 (2010). MSC: 68W25 05C69 05C85 PDF BibTeX XML Cite \textit{X. Li} and \textit{Z. Zhang}, Inf. Process. Lett. 110, No. 22, 986--991 (2010; Zbl 1379.68355) Full Text: DOI
Halldórsson, Magnús M.; Halpern, Joseph Y.; Li, Li Erran; Mirrokni, Vahab S. On spectrum sharing games. (English) Zbl 1267.91007 Distrib. Comput. 22, No. 4, 235-248 (2010). MSC: 91Axx 68M10 05C15 PDF BibTeX XML Cite \textit{M. M. Halldórsson} et al., Distrib. Comput. 22, No. 4, 235--248 (2010; Zbl 1267.91007) Full Text: DOI
Kanj, Iyad A.; Perković, Ljubomir; Xia, Ge On spanners and lightweight spanners of geometric graphs. (English) Zbl 1221.05294 SIAM J. Comput. 39, No. 6, 2132-2161 (2010). MSC: 05C85 05C10 68U05 68W15 PDF BibTeX XML Cite \textit{I. A. Kanj} et al., SIAM J. Comput. 39, No. 6, 2132--2161 (2010; Zbl 1221.05294) Full Text: DOI
Kranakis, Evangelos; Krizanc, Danny; Ponce, Oscar Morales; Stacho, Ladislav Bounded length, 2-edge augmentation of geometric planar graphs. (English) Zbl 1310.68025 Wu, Weili (ed.) et al., Combinatorial optimization and applications. 4th international conference, COCOA 2010, Kailua-Kona, HI, USA, December 18–20, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-17457-5/pbk). Lecture Notes in Computer Science 6508, 385-397 (2010). MSC: 68M10 05C10 05C40 68M15 68R10 PDF BibTeX XML Cite \textit{E. Kranakis} et al., Lect. Notes Comput. Sci. 6508, 385--397 (2010; Zbl 1310.68025) Full Text: DOI
Xu, Xiaohua; Wang, Yuexuan; Du, Hongwei; Wan, Pengjun; Zou, Feng; Li, Xianyue; Wu, Weili Approximations for node-weighted Steiner tree in unit disk graphs. (English) Zbl 1202.90267 Optim. Lett. 4, No. 3, 405-416 (2010). MSC: 90C35 PDF BibTeX XML Cite \textit{X. Xu} et al., Optim. Lett. 4, No. 3, 405--416 (2010; Zbl 1202.90267) Full Text: DOI
Schneider, Johannes; Wattenhofer, Roger An optimal maximal independent set algorithm for bounded-independence graphs. (English) Zbl 1231.68092 Distrib. Comput. 22, No. 5-6, 349-361 (2010). MSC: 68M14 68R10 05C85 05C70 68W15 68Q17 PDF BibTeX XML Cite \textit{J. Schneider} and \textit{R. Wattenhofer}, Distrib. Comput. 22, No. 5--6, 349--361 (2010; Zbl 1231.68092) Full Text: DOI
Shang, Weiping; Wang, Xiumei; Hu, Xiaodong Roman domination and its variants in unit disk graphs. (English) Zbl 1209.68652 Discrete Math. Algorithms Appl. 2, No. 1, 99-105 (2010). MSC: 68W25 68R10 68Q25 PDF BibTeX XML Cite \textit{W. Shang} et al., Discrete Math. Algorithms Appl. 2, No. 1, 99--105 (2010; Zbl 1209.68652) Full Text: DOI
Shang, Weiping; Wan, Pengjun; Hu, Xiaodong Approximation algorithms for minimum broadcast schedule problem in wireless sensor networks. (English) Zbl 1181.90061 Front. Math. China 5, No. 1, 75-87 (2010). MSC: 90B18 PDF BibTeX XML Cite \textit{W. Shang} et al., Front. Math. China 5, No. 1, 75--87 (2010; Zbl 1181.90061) Full Text: DOI
Schneider, Johannes; Wattenhofer, Roger Coloring unstructured wireless multi-hop networks. (English) Zbl 1291.68297 Proceedings of the 28th annual ACM symposium on principles of distributed computing, PODC ’09, Calgary, AB, Canada, August 10–12, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-396-9). 210-219 (2009). MSC: 68R10 05C15 05C85 68Q17 68W15 68W20 PDF BibTeX XML Cite \textit{J. Schneider} and \textit{R. Wattenhofer}, in: Proceedings of the 28th annual ACM symposium on principles of distributed computing, PODC '09, Calgary, AB, Canada, August 10--12, 2009. New York, NY: Association for Computing Machinery (ACM). 210--219 (2009; Zbl 1291.68297) Full Text: DOI
Dragan, Feodor F.; Xiang, Yang; Yan, Chenyu Collective tree spanners for unit disk graphs with applications. (English) Zbl 1267.05255 Koster, Arie (ed.) et al., DIMAP workshop on algorithmic graph theory. Extended abstracts from the workshop held at the University of Warwick, Coventry, UK, March 23–25, 2009. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 32, 117-124 (2009). MSC: 05C85 PDF BibTeX XML Cite \textit{F. F. Dragan} et al., Electron. Notes Discrete Math. 32, 117--124 (2009; Zbl 1267.05255) Full Text: DOI
Damian, Mirela; Javali, Nagesh Distributed construction of low-interference spanners. (English) Zbl 1267.68031 Distrib. Comput. 22, No. 1, 15-28 (2009). MSC: 68M10 68M14 05C90 PDF BibTeX XML Cite \textit{M. Damian} and \textit{N. Javali}, Distrib. Comput. 22, No. 1, 15--28 (2009; Zbl 1267.68031) Full Text: DOI
Havet, Frédéric; Kang, Ross J.; Sereni, Jean-Sébastien Improper coloring of unit disk graphs. (English) Zbl 1207.05056 Networks 54, No. 3, 150-164 (2009). MSC: 05C15 05C85 05C90 05C10 PDF BibTeX XML Cite \textit{F. Havet} et al., Networks 54, No. 3, 150--164 (2009; Zbl 1207.05056) Full Text: DOI
Wiese, Andreas; Kranakis, Evangelos Local construction and coloring of spanners of location aware unit disk graphs. (English) Zbl 1194.05046 Discrete Math. Algorithms Appl. 1, No. 4, 555-588 (2009). MSC: 05C15 05C85 68W25 68W15 PDF BibTeX XML Cite \textit{A. Wiese} and \textit{E. Kranakis}, Discrete Math. Algorithms Appl. 1, No. 4, 555--588 (2009; Zbl 1194.05046) Full Text: DOI
Miyamoto, Y.; Matsui, T. Perfectness and imperfectness of unit disk graphs on triangular lattice points. (English) Zbl 1191.05050 Discrete Math. 309, No. 9, 2733-2744 (2009). MSC: 05C17 PDF BibTeX XML Cite \textit{Y. Miyamoto} and \textit{T. Matsui}, Discrete Math. 309, No. 9, 2733--2744 (2009; Zbl 1191.05050) Full Text: DOI
Zhang, Zhao; Gao, Xiaofeng; Wu, Weili PTAS for connected vertex cover in unit disk graphs. (English) Zbl 1192.68495 Theor. Comput. Sci. 410, No. 52, 5398-5402 (2009). MSC: 68R10 90C27 68W05 PDF BibTeX XML Cite \textit{Z. Zhang} et al., Theor. Comput. Sci. 410, No. 52, 5398--5402 (2009; Zbl 1192.68495) Full Text: DOI
Huang, Yaochun; Gao, Xiaofeng; Zhang, Zhao; Wu, Weili A better constant-factor approximation for weighted dominating set in unit disk graph. (English) Zbl 1184.05090 J. Comb. Optim. 18, No. 2, 179-194 (2009). MSC: 05C69 05C22 PDF BibTeX XML Cite \textit{Y. Huang} et al., J. Comb. Optim. 18, No. 2, 179--194 (2009; Zbl 1184.05090) Full Text: DOI
Yan, Chenyu; Xiang, Yang; Dragan, Feodor F. Compact and low delay routing labeling scheme for unit disk graphs. (English) Zbl 1252.05214 Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 566-577 (2009). MSC: 05C85 05C62 05C78 05C90 PDF BibTeX XML Cite \textit{C. Yan} et al., Lect. Notes Comput. Sci. 5664, 566--577 (2009; Zbl 1252.05214) Full Text: DOI
Lev-Tov, Nissan; Peleg, David Conflict-free coloring of unit disks. (English) Zbl 1186.68338 Discrete Appl. Math. 157, No. 7, 1521-1532 (2009). MSC: 68R10 68W05 68M10 PDF BibTeX XML Cite \textit{N. Lev-Tov} and \textit{D. Peleg}, Discrete Appl. Math. 157, No. 7, 1521--1532 (2009; Zbl 1186.68338) Full Text: DOI
Gao, Xiaofeng; Wang, Yuexuan; Li, Xianyue; Wu, Weili Analysis on theoretical bounds for approximating dominating set problems. (English) Zbl 1178.68680 Discrete Math. Algorithms Appl. 1, No. 1, 71-84 (2009). MSC: 68W25 05C69 05C90 68R10 90B18 PDF BibTeX XML Cite \textit{X. Gao} et al., Discrete Math. Algorithms Appl. 1, No. 1, 71--84 (2009; Zbl 1178.68680) Full Text: DOI
Czyzowicz, J.; Dobrev, S.; Kranakis, E.; Opatrny, J.; Urrutia, J. Local edge colouring of Yao-like subgraphs of unit disk graphs. (English) Zbl 1163.68032 Theor. Comput. Sci. 410, No. 14, 1388-1400 (2009). MSC: 68R10 PDF BibTeX XML Cite \textit{J. Czyzowicz} et al., Theor. Comput. Sci. 410, No. 14, 1388--1400 (2009; Zbl 1163.68032) Full Text: DOI
Dai, Decheng; Yu, Changyuan A \(5+\varepsilon\)-approximation algorithm for minimum weighted dominating set in unit disk graph. (English) Zbl 1162.68042 Theor. Comput. Sci. 410, No. 8-10, 756-765 (2009). MSC: 68W25 05C69 68R10 PDF BibTeX XML Cite \textit{D. Dai} and \textit{C. Yu}, Theor. Comput. Sci. 410, No. 8--10, 756--765 (2009; Zbl 1162.68042) Full Text: DOI
Emek, Yuval; Kantor, Erez; Peleg, David On the effect of the deployment setting on broadcasting in Euclidean radio networks. (English) Zbl 1301.68144 Proceedings of the 27th annual ACM symposium on principles of distributed computing, PODC ’08, Toronto, Canada, August 18–21, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-989-0). 223-232 (2008). MSC: 68Q17 05C21 05C85 68M10 68Q25 68R10 90B18 PDF BibTeX XML Cite \textit{Y. Emek} et al., in: Proceedings of the 27th annual ACM symposium on principles of distributed computing, PODC '08, Toronto, Canada, August 18--21, 2008. New York, NY: Association for Computing Machinery (ACM). 223--232 (2008; Zbl 1301.68144) Full Text: DOI
Schneider, Johannes; Wattenhofer, Roger Alog-star distributed Maximal Independent Set algorithm for growth-bounded graphs. (English) Zbl 1301.05341 Proceedings of the 27th annual ACM symposium on principles of distributed computing, PODC ’08, Toronto, Canada, August 18–21, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-989-0). 35-44 (2008). MSC: 05C85 05C15 05C69 68M10 68M14 68Q17 68W15 PDF BibTeX XML Cite \textit{J. Schneider} and \textit{R. Wattenhofer}, in: Proceedings of the 27th annual ACM symposium on principles of distributed computing, PODC '08, Toronto, Canada, August 18--21, 2008. New York, NY: Association for Computing Machinery (ACM). 35--44 (2008; Zbl 1301.05341) Full Text: DOI
Perković, Ljubomir; Kanj, Iyad A. On geometric spanners of Euclidean and unit disk graphs. (English) Zbl 1259.68163 Albers, Susanne (ed.) et al., STACS 2008. 25th international symposium on theoretical aspects of computer science, Bordeaux, France, February 21–23, 2008. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-06-4). LIPIcs – Leibniz International Proceedings in Informatics 1, 409-420, electronic only (2008). MSC: 68R10 68M10 05C10 PDF BibTeX XML Cite \textit{L. Perković} and \textit{I. A. Kanj}, LIPIcs -- Leibniz Int. Proc. Inform. 1, 409--420 (2008; Zbl 1259.68163) Full Text: DOI Link
Zhang, Zhao; Gao, Xiaofeng; Wu, Weili Polynomial time approximation scheme for connected vertex cover in unit disk graph. (English) Zbl 1168.68448 Yang, Boting (ed.) et al., Combinatorial optimization and applications. Second international conference, COCOA 2008, St. John’s, NL, Canada, August 21–24, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85096-0/pbk). Lecture Notes in Computer Science 5165, 255-264 (2008). MSC: 68R10 05C35 05C62 05C70 68W25 PDF BibTeX XML Cite \textit{Z. Zhang} et al., Lect. Notes Comput. Sci. 5165, 255--264 (2008; Zbl 1168.68448) Full Text: DOI