NC Algorithms for Recognizing Partial 2-Trees and 3-Trees. - Daniel Granot; Darko Skorin-Kapov (SIAM J. Discret. Math., 1991)

On a cost allocation problem arising from a capacitated concentrator covering problem. - Darko Skorin-Kapov (Oper. Res. Lett., 1993)

On Some Optimization Problems on k-Trees and Partial k-Trees. - Daniel Granot; Darko Skorin-Kapov (Discret. Appl. Math., 1994)

On minimum cost isolated failure immune networks. - Héctor Fernando Beltrán; Darko Skorin-Kapov (Telecommun. Syst., 1994)

An efficient characterization of some cost allocation solutions associated with capacitated network design problems. - Darko Skorin-Kapov; Héctor Fernando Beltrán (Telecommun. Syst., 1994)

On the core of the minimum cost steiner tree game in networks. - Darko Skorin-Kapov (Ann. Oper. Res., 1995)

Hub network games. - Darko Skorin-Kapov (Networks, 1998)

On Cost Allocation in Hub-Like Networks. - Darko Skorin-Kapov (Ann. Oper. Res., 2001)

Network cost minimization using threshold-based discounting. - Hrvoje Podnar; Jadranka Skorin-Kapov; Darko Skorin-Kapov (Eur. J. Oper. Res., 2002)

Threshold based discounting networks: The cost allocation provided by the nucleolus. - Darko Skorin-Kapov; Jadranka Skorin-Kapov (Eur. J. Oper. Res., 2005)

Location Problems in Telecommunications. - Darko Skorin-Kapov; Jadranka Skorin-Kapov; Valter Boljuncic (Handbook of Optimization in Telecommunications, 2006)

A note on Steiner tree games. - Darko Skorin-Kapov; Jadranka Skorin-Kapov (Networks, 2012)

The Monotonic Cost Allocation Rule in Steiner Tree Network Games. - Darko Skorin-Kapov (J. Comput. Inf. Technol., 2016)

Social enterprise tree network games. - Darko Skorin-Kapov (Ann. Oper. Res., 2018)

Network Connectivity Game. - Darko Skorin-Kapov; Jadranka Skorin-Kapov (J. Comput. Inf. Technol., 2020)