Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees

Abstract

Full Citation:

Narek Bojikian, Alexander Firbas, Robert Ganian, Hung Hoang, Krisztina Szilagyi. Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees. 53rd International Colloquium on Automata, Languages, and Programming, ICALP 2026, Royal Holloway, University of London, Egham, United Kingdom, July 7-10, 2026 (Sayan Bhattacharya and Danupon Nanongkai and Michael Benedikt and Gabriele Puppis), volume 374 of LIPIcs, pages 38:1-38:14, 2026, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Alexander Firbas

Alexander Firbas is a Project Assistant at the Algorithms and Complexity Group.

Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.

Phuc Hung Hoang

Phuc Hung Hoang is a Project Assistant at the Algorithms and Complexity Group.