Conference
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | An, Shinwoo | - |
| dc.contributor.author | OH, EUNJIN | - |
| dc.date.accessioned | 2022-03-02T05:42:17Z | - |
| dc.date.available | 2022-03-02T05:42:17Z | - |
| dc.date.created | 2022-03-02 | - |
| dc.date.issued | 2021-08-09 | - |
| dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/110029 | - |
| dc.description.abstract | Let P be a set of n points in the plane where each point p of P is associated with a radius r | - |
| dc.language | English | - |
| dc.publisher | Springer Science and Business Media Deutschland GmbH | - |
| dc.relation.isPartOf | 17th International Symposium on Algorithms and Data Structures, WADS 2021 | - |
| dc.relation.isPartOf | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | - |
| dc.title | Reachability Problems for Transmission Graphs | - |
| dc.type | Conference | - |
| dc.type.rims | CONF | - |
| dc.identifier.bibliographicCitation | 17th International Symposium on Algorithms and Data Structures, WADS 2021, pp.71 - 84 | - |
| dc.citation.conferenceDate | 2021-08-09 | - |
| dc.citation.conferencePlace | CN | - |
| dc.citation.conferencePlace | online | - |
| dc.citation.endPage | 84 | - |
| dc.citation.startPage | 71 | - |
| dc.citation.title | 17th International Symposium on Algorithms and Data Structures, WADS 2021 | - |
| dc.contributor.affiliatedAuthor | An, Shinwoo | - |
| dc.contributor.affiliatedAuthor | OH, EUNJIN | - |
| dc.identifier.scopusid | 2-s2.0-85113583050 | - |
| dc.description.journalClass | 1 | - |
| dc.description.journalClass | 1 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.