Tanmay Inamdar

Forsker

Vitenskapelig artikkel

Vis forfatter(e) (2022). Non-Uniform k-Center and Greedy Clustering. Leibniz International Proceedings in Informatics. 1-20.
Vis forfatter(e) (2022). Near-optimal clustering in the k-machine model. Theoretical Computer Science. 80-97.
Vis forfatter(e) (2022). Exact Exponential Algorithms for Clustering Problems. Leibniz International Proceedings in Informatics. 1-14.
Vis forfatter(e) (2022). Algorithms for covering multiple submodular constraints and applications. Journal of combinatorial optimization. 979-1010.
Vis forfatter(e) (2022). Algorithms for Intersection Graphs for t-Intervals and t-Pseudodisks. Theory of Computing. 1-19.
Vis forfatter(e) (2022). (Re)packing Equal Disks into Rectangle. Leibniz International Proceedings in Informatics. 1-17.

Vis forfatter(e) (2021). ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. Leibniz International Proceedings in Informatics. 21:1-21:16.