-
1
-
-
0141778981
-
A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree
-
I. Averbakh and O. Berman. A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree. Discr. Appl. Math., 68:17-32, 1996.
-
(1996)
Discr. Appl. Math.
, vol.68
, pp. 17-32
-
-
Averbakh, I.1
Berman, O.2
-
2
-
-
0031632860
-
The power of a pebble: Exploring and mapping directed graphs
-
M. Bender, A. Fernandez, D. Ron, A. Sahai, and S. Vadhan. The power of a pebble: Exploring and mapping directed graphs. In Proc. 30th ACM Symp. on Theory of Computing (STOC'98), 269-287, 1998.
-
(1998)
Proc. 30th ACM Symp. on Theory of Computing (STOC'98)
, pp. 269-287
-
-
Bender, M.1
Fernandez, A.2
Ron, D.3
Sahai, A.4
Vadhan, S.5
-
5
-
-
24944505866
-
Searching for a black hole in tree networks
-
J. Czyzowicz, D. Kowalski, E. Markou, and A. Pelc. Searching for a black hole in tree networks. In Proc. 8th International Conference on Principles of Distributed Systems (OPODIS 2004), 35-45, 2004.
-
(2004)
Proc. 8th International Conference on Principles of Distributed Systems (OPODIS 2004)
, pp. 35-45
-
-
Czyzowicz, J.1
Kowalski, D.2
Markou, E.3
Pelc, A.4
-
6
-
-
24944457147
-
Exploration and labelling of an unknown graph by multiple agents
-
S. Das, P. Flocchini, A. Nayak, and N. Santoro. Exploration and labelling of an unknown graph by multiple agents. In Proc. 12th Int. Coll. on Structural Information and Communication Complexity (SIROCCO'05), 99-114, 2005.
-
(2005)
Proc. 12th Int. Coll. on Structural Information and Communication Complexity (SIROCCO'05)
, pp. 99-114
-
-
Das, S.1
Flocchini, P.2
Nayak, A.3
Santoro, N.4
-
8
-
-
33645140802
-
Optimal search for a black hole in common interconnection networks
-
S. Dobrev, P. Flocchini, R. Kralovic, G. Prencipe, P. Ruzicka, and N. Santoro. Optimal search for a black hole in common interconnection networks. Networks, 47(2):61-71, 2006.
-
(2006)
Networks
, vol.47
, Issue.2
, pp. 61-71
-
-
Dobrev, S.1
Flocchini, P.2
Kralovic, R.3
Prencipe, G.4
Ruzicka, P.5
Santoro, N.6
-
12
-
-
0026365074
-
Robotic exploration as graph construction
-
G. Dudek, M. Jenkin, E. Milios, and D. Wilkes. Robotic exploration as graph construction. Transactions on Robotics and Automation, 7(6):859-865, 1991.
-
(1991)
Transactions on Robotics and Automation
, vol.7
, Issue.6
, pp. 859-865
-
-
Dudek, G.1
Jenkin, M.2
Milios, E.3
Wilkes, D.4
-
13
-
-
27644440909
-
Collective tree exploration
-
P. Fraigniaud, L. Gasieniec, D. Kowalski, and A. Pelc. Collective tree exploration. In 6th Latin American Theoretical Informatics Symp. (LATIN'04), 141-151, 2004.
-
(2004)
6th Latin American Theoretical Informatics Symp. (LATIN'04)
, pp. 141-151
-
-
Fraigniaud, P.1
Gasieniec, L.2
Kowalski, D.3
Pelc, A.4
-
16
-
-
24944494818
-
Hardness and approximation results for black hole search in arbitrary graphs
-
R. Klasing, E. Markou, T. Radzik, and F. Sarracco. Hardness and approximation results for black hole search in arbitrary graphs. In Proc. 12th Coll. on Structural Information and Communication complexity (SIROCCO'05), 200-215, 2005.
-
(2005)
Proc. 12th Coll. on Structural Information and Communication Complexity (SIROCCO'05)
, pp. 200-215
-
-
Klasing, R.1
Markou, E.2
Radzik, T.3
Sarracco, F.4
-
17
-
-
0032665338
-
Security issues related to mobile code and agent-based systems
-
R. Oppliger. Security issues related to mobile code and agent-based systems. Computer Communications, 22(12):1165-1170, 1999.
-
(1999)
Computer Communications
, vol.22
, Issue.12
, pp. 1165-1170
-
-
Oppliger, R.1
-
18
-
-
0000049929
-
Exploring unknown undirected graphs
-
P. Panaite and A. Pelc. Exploring unknown undirected graphs. J. Algorithms, 33:281-295, 1999.
-
(1999)
J. Algorithms
, vol.33
, pp. 281-295
-
-
Panaite, P.1
Pelc, A.2
-
20
-
-
0012526412
-
Mobile computations and hostile hosts
-
In D. Tsichritzis, editor
-
Jan Vitek and Giuseppe Castagna. Mobile computations and hostile hosts. In D. Tsichritzis, editor. Mobile Objects, 241-261, 1999.
-
(1999)
Mobile Objects
, pp. 241-261
-
-
Vitek, J.1
Castagna, G.2
|