The following pages link to Sujoy Bhore (Q779175):
Displayed 38 items.
- Geometric planar networks on bichromatic points (Q779176) (← links)
- Balanced independent and dominating sets on colored interval graphs (Q831789) (← links)
- Bottleneck bichromatic full Steiner trees (Q1628678) (← links)
- Geometric systems of unbiased representatives (Q2122784) (← links)
- Unit disk representations of embedded trees, outerplanar and multi-legged graphs (Q2151453) (← links)
- The balanced connected subgraph problem for geometric intersection graphs (Q2166729) (← links)
- Balanced connected subgraph problem in geometric intersection graphs (Q2180133) (← links)
- Parameterized algorithms for book embedding problems (Q2206870) (← links)
- Algorithms and hardness results for nearest neighbor problems in bicolored point sets (Q2294681) (← links)
- Algorithm and hardness results on liar's dominating set and \({k}\)-tuple dominating set (Q2301734) (← links)
- Monochromatic plane matchings in bicolored point set (Q2338213) (← links)
- Geometric planar networks on bichromatic collinear points (Q2664940) (← links)
- On fair covering and hitting problems (Q2672421) (← links)
- Parameterized study of Steiner tree on unit disk graphs (Q2700383) (← links)
- On Local Structures of Cubicity 2 Graphs (Q2958318) (← links)
- Planar bichromatic bottleneck spanning trees (Q4958386) (← links)
- Parameterized Algorithms for Queue Layouts (Q5014103) (← links)
- Euclidean Steiner Spanners: Light and Sparse (Q5043642) (← links)
- Parameterized Algorithms for Queue Layouts (Q5050001) (← links)
- Parameterized Algorithms for Book Embedding Problems (Q5141644) (← links)
- On a Special Class of Boxicity 2 Graphs (Q5174960) (← links)
- Planar Bichromatic Bottleneck Spanning Trees (Q5874461) (← links)
- (Q5874486) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5918733) (← links)
- The balanced connected subgraph problem (Q5918764) (← links)
- On Erdős-Szekeres-type problems for \(k\)-convex point sets (Q5918941) (← links)
- On Erdős-Szekeres-type problems for \(k\)-convex point sets (Q5919470) (← links)
- On the upward book thickness problem: combinatorial and complexity results (Q5925712) (← links)
- Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)
- Parameterized Study of Steiner Tree on Unit Disk Graphs (Q6059172) (← links)
- Online Euclidean Spanners (Q6075901) (← links)
- On colorful vertex and edge cover problems (Q6088300) (← links)
- Untangling circular drawings: algorithms and complexity (Q6101838) (← links)
- An Algorithmic Study of Fully Dynamic Independent Sets for Map Labeling (Q6127810) (← links)
- (Q6147516) (← links)
- On streaming algorithms for geometric independent set and clique (Q6176560) (← links)
- (Q6187831) (← links)
- Online Spanners in Metric Spaces (Q6195959) (← links)