EUVIMEDEUVIMED entdecken
Crossref

Improved approximation for pathwidth one vertex deletion and parameterized complexity of its variants

Satyabrata Jana, Soumen Mandal, Ashutosh Rai, Saket Saurabh

Theoretical Computer Science · 2026-12 · 1088 · 116277

DOI: 10.1016/j.tcs.2026.116277 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-12. Verfasst von Satyabrata Jana und 3 weiteren Autor:innen. Die Arbeit nennt 30 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Jana, S., Mandal, S., Rai, A., & Saurabh, S. (2026). Improved approximation for pathwidth one vertex deletion and parameterized complexity of its variants. Theoretical Computer Science, 1088, 116277. https://doi.org/10.1016/j.tcs.2026.116277

Vancouver

Jana S, Mandal S, Rai A, Saurabh S. Improved approximation for pathwidth one vertex deletion and parameterized complexity of its variants. Theoretical Computer Science. 2026;1088:116277. doi:10.1016/j.tcs.2026.116277

BibTeX
@article{Jana2026,
  author = {Jana, Satyabrata and Mandal, Soumen and Rai, Ashutosh and Saurabh, Saket},
  title = {Improved approximation for pathwidth one vertex deletion and parameterized complexity of its variants},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1088},
  pages = {116277},
  doi = {10.1016/j.tcs.2026.116277}
}
Kostenlos starten →