Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Kamal Santra

Kamal Santra

2 indexed papers

Recent (6 mo)
2
With code
0
Influential cites
0
Benchmarked
0

Publications per year

2
26

Top categories

Discrete Math×2Combinatorics×2

Frequent co-authors

Gautam K. Das2×
Sriram Bhyravarapu1×

Research Timeline

2026
Algorithms for the Maximum Edge Open Packing Problem

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.

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 compatibility graph transitive orientations for the first two classes, and using a dynamic program over a partition tree for the third.

Highlighted terms show continued research focus across papers

Papers

cs.DMmath.COTheoreticalRecentAug 5, 2026

Maximum Edge Open Packing in Permutation, Interval, and Well-Partitioned Chordal Graphs

Gautam K. Das, Kamal Santra

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…

View →
math.COcs.DMTheoretical
Recent
Jun 26, 2026

Algorithms for the Maximum Edge Open Packing Problem

Sriram Bhyravarapu, Gautam K. Das, Kamal Santra

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-pa…

View →