Minati De

From MaRDI portal
Person:473191

Available identifiers

zbMath Open de.minatiMaRDI QIDQ473191

List of research outcomes





PublicationDate of PublicationType
Online geometric covering and piercing2024-10-07Paper
Online dominating set and coloring2024-09-16Paper
Online class cover problem2024-09-10Paper
Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\)2024-03-05Paper
Hitting geometric objects online via points in \(\mathbb{Z}^d\)2023-08-10Paper
Geometric dominating-set and set-cover via local-search2023-07-12Paper
https://portal.mardi4nfdi.de/entity/Q50095742021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q50027912021-07-28Paper
Convex-straight-skeleton Voronoi diagrams for segments and convex polygons2021-06-30Paper
Variations of largest rectangle recognition amidst a bichromatic point set2020-09-17Paper
Guarding polyhedral terrain by \(k\)-watchtowers2020-07-07Paper
Constant work-space algorithms for facility location problems2020-06-29Paper
A lower bound on the growth constant of polyaboloes on the Tetrakis lattice2020-02-24Paper
Range assignment of base-stations maximizing coverage area without interference2019-12-27Paper
Circular Separation Dimension of a Subclass of Planar Graphs2018-12-10Paper
Computing convex-straight-skeleton Voronoi diagrams for segments and convex polygons2018-10-04Paper
Rectilinear path problems in restricted memory setup2017-06-19Paper
Voronoi Diagram for Convex Polygonal Sites with Convex Polygon-Offset Distance Function2017-04-07Paper
Demand Hitting and Covering of Intervals2017-04-07Paper
https://portal.mardi4nfdi.de/entity/Q29575252017-01-26Paper
Rectilinear Path Problems in Restricted Memory Setup2015-02-19Paper
Approximation algorithms for maximum independent set of a unit disk graph2014-12-15Paper
APPROXIMATION ALGORITHMS FOR A VARIANT OF DISCRETE PIERCING SET PROBLEM FOR UNIT DISKS2014-12-01Paper
Prune-and-search with limited workspace2014-11-24Paper
Back-Up 2-Center on a Path/Tree/Cycle/Unicycle2014-09-26Paper
In-place algorithms for computing a largest clique in geometric intersection graphs2014-09-12Paper
An in-place min-max priority search tree2013-01-25Paper
In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs2012-07-16Paper

Research outcomes over time

This page was built for person: Minati De