On the public citation graph
Algorithms - ESA 2003
0 signed · 210 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/nav.1044openalex-snapshot
Rendezvous search when marks are left at the starting points
inferredcites →https://doi.org/10.1007/3-540-44693-1_22openalex-snapshot
Gathering of Asynchronous Oblivious Robots with Limited Visibility
inferredcites →https://doi.org/10.1007/b100809openalex-snapshot
The Theory of Search Games and Rendezvous
inferredcites →https://doi.org/10.1017/s0021900200028011openalex-snapshot
The rendezvous problem on discrete locations
inferredcites →https://doi.org/10.1057/jors.1992.89openalex-snapshot
Finding Your Kids When They Are Lost
inferredcites →https://doi.org/10.1137/s0363012993249195openalex-snapshot
The Rendezvous Search Problem
inferredcites →https://doi.org/10.1137/s0363012993260288openalex-snapshot
Rendezvous Search on the Line with Distinguishable Players
inferredcites →https://doi.org/10.1137/s0363012993260707openalex-snapshot
Rendezvous Search on the Line with Indistinguishable Players
inferredcites →https://doi.org/10.1137/s036301299427816xopenalex-snapshot
Minimax Rendezvous on the Line
inferredcites →https://doi.org/10.1137/s0363012996314130openalex-snapshot
Rendezvous on the Line when the Players' Initial Distance is Given by an Unknown Probability Distribution
inferredcites →https://doi.org/10.1145/276884.276925openalex-snapshot
Asymmetric rendezvous on the plane
inferredcites →https://doi.org/10.1287/opre.47.4.550openalex-snapshot
Rendezvous Search on the Interval and the Circle
inferredcites →https://doi.org/10.1287/opre.49.1.107.11191openalex-snapshot
Two Dimensional Rendezvous Search
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.20095openalex-snapshot
Black hole search in common interconnection networks
inferred← citeshttps://doi.org/10.1007/11427186_18openalex-snapshot
Partitioning Graphs to Speed Up Dijkstra’s Algorithm
inferred← citeshttps://doi.org/10.1007/11427186_45openalex-snapshot
Local Clustering of Large Graphs by Approximate Fiedler Vectors
inferred← citeshttps://doi.org/10.1007/11429647_10openalex-snapshot
Distributed Exploration of an Unknown Graph
inferred← citeshttps://doi.org/10.1007/11429647_6openalex-snapshot
Range Augmentation Problems in Static Ad-Hoc Wireless Networks
inferred← citeshttps://doi.org/10.1007/11430919_42openalex-snapshot
Stochastic Local Clustering for Massive Graphs
inferred← citeshttps://doi.org/10.1007/11496137_15openalex-snapshot
Indexing Information for Data Forensics
inferred← citeshttps://doi.org/10.1007/11496199_36openalex-snapshot
An Approximation Algorithm for a Facility Location Problem with Inventories and Stochastic Demands
inferred← citeshttps://doi.org/10.1007/11523468_23openalex-snapshot
An Õ(m 2 n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph
inferred← citeshttps://doi.org/10.1007/11534273_26openalex-snapshot
A Dynamic Implicit Adjacency Labelling Scheme for Line Graphs
inferred← citeshttps://doi.org/10.1007/11538462_11openalex-snapshot
Approximating the Best-Fit Tree Under L p Norms
inferred← citeshttps://doi.org/10.1007/11549345_24openalex-snapshot
Asynchronous Deterministic Rendezvous in Graphs
inferred← citeshttps://doi.org/10.1007/11555261_67openalex-snapshot
Multilevel Compound Tree – Construction Visualization and Interaction
inferred← citeshttps://doi.org/10.1007/11560586_21openalex-snapshot
Laxity Helps in Broadcast Scheduling
inferred← citeshttps://doi.org/10.1007/11561071_44openalex-snapshot
Packet Routing and Information Gathering in Lines, Rings and Trees
inferred← citeshttps://doi.org/10.1007/11561071_51openalex-snapshot
Highway Hierarchies Hasten Exact Shortest Path Queries
inferred← citeshttps://doi.org/10.1007/11602613_106openalex-snapshot
Distance Labeling in Hyperbolic Graphs
inferred← citeshttps://doi.org/10.1007/11602613_24openalex-snapshot
Correlation Clustering and Consensus Clustering
inferred← citeshttps://doi.org/10.1007/11602613_63openalex-snapshot
On the Complexity of Global Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/11671541_10openalex-snapshot
Approximation Algorithms for the k-Median Problem
inferred← citeshttps://doi.org/10.1007/11682462_60openalex-snapshot
Mobile Agent Rendezvous in a Synchronous Torus
inferred← citeshttps://doi.org/10.1007/11805588_10openalex-snapshot
Notarized Federated Identity Management for Web Services
inferred← citeshttps://doi.org/10.1007/11830924_17openalex-snapshot
Improved Algorithms for Data Migration
inferred← citeshttps://doi.org/10.1007/11830924_21openalex-snapshot
Minimum Vehicle Routing with a Common Deadline
inferred← citeshttps://doi.org/10.1007/11830924_23openalex-snapshot
Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
inferred← citeshttps://doi.org/10.1007/11851561_34openalex-snapshot
Optimal Probing Patterns for Sequencing by Hybridization
inferred← citeshttps://doi.org/10.1007/11940128_74openalex-snapshot
Gathering Asynchronous Oblivious Mobile Robots in a Ring
inferred← citeshttps://doi.org/10.1007/11945529_14openalex-snapshot
Mobile Agent Algorithms Versus Message Passing Algorithms
inferred← citeshttps://doi.org/10.1007/11947950_1openalex-snapshot
Distributed Security Algorithms by Mobile Agents
inferred← citeshttps://doi.org/10.1007/11960669_16openalex-snapshot
Comparison of Modularization Methods in Application to Different Biological Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-24922-9_11openalex-snapshot
Asynchronous Rendezvous with Different Maps
inferred← citeshttps://doi.org/10.1007/978-3-319-04298-5_3openalex-snapshot
Advice Complexity: Quantitative Approach to A-Priori Information
inferred← citeshttps://doi.org/10.1007/978-3-319-07458-0_17openalex-snapshot
Don’t Walk into Walls: Creating and Visualizing Consensus Realities for Next Generation Videoconferencing
inferred← citeshttps://doi.org/10.1007/978-3-319-10515-4_5openalex-snapshot
Computing the Topology of an Arrangement of Implicit and Parametric Curves Given by Values
inferred← citeshttps://doi.org/10.1007/978-3-319-13075-0_27openalex-snapshot
On the Most Likely Voronoi Diagramand Nearest Neighbor Searching
inferred← citeshttps://doi.org/10.1007/978-3-319-46642-2_3openalex-snapshot
Exploring an Ontological Approach for User Requirements Elicitation in the Design of Online Virtual Agents
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_10openalex-snapshot
Collaboration Without Communication: Evacuating Two Robots from a Disk
inferred← citeshttps://doi.org/10.1007/978-3-319-72050-0_20openalex-snapshot
Gathering in Dynamic Rings
inferred← citeshttps://doi.org/10.1007/978-3-540-24592-6_21openalex-snapshot
Power Consumption Problems in Ad-Hoc Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-24618-3_30openalex-snapshot
Avoiding Forbidden Submatrices by Row Deletions
inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_16openalex-snapshot
Approximating Smallest Enclosing Balls
inferred← citeshttps://doi.org/10.1007/978-3-540-24854-5_125openalex-snapshot
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-27796-5_11openalex-snapshot
Improved Bounds for Optimal Black Hole Search with a Network Map
inferred← citeshttps://doi.org/10.1007/978-3-540-27796-5_15openalex-snapshot
Mobile Agents Rendezvous When Tokens Fail
inferred← citeshttps://doi.org/10.1007/978-3-540-27810-8_30openalex-snapshot
A ( $2 - c\frac{{\rm log} N}{N}$ )–Approximation Algorithm for the Stable Marriage Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-27821-4_7openalex-snapshot
Maximum Coverage Problem with Group Budget Constraints and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_19openalex-snapshot
Further Improvements in Competitive Guarantees for QoS Buffering
inferred← citeshttps://doi.org/10.1007/978-3-540-27860-3_6openalex-snapshot
Multiple Agents RendezVous in a Ring in Spite of a Black Hole
inferred← citeshttps://doi.org/10.1007/978-3-540-28634-9_15openalex-snapshot
Experimental Comparison of Algorithms for Energy-Efficient Multicasting in Ad Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-30140-0_25openalex-snapshot
Extreme Points Under Random Noise
inferred← citeshttps://doi.org/10.1007/978-3-540-30496-8_4openalex-snapshot
Secure Initialization in Single-Hop Radio Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-30497-5_183openalex-snapshot
Up to Face Extrusion Algorithm for Generating B-Rep Solid
inferred← citeshttps://doi.org/10.1007/978-3-540-30502-6_1openalex-snapshot
Counting by Coin Tossings
inferred← citeshttps://doi.org/10.1007/978-3-540-30551-4_56openalex-snapshot
Polynomial Deterministic Rendezvous in Arbitrary Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-31856-9_24openalex-snapshot
Packet Buffering: Randomization Beats Deterministic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-68880-8_14openalex-snapshot
Engineering Comparators for Graph Clusterings
inferred← citeshttps://doi.org/10.1007/978-3-540-68880-8_16openalex-snapshot
Confidently Cutting a Cake into Approximately Fair Pieces
inferred← citeshttps://doi.org/10.1007/978-3-540-68891-4_22openalex-snapshot
Importance Sampling via Load-Balanced Facility Location
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_6openalex-snapshot
Point-to-Point Shortest Path Algorithms with Preprocessing
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_31openalex-snapshot
On a Special Co-cycle Basis of Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-69903-3_38openalex-snapshot
On Trade-Offs in External-Memory Diameter-Approximation
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_23openalex-snapshot
Polynomial-Time Construction of Linear Network Coding
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_45openalex-snapshot
Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_3openalex-snapshot
Speed-Up Techniques for Shortest-Path Computations
inferred← citeshttps://doi.org/10.1007/978-3-540-72383-7_50openalex-snapshot
Enclosing Machine Learning for Class Description
inferred← citeshttps://doi.org/10.1007/978-3-540-72738-5_23openalex-snapshot
Efficient Content Authentication in Peer-to-Peer Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_2openalex-snapshot
Engineering Fast Route Planning Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_4openalex-snapshot
Better Landmarks Within Reach
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_8openalex-snapshot
On the Cost of Persistence and Authentication in Skip Lists
inferred← citeshttps://doi.org/10.1007/978-3-540-72870-2_2openalex-snapshot
Significance-Driven Graph Clustering
inferred← citeshttps://doi.org/10.1007/978-3-540-72903-7_20openalex-snapshot
Assessing the Performance of a Graph-Based Clustering Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-73312-6_7openalex-snapshot
The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables — and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_33openalex-snapshot
Parameterized Approximability of the Disjoint Cycle Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-73538-0_3openalex-snapshot
Authenticated Relational Tables and Authenticated Skip Lists
inferred← citeshttps://doi.org/10.1007/978-3-540-73545-8_53openalex-snapshot
An $\frac{8}{5}$ -Approximation Algorithm for a Hard Variant of Stable Marriage
inferred← citeshttps://doi.org/10.1007/978-3-540-73843-5_7openalex-snapshot
Computing the Topology of an Arrangement of Quartics
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_27openalex-snapshot
Streaming Algorithms for Data in Motion
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_3openalex-snapshot
Minimum Cycle Bases in Graphs Algorithms and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_39openalex-snapshot
Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults
inferred← citeshttps://doi.org/10.1007/978-3-540-74469-6_13openalex-snapshot
Space-Efficient Structures for Detecting Port Scans
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_12openalex-snapshot
On Finding Graph Clusterings with Maximum Modularity
inferred← citeshttps://doi.org/10.1007/978-3-540-74976-9_12openalex-snapshot
An Algorithm to Find Overlapping Community Structure in Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-74976-9_33openalex-snapshot
Flexible Grid-Based Clustering
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_52openalex-snapshot
Shorter Implicit Representation for Planar Graphs and Bounded Treewidth Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-75555-5_26openalex-snapshot
A Graph-Based Clustering Method and Its Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-77048-0_1openalex-snapshot
Time and Space Efficient Algorithms for Two-Party Authenticated Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-77096-1_18openalex-snapshot
Maximizing the Number of Broadcast Operations in Static Random Geometric Ad-Hoc Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_48openalex-snapshot
Faster Treasure Hunt and Better Strongly Universal Exploration Sequences
inferred← citeshttps://doi.org/10.1007/978-3-540-77120-3_63openalex-snapshot
Distributed Relationship Schemes for Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-77444-0_29openalex-snapshot
Mobile Agent Rendezvous in a Ring Using Faulty Tokens
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_52openalex-snapshot
Randomized Rendez-Vous with Limited Memory
inferred← citeshttps://doi.org/10.1007/978-3-540-78849-2_3openalex-snapshot
Aggregate Computation over Data Streams
inferred← citeshttps://doi.org/10.1007/978-3-540-95891-8_45openalex-snapshot
Asynchronous Deterministic Rendezvous on the Line
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_2openalex-snapshot
Graph Drawing for Security Visualization
inferred← citeshttps://doi.org/10.1007/978-3-642-00887-0_13openalex-snapshot
Ricochet: A Family of Unconstrained Algorithms for Graph Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-02094-0_1openalex-snapshot
Design and Engineering of External Memory Traversal Algorithms for General Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-02094-0_2openalex-snapshot
Minimum Cycle Bases and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-02094-0_7openalex-snapshot
Engineering Route Planning Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-02158-9_25openalex-snapshot
Cutting a Cake for Five People
inferred← citeshttps://doi.org/10.1007/978-3-642-02927-1_4openalex-snapshot
Correlation Clustering Revisited: The “True” Cost of Error Minimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_15openalex-snapshot
Via Detours to I/O-Efficient Shortest Paths
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_22openalex-snapshot
Algorithm Engineering – An Attempt at a Definition
inferred← citeshttps://doi.org/10.1007/978-3-642-03456-5_8openalex-snapshot
Some Results for Elementary Operations
inferred← citeshttps://doi.org/10.1007/978-3-642-03547-0_11openalex-snapshot
Optimized Graph Search Using Multi-Level Graph Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_24openalex-snapshot
Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_11openalex-snapshot
Constructing Delaunay Triangulations along Space-Filling Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-04383-3_13openalex-snapshot
Towards Fair Leader Election in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-11409-0_16openalex-snapshot
An Even Simpler Linear-Time Algorithm for Verifying Minimum Spanning Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-12038-1_20openalex-snapshot
Towards K-Nearest Neighbor Search in Time-Dependent Spatial Network Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-12156-2_42openalex-snapshot
Skeleton of a Multi-ribbon Surface
inferred← citeshttps://doi.org/10.1007/978-3-642-13033-5_64openalex-snapshot
Stochastic Chaotic Simulated Annealing Using Neural Network for Minimizing Interference in Mobile Hierarchical Ad Hoc and Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-13036-6_12openalex-snapshot
A 3-Approximation for Facility Location with Uniform Capacities
inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_32openalex-snapshot
Preprocessing Speed-Up Techniques Is Hard
inferred← citeshttps://doi.org/10.1007/978-3-642-13193-6_37openalex-snapshot
Modularity-Driven Clustering of Dynamic Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-13509-5_27openalex-snapshot
Algorithms for Three Versions of the Shortest Common Superstring Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-13739-6_12openalex-snapshot
Query Racing: Fast Completeness Certification of Query Results
inferred← citeshttps://doi.org/10.1007/978-3-642-14355-7_3openalex-snapshot
Efficient Algorithms for the Prize Collecting Steiner Tree Problems with Interval Data
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_27openalex-snapshot
Budgeted Red-Blue Median and Its Generalizations
inferred← citeshttps://doi.org/10.1007/978-3-642-17455-1_16openalex-snapshot
Optimal Authenticated Data Structures with Multilinear Forms
inferred← citeshttps://doi.org/10.1007/978-3-642-17653-1_18openalex-snapshot
SkewCCC+: A Heterogeneous Distributed Hash Table
inferred← citeshttps://doi.org/10.1007/978-3-642-19094-0_13openalex-snapshot
Efficient Top-k Queries for Orthogonal Ranges
inferred← citeshttps://doi.org/10.1007/978-3-642-19094-0_14openalex-snapshot
Range-Aggregate Queries Involving Geometric Aggregation Operations
inferred← citeshttps://doi.org/10.1007/978-3-642-19893-9_36openalex-snapshot
Lorenz versus Pareto Dominance in a Single Machine Scheduling Problem with Rejection
inferred← citeshttps://doi.org/10.1007/978-3-642-20364-0_6openalex-snapshot
Cutting Graphs Using Competing Ant Colonies and an Edge Clustering Heuristic
inferred← citeshttps://doi.org/10.1007/978-3-642-20662-7_8openalex-snapshot
Dynamic Arc-Flags in Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-21204-8_19openalex-snapshot
The Min-Power Multicast Problems in Wireless Ad Hoc Networks: A Parameterized View
inferred← citeshttps://doi.org/10.1007/978-3-642-22922-0_7openalex-snapshot
Online Computation of Fastest Path in Time-Dependent Spatial Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-23088-2_5openalex-snapshot
NEFOS: Rapid Cache-Aware Range Query Processing with Probabilistic Guarantees
inferred← citeshttps://doi.org/10.1007/978-3-642-24425-4_82openalex-snapshot
Granular Structures in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-24829-0_8openalex-snapshot
Throw One’s Cake — and Eat It Too
inferred← citeshttps://doi.org/10.1007/978-3-642-25126-9_65openalex-snapshot
Privacy Preserving Gate Counting with Collaborative Bluetooth Scanners
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_52openalex-snapshot
On Power-Law Distributed Balls in Bins and Its Applications to View Size Estimation
inferred← citeshttps://doi.org/10.1007/978-3-642-28169-3_3openalex-snapshot
Immune Size Approximation Algorithms in Ad Hoc Radio Network
inferred← citeshttps://doi.org/10.1007/978-3-642-29096-1_16openalex-snapshot
A Localized Algorithm Based on Minimum Cost Arborescences for the MECBS Problem with Asymmetric Edge Costs
inferred← citeshttps://doi.org/10.1007/978-3-642-30347-0_6openalex-snapshot
The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye
inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_25openalex-snapshot
An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_57openalex-snapshot
Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_17openalex-snapshot
A Dependent LP-Rounding Approach for the k-Median Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-31900-6_44openalex-snapshot
Three Granular Structure Models in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-32241-9_31openalex-snapshot
External Memory Soft Heap, and Hard Heap, a Meldable Priority Queue
inferred← citeshttps://doi.org/10.1007/978-3-642-33042-1_60openalex-snapshot
Clustering on Dynamic Social Network Data
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_13openalex-snapshot
A 5-Approximation for Capacitated Facility Location
inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_36openalex-snapshot
Better Bounds for Graph Bisection
inferred← citeshttps://doi.org/10.1007/978-3-642-34624-8_10openalex-snapshot
Exploration and Exploitation Operators for Genetic Graph Clustering Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-34862-4_16openalex-snapshot
An Efficient Generator for Clustered Dynamic Random Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-38004-4_15openalex-snapshot
Authenticating Email Search Results
inferred← citeshttps://doi.org/10.1007/978-3-642-38233-8_1openalex-snapshot
Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost
inferred← citeshttps://doi.org/10.1007/978-3-642-38715-9_15openalex-snapshot
Using Graph Clustering for Community Discovery in Web-Based Social Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-39179-8_10openalex-snapshot
Discovering and Studying Collaboration Networks in Software Repositories
inferred← citeshttps://doi.org/10.1007/978-3-642-39247-4_3openalex-snapshot
Maximum Lifetime Broadcast in Mobile Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-39304-4_5openalex-snapshot
Automated Shift Design and Break Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-642-40273-9_10openalex-snapshot
A History of Distribution-Sensitive Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_29openalex-snapshot
Abstract Voronoi Diagrams with Disconnected Regions
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_28openalex-snapshot
New Bounds for Online Packing LPs
inferred← citeshttps://doi.org/10.1007/978-3-642-55415-5_24openalex-snapshot
Authenticated Dictionary Based on Frequency
inferred← citeshttps://doi.org/10.1007/s00224-005-1223-5openalex-snapshot
Rendezvous and Election of Mobile Agents: Impact of Sense of Direction
inferred← citeshttps://doi.org/10.1007/s00224-013-9484-xopenalex-snapshot
The Kissing Problem: How to End a Gathering When Everyone Kisses Everyone Else Goodbye
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/s00453-006-0074-2openalex-snapshot
Deterministic Rendezvous in Graphs
inferred← citeshttps://doi.org/10.1016/j.cosrev.2010.09.007openalex-snapshot
Streaming techniques and data aggregation in networks of tiny artefacts
inferred← citeshttps://doi.org/10.1016/j.dam.2011.01.020openalex-snapshot
Deterministic symmetric rendezvous with tokens in a synchronous torus
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.12.016openalex-snapshot
Asynchronous deterministic rendezvous in graphs
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.2007.09.032openalex-snapshot
Gathering asynchronous oblivious mobile robots in a ring
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.006openalex-snapshot
Election and rendezvous with incomparable labels
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.010openalex-snapshot
How to meet in anonymous network
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.10.031openalex-snapshot
Two improved range-efficient algorithms for F0 estimation
inferred← citeshttps://doi.org/10.1109/icra.2014.6907710openalex-snapshot
Multi-agent rendezvous on street networks
inferred← citeshttps://doi.org/10.1109/iros.2012.6386049openalex-snapshot
Multi-robot exploration and rendezvous on graphs
inferred← citeshttps://doi.org/10.1109/iros.2016.7759299openalex-snapshot
Fast and efficient rendezvous in street networks
inferred← citeshttps://doi.org/10.1109/iros.2018.8594460openalex-snapshot
Re-Establishing Communication in Teams of Mobile Robots
inferred← citeshttps://doi.org/10.1145/1187436.1216585openalex-snapshot
Partitioning graphs to speedup Dijkstra's algorithm
inferred← citeshttps://doi.org/10.1145/1978782.1978789openalex-snapshot
Randomized rendezvous with limited memory
inferred← citeshttps://doi.org/10.1145/2601068openalex-snapshot
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
inferred← citeshttps://doi.org/10.1145/2684464.2684468openalex-snapshot
Randomized Rendezvous Algorithms for Agents on a Ring with Different Speeds
inferred← citeshttps://doi.org/10.1145/571825.571853openalex-snapshot
Searching for a black hole in arbitrary networks
inferred← citeshttps://doi.org/10.1145/777412.777469openalex-snapshot
Can we elect if we cannot compare?
inferred← citeshttps://doi.org/10.1190/geo2018-0481.1openalex-snapshot
Particula: A simulator tool for computational rock physics of granular media
inferred← citeshttps://doi.org/10.1201/9781420011296-15openalex-snapshot
Computing with Mobile Agents in Distributed Networks
inferred← citeshttps://doi.org/10.20381/ruor-13057openalex-snapshot
Locating mobile agents through distributed mechanisms
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-5412openalex-snapshot
Network Decontamination with Temporal Immunity
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.3390/a8030680openalex-snapshot
Network Community Detection on Metric Space
inferred← citeshttps://doi.org/10.3390/e25071058openalex-snapshot
Achieving Verifiable Decision Tree Prediction on Hybrid Blockchains
inferred← citeshttps://doi.org/10.48550/arxiv.2008.07455openalex-snapshot
Gathering in 1-Interval Connected Graphs
inferred← citeshttps://doi.org/10.5555/1283383.1283448openalex-snapshot
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
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.