EUVIMEDEUVIMED entdecken
Crossref

Bicriteria FPT-approximation algorithms for vertex deletion to bounded degeneracy graphs

Tanmay Inamdar, Lawqueen Kanesh, R. Krithika, Harshil Mittal, Saket Saurabh

Theoretical Computer Science · 2026-07 · 1079 · 116019

DOI: 10.1016/j.tcs.2026.116019 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-07. Verfasst von Tanmay Inamdar und 4 weiteren Autor:innen. Die Arbeit nennt 15 Literaturangaben. Gefördert von: Horizon 2020 Framework Programme, European Research Council, Indian Institute of Technology Jodhpur.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Horizon 2020 Framework Programme
  • European Research Council
  • Indian Institute of Technology Jodhpur

Zitieren

APA

Inamdar, T., Kanesh, L., Krithika, R., Mittal, H., & Saurabh, S. (2026). Bicriteria FPT-approximation algorithms for vertex deletion to bounded degeneracy graphs. Theoretical Computer Science, 1079, 116019. https://doi.org/10.1016/j.tcs.2026.116019

Vancouver

Inamdar T, Kanesh L, Krithika R, Mittal H, Saurabh S. Bicriteria FPT-approximation algorithms for vertex deletion to bounded degeneracy graphs. Theoretical Computer Science. 2026;1079:116019. doi:10.1016/j.tcs.2026.116019

BibTeX
@article{Inamdar2026,
  author = {Inamdar, Tanmay and Kanesh, Lawqueen and Krithika, R. and Mittal, Harshil and Saurabh, Saket},
  title = {Bicriteria FPT-approximation algorithms for vertex deletion to bounded degeneracy graphs},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1079},
  pages = {116019},
  doi = {10.1016/j.tcs.2026.116019}
}
Kostenlos starten →