News

Two papers from BDAG were accepted to 51st EATCS International Colloquium on Automata, Languages and Programming

The following two papers from our group were accepted to 51st EATCS International Colloquium on Automata, Languages and Programming ( ICALP 2024):

  • “New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths” by Michal Dory, Sebastian Forster, Yasamin Nazari, and Tijn de Vos (preprint on  arXiv).
  • “Decremental Matching in General Weighted Graphs” by Aditi Dudeja (preprint on  arXiv). 

Congratulations!

51st EATCS International Colloquium on Automata