JOURNAL OF COMPUTER AND SYSTEM SCIENCES - Journal - MOST Wiedzy

Search

JOURNAL OF COMPUTER AND SYSTEM SCIENCES

ISSN:

0022-0000

eISSN:

1090-2724

Disciplines
(Field of Science):

  • Information and communication technology (Engineering and Technology)
  • Civil engineering and transport (Engineering and Technology)
  • Computer and information sciences (Natural sciences)

Ministry points: Help

Ministry points
2020 100 Ministry Scored Journals List 2019
Ministry points
Year Points List
2020 100 Ministry Scored Journals List 2019
2019 100 Ministry Scored Journals List 2019
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
2009 32 A
2008 32 A

Model:

Hybrid

Punkty CiteScore:

Punkty CiteScore
2018 2.05
Punkty CiteScore
Year Points
2018 2.05
2017 2.09
2016 2.31

Impact Factor:

Log in to see the Impact Factor.

Publishing policy:

Pre-print
author's version of the article before the review
Post-print
author's version of the article after the review

Status table SHERPA RoMEO

Status table SHERPA RoMEO
RoMEO color Archiving policy
Green can archive pre-prints and post-prints or a version of the publisher
Blue can archive post-prints
Yellow can archive pre-prints
White can not archive any materials
Gray unknown

Filters

total: 4

  • Category
  • Year

Catalog Journals

2019
  • Clearing directed subgraphs by mobile agents
    Publication

    - JOURNAL OF COMPUTER AND SYSTEM SCIENCES - 2019

    We 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...

    Full text in external service

2017
  • Collision-free network exploration
    Publication
    • J. Czyzowicz
    • D. Dereniowski
    • L. Gąsieniec
    • R. Klasing
    • A. Kosowski
    • D. Pająk

    - JOURNAL OF COMPUTER AND SYSTEM SCIENCES - 2017

    Mobile 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...

    Full text in external service

2016
  • Bounds on the cover time of parallel rotor walks
    Publication

    - JOURNAL OF COMPUTER AND SYSTEM SCIENCES - 2016

    The 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...

    Full text in external service

2015
  • The complexity of minimum-length path decompositions
    Publication

    We 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...

    Full text in external service

seen 74 times