Skip to content

Author

Paweł Putra

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

A tight lower bound for malicious online bipartite matching with limited recourse budget

We study one-sided online bipartite matching with recourse. In this setting, one side of a bipartite graph is known in advance, while vertices on the other side arrive online together with their incident edges. After each arrival, the algorithm must maintain a maximum-cardinality matching while minimizing the total num...

Júlia Baligács, B. Bosek, Paweł Putra et al. · 0 citations
Conference Aug 2026

Online and Incremental Fractional Vertex Cover on Trees

This paper presents an $\frac{11}{6} \approx 1.83$-competitive algorithm for trees in the more general edge arrival model and gives a 1.5-competitive algorithm and provide a matching lower bound.

Júlia Baligács, B. Bosek, Y. Disser et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.