1 citations · 1 across the 5 of their papers we have counts for
4 papers · 1 filter
Metric Planarity Testing is Hard
Anubhav Dhar, Debajyoti Kar, Sándor Kisfaludi-Bak +3
A key milestone in algorithmic graph theory is Hopcroft and Tarjan's 1974 linear-time algorithm for graph planarity testing. At a workshop in 2002, Linial and Rabinovich asked for…
Query-efficient winner prediction in district-based elections
Koustav De, Debajyoti Kar, Swagato Sanyal
In a district-based election, N voters are partitioned into k districts, and each voter votes for one of m candidates. Each district elects a winner using the plurality rule (i.e.…
On Linear-Size Guillotine-Separable Subsets of Fat Convex Objects, Disks, and Squares
Mark de Berg, Debajyoti Kar, Arindam Khan +1
Let be a family of pairwise disjoint objects in the plane. We say that a subset is \emph{separable} if it admits a sequence of gu…
Approximation Schemes and Structural Barriers for the Two-Dimensional Knapsack Problem with Rotations
Debajyoti Kar, Arindam Khan, Andreas Wiese
We study the two-dimensional (geometric) knapsack problem with rotations (2DKR), in which we are given a square knapsack and a set of rectangles with associated profits. The object…