#### Filter Results:

- Full text PDF available (40)

#### Publication Year

2003

2017

- This year (5)
- Last 5 years (32)
- Last 10 years (46)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Dariusz Dereniowski
- MFCS
- 2010

In this paper we consider the problem of connected edge searching of weighted trees. Barrière et al. claim in [Capture of an intruder by mobile agents, SPAA’02 (2002) 200-209] that there exists a polynomial-time algorithm for finding an optimal search strategy, that is, a strategy that minimizes the number of used searchers. However, due to some flaws in… (More)

- Dariusz Dereniowski, Wieslaw Kubiak, Yori Zwols
- ArXiv
- 2013

- Dariusz Dereniowski
- Discrete Applied Mathematics
- 2008

We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farchi and Newman considered a special case where the partial order has the maximum element and the Hasse diagram is a tree (tree-like posets) and they gave an O(n log n)-time algorithm… (More)

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 maintains a cyclic ordering of its outgoing arcs, and… (More)

- Shantanu Das, Dariusz Dereniowski, Adrian Kosowski, Przemyslaw Uznanski
- SIROCCO
- 2014

We study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is… (More)

- Dariusz Dereniowski, Wieslaw Kubiak, Yori Zwols
- J. Comput. Syst. Sci.
- 2015

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… (More)

- Dariusz Dereniowski, Andrzej Pelc
- Theor. Comput. Sci.
- 2016

Topology recognition and leader election are fundamental tasks in distributed computing in networks. The first of them requires each node to find a labeled isomorphic copy of the network, while the result of the second one consists in a single node adopting the label 1 (leader), with all other nodes adopting the label 0 and learning a path to the leader. We… (More)

- Dariusz Dereniowski, Andrzej Pelc
- DISC
- 2010

We study the problem of the amount of information required to draw a complete or a partial map of a graph with unlabeled nodes and arbitrarily labeled ports. A mobile agent, starting at any node of an unknown connected graph and walking in it, has to accomplish one of the following tasks: draw a complete map of the graph, i.e., find an isomorphic copy of it… (More)

We study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how… (More)

- Dariusz Dereniowski, Adam Nadolski
- Inf. Process. Lett.
- 2006

In this paper we consider the vertex ranking problem of weighted trees. We show that this problem is strongly NP-hard. We also give a polynomial-time reduction from the problem of vertex ranking of weighted trees to the vertex ranking of (simple) chordal graphs, which proves that the latter problem is NP-hard. In this way we solve an open problem of Aspvall… (More)