2 papers
cs.CC2026
Towards Optimal Prefix-Free Graph Construction: NP-Hardness and Structural Insights
Andrej Baláž, Alexandru Popa
Prefix-free parsing provides an efficient way to construct compressed representations of large and repetitive pangenomes and naturally induces a graph representation known as a pre…
cs.GT2026
Optimal Portfolio Compression for Priority-Proportional Clearing with Defaulting Costs
Gergely Csáji, Rareş-Ioan Mateiu, Alexandru Popa +1
We study financial networks where banks are connected through bilateral liabilities and may default when resources are insufficient to meet obligations. We consider both the standa…