The following pages link to Dibyayan Chakraborty (Q778516):
Displaying 26 items.
- On the stab number of rectangle intersection graphs (Q778517) (← links)
- Hardness and approximation for the geodetic set problem in some graph classes (Q779181) (← links)
- Bottleneck bichromatic full Steiner trees (Q1628678) (← links)
- Algorithms and complexity of \(s\)-club cluster vertex deletion (Q2115849) (← links)
- On dominating set of some subclasses of string graphs (Q2144448) (← links)
- Finding geometric representations of apex graphs is NP-hard (Q2154093) (← links)
- Dominating set on overlap graphs of rectangles intersecting a line (Q2300029) (← links)
- Approximating minimum dominating set on string graphs (Q2301546) (← links)
- Bounds on the bend number of split and cocomparability graphs (Q2322713) (← links)
- Triangle-free projective-planar graphs with diameter two: domination and characterization (Q2691564) (← links)
- On Local Structures of Cubicity 2 Graphs (Q2958318) (← links)
- On a Special Class of Boxicity 2 Graphs (Q5174960) (← links)
- On rectangle intersection graphs with stab number at most two (Q5919053) (← links)
- On rectangle intersection graphs with stab number at most two (Q5919634) (← links)
- Algorithms and complexity for geodetic sets on partial grids (Q6057850) (← links)
- (Q6065396) (← links)
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs (Q6145821) (← links)
- Finding geometric representations of apex graphs is \textsf{NP}-hard (Q6175518) (← links)
- Recognizing geometric intersection graphs stabbed by a line (Q6204544) (← links)
- Kempe Equivalent List Colorings Revisited (Q6507187) (← links)
- Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic? (Q6525086) (← links)
- Distance-based covering problems for graphs of given cyclomatic number (Q6546588) (← links)
- Cutting Barnette graphs perfectly is hard (Q6589850) (← links)
- Complexity and algorithms for isometric path cover on chordal graphs and beyond (Q6602428) (← links)
- Kempe equivalent list colorings revisited (Q6606328) (← links)
- Isometric path complexity of graphs (Q6647660) (← links)
