A parallel SVD algorithm and its application to financial ratio analysis. - Robert Manger; Mladen Grbic; Vito Leonardo Plantamura; Branko Soucek (Microprocess. Microprogramming, 1995)

Holographic Neural Networks and Data Compression. - Robert Manger (Informatica (Slovenia), 1997)

Solving path problems on a network of computers. - Robert Manger (Informatica (Slovenia), 2002)

Composite Path Algebras for Solving Path Problems in Graphs. - Robert Manger (Ars Comb., 2006)

Multilayer Perceptrons and Data Compression. - Robert Manger; Krunoslav Puljic (Comput. Artif. Intell., 2007)

Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem. - Alfonzo Baumgartner; Robert Manger; Zeljko Hocenski (J. Comput. Inf. Technol., 2007)

On the competitiveness of a modified work function algorithm for solving the on-line k-server problem. - Tomislav Rudec; Robert Manger (ITI, 2008)

The Design and Analysis of a Modified Work Function Algorithm for Solving the On-Line k-Server Problem. - Alfonzo Baumgartner; Tomislav Rudec; Robert Manger (Comput. Informatics, 2010)

Measuring True Performance of the Work Function Algorithm for Solving the On-line k-Server Problem. - Tomislav Rudec; Alfonzo Baumgartner; Robert Manger (J. Comput. Inf. Technol., 2010)

A distributed evolutionary algorithm with a superlinear speedup for solving the vehicle routing problem. - Krunoslav Puljic; Robert Manger (Comput. Informatics, 2012)

Editorial. - Vesna Luzar-Stiffler; Robert Manger; Zelimir Kurtanjek (J. Comput. Inf. Technol., 2012)

A fast work function algorithm for solving the k-server problem. - Tomislav Rudec; Alfonzo Baumgartner; Robert Manger (Central Eur. J. Oper. Res., 2013)

A new approach to solve the k-server problem based on network flows and flow cost reduction. - Tomislav Rudec; Robert Manger (Comput. Oper. Res., 2013)

A fast approximate implementation of the work function algorithm for solving the (k ) -server problem. - Tomislav Rudec; Robert Manger (Central Eur. J. Oper. Res., 2015)

Heuristic solutions to robust variants of the minimum-cost integer flow problem. - Marko Spoljarec; Robert Manger (J. Heuristics, 2020)

Evolutionary operators for the Hamiltonian completion problem. - Krunoslav Puljic; Robert Manger (Soft Comput., 2020)

Solving Robust Weighted Independent Set Problems on Trees and under Interval Uncertainty. - Ana Klobucar; Robert Manger (Symmetry, 2021)

Solving the minimum-cost double Roman domination problem. - Ana Klobucar Barisic; Robert Manger (Central Eur. J. Oper. Res., 2024)