| Publication | Date of Publication | Type |
|---|
Fault tolerance in Euclidean committee selection
| 2025-01-06 | Paper |
Euclidean bottleneck Steiner tree is fixed-parameter tractable
| 2024-11-28 | Paper |
Approximate controllability for semilinear fractional stochastic evolution equations
Qualitative Theory of Dynamical Systems | 2024-10-25 | Paper |
Minimum-membership geometric set cover, revisited
| 2024-10-16 | Paper |
Subexponential Parameterized algorithms on disk graphs (extended abstract)
| 2024-07-19 | Paper |
Subexponential parameterized algorithms for cut and cycle hitting problems on \(H\)-minor-free graphs
| 2024-07-19 | Paper |
Dynamic geometric set cover, revisited
| 2024-07-19 | Paper |
A framework for approximation schemes on disk graphs
| 2024-05-14 | Paper |
True contraction decomposition and almost ETH-tight bipartization for unit-disk graphs
| 2024-05-14 | Paper |
Point separation and obstacle removal by finding and hitting odd cycles
| 2024-05-14 | Paper |
Mean Field Games with infinitely degenerate diffusion and non-coercive Hamiltonian
| 2023-11-16 | Paper |
Clustering what matters: optimal approximation for clustering with outliers
The Journal of Artificial Intelligence Research (JAIR) | 2023-10-23 | Paper |
Degenerate Mean Field Games with H\"ormander diffusion
| 2023-08-20 | Paper |
Searching for the closest-pair in a query translate
| 2022-07-18 | Paper |
New bounds for range closest-pair problems
Discrete \& Computational Geometry | 2022-06-03 | Paper |
Searching for the closest-pair in a query translate
| 2021-03-17 | Paper |
Range closest-pair search in higher dimensions
Computational Geometry | 2021-01-07 | Paper |
Approximate range closest-pair queries
Computational Geometry | 2020-10-23 | Paper |
New bounds for range closest-pair problems
| 2020-08-18 | Paper |
The most-likely skyline problem for stochastic points
Computational Geometry | 2020-03-23 | Paper |
Range closest-pair search in higher dimensions
Lecture Notes in Computer Science | 2020-01-16 | Paper |
On the expected diameter, width, and complexity of a stochastic convex hull
Computational Geometry | 2019-10-25 | Paper |
An improved quicksort algorithm based on tissue-like P systems with promoters
| 2019-10-10 | Paper |
Inverse-problem-based accuracy control for arbitrary-resolution fairing of quasiuniform cubic B-spline curves
Mathematical Problems in Engineering | 2019-02-08 | Paper |
On the separability of stochastic geometric objects, with applications
Computational Geometry | 2018-10-31 | Paper |
On the separability of stochastic geometric objects, with applications
| 2018-01-30 | Paper |
Stochastic closest-pair problem and most-likely nearest-neighbor search in tree spaces
| 2017-09-22 | Paper |
On the expected diameter, width, and complexity of a stochastic convex-hull
Lecture Notes in Computer Science | 2017-09-22 | Paper |
On the arrangement of stochastic lines in \(\mathbb{R}^2\)
Journal of Discrete Algorithms | 2017-07-13 | Paper |
Linear hypothesis based accuracy control for multi-resolution fairing
| 2016-08-10 | Paper |
Lattice based communication P systems with applications in cluster analysis
Soft Computing | 2015-12-02 | Paper |
Spatial cluster analysis by the bin-packing problem and DNA computing technique
Discrete Dynamics in Nature and Society | 2013-06-13 | Paper |
