Kunal Dutta

According to our database1, Kunal Dutta authored at least 19 papers between 2010 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
On Limit Constants in Last Passage Percolation in Transitive Tournaments.
CoRR, 2020

Dimensionality Reduction for k-Distance Applied to Persistent Homology.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning.
Discret. Comput. Geom., 2019

Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
A Simple Proof of Optimal Epsilon Nets.
Comb., 2018

Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

On Induced Paths, Holes and Trees in Random Graphs.
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017
Kernelization of the Subset General Position Problem in Geometry.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

2016
Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs.
SIAM J. Discret. Math., 2016

(1, j)-set problem in graphs.
Discret. Math., 2016

Two Proofs for Shallow Packings.
Discret. Comput. Geom., 2016

On Subgraphs of Bounded Degeneracy in Hypergraphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

2014
Induced acyclic tournaments in random digraphs: Sharp concentration, thresholds and algorithms.
Discuss. Math. Graph Theory, 2014

Counting Independent Sets in Hypergraphs.
Comb. Probab. Comput., 2014

Size sensitive packing number for Hamming cube and its consequences.
CoRR, 2014

2012
New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs.
SIAM J. Discret. Math., 2012

2011
Degenerations and orbits in finite abelian groups.
J. Comb. Theory, Ser. A, 2011

On induced acyclic subgraphs in sparse random digraphs.
Electron. Notes Discret. Math., 2011

2010
Largest Induced Acyclic Tournament in Random Digraphs: A 2-Point Concentration.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010


  Loading...