Exact and parameterized algorithms for window width minimization in bipartite arrangement
Theoretical Computer Science · 2026-07 · 1078 · 116012
DOI: 10.1016/j.tcs.2026.116012 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-07. Verfasst von Shashank Chauhan und 3 weiteren Autor:innen. Die Arbeit nennt 16 Literaturangaben. Gefördert von: IIT Indore, IIT Jodhpur, Department of Science and Technology.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- IIT Indore
- IIT Jodhpur
- Department of Science and Technology
Zitieren
APA
Chauhan, S., Inamdar, T., Kanesh, L., & Roy, S. (2026). Exact and parameterized algorithms for window width minimization in bipartite arrangement. Theoretical Computer Science, 1078, 116012. https://doi.org/10.1016/j.tcs.2026.116012
Vancouver
Chauhan S, Inamdar T, Kanesh L, Roy S. Exact and parameterized algorithms for window width minimization in bipartite arrangement. Theoretical Computer Science. 2026;1078:116012. doi:10.1016/j.tcs.2026.116012
BibTeX
@article{Chauhan2026,
author = {Chauhan, Shashank and Inamdar, Tanmay and Kanesh, Lawqueen and Roy, Sanjukta},
title = {Exact and parameterized algorithms for window width minimization in bipartite arrangement},
journal = {Theoretical Computer Science},
year = {2026},
volume = {1078},
pages = {116012},
doi = {10.1016/j.tcs.2026.116012}
}
EUVIMED