The following pages link to Subhabrata Paul (Q294555):
Displaying 20 items.
- \((1, j)\)-set problem in graphs (Q294556) (← links)
- Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940) (← links)
- (Q1949114) (redirect page) (← links)
- Liar's domination in graphs: complexity and algorithm (Q1949115) (← links)
- Hardness results and approximation algorithm for total liar's domination in graphs (Q2015803) (← links)
- Transitivity on subclasses of bipartite graphs (Q2104170) (← links)
- Results on vertex-edge and independent vertex-edge domination (Q2168729) (← links)
- Existence of planar support for geometric hypergraphs using elementary techniques (Q2174599) (← links)
- On vertex-edge and independent vertex-edge domination (Q2180173) (← links)
- Linear kernels for \(k\)-tuple and liar's domination in bounded genus graphs (Q2403794) (← links)
- A linear time algorithm for liar's domination problem in proper interval graphs (Q2445259) (← links)
- Grid obstacle representation of graphs (Q2663991) (← links)
- CONNECTED LIAR'S DOMINATION IN GRAPHS: COMPLEXITY AND ALGORITHMS (Q2874035) (← links)
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q2948479) (← links)
- Algorithmic Aspects of Disjunctive Domination in Graphs (Q3196396) (← links)
- Uniformity of Point Samples in Metric Spaces Using Gap Ratio (Q5361233) (← links)
- (Q5500304) (← links)
- Construction of optimal binary Z-complementary code sets with new lengths using generalized Boolean function (Q6086197) (← links)
- A direct construction of even length ZCPs with large ZCZ ratio (Q6101848) (← links)
- On \(k\)-vertex-edge domination of graph (Q6146665) (← links)
