EUVIMEDEUVIMED entdecken
Crossref

Hardness and fixed parameter tractability for pinwheel scheduling problems

Yusuke Kobayashi, Bingkai Lin, Joseph Swernofsky

Theoretical Computer Science · 2026-07 · 1077 · 115998

DOI: 10.1016/j.tcs.2026.115998 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-07. Verfasst von Yusuke Kobayashi und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 36 Literaturangaben. Gefördert von: Japan Science and Technology Agency Strategic Basic Research Programs, Japan Society for the Promotion of Science.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • Japan Science and Technology Agency Strategic Basic Research Programs
  • Japan Society for the Promotion of Science

Zitieren

APA

Kobayashi, Y., Lin, B., & Swernofsky, J. (2026). Hardness and fixed parameter tractability for pinwheel scheduling problems. Theoretical Computer Science, 1077, 115998. https://doi.org/10.1016/j.tcs.2026.115998

Vancouver

Kobayashi Y, Lin B, Swernofsky J. Hardness and fixed parameter tractability for pinwheel scheduling problems. Theoretical Computer Science. 2026;1077:115998. doi:10.1016/j.tcs.2026.115998

BibTeX
@article{Kobayashi2026,
  author = {Kobayashi, Yusuke and Lin, Bingkai and Swernofsky, Joseph},
  title = {Hardness and fixed parameter tractability for pinwheel scheduling problems},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1077},
  pages = {115998},
  doi = {10.1016/j.tcs.2026.115998}
}
Kostenlos starten →