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:40:33Z | - |
| dc.date.available | 2022-03-02T05:40:33Z | - |
| dc.date.created | 2022-03-02 | - |
| dc.date.issued | 2021-12-07 | - |
| dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/110013 | - |
| dc.description.abstract | In this paper, we present an algorithm for computing a feedback vertex set of a unit disk graph of size k, if it exists, which runs in time 2 | - |
| dc.language | English | - |
| dc.publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing | - |
| dc.relation.isPartOf | 32nd International Symposium on Algorithms and Computation, ISAAC 2021 | - |
| dc.relation.isPartOf | Leibniz International Proceedings in Informatics, LIPIcs | - |
| dc.title | Feedback Vertex Set on Geometric Intersection Graphs | - |
| dc.type | Conference | - |
| dc.type.rims | CONF | - |
| dc.identifier.bibliographicCitation | 32nd International Symposium on Algorithms and Computation, ISAAC 2021 | - |
| dc.citation.conferenceDate | 2021-12-06 | - |
| dc.citation.conferencePlace | JA | - |
| dc.citation.conferencePlace | online | - |
| dc.citation.title | 32nd International Symposium on Algorithms and Computation, ISAAC 2021 | - |
| dc.contributor.affiliatedAuthor | An, Shinwoo | - |
| dc.contributor.affiliatedAuthor | Oh, Eunjin | - |
| dc.identifier.scopusid | 2-s2.0-85122461380 | - |
| dc.description.journalClass | 1 | - |
| dc.description.journalClass | 1 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.