Twin-width and Polynomial Kernels-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Twin-width and Polynomial Kernels

Published:2022-04-19 Issue:11 Volume:84 Page:3300-3337
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Bonnet Édouard^ORCID,Kim Eun Jung^ORCID,Reinald Amadeus^ORCID,Thomassé Stéphan,Watrigant Rémi^ORCID

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

https://link.springer.com/content/pdf/10.1007/s00453-022-00965-5.pdf

Reference48 articles.

1. Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for dominating set. J. ACM 51(3), 363–384 (2004). https://doi.org/10.1145/990308.990309

2. Alon, N., Gutner, S.: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs. Algorithmica 54(4), 544–556 (2009). https://doi.org/10.1007/s00453-008-9204-0

3. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423–434 (2009). https://doi.org/10.1016/j.jcss.2009.04.001

4. Bonnet, É., Geniet, C., Kim, E.J., Thomassé, S., Watrigant, R.: Twin-width II: small classes. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1977–1996 (2021). https://doi.org/10.1137/1.9781611976465.118

5. Bonnet, É., Geniet, C., Kim, E. J., Thomassé, S., Watrigant, R.: Twin-width III: max independent set, min dominating set, and coloring. In: Bansal, N., Merelli, E., Worrell, J., (eds), 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), volume 198 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 35:1–35:20, Dagstuhl, Germany, 2021. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://drops.dagstuhl.de/opus/volltexte/2021/14104, https://doi.org/10.4230/LIPIcs.ICALP.2021.35

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Neighbourhood complexity of graphs of bounded twin-width;European Journal of Combinatorics;2024-01

2. Graphs of bounded twin-width are quasi-polynomially χ-bounded;Journal of Combinatorial Theory, Series B;2023-07

3. Distal Combinatorial Tools for Graphs of Bounded Twin-Width;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26

4. Bounds for the Twin-Width of Graphs;SIAM Journal on Discrete Mathematics;2022-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3