( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parameterized Approximation Algorithms for Directed Steiner Network Problems.

, , и . CoRR, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Rajesh Saiju

Hybrid Power System Modelling - Simulation and Energy Management Unit Development. Uni Kassel, (2008)

Rajesh Chitta

Rajesh Saiju

Rajesh Narasimha

Rajesh Kolli

 

Другие публикации лиц с тем же именем

Refined Lower Bounds for Nearest Neighbor Condensation.. ALT, том 167 из Proceedings of Machine Learning Research, стр. 262-281. PMLR, (2022)A Tight Lower Bound for Planar Steiner Orientation., , и . Algorithmica, 81 (8): 3200-3216 (2019)List H-Coloring a Graph by Removing Few Vertices., , и . Algorithmica, 78 (1): 110-146 (2017)Algorithms and Hardness Results for Nearest Neighbor Problems in Bicolored Point Sets., , и . LATIN, том 10807 из Lecture Notes in Computer Science, стр. 80-93. Springer, (2018)Tight Bounds for Gomory-Hu-like Cut Counting., , и . WG, том 9941 из Lecture Notes in Computer Science, стр. 133-144. (2016)FPT Inapproximability of Directed Cut and Connectivity Problems., и . IPEC, том 148 из LIPIcs, стр. 8:1-8:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Shadowless Solutions for Fixed-Parameter Tractability of Directed Graphs., и . Encyclopedia of Algorithms, (2016)A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs.. CIAC, том 12701 из Lecture Notes in Computer Science, стр. 187-201. Springer, (2021)How Does Fairness Affect the Complexity of Gerrymandering?, , и . AAMAS, стр. 2869-2871. ACM, (2023)Towards a Theory of Parameterized Streaming Algorithms., и . IPEC, том 148 из LIPIcs, стр. 7:1-7:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)