( en | de | ru )

 

Disambiguation of "Subramani, K."

Author of the publication

copydeleteadd this publication to your clipboard
On the Approximability of Path and Cycle Problems in Arc-Dependent Networks.

, , , and . CALDAM, volume 13179 of Lecture Notes in Computer Science, page 292-304. Springer, (2022)

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. You can also use the button next to the name to display some publications already assigned to the person.

Aman K K Bhasin

K Dugaev

K Pillen

K Tittmann

K Amann

 

Other publications of authors with the same name

On the lengths of tree-like and Dag-like cutting plane refutations of Horn constraint systems., and . Ann. Math. Artif. Intell., 90 (10): 979-998 (2022)On the computational complexity of read once resolution decidability in 2CNF formulas., , and . CoRR, (2016)Corrigendum to Ön the negative cost girth problem in planar networks" Journal of Discrete Algorithms 35 (2015) 40-50., and . J. Discrete Algorithms, (2016)On the analysis of optimization problems in arc-dependent networks., , and . Discret. Optim., (2022)Unit Refutations of Difference Constraint Systems., and . ECAI, volume 372 of Frontiers in Artificial Intelligence and Applications, page 2226-2233. IOS Press, (2023)A certifying algorithm for lattice point feasibility in a system of UTVPI constraints., and . J. Comb. Optim., 35 (2): 389-408 (2018)Analyzing the Reachability Problem in Choice Networks., , and . CPAIOR, volume 13292 of Lecture Notes in Computer Science, page 408-423. Springer, (2022)An Analysis of Zero-Clairvoyant Scheduling.. TACAS, volume 2280 of Lecture Notes in Computer Science, page 98-112. Springer, (2002)Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks.. ADHOC-NOW, volume 3738 of Lecture Notes in Computer Science, page 320-333. Springer, (2005)On the computational complexities of Quantified Integer Programming variants., , and . ISAIM, (2016)