( en | de | ru )

 

Disambiguation of "Subramani, K."

Author of the publication

copydeleteadd this publication to your clipboard
Farkas Bounds on Horn Constraint Systems.

, , and . Theory Comput. Syst., 68 (2): 227-249 (April 2024)

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 Böhm

K Schweizerhof

K Schaber

K Beheng

 

Other publications of authors with the same name

Corrigendum to Ön the negative cost girth problem in planar networks" Journal of Discrete Algorithms 35 (2015) 40-50., and . J. Discrete Algorithms, (2016)Analytical models for risk-based intrusion response., , , and . Comput. Networks, 57 (10): 2181-2192 (2013)On the approximability of the Largest Sphere Rule Ensemble Classification problem., and . Inf. Process. Lett., 115 (11): 833-837 (2015)On using priced timed automata to achieve optimal scheduling., , and . Formal Methods Syst. Des., 29 (1): 97-114 (2006)A Parallel Implementation for the Negative Cost Girth Problem., and . Int. J. Parallel Program., 43 (2): 240-259 (2015)On the Shoshan-Zwick Algorithm for the All-Pairs Shortest Path Problem., , and . J. Graph Algorithms Appl., 21 (2): 177-181 (2017)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 quantified linear implications., , , and . Ann. Math. Artif. Intell., 71 (4): 301-325 (2014)On Partial Vertex Cover on Bipartite Graphs and Trees, and . CoRR, (2013)Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints., , and . Discret. Appl. Math., (2021)