3 papers
cs.DS2026
Not All Degree Constraints Are Created Equal when Computing Spanning Trees
Narek Bojikian, Alexander Firbas, Robert Ganian +2
We study the computation of minimum spanning trees subject to local degree constraints. Recent work (ICALP 2026) established that three natural formalizations of this problem share…
cs.CG2025
Flipping odd matchings in geometric and combinatorial settings
Oswin Aichholzer, Sofia Brenner, Joseph Dorfer +4
We study the problem of reconfiguring odd matchings, that is, matchings that cover all but a single vertex. Our reconfiguration operation is a so-called flip where the unmatched ve…
math.CO2024
Signotopes with few plus signs
Helena Bergold, Lukas Egeling, Hung. P. Hoang
Arrangements of pseudohyperplanes are widely studied in computational geometry. A rich subclass of pseudohyerplane arrangements, which has gained more attention in recent years, is…