Kamal Santra
2 indexed papers
Publications per year
Top categories
Frequent co-authors
Research Timeline
This paper studies the computational complexity of Maximum Edge Open Packing Problem in distance-hereditary, biconvex bipartite, and chordal graphs, providing polynomial-time algorithms and a fixed-parameter tractable algorithm.
This paper studies the Maximum Edge Open Packing problem on permutation graphs, interval graphs, and well-partitioned chordal graphs, introducing oriented star-conflict graphs and proving compatibility graph transitive orientations for the first two classes, and using a dynamic program over a partition tree for the third.
Papers
Maximum Edge Open Packing in Permutation, Interval, and Well-Partitioned Chordal Graphs
This paper studies the Maximum Edge Open Packing problem on permutation graphs, interval graphs, and well-partitioned chordal graphs, introducing oriented star-conflict graphs and proving compatibilit…