Skip to content
GraphTheory.in

Kunal Dutta

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

via OpenAlex

Citations
112

via OpenAlex

Publications
59

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 (59)

Sorted by most cited.

  1. A Simple Proof of Optimal Epsilon Nets

    Combinatorica2018journal article

    View DOI
    12 cites

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

    SIAM Journal on Discrete Mathematics2012journal article

    View DOI
    12 cites

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

    2018

    View DOI
    11 cites

  4. Effect of spin-orbit coupling in noncentrosymmetric half-Heusler alloys

    2023

    View DOI
    10 cites

  5. Degenerations and orbits in finite abelian groups

    Journal of Combinatorial Theory, Series A2011journal article

    View DOI
    9 cites

  6. <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
    8 cites

  7. Two Proofs for Shallow Packings

    2016

    View DOI
    6 cites

  8. Machine Learning-Based Prototype for Restaurant Rating Prediction and Cuisine Selection

    2020

    View DOI
    4 cites

  9. On Limit Constants in Last Passage Percolation in Transitive Tournaments

    2020

    View DOI
    4 cites

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

    Journal of Applied and Computational Topology2021journal article

    View DOI
    3 cites

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

    Discrete & Computational Geometry2021journal article

    View DOI
    3 cites

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

    Journal of Group Theory2013journal article

    View DOI
    3 cites

  13. Induced acyclic subgraphs in random digraphs: Improved bounds

    Discrete Mathematics & Theoretical Computer Science2010journal article

    View DOI
    3 cites

  14. Rashba and Zeeman splitting in non-magnetic and non-centrosymmetric MXene <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mrow><mml:msub><mml:mi>Ta</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:msub><mml:mi>CS</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:mrow></mml:math>

    2025

    View DOI
    2 cites

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

    Discrete & Computational Geometry2019journal article

    View DOI
    2 cites

  16. Two Proofs for Shallow Packings

    2015

    View DOI
    2 cites

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

    Discussiones Mathematicae Graph Theory1970journal article

    View DOI
    2 cites

  18. DiffRed: Dimensionality Reduction guided by stable rank

    2024

    View DOI
    1 cites

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

    SIAM Journal on Discrete Mathematics2023journal article

    View DOI
    1 cites

  20. Persistent Homology with Dimensionality Reduction: k-Distance vs Gaussian Kernels

    2018

    1 cites

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

    2018

    View DOI
    1 cites

  22. Associations of Obesity Indices with Cardiorespiratory Fitness in Bengali School Going Boys in India

    2017

    View DOI
    1 cites

  23. Kernelization of the Subset General Position Problem in Geometry

    2017

    View DOI
    1 cites

  24. On Subgraphs of Bounded Degeneracy in Hypergraphs

    2016

    View DOI
    1 cites

  25. Improved Bounds on Induced Acyclic Subgraphs in Random Digraphs

    SIAM Journal on Discrete Mathematics2016journal article

    View DOI
    1 cites

  26. Size sensitive packing number for Hamming cube and its consequences

    2014

    View DOI
    1 cites

  27. $(1,j)$-set problem in graphs

    2014

    View DOI
    1 cites

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

    LATIN 2010: Theoretical Informatics1970other

    View DOI
    1 cites

  29. On induced acyclic subgraphs in sparse random digraphs

    Electronic Notes in Discrete Mathematics1970journal article

    View DOI
    1 cites

  30. Uniform Brackets, Containers, and Combinatorial Macbeath Regions

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

    View DOI
    1 cites

  31. Coexistence of Rashba and Ising Spin-Singlet Pairings in Two-Dimensional IrTe$_{2}$

    2026

    0 cites

  32. RETRACTED: Constructive \(\ell_2\)-Discrepancy Minimization with Additive Deviations

    2026

    View DOI
    0 cites

  33. RETRACTION NOTICE: Constructive \(\ell_2\)-Discrepancy Minimization with Additive Deviations

    2026

    View DOI
    0 cites

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

    2026book chapter

    View DOI
    0 cites

  35. Constructive l2-Discrepancy Minimization with Additive Deviations

    2025

    View DOI
    0 cites

  36. Persistent Spin Textures in Nonpolar Chiral Systems

    2024

    View DOI
    0 cites

  37. On Edge Collapse of Random Simplicial Complexes

    2024

    View DOI
    0 cites

  38. A Euclidean Embedding for Computing Persistent Homology with Gaussian Kernels

    2024

    View DOI
    0 cites

  39. Effect of Spin Orbit Coupling in non-centrosymmetric half-Heusler alloys

    2023

    View DOI
    0 cites

  40. Dimensionality Reduction for Persistent Homology with Gaussian Kernels

    2023

    View DOI
    0 cites

  41. Sparse Geometric Set Systems and the Beck-Fiala Conjecture

    2023

    View DOI
    0 cites

  42. Strong Collapse of Random Simplicial Complexes

    2023

    View DOI
    0 cites

  43. Dimensionality Reduction for $k$-Distance Applied to Persistent Homology

    2021

    View DOI
    0 cites

  44. On Shallow Packings and Tusnády's Problem

    2021

    View DOI
    0 cites

  45. Contributors

    2021

    View DOI
    0 cites

  46. Team, Visitors, External Collaborators

    2018

    0 cites

  47. Tight kernels for covering and hitting:Point hyperplane cover and polynomial point hitting set

    2018

    0 cites

  48. Tight Kernels for Covering with Points and Polynomials

    2017

    0 cites

  49. A new asymmetric correlation inequality for Gaussian measure

    2016

    0 cites

  50. New Results - Algorithmic aspects of topological andgeometric data analysis

    2016

    0 cites

  51. Combinatorics of finite abelian groups and Weil representations

    Pacific Journal of Mathematics2015journal article

    View DOI
    0 cites

  52. On certain invariants of random digraphs and uniform hypergraphs[HBNI Th68]

    2014

    0 cites

  53. Counting Independent Sets in Hypergraphs

    Combinatorics, Probability and Computing2014journal article

    View DOI
    0 cites

  54. Induced acyclic subgraphs in random digraphs: Improved bounds

    2013

    0 cites

  55. New lower bounds for the independence number of sparse graphs and hypergraphs

    2011

    View DOI
    0 cites

  56. Enhanced Rendering of Anatomical Surface Structures using Fractal Interpolation

    1986

    View DOI
    0 cites

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

    Leibniz International Proceedings in Informatics, LIPIcs1970journal article

    View DOI
    0 cites

  58. 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

  59. 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