ISSN:
eISSN:
Dyscypliny:
- informatyka techniczna i telekomunikacja (Dziedzina nauk inżynieryjno-technicznych)
- informatyka (Dziedzina nauk ścisłych i przyrodniczych)
- matematyka (Dziedzina nauk ścisłych i przyrodniczych)
Punkty Ministerialne: Pomoc
Rok | Punkty | Lista |
---|---|---|
Rok 2024 | 40 | Ministerialna lista czasopism punktowanych 2024 |
Rok | Punkty | Lista |
---|---|---|
2024 | 40 | Ministerialna lista czasopism punktowanych 2024 |
2023 | 40 | Lista ministerialna czasopism punktowanych 2023 |
2022 | 40 | Lista ministerialna czasopism punktowanych (2019-2022) |
2021 | 40 | Lista ministerialna czasopism punktowanych (2019-2022) |
2020 | 40 | Lista ministerialna czasopism punktowanych (2019-2022) |
2019 | 40 | Lista ministerialna czasopism punktowanych (2019-2022) |
2018 | 20 | A |
2017 | 20 | A |
2016 | 20 | A |
2015 | 20 | A |
2014 | 15 | A |
2013 | 20 | A |
2012 | 25 | A |
2011 | 25 | A |
2010 | 32 | A |
Model czasopisma:
Punkty CiteScore:
Rok | Punkty |
---|---|
Rok 2023 | 1.9 |
Rok | Punkty |
---|---|
2023 | 1.9 |
2022 | 2.1 |
2021 | 2.1 |
2020 | 2 |
2019 | 1.7 |
2018 | 1.5 |
2017 | 1.6 |
2016 | 1.7 |
2015 | 1.7 |
2014 | 2 |
2013 | 2 |
2012 | 1.6 |
2011 | 1.4 |
Impact Factor:
Sherpa Romeo:
Prace opublikowane w tym czasopiśmie
Filtry
wszystkich: 4
Katalog Czasopism
Rok 2019
-
On Tradeoffs Between Width- and Fill-like Graph Parameters
PublikacjaIn this work we consider two two-criteria optimization problems: given an input graph, the goal is to find its interval (or chordal) supergraph that minimizes the number of edges and its clique number simultaneously. For the interval supergraph, the problem can be restated as simultaneous minimization of the path width pw(G) and the profile p(G) of the input graph G. We prove that for an arbitrary graph G and an integer t ∈ {1,...
-
On-line Search in Two-Dimensional Environment
PublikacjaWe consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers as possible. We require that the strategy is connected and monotone, that is, at each point of the execution the part of the graph...
Rok 2018
-
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots
PublikacjaWe study the problem of exploration of a tree by mobile agents (robots) that have limited energy. The energy constraint bounds the number of edges that can be traversed by a single agent. We use a team of agents to collectively explore the tree and the objective is to minimize the size of this team. The agents start at a single node, the designated root of the tree and the height of the tree is assumed to be less than the energy...
Rok 2013
-
Deterministic rendezvous of asynchronous bounded-memory agents in polygonal terrains
PublikacjaWe consider two versions of the rendezvous problem: exact RV, when the points representing agents have to coincide at some time, and e-RV, when these points have to get at distance less than e in the terrain. In any terrain, each agent chooses its trajectory, but the movements of the agent on this trajectory are controlled by an adversary that may, e.g. speed up or slow down the agent.
wyświetlono 577 razy