A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
RAIRO-Theor. Inf. Appl., 45 3 (2011) 331-346
Published online: 2011-09-05
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Akane: Perplexity-Guided Time Series Data Cleaning
Xiaoyu Han, Haoran Xiong, Zhenying He, Peng Wang, Chen Wang and X. Sean WangProceedings of the ACM on Management of Data 2 (3) 1 (2024)
https://doi.org/10.1145/3654993
49 (2024)
https://doi.org/10.1007/978-3-031-62776-7_3
Space-efficient algorithms for reachability in directed geometric graphs
Sujoy Bhore and Rahul JainTheoretical Computer Science 961 113938 (2023)
https://doi.org/10.1016/j.tcs.2023.113938
On the Tractability of Covering a Graph with 2-Clubs
Riccardo Dondi and Manuel LafondAlgorithmica 85 (4) 992 (2023)
https://doi.org/10.1007/s00453-022-01062-3
Harmonic functions of polynomial growth on infinite penny graphs
Zunwu He and Bobo HuaJournal of the London Mathematical Society 105 (1) 565 (2022)
https://doi.org/10.1112/jlms.12529
Discrete Harmonic Functions on Infinite Penny Graphs
Bobo HuaVietnam Journal of Mathematics 49 (2) 461 (2021)
https://doi.org/10.1007/s10013-020-00471-7
11651 243 (2019)
https://doi.org/10.1007/978-3-030-25027-0_17
11904 216 (2019)
https://doi.org/10.1007/978-3-030-35802-0_17
Combinatorial Algorithms
Riccardo Dondi, Giancarlo Mauri, Florian Sikora and Italo ZoppisLecture Notes in Computer Science, Combinatorial Algorithms 10979 153 (2018)
https://doi.org/10.1007/978-3-319-94667-2_13