( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Stressing is Better Than Relaxing for Negative Cost Cycle Detection in Networks.

. ADHOC-NOW, том 3738 из Lecture Notes in Computer Science, стр. 320-333. Springer, (2005)

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

K Kremer

K Seibert

K Beheng

 

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

On the Complexities of Selected Satisfiability and Equivalence Queries over Boolean Formulas and Inclusion Queries over Hulls.. Adv. Decis. Sci., (2009)Absorbing random walks and the NAE2SAT problem., и . Int. J. Comput. Math., 88 (3): 452-467 (2011)A Randomized Algorithm for BBCSPs in the Prover-Verifier Model.. ICTAC, том 4711 из Lecture Notes in Computer Science, стр. 455-466. Springer, (2007)Algorithmic Aspects of Risk Management., , и . Formal Modeling: Actors, Open Systems, Biological Systems, том 7000 из Lecture Notes in Computer Science, стр. 262-276. Springer, (2011)On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection., и . Appl. Math. Comput., 173 (1): 273-305 (2006)Boolean Functions as Models for Quantified Boolean Formulas., , и . J. Autom. Reason., 39 (1): 49-75 (2007)Differentiable Discrete Optimization Using Dataless Neural Networks., , и . COCOA (2), том 14462 из Lecture Notes in Computer Science, стр. 3-15. Springer, (2023)An Empirical Analysis of Feasibility Checking Algorithms for UTVPI Constraints., , , и . AAIM, том 11343 из Lecture Notes in Computer Science, стр. 111-123. Springer, (2018)Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs., , , и . IWOCA, том 12126 из Lecture Notes in Computer Science, стр. 395-408. Springer, (2020)Read-Once Resolutions in Horn Formulas., , и . FAW, том 11458 из Lecture Notes in Computer Science, стр. 100-110. Springer, (2019)