EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Covering and partitioning of split, chain and cographs with isometric paths

Dibyayan Chakraborty, Haiko Müller, Sebastian Ordyniak, Fahad Panolan, Mateusz Rychlicki

Theoretical Computer Science · 2026-06 · 1075 · 115910

DOI: 10.1016/j.tcs.2026.115910 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-06. Verfasst von Dibyayan Chakraborty und 4 weiteren Autor:innen. Die Arbeit nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Chakraborty, D., Müller, H., Ordyniak, S., Panolan, F., & Rychlicki, M. (2026). Covering and partitioning of split, chain and cographs with isometric paths. Theoretical Computer Science, 1075, 115910. https://doi.org/10.1016/j.tcs.2026.115910

Vancouver

Chakraborty D, Müller H, Ordyniak S, Panolan F, Rychlicki M. Covering and partitioning of split, chain and cographs with isometric paths. Theoretical Computer Science. 2026;1075:115910. doi:10.1016/j.tcs.2026.115910

BibTeX
@article{Chakraborty2026,
  author = {Chakraborty, Dibyayan and Müller, Haiko and Ordyniak, Sebastian and Panolan, Fahad and Rychlicki, Mateusz},
  title = {Covering and partitioning of split, chain and cographs with isometric paths},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1075},
  pages = {115910},
  doi = {10.1016/j.tcs.2026.115910}
}
Kostenlos starten →