Skip to main content

2 Result(s)

within Mathematics Remove this filter Discrete Mathematics in Computer Science Remove this filter Dibyayan Chakraborty Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Cutting Barnette Graphs Perfectly is Hard

    A perfect matching cut is a perfect matching that is also a cutset, or equivalently a perfect matching containing an even number of edges on every cycle. The corresponding algorithmic problem, Perfect Matching Cu...

    Édouard Bonnet, Dibyayan Chakraborty… in Graph-Theoretic Concepts in Computer Scien… (2023)

  2. No Access

    Chapter and Conference Paper

    Approximating Minimum Dominating Set on String Graphs

    A string graph is an intersection graph of simple curves on the plane. For \(k\ge 0\) ,

    Dibyayan Chakraborty, Sandip Das… in Graph-Theoretic Concepts in Computer Scien… (2019)