Skip to main content

and
  1. No Access

    Article

    On the Stab Number of Rectangle Intersection Graphs

    We introduce the notion of stab number and exact stab number of rectangle intersection graphs, otherwise known as graphs of boxicity at most 2. A graph G is said to be a k-stabbable rectangle intersection graph, ...

    Dibyayan Chakraborty, Mathew C. Francis in Theory of Computing Systems (2020)

  2. No Access

    Article

    Bounds on the Bend Number of Split and Cocomparability Graphs

    A path is a simple, piecewise linear curve made up of alternating horizontal and vertical line segments in the plane. A k-bend path is a path made up of at most k + 1 line segments. A Bk-VPG representation of a g...

    Dibyayan Chakraborty, Sandip Das, Joydeep Mukherjee in Theory of Computing Systems (2019)

  3. No Access

    Article

    Frame selection for OCR from video stream of book flip**

    Optical Character Recognition (OCR) in video stream of flip** pages is a challenging task because flip** at random speed causes difficulties in identifying the frames that contain the open page image (OPI)...

    Dibyayan Chakraborty, Partha Pratim Roy in Multimedia Tools and Applications (2018)