Crossref
Parameterized Complexity of Disconnected Matchings
Theoretical Computer Science · 2026-11 · 116309
DOI: 10.1016/j.tcs.2026.116309 ↗Kurz gefasst
Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-11. Verfasst von Sushmita Gupta und 4 weiteren Autor:innen. Die Arbeit nennt 16 Literaturangaben. Gefördert von: Indian Institute of Technology Jodhpur.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- Indian Institute of Technology Jodhpur
Zitieren
APA
Gupta, S., Jain, P., Kanesh, L., Modak, S., & Saurabh, S. (2026). Parameterized Complexity of Disconnected Matchings. Theoretical Computer Science, 116309. https://doi.org/10.1016/j.tcs.2026.116309
Vancouver
Gupta S, Jain P, Kanesh L, Modak S, Saurabh S. Parameterized Complexity of Disconnected Matchings. Theoretical Computer Science. 2026:116309. doi:10.1016/j.tcs.2026.116309
BibTeX
@article{Gupta2026,
author = {Gupta, Sushmita and Jain, Pallavi and Kanesh, Lawqueen and Modak, Sounak and Saurabh, Saket},
title = {Parameterized Complexity of Disconnected Matchings},
journal = {Theoretical Computer Science},
year = {2026},
pages = {116309},
doi = {10.1016/j.tcs.2026.116309}
}
EUVIMED