Abhiruk Lahiri

1. Geometric Dominating Set and Set Cover via Local Search
   2016/05/09 by Minati De, A. Lahiri, Abhiruk Lahiri +2 · 1 citation
   Computer Science · Mathematics · #Advanced Graph Theory Research #Artificial intelligence #Class (philosophy) #Combinatorics #Complexity and Algorithms in Graphs #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Computer science #Convex hull #Convex optimization #Convex set #Cover (algebra) #Discrete mathematics #Dominating set #FOS: Computer and information sciences #Geometry #Homothetic transformation #Intersection (aeronautics) #Mathematics #Object (grammar) #Plane (geometry) #Regular polygon #Set (abstract data type) #Set cover problem #cs.CG
2. Parameterized Convexity Testing
   2021/10/25 by Abhiruk Lahiri, Lahiri, Abhiruk, Ilan Newman +3 · 1 citation
   Computer Science · #68W20 #68W25 #Data Structures and Algorithms (cs.DS) #F.2 #FOS: Computer and information sciences #acm:68W20 #acm:68W25 #cs.DS #msc:68W20 #msc:68W25
3. On Comparable Box Dimension
   2022/03/15 by Zdenek Dvorák, Daniel Goncalves, Dvorák, Zdenek +7 · 1 citation
   Computer Science · Mathematics · #05C85 #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #acm:05C85 #cs.DM #cs.DS #math.CO #msc:05C85
4. Rainbow trees in uniformly edge-coloured graphs
   2021/05/18 by Elad Aigner-Horev, Dan Hefetz, Aigner-Horev, Elad +3 · 1 citation
   Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO