( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A certifying algorithm for lattice point feasibility in a system of UTVPI constraints.

, и . J. Comb. Optim., 35 (2): 389-408 (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.

Aman K K Bhasin

K Schweizerhof

K Schaber

K Beheng

K Böhm

 

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

An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints., , , и . AAIM, том 11343 из Lecture Notes in Computer Science, стр. 111-123. Springer, (2018)An Optimal Algorithm for Computing the Integer Closure of UTVPI Constraints., и . WALCOM, том 9627 из Lecture Notes in Computer Science, стр. 154-165. Springer, (2016)Totally Clairvoyant Scheduling with Relative Timing Constraints.. VMCAI, том 3855 из Lecture Notes in Computer Science, стр. 398-411. Springer, (2006)Disjoint Clustering in Combinatorial Circuits., , и . IWOCA, том 11638 из Lecture Notes in Computer Science, стр. 201-213. Springer, (2019)Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs., , , и . IWOCA, том 12126 из Lecture Notes in Computer Science, стр. 395-408. Springer, (2020)Absorbing Random Walks and the NAE2SAT Problem.. FAW, том 5059 из Lecture Notes in Computer Science, стр. 89-100. Springer, (2008)Read-Once Resolutions in Horn Formulas., , и . FAW, том 11458 из Lecture Notes in Computer Science, стр. 100-110. Springer, (2019)Differentiable Discrete Optimization Using Dataless Neural Networks., , и . COCOA (2), том 14462 из Lecture Notes in Computer Science, стр. 3-15. Springer, (2023)A Graphical Theorem of the Alternative for UTVPI Constraints., и . ICTAC, том 9399 из Lecture Notes in Computer Science, стр. 328-345. Springer, (2015)Analyzing Selected Quantified Integer Programs.. IJCAR, том 3097 из Lecture Notes in Computer Science, стр. 342-356. Springer, (2004)