( en | de | ru )

 

Disambiguation of "Subramani, K."

Author of the publication

copydeleteadd this publication to your clipboard
Finding read-once resolution refutations in systems of 2CNF clauses.

, , and . Theor. Comput. Sci., (2018)

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 Schweizerhof

K Schaber

K Beheng

K Bier

 

Other publications of authors with the same name

A polyhedral projection procedure for Q2SAT.. Electron. Notes Discret. Math., (2001)Periodic Linear Programming with applications to real-time scheduling.. Math. Struct. Comput. Sci., 15 (2): 383-406 (2005)On the Design and Implementation of a Shared Memory Dispatcher for Partially Clairvoyant Schedulers., and . Int. J. Parallel Program., 36 (4): 386-411 (2008)A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints., and . Algorithmica, 81 (7): 2765-2794 (2019)On the complexity of and solutions to the minimum stopping and trapping set problems., , and . Theor. Comput. Sci., (2022)Finding read-once resolution refutations in systems of 2CNF clauses., , and . Theor. Comput. Sci., (2018)Distributed algorithms for partially clairvoyant dispatchers., , and . Clust. Comput., 11 (2): 115-131 (2008)New Results on Test-Cost Minimization in Database Migration., , , and . ALGOCLOUD, volume 13084 of Lecture Notes in Computer Science, page 38-55. Springer, (2021)Algorithmic Analysis of Priority-Based Bin Packing., , , and . CALDAM, volume 12601 of Lecture Notes in Computer Science, page 359-372. Springer, (2021)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)