Skip to content
GraphTheory.in

Kunal Dutta

University of WarsawIN
ORCID0000-0003-3055-9326
Claim this profile
h-index
6

via OpenAlex

Citations
111

via OpenAlex

Publications
22

About

Kunal Dutta is a researcher at the University of Warsaw, with a significant body of work spanning over 56 years, encompassing 22 publications. His research focuses on graph theory and network optimisation, as evident from titles such as 'On Induced Paths, Holes and Trees in Random Graphs' and 'Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets'. Dutta's publications have appeared in reputable venues like SIAM Journal on Discrete Mathematics, Discrete & Computational Geometry, and Combinatorica.

Research areas

  • Combinatorics
  • Mathematics
  • Computer science
  • Discrete mathematics
  • Mathematical analysis

Publications (22)

Sorted by most cited.

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

    2018

    View DOI
    11 cites

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

    SIAM Journal on Discrete Mathematics2023journal article

    View DOI
    1 cites

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

    LATIN 2010: Theoretical Informatics1970other

    View DOI
    1 cites

  4. On induced acyclic subgraphs in sparse random digraphs

    Electronic Notes in Discrete Mathematics1970journal article

    View DOI
    1 cites

  5. Near-Optimal Centerpoints in Polynomial Time in the Ambient Dimension

    2026book chapter

    View DOI
    0 cites

  6. Dimensionality reduction for k-distance applied to persistent homology

    Journal of Applied and Computational Topology2021journal article

    View DOI
    0 cites

  7. Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets

    Discrete & Computational Geometry2021journal article

    View DOI
    0 cites

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

    Discrete & Computational Geometry2019journal article

    View DOI
    0 cites

  9. A Simple Proof of Optimal Epsilon Nets

    Combinatorica2018journal article

    View DOI
    0 cites

  10. <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>,</mml:mo><mml:mi>j</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math>-set problem in graphs

    Discrete Mathematics2016journal article

    View DOI
    0 cites

  11. Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs

    SIAM Journal on Discrete Mathematics2016journal article

    View DOI
    0 cites

  12. Combinatorics of finite abelian groups and Weil representations

    Pacific Journal of Mathematics2015journal article

    View DOI
    0 cites

  13. Counting Independent Sets in Hypergraphs

    Combinatorics, Probability and Computing2014journal article

    View DOI
    0 cites

  14. Degeneration and orbits of tuples and subgroups in an abelian group

    Journal of Group Theory2013journal article

    View DOI
    0 cites

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

    SIAM Journal on Discrete Mathematics2012journal article

    View DOI
    0 cites

  16. Degenerations and orbits in finite abelian groups

    Journal of Combinatorial Theory, Series A2011journal article

    View DOI
    0 cites

  17. Induced acyclic subgraphs in random digraphs: Improved bounds

    Discrete Mathematics & Theoretical Computer Science2010journal article

    View DOI
    0 cites

  18. Uniform Brackets, Containers, and Combinatorial Macbeath Regions

    13th Innovations in Theoretical Computer Science Conference (ITCS 2022)1970conference paper

    View DOI
    0 cites

  19. Dimensionality Reduction for k-Distance Applied to Persistent Homology

    Leibniz International Proceedings in Informatics, LIPIcs1970journal article

    View DOI
    0 cites

  20. Randomized Incremental Construction of Delaunay Triangulations of Nice Point Sets

    Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany1970journal article

    View DOI
    0 cites

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

    Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany1970journal article

    View DOI
    0 cites

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

    Discussiones Mathematicae Graph Theory1970journal article

    View DOI
    0 cites