Mayank Goswami
Scholar

Mayank Goswami

Google Scholar ID: f5iIqDgAAAAJ
Associate Professor, Queens College, City University of New York
AlgorithmsData StructuresGeometryNetworks.
Citations & Impact
All-time
Citations
928
 
H-index
12
 
i10-index
13
 
Publications
20
 
Co-authors
19
list available
Resume (English only)
Academic Achievements
  • - Publications:
  • - A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems (Best Paper Award!)
  • - Computing Diverse and Nice Triangulations
  • - Vantage Point Selection Algorithms for Bottleneck Capacity Estimation
  • - A Theoretical Study of Neural Network Expressive Power via Manifold Topology
  • - Algorithms for the Diverse-k-SAT problem: the geometry of satisfying assignments
  • - On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
  • - An Algorithm for Bichromatic Sorting with Polylog Competitive Ratio
  • - On the Existence of a Trojaned Twin Model
  • - Learning to Segment from Noisy Annotations: A Spatial Correction Approach
  • - Program Committees: SODA 2026, ISAAC 2025, FWCG 2024, 2018, 2017, 2016, ICPP 2017
Research Experience
  • - Associate Professor, Department of Computer Science, CUNY Queens College
  • - CUNY Graduate Center
  • - Hosted the Fall Workshop on Computational Geometry (FWCG) in October 2018 and November 2025
  • - Organizes the Computer Science Seminar, Q4C (Queens College CS Colloquium)
Education
  • - Ph.D. in Applied Mathematics and Statistics from Stony Brook University, New York, Advisors: Joe Mitchell and David Gu
  • - Researcher at Max-Planck Institute for Informatics, Germany, in the Algorithms and Complexity group headed by Kurt Mehlhorn
  • - B.Math. from Indian Statistical Institute, Bangalore, India
Background
  • Research Interests: Algorithms (sorting, searching, binary search trees, succinct data structures and variants of Bloom filters, graph problems, I/O efficient algorithms, lower bounds), Computational geometry and algorithms for geometric databases, Theoretical machine learning (removing noisy labels, generalization performance), Conformal geometry, Teichmuller theory, and harmonic measure.
Miscellany
  • Ph.D. and Postdoc Positions available! Requirements for the Ph.D. position are a strong mathematical foundation and knowledge of algorithm design. Requirements for the Postdoctoral position are a strong record of publication in top theoretical CS or ML venues. Email me if interested.