Finding an Even Simple Path in a Directed Planar Graph. - Zhivko Prodanov Nedev (SIAM J. Comput., 1999)

A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs. - Zhivko Prodanov Nedev; Peter T. Wood (J. Algorithms, 2000)

Optimization problems in the implementation of distributed mergesort on networked computers. - Zhivko Prodanov Nedev; Tao Gong; Bryan Hill (Parallel and Distributed Computing and Networks, 2004)

The Magnus-Derek game. - Zhivko Prodanov Nedev; S. Muthukrishnan 001 (Theor. Comput. Sci., 2008)

An algorithm for finding a nearly minimal balanced set in Fp. - Zhivko Prodanov Nedev (Math. Comput., 2009)

An O(n)-Round Strategy for the Magnus-Derek Game. - Zhivko Prodanov Nedev (Algorithms, 2010)