Graph modeling of search processes

2018/31/B/ST6/00820

Keywords

Descriptors

  • ST6_6: Algorytmika, algorytmy równoległe, rozproszone i sieciowe, algorytmiczna teoria gier

Panel

ST6 – Computer science and informatics: informatics and information systems, computer science, scientific computing, intelligent systems

Host institution

Politechnika Gdańska, Wydział Elektroniki, Telekomunikacji i Informatyki

Voivodeship: pomorskie

Other projects carried out by the institution »

Principal investigator (from the host institution)

dr hab. Dariusz Piotr Dereniowski

Number of co-investigators in the project: 5

Call

OPUS 16 – announced on 2018-09-14

Amount awarded
480 200 PLN
Project start date
2019-06-28
Project end date
2024-06-27
Project duration
60 months (the same as in the proposal)
Project status
Project settled

Project description

Download the project description in a pdf file

Note — project descriptions were prepared by the authors of the applications themselves and placed in the system in an unchanged form.

Information in the final report

Publication in academic press/journals (4)

  1. On the characteristic graph of a discrete symmetric channel

    Authors:
    Dariusz Dereniowski, Marcin Jurkiewicz
    Academic press:
    IEEE Transactions on Information Theory (year: 2021, volume: 67, pages: 3818-3823), Publisher: IEEE
    Status:
    Published
    DOI:
    10.1109/TIT.2021.3073822 – link to the publication
  2. Gossiping by Energy-Constrained Mobile Agents in Tree Networks

    Authors:
    Jurek Czyzowicz, Dariusz Dereniowski, Robert Ostrowski, Wojciech Rytter
    Academic press:
    Theoretical Computer Science (year: 2021, volume: 861, pages: 45-65), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.tcs.2021.02.009 – link to the publication
  3. The Complexity of Bicriteria Tree-Depth

    Authors:
    Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula
    Academic press:
    Theoretical Computer Science (year: 2023, volume: 947, pages: 113682), Publisher: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.tcs.2022.12.032 – link to the publication
  4. Edge and Pair Queries - Random Graphs and Complexity

    Authors:
    Dariusz Dereniowski, Przemysław Gordinowicz, Paweł Prałat
    Academic press:
    The Electronic Journal of Combinatorics (year: 2023, volume: 30(2), pages: P2.34), Publisher: N.J. Calkin and H.S. Wilf, [Atlanta, Ga.]
    Status:
    Published
    DOI:
    10.37236/11159 – link to the publication

Articles in post-conference publications (3)

  1. The Complexity of Bicriteria Tree-depth

    Authors:
    Piotr Borowiecki, Dariusz Dereniowski, Dorota Osula
    Conference:
    23rd International Symposium on Fundamentals of Computation Theory (year: 2021, pages: 100-113), Publisher: Springer
    Date:
    conference 12-15 wrzesień 2021
    Status:
    Published
  2. An Efficient Noisy Binary Search in Graphs via Median Approximation

    Authors:
    Dariusz Dereniowski, Aleksander Łukasiewicz, Przemysław Uznański
    Conference:
    32nd International Workshop on Combinatorial Algorithms IWOCA 2021 (year: 2021, pages: 265-281), Publisher: Springer
    Date:
    conference 5-8 lipiec 2021
    Status:
    Published
  3. Constant-Factor Approximation Algorithm for Binary Search in Trees with Monotonic Query Times

    Authors:
    Dariusz Dereniowski, Izajasz Wrosz
    Conference:
    47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022) (year: 2022, pages: 42:1-42:15), Publisher: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
    Date:
    conference 22-26.08.2022
    Status:
    Published

« New search

Graphic design and implementation: Jakub Piotrowski