( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Corrigendum to Ön the negative cost girth problem in planar networks" Journal of Discrete Algorithms 35 (2015) 40-50.

, и . J. Discrete Algorithms, (2016)

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.

Aman K K Bhasin

K Beheng

K Schweizerhof

K Schaber

K Bente

 

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

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., и . Int. J. Parallel Program., 36 (4): 386-411 (2008)Randomized algorithms for finding the shortest negative cost cycle in networks., , и . Discret. Appl. Math., (2018)Reachability problems in interval-constrained and cardinality-constrained graphs., , и . Discret. Math. Algorithms Appl., 15 (4): 2250110:1-2250110:26 (мая 2023)Finding read-once resolution refutations in systems of 2CNF clauses., , и . Theor. Comput. Sci., (2018)On the complexity of and solutions to the minimum stopping and trapping set problems., , и . Theor. Comput. Sci., (2022)A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints., и . Algorithmica, 81 (7): 2765-2794 (2019)Analyzing Unit Read-Once Refutations in Difference Constraint Systems., и . JELIA, том 12678 из Lecture Notes in Computer Science, стр. 147-161. Springer, (2021)Parameterized and Exact-Exponential Algorithms for the Read-Once Integer Refutation Problem in UTVPI Constraints., и . COCOA (2), том 14462 из Lecture Notes in Computer Science, стр. 377-389. Springer, (2023)