default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Manger
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j17]Ana Klobucar Barisic
, Robert Manger:
Solving the minimum-cost double Roman domination problem. Central Eur. J. Oper. Res. 32(3): 793-817 (2024)- 2021
- [j16]Ana Klobucar, Robert Manger:
Solving Robust Weighted Independent Set Problems on Trees and under Interval Uncertainty. Symmetry 13(12): 2259 (2021) - 2020
- [j15]Marko Spoljarec, Robert Manger:
Heuristic solutions to robust variants of the minimum-cost integer flow problem. J. Heuristics 26(4): 531-559 (2020) - [j14]Krunoslav Puljic, Robert Manger:
Evolutionary operators for the Hamiltonian completion problem. Soft Comput. 24(23): 18073-18088 (2020)
2010 – 2019
- 2019
- [i1]Marko Spoljarec, Robert Manger:
Heuristic solutions to robust variants of the minimum-cost integer flow problem. CoRR abs/1907.09468 (2019) - 2015
- [j13]Tomislav Rudec, Robert Manger:
A fast approximate implementation of the work function algorithm for solving the \(k\) -server problem. Central Eur. J. Oper. Res. 23(3): 699-722 (2015) - 2013
- [j12]Tomislav Rudec, Alfonzo Baumgartner, Robert Manger:
A fast work function algorithm for solving the k-server problem. Central Eur. J. Oper. Res. 21(1): 187-205 (2013) - [j11]Tomislav Rudec, Robert Manger:
A new approach to solve the k-server problem based on network flows and flow cost reduction. Comput. Oper. Res. 40(4): 1004-1013 (2013) - 2012
- [j10]Krunoslav Puljic, Robert Manger:
A distributed evolutionary algorithm with a superlinear speedup for solving the vehicle routing problem. Comput. Informatics 31(3): 675- (2012) - [j9]Vesna Luzar-Stiffler, Robert Manger, Zelimir Kurtanjek:
Editorial. J. Comput. Inf. Technol. 20(3): i-ii (2012) - 2010
- [j8]Alfonzo Baumgartner, Tomislav Rudec, Robert Manger:
The Design and Analysis of a Modified Work Function Algorithm for Solving the On-Line k-Server Problem. Comput. Informatics 29(4): 681-700 (2010) - [j7]Tomislav Rudec, Alfonzo Baumgartner, Robert Manger:
Measuring True Performance of the Work Function Algorithm for Solving the On-line k-Server Problem. J. Comput. Inf. Technol. 18(4) (2010)
2000 – 2009
- 2008
- [c1]Tomislav Rudec, Robert Manger:
On the competitiveness of a modified work function algorithm for solving the on-line k-server problem. ITI 2008: 779-784 - 2007
- [j6]Robert Manger, Krunoslav Puljic:
Multilayer Perceptrons and Data Compression. Comput. Artif. Intell. 26(1): 45-62 (2007) - [j5]Alfonzo Baumgartner, Robert Manger, Zeljko Hocenski:
Work Function Algorithm with a Moving Window for Solving the On-line k-server Problem. J. Comput. Inf. Technol. 15(4): 325-330 (2007) - 2006
- [j4]Robert Manger:
Composite Path Algebras for Solving Path Problems in Graphs. Ars Comb. 78 (2006) - 2002
- [j3]Robert Manger:
Solving path problems on a network of computers. Informatica (Slovenia) 26(1) (2002)
1990 – 1999
- 1997
- [j2]Robert Manger:
Holographic Neural Networks and Data Compression. Informatica (Slovenia) 21(4) (1997) - 1995
- [j1]Robert Manger, Mladen Grbic, Vito Leonardo Plantamura, Branko Soucek:
A parallel SVD algorithm and its application to financial ratio analysis. Microprocess. Microprogramming 41(1): 97-106 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
