On the public citation graph

Collective Tree Exploration

https://doi.org/10.1002/net.20127

0 signed · 188 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1097-0118(199911)32:3<265::aid-jgt6>3.0.co;2-8openalex-snapshot

Exploring an unknown graph

inferredcites →https://doi.org/10.1002/1097-0037(200009)36:2<96::aid-net4>3.0.co;2-nopenalex-snapshot

Impact of topographic information on graph exploration efficiency

inferredcites →https://doi.org/10.1006/jagm.1994.1039openalex-snapshot

Online Navigation in a Room

inferredcites →https://doi.org/10.1006/jagm.1999.1043openalex-snapshot

Exploring Unknown Undirected Graphs

inferredcites →https://doi.org/10.1007/10705474_12openalex-snapshot

On-Line Searching in Simple Polygons

inferredcites →https://doi.org/10.1007/3-540-45471-3_27openalex-snapshot

Online Parallel Heuristics and Robot Searching under the Competitive Framework

inferredcites →https://doi.org/10.1007/3-540-45749-6_35openalex-snapshot

Optimal Graph Exploration without Good Maps

inferredcites →https://doi.org/10.1007/bf00993411openalex-snapshot

Piecemeal learning of an unknown environment

inferredcites →https://doi.org/10.1016/0166-218x(95)00054-uopenalex-snapshot

A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree

inferredcites →https://doi.org/10.1016/0304-3975(91)90263-2openalex-snapshot

Shortest paths without a map

inferredcites →https://doi.org/10.1016/s0166-218x(97)89161-5openalex-snapshot

