The following pages link to Rajesh Chitnis (Q259034):
Displayed 31 items.
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs (Q259037) (← links)
- On the \(SIG\)-dimension of trees under the \(L_\infty\)-metric (Q354411) (← links)
- A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- A tight lower bound for Steiner orientation (Q1625142) (← links)
- Can we create large \(k\)-cores by adding few edges? (Q1625143) (← links)
- A tight lower bound for planar Steiner orientation (Q1999967) (← links)
- Algorithms and hardness results for nearest neighbor problems in bicolored point sets (Q2294681) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- A tight lower bound for edge-disjoint paths on planar DAGs (Q2692724) (← links)
- Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q2843251) (← links)
- Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset (Q2862207) (← links)
- Fixed-Parameter and Approximation Algorithms: A New Look (Q2867077) (← links)
- Faster Exact Algorithms for Some Terminal Set Problems (Q2867080) (← links)
- A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract) (Q2946016) (← links)
- Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs (Q2963899) (← links)
- Parameterized Algorithms for Boxicity (Q3060748) (← links)
- Tight Bounds for Gomory-Hu-like Cut Counting (Q3181053) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Kernelization via Sampling with Applications to Finding Matchings and Related Problems in Dynamic Graph Streams (Q4575674) (← links)
- Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q4962189) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5009577) (← links)
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems (Q5032020) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Parameterized Streaming: Maximal Matching and Vertex Cover (Q5363104) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5384091) (← links)
- (Q5743512) (← links)
- Towards a theory of parameterized streaming algorithms (Q5875539) (← links)
- FPT Inapproximability of Directed Cut and Connectivity Problems (Q5875540) (← links)
- A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs (Q6158361) (← links)
- Sublinear-space streaming algorithms for estimating graph parameters on sparse graphs (Q6179417) (← links)