FUNDAMENTA INFORMATICAE - Journal - Bridge of Knowledge

Search

FUNDAMENTA INFORMATICAE

ISSN:

0169-2968

eISSN:

1875-8681

Disciplines
(Field of Science):

  • Information and communication technology (Engineering and Technology)
  • Biomedical engineering (Engineering and Technology)
  • Computer and information sciences (Natural sciences)
  • Mathematics (Natural sciences)

Ministry points: Help

Ministry points - current year
Year Points List
Year 2024 70 Ministry scored journals list 2024
Ministry points - previous years
Year Points List
2024 70 Ministry scored journals list 2024
2023 70 Ministry Scored Journals List
2022 70 Ministry Scored Journals List 2019-2022
2021 70 Ministry Scored Journals List 2019-2022
2020 70 Ministry Scored Journals List 2019-2022
2019 70 Ministry Scored Journals List 2019-2022
2018 20 A
2017 20 A
2016 20 A
2015 20 A
2014 15 A
2013 15 A
2012 20 A
2011 20 A
2010 27 A

Model:

Hybrid

Points CiteScore:

Points CiteScore - current year
Year Points
Year 2022 3.2
Points CiteScore - previous years
Year Points
2022 3.2
2021 3.1
2020 3.1
2019 2.7
2018 2.3
2017 1.8
2016 1.8
2015 1.8
2014 1.8
2013 1.7
2012 1.7
2011 1.5

Impact Factor:

Log in to see the Impact Factor.

Filters

total: 8

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Journals

Year 2019
Year 2017
Year 2016
  • Important Facts and Observations about Pairwise Comparisons (the special issue edition)
    Publication
    • W. W. Koczkodaj
    • L. Mikhailov
    • G. Redlarski
    • M. Soltys
    • J. Szybowski
    • G. Tamazian
    • E. Wajch
    • K. K. F. Yuen

    - FUNDAMENTA INFORMATICAE - Year 2016

    This study has been inspired by numerous requests for clarification from researchers who often confuse Saaty’s Analytic Hierarchy Process (AHP) with the pairwise comparisons (PC) method, taking AHP as the only representation of PC. This study should be regarded as an interpretation and clarification of past investigations of PC. In addition, this article is a reflection on general PC research at a higher level of abstraction: the...

    Full text to download in external service

Year 2014
Year 2013
Year 2012
  • Dynamic coloring of graphs
    Publication

    - FUNDAMENTA INFORMATICAE - Year 2012

    Dynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...

Year 2006
  • Efficient parallel query processing by graph ranking

    W artykule analizujemy przybliżony algorytm dla problemu szukania drzewa spinającego o minimalnym uporządkowanym indeksie chromatycznym, co znajduje zastosowanie w równoległym przetwarzaniu zapytań w relacyjnych bazach danych. Podajemy nowe oszacowanie uporządkowanego indeksu chromatycznego drzewa, które prowadzi do uzyskania lepszej funkcji dobroci wspomnianego algorytmu.

seen 455 times