(p − 1)(p + 1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective

inferredcites →https://doi.org/10.1109/sfcs.1994.365703openalex-snapshot

The power of team exploration: two robots can learn unlabeled directed graphs

inferredcites →https://doi.org/10.1137/0207017openalex-snapshot

Approximation Algorithms for Some Routing Problems

inferredcites →https://doi.org/10.1137/s0097539791194931openalex-snapshot

Navigating in Unfamiliar Geometric Terrain

inferredcites →https://doi.org/10.1137/s009753979732428xopenalex-snapshot

Exploring Unknown Environments

inferredcites →https://doi.org/10.1145/225298.225337openalex-snapshot

Piecemeal graph exploration by a mobile robot (extended abstract)

inferredcites →https://doi.org/10.1145/274787.274788openalex-snapshot

How to learn an unknown environment. I

inferredcites →https://doi.org/10.1145/276698.276759openalex-snapshot

The power of a pebble

inferredcites →https://doi.org/10.1145/777412.777465openalex-snapshot

Improved approximation algorithms for the freeze-tag problem

inferredcites →https://doi.org/10.2172/10180101openalex-snapshot

Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118135617.ch3openalex-snapshot

Distributed Security Algorithms for Mobile Agents

inferred← citeshttps://doi.org/10.1002/9781118135617.ch5openalex-snapshot

Cooperating Mobile Agents

inferred← citeshttps://doi.org/10.1002/net.20095openalex-snapshot

Black hole search in common interconnection networks

inferred← citeshttps://doi.org/10.1002/net.21453openalex-snapshot

Deterministic rendezvous in networks: A comprehensive survey

inferred← citeshttps://doi.org/10.1007/11429647_10openalex-snapshot

Distributed Exploration of an Unknown Graph

inferred← citeshttps://doi.org/10.1007/11682127_24openalex-snapshot

Power-Aware Collective Tree Exploration

inferred← citeshttps://doi.org/10.1007/11758471_16openalex-snapshot

Black Hole Search in Asynchronous Rings Using Tokens

inferred← citeshttps://doi.org/10.1007/11780823_6openalex-snapshot

Setting Port Numbers for Fast Graph Exploration

inferred← citeshttps://doi.org/10.1007/11821069_29openalex-snapshot

Smart Robot Teams Exploring Sparse Trees

inferred← citeshttps://doi.org/10.1007/11947950_1openalex-snapshot

Distributed Security Algorithms by Mobile Agents

inferred← citeshttps://doi.org/10.1007/11947950_34openalex-snapshot

Improved Distributed Exploration of Anonymous Networks

inferred← citeshttps://doi.org/10.1007/978-0-387-34735-6_14openalex-snapshot

Exploring an Unknown Graph to Locate a Black Hole Using Tokens

inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_348openalex-snapshot

Robotics

inferred← citeshttps://doi.org/10.1007/978-3-030-01325-7_20openalex-snapshot

Broadcast with Energy-Exchanging Mobile Agents Distributed on a Tree

inferred← citeshttps://doi.org/10.1007/978-3-030-10801-4_31openalex-snapshot

Minimizing the Cost of Team Exploration

inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_16openalex-snapshot

Graph Explorations with Mobile Agents

inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_18openalex-snapshot

Dangerous Graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-11072-7_2openalex-snapshot

Moving and Computing Models: Agents

inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_10openalex-snapshot

Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Agents

inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_4openalex-snapshot

Near-Gathering of Energy-Constrained Mobile Agents

inferred← citeshttps://doi.org/10.1007/978-3-030-34405-4_2openalex-snapshot

Fast Dispersion of Mobile Robots on Arbitrary Graphs

inferred← citeshttps://doi.org/10.1007/978-3-030-39881-1_16openalex-snapshot

Dispersion of Mobile Robots on Grids

inferred← citeshttps://doi.org/10.1007/978-3-030-62401-9_5openalex-snapshot

Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots

inferred← citeshttps://doi.org/10.1007/978-3-031-09993-9_11openalex-snapshot

Dispersion of Mobile Robots on Directed Anonymous Graphs

inferred← citeshttps://doi.org/10.1007/978-3-031-27199-1_27openalex-snapshot

A Constant-Factor Approximation Algorithm for Online Coverage Path Planning with Energy Constraint

inferred← citeshttps://doi.org/10.1007/978-3-031-60603-8_31openalex-snapshot

Multi-agent Online Graph Exploration on Cycles and Tadpole Graphs

inferred← citeshttps://doi.org/10.1007/978-3-031-81404-4_7openalex-snapshot

Optimal Dispersion in Triangular Grids: Achieving Efficiency Without Prior Knowledge

inferred← citeshttps://doi.org/10.1007/978-3-032-26465-7_20openalex-snapshot

Online Exploration of Grid Graphs with Multiple Searchers

inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_26openalex-snapshot

A Recursive Approach to Multi-robot Exploration of Trees

inferred← citeshttps://doi.org/10.1007/978-3-319-09620-9_4openalex-snapshot

The Beachcombers’ Problem: Walking and Searching with Mobile Robots

inferred← citeshttps://doi.org/10.1007/978-3-319-25258-2_25openalex-snapshot

Collaborative Exploration by Energy-Constrained Mobile Robots

inferred← citeshttps://doi.org/10.1007/978-3-319-28472-9_12openalex-snapshot

Beachcombing on Strips and Islands

inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_13openalex-snapshot

Linear Search by a Pair of Distinct-Speed Robots

inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_17openalex-snapshot

Collaborative Delivery with Energy-Constrained Mobile Robots

inferred← citeshttps://doi.org/10.1007/978-3-319-48314-6_18openalex-snapshot

Communication Problems for Mobile Agents Exchanging Energy

inferred← citeshttps://doi.org/10.1007/978-3-319-72050-0_8openalex-snapshot

A General Lower Bound for Collaborative Tree Exploration

inferred← citeshttps://doi.org/10.1007/978-3-319-72751-6_1openalex-snapshot

Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots

inferred← citeshttps://doi.org/10.1007/978-3-319-72751-6_8openalex-snapshot

Energy-Optimal Broadcast in a Tree with Mobile Agents

inferred← citeshttps://doi.org/10.1007/978-3-319-78133-4_12openalex-snapshot

Evolutionary Learning of Fire Fighting Strategies

inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_22openalex-snapshot

Digraphs Exploration with Little Memory

inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_34openalex-snapshot

Graph Exploration by a Finite Automaton

inferred← citeshttps://doi.org/10.1007/978-3-540-69355-0_5openalex-snapshot

Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots

inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_5openalex-snapshot

Why Robots Need Maps

inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_8openalex-snapshot

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

inferred← citeshttps://doi.org/10.1007/978-3-540-87779-0_16openalex-snapshot

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pure Tokens

inferred← citeshttps://doi.org/10.1007/978-3-642-11476-2_15openalex-snapshot

Black Hole Search in Directed Graphs

inferred← citeshttps://doi.org/10.1007/978-3-642-13284-1_13openalex-snapshot

Periodic Data Retrieval Problem in Rings Containing a Malicious Host

inferred← citeshttps://doi.org/10.1007/978-3-642-14849-1_21openalex-snapshot

Computing by Mobile Robotic Sensors

inferred← citeshttps://doi.org/10.1007/978-3-642-22012-8_38openalex-snapshot

Online Graph Exploration: New Results on Old and New Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-642-24100-0_41openalex-snapshot

Black Hole Search with Finite Automata Scattered in a Synchronous Torus

inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_348-2openalex-snapshot

Robotics

inferred← citeshttps://doi.org/10.1007/978-3-642-29344-3_31openalex-snapshot

Decidability Classes for Mobile Agents Computing

inferred← citeshttps://doi.org/10.1007/978-3-642-29700-7_29openalex-snapshot

Online Exploration of All Vertices in a Simple Polygon

inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_45openalex-snapshot

Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports

inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_37openalex-snapshot

Observe and Remain Silent (Communication-Less Agent Location Discovery)

inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_4openalex-snapshot

Collecting Information by Power-Aware Mobile Agents

inferred← citeshttps://doi.org/10.1007/978-3-642-33651-5_5openalex-snapshot

Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology

inferred← citeshttps://doi.org/10.1007/978-3-642-35476-2_11openalex-snapshot

Directed Graph Exploration

inferred← citeshttps://doi.org/10.1007/978-3-642-35476-2_17openalex-snapshot

Black Hole Search and Exploration in Unoriented Tori with Synchronous Scattered Finite Automata

inferred← citeshttps://doi.org/10.1007/978-3-642-35476-2_9openalex-snapshot

Tree Exploration by a Swarm of Mobile Agents

inferred← citeshttps://doi.org/10.1007/978-3-642-36065-7_1openalex-snapshot

Mobility and Computations: Some Open Research Directions

inferred← citeshttps://doi.org/10.1007/978-3-642-39212-2_46openalex-snapshot

Fast Collaborative Graph Exploration

inferred← citeshttps://doi.org/10.1007/978-3-662-46018-4_3openalex-snapshot

Strategies for Parallel Unaware Cleaners

inferred← citeshttps://doi.org/10.1007/978-3-662-55751-8_8openalex-snapshot

Energy-Efficient Fast Delivery by Mobile Agents

inferred← citeshttps://doi.org/10.1007/s00224-017-9816-3openalex-snapshot

Collaborative Exploration of Trees by Energy-Constrained Mobile Robots

inferred← citeshttps://doi.org/10.1007/s00446-006-0154-yopenalex-snapshot

Searching for a black hole in arbitrary networks: optimal mobile agents protocols

inferred← citeshttps://doi.org/10.1007/s00446-015-0253-8openalex-snapshot

Time versus cost tradeoffs for deterministic rendezvous in networks

inferred← citeshttps://doi.org/10.1007/s00446-016-0283-xopenalex-snapshot

Searching without communicating: tradeoffs between performance and selection complexity

inferred← citeshttps://doi.org/10.1007/s00446-016-0285-8openalex-snapshot

The ANTS problem

inferred← citeshttps://doi.org/10.1007/s00446-026-00516-zopenalex-snapshot

Exploration on highly dynamic graphs

inferred← citeshttps://doi.org/10.1007/s00453-011-9496-3openalex-snapshot

Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles

inferred← citeshttps://doi.org/10.1007/s00453-011-9611-5openalex-snapshot

Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots

inferred← citeshttps://doi.org/10.1007/s00453-014-9939-8openalex-snapshot

Convergecast and Broadcast by Power-Aware Mobile Agents

inferred← citeshttps://doi.org/10.1007/s00453-015-9982-0openalex-snapshot

Anonymous Meeting in Networks

inferred← citeshttps://doi.org/10.1007/s00453-016-0172-5openalex-snapshot

Online Makespan Minimization with Parallel Schedules

inferred← citeshttps://doi.org/10.1007/s00453-018-0447-0openalex-snapshot

Linear Search by a Pair of Distinct-Speed Robots

inferred← citeshttps://doi.org/10.1007/s00453-022-00995-zopenalex-snapshot

Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots

inferred← citeshttps://doi.org/10.1007/s00453-024-01275-8openalex-snapshot

Energy Constrained Depth First Search

inferred← citeshttps://doi.org/10.1007/s10514-023-10142-4openalex-snapshot

Dynamic task allocation approaches for coordinated exploration of Subterranean environments

inferred← citeshttps://doi.org/10.1007/s10878-012-9571-yopenalex-snapshot

Online graph exploration algorithms for cycles and trees by multiple searchers

inferred← citeshttps://doi.org/10.1007/s10878-024-01192-0openalex-snapshot

An improved upper bound for the online graph exploration problem on unicyclic graphs

inferred← citeshttps://doi.org/10.1016/j.ic.2014.12.005openalex-snapshot

Fast collaborative graph exploration

inferred← citeshttps://doi.org/10.1016/j.ic.2018.12.001openalex-snapshot

Communication and location discovery in geometric ring networks

inferred← citeshttps://doi.org/10.1016/j.ic.2025.105380openalex-snapshot

Collision-free exploration by mobile agents using pebbles

inferred← citeshttps://doi.org/10.1016/j.ipl.2011.07.018openalex-snapshot

How many oblivious robots can explore a line

inferred← citeshttps://doi.org/10.1016/j.ipl.2012.03.017openalex-snapshot

Deterministic network exploration by a single agent with Byzantine tokens

inferred← citeshttps://doi.org/10.1016/j.jcss.2025.103656openalex-snapshot

Near-optimal dispersion on arbitrary anonymous graphs

inferred← citeshttps://doi.org/10.1016/j.jcss.2026.103829openalex-snapshot

Balanced dispersion on time-varying dynamic graphs

inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.04.003openalex-snapshot

Decidability classes for mobile agents computing

inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.11.007openalex-snapshot

Dispersion of mobile robots using global communication

inferred← citeshttps://doi.org/10.1016/j.jpdc.2025.105139openalex-snapshot

Dispersion of mobile robots on directed anonymous graphs

inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.014openalex-snapshot

Graph exploration by a finite automaton

inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.011openalex-snapshot

Map construction of unknown graphs by multiple agents

inferred← citeshttps://doi.org/10.1016/j.tcs.2008.03.035openalex-snapshot

Setting port numbers for fast graph exploration

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.007openalex-snapshot

Remembering without memory: Tree exploration by asynchronous oblivious robots

inferred← citeshttps://doi.org/10.1016/j.tcs.2010.01.011openalex-snapshot

Locating and repairing faults in a network with mobile agents

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.034openalex-snapshot

Online graph exploration: New results on old and new algorithms

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.11.022openalex-snapshot

Exploring an unknown dangerous graph using tokens

inferred← citeshttps://doi.org/10.1016/j.tcs.2013.02.010openalex-snapshot

Tight bounds for black hole search with scattered agents in synchronous rings

inferred← citeshttps://doi.org/10.1016/j.tcs.2013.12.023openalex-snapshot

Price of asynchrony in mobile agents computing

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.07.013openalex-snapshot

Exploring an unknown dangerous graph with a constant number of tokens

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.011openalex-snapshot

The Beachcombers' Problem: Walking and searching with mobile robots

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.09.026openalex-snapshot

Strategies for parallel unaware cleaners

inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.017openalex-snapshot

Lower and upper competitive bounds for online directed graph exploration

inferred← citeshttps://doi.org/10.1016/j.tcs.2017.04.018openalex-snapshot

Collaborative delivery with energy-constrained mobile robots

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.006openalex-snapshot

A general lower bound for collaborative tree exploration

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.09.029openalex-snapshot

Group search of the plane with faulty robots

inferred← citeshttps://doi.org/10.1016/j.tcs.2019.04.001openalex-snapshot

Beachcombing on strips and islands

inferred← citeshttps://doi.org/10.1016/j.tcs.2019.07.018openalex-snapshot

Energy-optimal broadcast and exploration in a tree using mobile agents

inferred← citeshttps://doi.org/10.1016/j.tcs.2020.10.008openalex-snapshot

Near-gathering of energy-constrained mobile agents

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.02.009openalex-snapshot

Gossiping by energy-constrained mobile agents in tree networks

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.003openalex-snapshot

An improved lower bound for competitive graph exploration

inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.004openalex-snapshot

Collaborative delivery on a fixed path with homogeneous energy-constrained agents

inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115272openalex-snapshot

Dispersion of mobile robots on graphs in the asynchronous model

inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115390openalex-snapshot

Path connected dynamic graphs with a study of dispersion and exploration

inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115810openalex-snapshot

Efficient dispersion in triangular grids without prior knowledge

inferred← citeshttps://doi.org/10.1093/bib/bbaa012openalex-snapshot

Biological applications of knowledge graph embedding models

inferred← citeshttps://doi.org/10.1109/acc.2007.4283034openalex-snapshot

Visibility-based multi-agent deployment in orthogonal environments

inferred← citeshttps://doi.org/10.1109/aike.2018.00025openalex-snapshot

Fast Graph Exploration by a Mobile Robot

inferred← citeshttps://doi.org/10.1109/cac59555.2023.10452014openalex-snapshot

Multi-Robot Autonomous Exploration in Unknown Environment: A Review

inferred← citeshttps://doi.org/10.1109/coase.2007.4341721openalex-snapshot

Multi-Robot Localization and Mapping Strategy: Utilizing Behavior Based Dynamic Tree Structure and Observer-explorer Routine

inferred← citeshttps://doi.org/10.1109/dyspan.2018.8610414openalex-snapshot

Multi-Agent Planning with Cardinality: Towards Autonomous Enforcement of Spectrum Policies

inferred← citeshttps://doi.org/10.1109/icarcv.2014.7064607openalex-snapshot

Improved analysis of a multirobot graph exploration strategy

inferred← citeshttps://doi.org/10.1109/icdcs.2015.59openalex-snapshot

Deterministic Symmetry Breaking in Ring Networks

inferred← citeshttps://doi.org/10.1109/icdcs47774.2020.00100openalex-snapshot

Efficient Dispersion of Mobile Robots on Dynamic Graphs

inferred← citeshttps://doi.org/10.1109/icoin53446.2022.9687190openalex-snapshot

On Accelerating Multiple Random Walks with Loose Cooperation

inferred← citeshttps://doi.org/10.1109/icra.2019.8793850openalex-snapshot

A Competitive Algorithm for Online Multi-Robot Exploration of a Translating Plume

inferred← citeshttps://doi.org/10.1109/icra40945.2020.9196700openalex-snapshot

Recognition and Reconfiguration of Lattice-Based Cellular Structures by Simple Robots

inferred← citeshttps://doi.org/10.1109/incos.2010.31openalex-snapshot

Exploration Algorithms by Multiple Robots in Challenged Communication Environment

inferred← citeshttps://doi.org/10.1109/ipdps.2006.1639543openalex-snapshot

Optimal map construction of an unknown torus

inferred← citeshttps://doi.org/10.1109/ipdps.2009.5161080openalex-snapshot

Map construction and exploration by mobile agents scattered in a dangerous network

inferred← citeshttps://doi.org/10.1109/ipdps54959.2023.00015openalex-snapshot

Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots

inferred← citeshttps://doi.org/10.1109/mrs66243.2025.11357261openalex-snapshot

Design for One, Deploy for Many: Navigating Tree Mazes with Multiple Agents

inferred← citeshttps://doi.org/10.1109/robot.2009.5152256openalex-snapshot

Multi-robot tree and graph exploration

inferred← citeshttps://doi.org/10.1109/robot.2010.5509522openalex-snapshot

Multi-robot flooding algorithm for the exploration of unknown indoor environments

inferred← citeshttps://doi.org/10.1109/tccn.2019.2914915openalex-snapshot

Spectrum Enforcement and Localization Using Autonomous Agents With Cardinality

inferred← citeshttps://doi.org/10.1109/tro.2011.2121170openalex-snapshot

Multirobot Tree and Graph Exploration

inferred← citeshttps://doi.org/10.1109/tsmcb.2011.2179799openalex-snapshot

A Flooding Algorithm for Multirobot Exploration

inferred← citeshttps://doi.org/10.1142/s0129054107004826openalex-snapshot

OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT

inferred← citeshttps://doi.org/10.1142/s0129054114500129openalex-snapshot

EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN

inferred← citeshttps://doi.org/10.1145/1159892.1159897openalex-snapshot

Optimal constrained graph exploration

inferred← citeshttps://doi.org/10.1145/2332432.2332444openalex-snapshot

Collaborative search on the plane without communication

inferred← citeshttps://doi.org/10.1145/2594581openalex-snapshot

Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports

inferred← citeshttps://doi.org/10.1145/2611462.2611473openalex-snapshot

Time versus cost tradeoffs for deterministic rendezvous in networks

inferred← citeshttps://doi.org/10.1145/3369740.3369775openalex-snapshot

Dispersion of Mobile Robots in the Global Communication Model

inferred← citeshttps://doi.org/10.1145/3583668.3594568openalex-snapshot

Brief Announcement: Efficient Collaborative Tree Exploration with Breadth-First Depth-Next

inferred← citeshttps://doi.org/10.1145/3700838.3700845openalex-snapshot

Dispersion on Time Varying Graphs

inferred← citeshttps://doi.org/10.1145/3700838.3700863openalex-snapshot

Collision-free Exploration by Mobile Agents Using Pebbles

inferred← citeshttps://doi.org/10.1145/3700838.3700864openalex-snapshot

Path Connected Dynamic Graphs with a Study of Efficient Dispersion

inferred← citeshttps://doi.org/10.1145/3710795.3710803openalex-snapshot

SIGACT News Online Algorithms Column 43: 2024 in review

inferred← citeshttps://doi.org/10.1145/3732772.3733538openalex-snapshot

Distributed Freeze Tag: a sustainable solution to discover and wake-up a robot swarm

inferred← citeshttps://doi.org/10.1145/777412.777469openalex-snapshot

Can we elect if we cannot compare?

inferred← citeshttps://doi.org/10.14569/ijacsa.2013.040415openalex-snapshot

A Review of Computation Solutions by Mobile Agents in an Unsafe Environment

inferred← citeshttps://doi.org/10.1561/2300000073openalex-snapshot

A Survey of Decision-Theoretic Approaches for Robotic Environmental Monitoring

inferred← citeshttps://doi.org/10.1587/transinf.e96.d.489openalex-snapshot

Online Vertex Exploration Problems in a Simple Polygon

inferred← citeshttps://doi.org/10.20381/ruor-13057openalex-snapshot

Locating mobile agents through distributed mechanisms

inferred← citeshttps://doi.org/10.20381/ruor-18976openalex-snapshot

Best effort decontamination of networks

inferred← citeshttps://doi.org/10.20381/ruor-19839openalex-snapshot

Distributed computing with mobile agents: Solving rendezvous and related problems

inferred← citeshttps://doi.org/10.20381/ruor-5411openalex-snapshot

Black Hole Search in the Network and Subway Models

inferred← citeshttps://doi.org/10.22215/etd/2007-06571openalex-snapshot

Using mobile agents for black hole search with tokens in multi networks

inferred← citeshttps://doi.org/10.22215/etd/2015-11117openalex-snapshot

Searching with Two-Speed Autonomous Mobile Robots

inferred← citeshttps://doi.org/10.24963/ijcai.2017/630openalex-snapshot

Maintaining Communication in Multi-Robot Tree Coverage

inferred← citeshttps://doi.org/10.48550/arxiv.1111.0321openalex-snapshot

Anonymous Meeting in Networks

inferred← citeshttps://doi.org/10.48550/arxiv.1205.4545openalex-snapshot

Memory Lower Bounds for Randomized Collaborative Search and Applications to Biology

inferred← citeshttps://doi.org/10.48550/arxiv.1511.05987openalex-snapshot

Algorithms for Communication Problems for Mobile Agents Exchanging Energy

inferred← citeshttps://doi.org/10.5555/1898699.1898769openalex-snapshot

Optimal map construction of an unknown torus

inferred← citeshttps://doi.org/10.70675/58e2747az6a79z40dezb604zbcda2fb26d19openalex-snapshot

Algorithms for deterministic parallel graph exploration

inferred← citeshttps://doi.org/10.70675/60c156c7zec1bz41adza07bz14e290635419openalex-snapshot

Distributed algorithms for energy constrained mobile agents

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.