Kunal Dutta

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

On Edge Collapse of Random Simplicial Complexes.

[BibT_eX]

[DOI]

Soumik Dutta

Siddharth Pritam

Proceedings of the 40th International Symposium on Computational Geometry, 2024

DiffRed: Dimensionality reduction guided by stable rank.

[BibT_eX]

[DOI]

Prarabdh Shukla

Gagan Raj Gupta

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023

On Induced Paths, Holes, and Trees in Random Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2023

Strong Collapse of Random Simplicial Complexes.

[BibT_eX]

[DOI]

Soumik Dutta

Siddharth Pritam

CoRR, 2023

Sparse Geometric Set Systems and the Beck-Fiala Conjecture.

[BibT_eX]

[DOI]

CoRR, 2023

Dimensionality Reduction for Persistent Homology with Gaussian Kernels.

[BibT_eX]

[DOI]

CoRR, 2023

2022

Uniform Brackets, Containers, and Combinatorial Macbeath Regions.

[BibT_eX]

[DOI]

Shay Moran

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Dimensionality reduction for k-distance applied to persistent homology.

[BibT_eX]

[DOI]

Shreya Arya

Martin Lotz

J. Appl. Comput. Topol., 2021

Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets.

[BibT_eX]

[DOI]

Olivier Devillers

Marc Glisse

Discret. Comput. Geom., 2021

2020

On Limit Constants in Last Passage Percolation in Transitive Tournaments.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2019

2018

A Simple Proof of Optimal Epsilon Nets.

[BibT_eX]

[DOI]

Nabil H. Mustafa

Comb., 2018

Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set.

[BibT_eX]

[DOI]

Sudeshna Kolay

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

Kernelization of the Subset General Position Problem in Geometry.

[BibT_eX]

[DOI]

Sudeshna Kolay

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016

Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2016

(1, j)-set problem in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2016

Two Proofs for Shallow Packings.

[BibT_eX]

[DOI]

Esther Ezra

Discret. Comput. Geom., 2016

On Subgraphs of Bounded Degeneracy in Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

2014

Induced acyclic tournaments in random digraphs: Sharp concentration, thresholds and algorithms.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2014

Counting Independent Sets in Hypergraphs.

[BibT_eX]

[DOI]

Jeff Cooper

Dhruv Mubayi

Comb. Probab. Comput., 2014

Size sensitive packing number for Hamming cube and its consequences.

[BibT_eX]

[DOI]

CoRR, 2014

2012

New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Dhruv Mubayi

SIAM J. Discret. Math., 2012

2011

Degenerations and orbits in finite abelian groups.

[BibT_eX]

[DOI]

Amritanshu Prasad

J. Comb. Theory A, 2011

On induced acyclic subgraphs in sparse random digraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration.

[BibT_eX]

[DOI]