Wyszukiwarka
ISSN:
eISSN:
Dyscypliny:
- etnologia i antropologia kulturowa (Dziedzina nauk humanistycznych)
- informatyka techniczna i telekomunikacja (Dziedzina nauk inżynieryjno-technicznych)
- inżynieria lądowa, geodezja i transport (Dziedzina nauk inżynieryjno-technicznych)
- ochrona dziedzictwa i konserwacja zabytków (Dziedzina nauk inżynieryjno-technicznych)
- informatyka (Dziedzina nauk ścisłych i przyrodniczych)
Punkty Ministerialne: Pomoc
| Rok | Punkty | Lista |
|---|---|---|
| Rok 2024 | 100 | Ministerialna lista czasopism punktowanych 2024 |
| Rok | Punkty | Lista |
|---|---|---|
| 2024 | 100 | Ministerialna lista czasopism punktowanych 2024 |
| 2023 | 100 | Lista ministerialna czasopism punktowanych 2023 |
| 2022 | 100 | Lista ministerialna czasopism punktowanych (2019-2022) |
| 2021 | 100 | Lista ministerialna czasopism punktowanych (2019-2022) |
| 2020 | 100 | Lista ministerialna czasopism punktowanych (2019-2022) |
| 2019 | 100 | Lista ministerialna czasopism punktowanych (2019-2022) |
| 2018 | 30 | A |
| 2017 | 30 | A |
| 2016 | 30 | A |
| 2015 | 30 | A |
| 2014 | 30 | A |
| 2013 | 30 | A |
| 2012 | 30 | A |
| 2011 | 30 | A |
| 2010 | 32 | A |
Model czasopisma:
Punkty CiteScore:
| Rok | Punkty |
|---|---|
| Rok 2023 | 3.7 |
| Rok | Punkty |
|---|---|
| 2023 | 3.7 |
| 2022 | 2.9 |
| 2021 | 3.1 |
| 2020 | 4.5 |
| 2019 | 4 |
| 2018 | 3.9 |
| 2017 | 4.3 |
| 2016 | 4.7 |
| 2015 | 5 |
| 2014 | 4.2 |
| 2013 | 4 |
| 2012 | 3.4 |
| 2011 | 3.5 |
Impact Factor:
Sherpa Romeo:
Prace opublikowane w tym czasopiśmie
Filtry
wszystkich: 5
Katalog Czasopism
Rok 2021
-
Searching by heterogeneous agents
PublikacjaIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search strategy initially assigns labels to the searchers, each searcher can be only present on an edge of its own label. We prove that this problem is not monotone even for trees and we give instances...
Rok 2019
-
Clearing directed subgraphs by mobile agents
PublikacjaWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset S of vertices of a digraph D and a positive integer k, the objective is to determine whether there is a subgraph H=(V,A) of D such that (a) S is a subset of V, (b) H is the union of k directed...
Rok 2017
-
Collision-free network exploration
PublikacjaMobile agents start at different nodes of an n-node network. The agents synchronously move along the network edges in a collision-free way, i.e., in no round two agents may occupy the same node. An agent has no knowledge of the number and initial positions of other agents. We are looking for the shortest time required to reach a configuration in which each agent has visited all nodes and returned to its starting location. In...
Rok 2016
-
Bounds on the cover time of parallel rotor walks
PublikacjaThe rotor-router mechanism was introduced as a deterministic alternative to the random walk in undirected graphs. In this model, a set of k identical walkers is deployed in parallel, starting from a chosen subset of nodes, and moving around the graph in synchronous steps. During the process, each node successively propagates walkers visiting it along its outgoing arcs in round-robin fashion, according to a fixed ordering. We consider...
Rok 2015
-
The complexity of minimum-length path decompositions
PublikacjaWe consider a bi-criteria generalization of the pathwidth problem, where, for given integers k, l and a graph G, we ask whether there exists a path decomposition P of G such that the width of P is at most k and the number of bags in P, i.e., the length of P, is at most l. We provide a complete complexity classification of the problem in terms of k and l for general graphs. Contrary to the original pathwidth problem, which is fixed-parameter...
wyświetlono 740 razy