The following pages link to Arijit Ghosh (Q294554):
Displaying 50 items.
- \((1, j)\)-set problem in graphs (Q294556) (← links)
- Triangulating smooth submanifolds with light scaffolding (Q655155) (← links)
- Two proofs for shallow packings (Q728497) (← links)
- On triangle estimation using tripartite independent set queries (Q825973) (← links)
- Only distances are required to reconstruct submanifolds (Q1693317) (← links)
- An obstruction to Delaunay triangulations in Riemannian manifolds (Q1702353) (← links)
- A simple proof of optimal epsilon nets (Q1715082) (← links)
- Delaunay triangulation of manifolds (Q1750387) (← links)
- Fixed parameter tractability of graph deletion problems over data streams (Q2019516) (← links)
- Local conditions for triangulating submanifolds of Euclidean space (Q2046445) (← links)
- Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond (Q2159471) (← links)
- Existence of planar support for geometric hypergraphs using elementary techniques (Q2174599) (← links)
- Tight kernels for covering and hitting: point hyperplane cover and polynomial point hitting set (Q2294690) (← links)
- Delaunay simplices in diagonally distorted lattices (Q2331209) (← links)
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
- Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning (Q2415378) (← links)
- Manifold reconstruction using tangential Delaunay complexes (Q2441577) (← links)
- Grid obstacle representation of graphs (Q2663991) (← links)
- Local criteria for triangulating general manifolds (Q2679601) (← links)
- Stability of Delaunay-type structures for manifolds (Q2874584) (← links)
- THE STABILITY OF DELAUNAY TRIANGULATIONS (Q2875645) (← links)
- DELAUNAY STABILITY VIA PERTURBATIONS (Q2939918) (← links)
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q2948479) (← links)
- On Subgraphs of Bounded Degeneracy in Hypergraphs (Q3181066) (← links)
- A Probabilistic Approach to Reducing Algebraic Complexity of Delaunay Triangulations (Q3452821) (← links)
- (Q4580113) (← links)
- (Q5009595) (← links)
- FPT Algorithms for Embedding into Low-Complexity Graphic Metrics (Q5053040) (← links)
- (Q5091015) (← links)
- (Q5111239) (← links)
- Local criteria for triangulation of manifolds (Q5115776) (← links)
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q5361233) (← links)
- Two Proofs for Shallow Packings (Q5368679) (← links)
- Manifold reconstruction using tangential Delaunay complexes (Q5405897) (← links)
- Triangle Estimation Using Tripartite Independent Set Queries. (Q5875580) (← links)
- A new synergistic strategy for ranking restaurant locations: A decision-making approach based on the hexagonal fuzzy numbers (Q6041226) (← links)
- Covering almost all the layers of the hypercube with multiplicities (Q6041856) (← links)
- Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond (Q6062144) (← links)
- (Q6070387) (← links)
- (Q6090876) (← links)
- Interplay Between Graph Isomorphism and Earth Mover’s Distance in the Query and Communication Worlds (Q6090911) (← links)
- Almost optimal query algorithm for hitting set using a subset query (Q6113278) (← links)
- (Q6126292) (← links)
- Small vertex cover helps in fixed-parameter tractability of graph deletion problems over data streams (Q6185609) (← links)
- Faster counting and sampling algorithms using colorful decision oracle (Q6490963) (← links)
- Heterochromatic Geometric Transversals of Convex sets (Q6508272) (← links)
- Countably Colorful Hyperplane Transversal (Q6521959) (← links)
- Tolerant bipartiteness testing in dense graphs (Q6560865) (← links)
- Exploring the gap between tolerant and non-tolerant distribution testing (Q6591877) (← links)
- Counting and sampling from substructures using linear algebraic queries (Q6604609) (← links)
