Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/101335
PIRA download icon_1.1View/Download Full Text
DC FieldValueLanguage
dc.contributorDepartment of Computingen_US
dc.creatorCao, Yen_US
dc.creatorYuan, Hen_US
dc.creatorWang, Jen_US
dc.date.accessioned2023-09-05T02:39:18Z-
dc.date.available2023-09-05T02:39:18Z-
dc.identifier.isbn978-3-95977-292-1en_US
dc.identifier.urihttp://hdl.handle.net/10397/101335-
dc.language.isoenen_US
dc.publisherSchloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishingen_US
dc.rights© Yixin Cao, Hanchun Yuan, and Jianxin Wang; licensed under Creative Commons License CC-BY 4.0 (https://creativecommons.org/licenses/by/4.0/)en_US
dc.rightsThe following publication Cao, Y., Yuan, H., & Wang, J. (2023). Modification Problems Toward Proper (Helly) Circular-Arc Graphs. In J. Leroux, S. Lombardy, & D. Peleg (Eds.), 48th International Symposium on Mathematical Foundations of Computer Science : MFCS 2023, August 28 to September 1, 2023, Bordeaux, France (pp. 31:1-31:14). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing is available at https://doi.org/10.4230/LIPIcs.MFCS.2023.31.en_US
dc.subjectproper (Helly) circular-arc graphen_US
dc.subjectGraph modification problemen_US
dc.titleModification problems toward proper (helly) circular-arc graphsen_US
dc.typeConference Paperen_US
dc.identifier.spage31:1en_US
dc.identifier.epage31:14en_US
dc.identifier.doi10.4230/LIPIcs.MFCS.2023.31en_US
dcterms.abstractWe present a 9^k ⋅ n^O(1)-time algorithm for the proper circular-arc vertex deletion problem, resolving an open problem of van ’t Hof and Villanger [Algorithmica 2013] and Crespelle et al. [Computer Science Review 2023]. Our structural study also implies parameterized algorithms for modification problems toward proper Helly circular-arc graphs.en_US
dcterms.accessRightsopen accessen_US
dcterms.bibliographicCitationIn J Leroux, S Lombardy, & D Peleg (Eds.), 48th International Symposium on Mathematical Foundations of Computer Science : MFCS 2023, August 28 to September 1, 2023, Bordeaux, France, p. 31:1-31:14. Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2023.en_US
dcterms.issued2023-
dc.relation.ispartofbook48th International Symposium on Mathematical Foundations of Computer Science : MFCS 2023, August 28 to September 1, 2023, Bordeaux, Franceen_US
dc.relation.conferenceInternational Symposium on Mathematical Foundations of Computer Science [MFCS]en_US
dc.publisher.placeSaarbrücken/Wadern, Germanyen_US
dc.identifier.artn31en_US
dc.description.validate202309 bcchen_US
dc.description.oaVersion of Recorden_US
dc.identifier.FolderNumbera2392-
dc.identifier.SubFormID47608-
dc.description.fundingSourceRGCen_US
dc.description.fundingSourceOthersen_US
dc.description.fundingTextnsfcen_US
dc.description.pubStatusPublisheden_US
dc.description.oaCategoryCCen_US
Appears in Collections:Conference Paper
Files in This Item:
File Description SizeFormat 
Cao_Modification_Problems_Proper.pdf717.75 kBAdobe PDFView/Open
Open Access Information
Status open access
File Version Version of Record
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Page views

154
Last Week
6
Last month
Citations as of Nov 9, 2025

Downloads

70
Citations as of Nov 9, 2025

SCOPUSTM   
Citations

1
Citations as of Jun 21, 2024

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.