The following pages link to Satyabrata Jana (Q782175):
Displaying 18 items.
- Maximum bipartite subgraph of geometric intersection graphs (Q782177) (← links)
- Linear-size planar Manhattan network for convex point sets (Q824337) (← links)
- Balanced connected graph partition (Q831759) (← links)
- Collision-free routing problem with restricted L-path (Q2161235) (← links)
- The balanced connected subgraph problem for geometric intersection graphs (Q2166729) (← links)
- Balanced connected subgraph problem in geometric intersection graphs (Q2180133) (← links)
- Uniquely Restricted Matchings in Interval Graphs (Q3130447) (← links)
- The balanced connected subgraph problem (Q5918764) (← links)
- Covering and packing of rectilinear subdivision (Q5918965) (← links)
- Covering and packing of rectilinear subdivision (Q5919660) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)
- Partitioning subclasses of chordal graphs with few deletions (Q6144015) (← links)
- A Polynomial Kernel for Proper Helly Circular-arc Vertex Deletion (Q6516429) (← links)
- A polynomial kernel for proper Helly circular-arc vertex deletion (Q6547958) (← links)
- Maximum bipartite subgraphs of geometric intersection graphs (Q6552516) (← links)
- Parameterized approximation scheme for feedback vertex set (Q6647689) (← links)
- Cuts in Graphs with Matroid Constraints (Q6734242) (← links)
- Multivariate Exploration of Metric Dilation (Q6761566) (← links)
