Aditi Dudeja

Postdoctoral Fellow
University of Salzburg
aditi.dudeja (at) plus (dot) ac (dot) at
aditi.dudeja (at) rutgers (dot) edu

About Me

I am a postdoc in the Big Data Algorithms Group at the University of Salzburg. Before this, I was a PhD student in the Computer Science Department of Rutgers University. My research interests are in graph algorithms.


Publications

Decremental Matching in General Weighted Graphs

In ICALP 2024 .

Full version: [arXiv]

Decremental Matching in General Graphs

with Sepehr Assadi, Aaron Bernstein.

In ICALP 2022 .

Full version: [pdf]

Slides: [pdf]

A Framework for Dynamic Matching in Weighted Graphs

with Aaron Bernstein, Zach Langley.

In STOC 2021 .

Full version: [pdf]

Talk (by Zach): [video]

Poster: [pdf]

Incremental SCC Maintenance in Sparse Graphs

with Aaron Bernstein, Seth Pettie.

In ESA 2021 .

Full version: [pdf]

Slides: [pdf]

Ruling Sets in Random Order and Adversarial Streams

with Sepehr Assadi.

In DISC 2021.

Talk: [video]

Slides: [pdf]

A Simple Semi-Streaming Algorithm for Global Minimum Cuts

with Sepehr Assadi.

In SOSA 2021.

Full version: [pdf]

Slides: [pdf]

Online Matching with Recourse: Random Edge Arrivals

with Aaron Bernstein.

In FSTTCS 2020.

Full version: [pdf]

Talk: [video]

Slides: [pdf]

Exact and FPT Algorithms for Max-Conflict Free Colouring in Hypergraphs

with Pradeesha Ashok, Sudeshna Kolay.

In ISAAC 2015.


Talks

Teaching

At Rutgers:

  • TA for CS 206: Introduction to Discrete Structures II, Summer 2021 and Summer 2022
  • TA for CS 205: Introduction to Discrete Structures I, Summer 2020
  • TA for CS 344: Algorithms, Fall 2019
  • TA for CS 508: Formal Languages and Automata, Spring 2018

At Salzburg:

Miscellaneous

From Summer 2019 to Fall 2020, I was a co-organizer of the Theory of Computation Reading Seminar.