Author of the publication

On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight.

, , , and . Optim. Lett., 10 (6): 1203-1220 (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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Privacy Awareness Diffusion in Social Networks., and . IEEE Secur. Priv., 13 (6): 44-50 (2015)Random Constraint Satisfaction: A More Accurate Picture., , , , , and . Constraints An Int. J., 6 (4): 329-344 (2001)On a new edge function on complete weighted graphs and its application for locating Hamiltonian cycles of small weight., , , and . Optim. Lett., 10 (6): 1203-1220 (2016)Review of "Probability and Computing: Randomized Algorithms and Probabilitic Analysis by Michael Mitzenmacher and Eli Upfal", Cambridge University Press, 2005.. SIGACT News, 38 (3): 22-27 (2007)Approximating the unsatisfiability threshold of random formulas., , , and . Random Struct. Algorithms, 12 (3): 253-269 (1998)Monotonicity and inert fugitive search games., and . Electron. Notes Discret. Math., (1999)A Note on the Non-Colorability Threshold of a Random Graph., , and . Electron. J. Comb., (2000)A Probabilistic Key Agreement Scheme for Sensor Networks without Key Predistribution., , , and . ICGS3/e-Democracy, volume 99 of Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, page 72-79. Springer, (2011)Trust in global computing systems as a limit property emerging from short range random interactions., , , and . ARES, page 741-748. IEEE Computer Society, (2007)On the Use of Weber Polynomials in Elliptic Curve Cryptography., , and . EuroPKI, volume 3093 of Lecture Notes in Computer Science, page 335-349. Springer, (2004)