From the 2 of 8 linked papers with an AI index.
8 papers
A tight lower bound for malicious online bipartite matching with limited recourse budget
Julia Baligacs, Bartłomiej Bosek, Paweł Putra +2
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 toget…
A lower bound of 4 for online graph exploration
Julia Baligacs
The paper proves that any online algorithm for graph exploration must have a competitive ratio of at least 4, improving the previous bound of 10/3, and shows that certain restricti…
Randomization Helps in Online Graph Exploration: Breaking the Deterministic Lower Bound on Cycles
Júlia Baligács, Jan HÄ zÅa, Lena Volk
The paper presents a randomized algorithm for online exploration of cycle graphs that achieves a competitive ratio of at most 1.315, surpassing the best possible deterministic rati…
A coarse block-cut tree theorem
Júlia Baligács, Václav Blažej, Jadwiga Czyżewska +2
We prove a coarse analogue of the classic fact that every graph can be decomposed along its cut-vertices into -connected components. Precisely, we prove that for every graph …
Temporal Cliques Admit Linear Spanners
Julia Baligacs
A temporal graph is a graph in which every edge carries a non-empty set of time labels, and it is temporally connected if for every two vertices and , there exists a -…
Inevitability of Polarization in Geometric Opinion Exchange
Abdou Majeed Alidou, Júlia Baligács, Max Hahn-Klimroth +3
Polarization and unexpected correlations between opinions on diverse topics (including in politics, culture and consumer choices) are an object of sustained attention. However, num…