@inproceedings{BFGHS26,
 author = {Narek Bojikian and Alexander Firbas and Robert Ganian and Hung Hoang and Krisztina Szilagyi},
 booktitle = {53rd International Colloquium on Automata, Languages, and Programming,
{ICALP} 2026, Royal Holloway, University of London, Egham, United
Kingdom, July 7-10, 2026},
 doi = {10.4230/LIPICS.ICALP.2026.38},
 editor = {Sayan Bhattacharya and
Danupon Nanongkai and
Michael Benedikt and
Gabriele Puppis},
 keywords = {PGD, ParAI},
 pages = {38:1–38:14},
 publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{ü}r Informatik},
 series = {LIPIcs},
 title = {Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees},
 url = {https://doi.org/10.4230/LIPIcs.ICALP.2026.38},
 volume = {374},
 year = {2026}
}