On the public citation graph

Geographic Routing Using Hyperbolic Space

0 signed · 379 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.1007/bf01200757openalex-snapshot
The geometry of graphs and some of its algorithmic applications
inferredcites →https://doi.org/10.1016/0022-2496(74)90027-3openalex-snapshot
Monotone mapping of similarities into a general metric space
inferredcites →https://doi.org/10.1016/j.jctb.2005.04.005openalex-snapshot
Monotone maps, sphericity and bounded second eigenvalue
inferredcites →https://doi.org/10.1016/j.tcs.2005.06.022openalex-snapshot
On a conjecture related to geometric routing
inferredcites →https://doi.org/10.1023/a:1012319418150openalex-snapshot
Routing with Guaranteed Delivery in Ad Hoc Wireless Networks
inferredcites →https://doi.org/10.1023/a:1024591915518openalex-snapshot
Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table
inferredcites →https://doi.org/10.1109/infcom.2005.1497887openalex-snapshot
GPS free coordinate assignment and routing in wireless sensor networks
inferredcites →https://doi.org/10.1109/mm.2002.1134340openalex-snapshot
Mica: a wireless platform for deeply embedded networks
inferredcites →https://doi.org/10.1112/plms/s3-10.1.304openalex-snapshot
Convex Representations of Graphs
inferredcites →https://doi.org/10.1145/318951.319004openalex-snapshot
An algorithm for distributed computation of a spanningtree in an extended LAN
inferredcites →https://doi.org/10.1145/345910.345953openalex-snapshot
GPSR
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/383059.383072openalex-snapshot
A scalable content-addressable network
inferredcites →https://doi.org/10.1145/501416.501424openalex-snapshot
Geometric spanner for routing in mobile networks
inferredcites →https://doi.org/10.1145/501422.501424openalex-snapshot
Geometric spanner for routing in mobile networks
inferredcites →https://doi.org/10.1145/872035.872044openalex-snapshot
Geometric ad-hoc routing
inferredcites →https://doi.org/10.1145/938985.938996openalex-snapshot
Geographic routing without location information
inferredcites →https://doi.org/10.1145/938994.938996openalex-snapshot
Geographic routing without location information
inferredcites →https://doi.org/10.1515/9781400865321openalex-snapshot
Three-Dimensional Geometry and Topology, Volume 1
inferredcites →https://doi.org/10.5555/1251203.1251219openalex-snapshot
Geographic routing made practical
inferredcites →https://doi.org/10.5555/1251203.1251227openalex-snapshot
Beacon vector routing: scalable point-to-point routing in wireless sensornets

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119551713.ch19openalex-snapshot
Fog Computing to Enable Geospatial Video Analytics for Disaster‐incident Situational Awareness
inferred← citeshttps://doi.org/10.1002/ett.2987openalex-snapshot
Dynamic greedy routing in overlay networks using virtual coordinates from the hyperbolic plane
inferred← citeshttps://doi.org/10.1002/net.21449openalex-snapshot
Succinct greedy drawings do not always exist
inferred← citeshttps://doi.org/10.1002/net.21630openalex-snapshot
Optimizing robustness in geometric routing via embedding redundancy and regeneration
inferred← citeshttps://doi.org/10.1002/net.21631openalex-snapshot
Metric tree‐like structures in real‐world networks: an empirical study
inferred← citeshttps://doi.org/10.1002/wcm.1106openalex-snapshot
An energy‐efficient hole‐healing mechanism for wireless sensor networks with obstacles
inferred← citeshttps://doi.org/10.1002/wcm.1152openalex-snapshot
A detailed analytical and simulation study of geographic random forwarding
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_41openalex-snapshot
Geometric Optimization in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-1-4471-4552-3_5openalex-snapshot
On the Feasibility of Dynamic, Efficient, and Scalable Name-Based Discovery Systems
inferred← citeshttps://doi.org/10.1007/978-1-4614-0110-0_9openalex-snapshot
Drawing Trees, Outerplanar Graphs, Series-Parallel Graphs, and Planar Graphs in a Small Area
inferred← citeshttps://doi.org/10.1007/978-1-84882-218-4_5openalex-snapshot
Geometric Routing in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-00006-6_48openalex-snapshot
Greedy Embedding Strategy for Dynamic Graphs Based on Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-030-67087-0_25openalex-snapshot
Routing in Generalized Geometric Inhomogeneous Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-92931-2_25openalex-snapshot
Limitations on Realistic Hyperbolic Graph Drawing
inferred← citeshttps://doi.org/10.1007/978-3-031-70352-2_7openalex-snapshot
Hyperbolic Delaunay Geometric Alignment
inferred← citeshttps://doi.org/10.1007/978-3-319-26784-5openalex-snapshot
Algorithms and Models for the Web Graph
inferred← citeshttps://doi.org/10.1007/978-3-319-26784-5_3openalex-snapshot
Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-26850-7_28openalex-snapshot
Virtual and Consistent Hyperbolic Tree: A New Structure for Distributed Database Management
inferred← citeshttps://doi.org/10.1007/978-3-319-38904-2_28openalex-snapshot
A Cloud Computing System Using Virtual Hyperbolic Coordinates for Services Distribution
inferred← citeshttps://doi.org/10.1007/978-3-540-74208-1_5openalex-snapshot
Packing and Covering δ-Hyperbolic Spaces by Balls
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_29openalex-snapshot
Good Quality Virtual Realization of Unit Ball Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_69openalex-snapshot
Navigating in a Graph by Aid of Its Spanning Tree
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_3openalex-snapshot
Succinct Greedy Graph Drawing in the Hyperbolic Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-00219-9_4openalex-snapshot
An Algorithm to Construct Greedy Drawings of Triangulations
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_49openalex-snapshot
Compact and Low Delay Routing Labeling Scheme for Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-03816-7_25openalex-snapshot
How to Use Spanning Trees to Navigate in Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_79openalex-snapshot
Succinct Greedy Geometric Routing in the Euclidean Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-11805-0_17openalex-snapshot
Succinct Greedy Drawings Do Not Always Exist
inferred← citeshttps://doi.org/10.1007/978-3-642-13067-0_25openalex-snapshot
A Lower Bound on Greedy Embedding in Euclidean Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-21204-8_10openalex-snapshot
Greedy Routing via Embedding Graphs onto Semi-metric Spaces
inferred← citeshttps://doi.org/10.1007/978-3-642-25249-5_1openalex-snapshot
Revisiting Hyperbolic Voronoi Diagrams in Two and Higher Dimensions from Theoretical, Applied and Generalized Viewpoints
inferred← citeshttps://doi.org/10.1007/978-3-642-25878-7_34openalex-snapshot
Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane
inferred← citeshttps://doi.org/10.1007/978-3-642-28209-6_4openalex-snapshot
Maximizing Network Lifetime on the Line with Adjustable Sensing Ranges
inferred← citeshttps://doi.org/10.1007/978-3-642-31104-8_1openalex-snapshot
Space Lower Bounds for Low-Stretch Greedy Embeddings
inferred← citeshttps://doi.org/10.1007/978-3-642-31585-5_51openalex-snapshot
Random Hyperbolic Graphs: Degree Sequence and Clustering
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_31openalex-snapshot
On the Hyperbolicity of Small-World and Tree-Like Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-38865-1_8openalex-snapshot
A Note on the Local Minimum Problem in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-40009-4_14openalex-snapshot
Geometric Methods of Information Storage and Retrieval in Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-40066-7_10openalex-snapshot
Three-Dimensional Wireless Sensor Networks: Geometric Approaches for Topology and Routing Design
inferred← citeshttps://doi.org/10.1007/978-3-642-40450-4_65openalex-snapshot
Euclidean Greedy Drawings of Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-40698-0_6openalex-snapshot
Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity
inferred← citeshttps://doi.org/10.1007/978-3-662-45803-7_40openalex-snapshot
On Self-Approaching and Increasing-Chord Drawings of 3-Connected Planar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-46248-5_13openalex-snapshot
An ICN-Oriented Name-Based Routing Scheme
inferred← citeshttps://doi.org/10.1007/978-981-97-2966-1_13openalex-snapshot
RGCNdist2vec: Using Graph Convolutional Networks and Distance2Vector to Estimate Shortest Path Distance Along Road Networks
inferred← citeshttps://doi.org/10.1007/s00453-010-9478-xopenalex-snapshot
Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs
inferred← citeshttps://doi.org/10.1007/s00453-012-9647-1openalex-snapshot
How to Use Spanning Trees to Navigate in Graphs
inferred← citeshttps://doi.org/10.1007/s00453-012-9682-yopenalex-snapshot
On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs
inferred← citeshttps://doi.org/10.1007/s00453-017-0291-7openalex-snapshot
Effect of Gromov-Hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications
inferred← citeshttps://doi.org/10.1007/s00454-009-9227-6openalex-snapshot
Some Results on Greedy Embeddings in Metric Spaces
inferred← citeshttps://doi.org/10.1007/s00454-017-9913-8openalex-snapshot
Euclidean Greedy Drawings of Trees
inferred← citeshttps://doi.org/10.1007/s10955-018-2115-9openalex-snapshot
Network Geometry and Complexity
inferred← citeshttps://doi.org/10.1007/s11036-019-01325-4openalex-snapshot
Secure Data Sharing Framework via Hierarchical Greedy Embedding in Darknets
inferred← citeshttps://doi.org/10.1007/s11107-017-0723-yopenalex-snapshot
All-optical tree-based greedy router using optical logic gates and optical flip-flops
inferred← citeshttps://doi.org/10.1007/s11227-022-04485-5openalex-snapshot
Hyperbolic trees for efficient routing computation
inferred← citeshttps://doi.org/10.1007/s11276-009-0187-9openalex-snapshot
Routing with off-network control: a novel paradigm for scalable design in very large sensor networks
inferred← citeshttps://doi.org/10.1007/s11276-014-0770-6openalex-snapshot
GRIP: Greedy Routing through dIstributed Parametrization for guaranteed delivery in WSNs
inferred← citeshttps://doi.org/10.1007/s11276-021-02751-7openalex-snapshot
A hyperbolic routing scheme for information-centric internet of things with edge computing
inferred← citeshttps://doi.org/10.1007/s11390-025-5946-2openalex-snapshot
Uncovering Several Useful Structures of Complex Networks in Computer Science Applications
inferred← citeshttps://doi.org/10.1007/s11432-012-4655-yopenalex-snapshot
Integrating local and partial network view for routing on scale-free networks
inferred← citeshttps://doi.org/10.1007/s11802-012-2111-7openalex-snapshot
Three-dimensional ocean sensor networks: A survey
inferred← citeshttps://doi.org/10.1007/s13119-013-0013-7openalex-snapshot
On the choice of a spanning tree for greedy embedding of network graphs
inferred← citeshttps://doi.org/10.1007/s41109-016-0013-0openalex-snapshot
Manifold learning and maximum likelihood estimation for hyperbolic network embedding
inferred← citeshttps://doi.org/10.1016/j.adhoc.2010.07.013openalex-snapshot
G-STAR: Geometric STAteless Routing for 3-D wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.adhoc.2014.04.007openalex-snapshot
A distributed routing for wireless sensor networks with mobile sink based on the greedy embedding
inferred← citeshttps://doi.org/10.1016/j.adhoc.2017.03.002openalex-snapshot
Bypassing holes in sensor networks: Load-balance vs. latency
inferred← citeshttps://doi.org/10.1016/j.aeue.2020.153498openalex-snapshot
Geometric greedy router in Quantum-dot Cellular Automata
inferred← citeshttps://doi.org/10.1016/j.aim.2015.09.002openalex-snapshot
Enumeration of graphs with a heavy-tailed degree sequence
inferred← citeshttps://doi.org/10.1016/j.amc.2014.05.023openalex-snapshot
Virtual coordinates in hyperbolic space based on Ricci flow for WLANs
inferred← citeshttps://doi.org/10.1016/j.comcom.2010.03.021openalex-snapshot
Minimizing recovery overhead in geographic ad hoc routing
inferred← citeshttps://doi.org/10.1016/j.comcom.2012.08.023openalex-snapshot
Link failure recovery technique for greedy routing in the hyperbolic plane
inferred← citeshttps://doi.org/10.1016/j.comcom.2017.10.014openalex-snapshot
Succinct and practical greedy embedding for geometric routing
inferred← citeshttps://doi.org/10.1016/j.comgeo.2012.01.015openalex-snapshot
Compact and low delay routing labeling scheme for Unit Disk Graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2016.08.003openalex-snapshot
Metric embedding, hyperbolic space, and social networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2011.03.014openalex-snapshot
Price: Hybrid geographic and co-based forwarding in delay-tolerant networks
inferred← citeshttps://doi.org/10.1016/j.comnet.2012.12.004openalex-snapshot
Incrementally upgradable data center architecture using hyperbolic tessellations
inferred← citeshttps://doi.org/10.1016/j.comnet.2015.02.022openalex-snapshot
Experimental validation of resilient tree-based greedy geometric routing
inferred← citeshttps://doi.org/10.1016/j.dam.2010.10.016openalex-snapshot
Distributed computation of virtual coordinates for greedy routing in sensor networks
inferred← citeshttps://doi.org/10.1016/j.endm.2017.06.051openalex-snapshot
A simple approach for lower-bounding the distortion in any Hyperbolic embedding
inferred← citeshttps://doi.org/10.1016/j.future.2017.08.009openalex-snapshot
AGRA: AI-augmented geographic routing approach for IoT-based incident-supporting applications
inferred← citeshttps://doi.org/10.1016/j.future.2020.02.079openalex-snapshot
REBATE: A REpulsive-BAsed Traffic Engineering protocol for dynamic scale-free networks
inferred← citeshttps://doi.org/10.1016/j.jmaa.2011.02.067openalex-snapshot
Graphs and Gromov hyperbolicity of non-constant negatively curved surfaces
inferred← citeshttps://doi.org/10.1016/j.physa.2013.09.014openalex-snapshot
Navigation in spatial networks: A survey
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.08.032openalex-snapshot
A generalized greedy routing algorithm for 2-connected graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.01.049openalex-snapshot
Greedy routing via embedding graphs onto semi-metric spaces
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.01.017openalex-snapshot
A simple routing algorithm based on Schnyder coordinates
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.04.027openalex-snapshot
Category-based routing in social networks: Membership dimension and the small-world phenomenon
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.02.003openalex-snapshot
Space lower bounds for low-stretch greedy embeddings
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.05.025openalex-snapshot
Data center interconnection networks are not hyperbolic
inferred← citeshttps://doi.org/10.1016/j.topol.2009.10.008openalex-snapshot
Manhattan orbifolds
inferred← citeshttps://doi.org/10.1017/nws.2024.13openalex-snapshot
Maximal cliques in scale-free random graphs
inferred← citeshttps://doi.org/10.1038/s41467-023-43337-5openalex-snapshot
The D-Mercator method for the multidimensional hyperbolic embedding of real networks
inferred← citeshttps://doi.org/10.1038/s41598-017-12586-yopenalex-snapshot
The Hidden Flow Structure and Metric Space of Network Embedding Algorithms Based on Random Walks
inferred← citeshttps://doi.org/10.1038/s42254-020-00264-4openalex-snapshot
Network geometry
inferred← citeshttps://doi.org/10.1038/srep10073openalex-snapshot
Emergent Complex Network Geometry
inferred← citeshttps://doi.org/10.1038/srep13979openalex-snapshot
Complex Quantum Network Manifolds in Dimension $d>2$ are Scale-Free
inferred← citeshttps://doi.org/10.1038/srep41974openalex-snapshot
Emergent Hyperbolic Network Geometry
inferred← citeshttps://doi.org/10.1080/15427951.2013.828336openalex-snapshot
On the Hyperbolicity of Small-World and Treelike Random Graphs
inferred← citeshttps://doi.org/10.1088/1742-5468/ab3bc8openalex-snapshot
Fast hyperbolic mapping based on the hierarchical community structure in complex networks
inferred← citeshttps://doi.org/10.1088/1742-6596/1096/1/012080openalex-snapshot
Cluster approach for network routing in hierarchical systems
inferred← citeshttps://doi.org/10.1088/1742-6596/1368/5/052005openalex-snapshot
Addressing system and routing without tables in new generation networks
inferred← citeshttps://doi.org/10.1088/2632-072x/ad0e23openalex-snapshot
Zoo guide to network embedding
inferred← citeshttps://doi.org/10.1093/comnet/cnaa002openalex-snapshot
Hydra: a method for strain-minimizing hyperbolic embedding of network- and distance-based data
inferred← citeshttps://doi.org/10.1093/comnet/cnad002openalex-snapshot
Strain-minimizing hyperbolic network embeddings with landmarks
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.001.0001openalex-snapshot
The Nature of Complex Networks
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.002.0003openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.002.0004openalex-snapshot
Dedication
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.002.0005openalex-snapshot
Epigraph
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.002.0006openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.002.0007openalex-snapshot
Contents
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.002.0008openalex-snapshot
Further reading
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.003.0001openalex-snapshot
First Insight
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.003.0002openalex-snapshot
Graphs
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.003.0003openalex-snapshot
Classical Random Graphs
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.003.0004openalex-snapshot
Equilibrium Networks
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.003.0005openalex-snapshot
Evolving Networks
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.003.0006openalex-snapshot
Connected Components
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.003.0007openalex-snapshot
Epidemics and Spreading Phenomena
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.003.0008openalex-snapshot
Networks of Networks
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.003.0009openalex-snapshot
Spectra and Communities
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.003.0010openalex-snapshot
Walks and Search
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.003.0011openalex-snapshot
Temporal Networks
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.003.0012openalex-snapshot
Cooperative Systems on Networks
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.003.0013openalex-snapshot
Inference and Reconstruction
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.003.0014openalex-snapshot
What’s Next?
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.005.0001openalex-snapshot
Adjacency Matrix for Hypergraphs
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.005.0002openalex-snapshot
Spectra of symmetric normalized Laplacians of sample graphs
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.005.0003openalex-snapshot
Generating Functions
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.005.0004openalex-snapshot
Hyperscaling Relations for Percolation
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.005.0005openalex-snapshot
Degree Distribution of a Damaged Network
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.005.0006openalex-snapshot
Non-backtracking Matrix
inferred← citeshttps://doi.org/10.1093/oso/9780199695119.005.0007openalex-snapshot
Treating General Interdependent Networks
inferred← citeshttps://doi.org/10.1098/rsta.2011.0215openalex-snapshot
Geometric algorithms for sensor networks
inferred← citeshttps://doi.org/10.1103/physreva.98.062328openalex-snapshot
Unitary entanglement construction in hierarchical networks
inferred← citeshttps://doi.org/10.1103/physreve.104.054302openalex-snapshot
Local topological moves determine global diffusion properties of hyperbolic higher-order networks
inferred← citeshttps://doi.org/10.1103/physreve.84.046102openalex-snapshot
Identifying communities by influence dynamics in social networks
inferred← citeshttps://doi.org/10.1109/access.2019.2902621openalex-snapshot
Lightweight Anonymous Geometric Routing for Internet of Things
inferred← citeshttps://doi.org/10.1109/access.2020.2981928openalex-snapshot
Towards Efficient NDN Framework for Connected Vehicle Applications
inferred← citeshttps://doi.org/10.1109/access.2024.3454807openalex-snapshot
HLoOP—Hyperbolic 2-Space Local Outlier Probabilities
inferred← citeshttps://doi.org/10.1109/apwimob48441.2019.8964134openalex-snapshot
Named Data Network (NDN) Scalability Problem
inferred← citeshttps://doi.org/10.1109/cadsm.2017.7916156openalex-snapshot
Increasing the reliability of distribution systems by the use of intrusion detection system based on ricci flows
inferred← citeshttps://doi.org/10.1109/cason.2011.6085926openalex-snapshot
Category-based routing in social networks: Membership dimension and the small-world phenomenon
inferred← citeshttps://doi.org/10.1109/ccnc.2014.6866575openalex-snapshot
Increasing recommendation accuracy and diversity via social networks hyperbolic embedding
inferred← citeshttps://doi.org/10.1109/cdc.2012.6425837openalex-snapshot
Social networks over wireless networks
inferred← citeshttps://doi.org/10.1109/cdc.2014.7040150openalex-snapshot
Social network ad allocation via hyperbolic embedding
inferred← citeshttps://doi.org/10.1109/coconet.2015.7411231openalex-snapshot
Greedy routing performance analysis of network embedded in Hyperbolic and Euclidean Space
inferred← citeshttps://doi.org/10.1109/csci49370.2019.00092openalex-snapshot
The Skeleton of Hyperbolic Graphs for Greedy Navigation
inferred← citeshttps://doi.org/10.1109/csci51800.2020.00256openalex-snapshot
Proximity in the Brain
inferred← citeshttps://doi.org/10.1109/csci58124.2022.00084openalex-snapshot
Connected Hyperbolic Complex Networks
inferred← citeshttps://doi.org/10.1109/dcoss.2016.21openalex-snapshot
Greedy Routing on Virtual Raw Anchor Coordinate (VRAC) System
inferred← citeshttps://doi.org/10.1109/drcn.2014.6816153openalex-snapshot
Availability analysis of resilient geometric routing on Internet topology
inferred← citeshttps://doi.org/10.1109/euc.2011.40openalex-snapshot
Greedy Routing on Hierarchical Clusters
inferred← citeshttps://doi.org/10.1109/focs.2008.18openalex-snapshot
Some Results on Greedy Embeddings in Metric Spaces
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00101openalex-snapshot
Explicit near-fully X-Ramanujan graphs
inferred← citeshttps://doi.org/10.1109/glocom.2012.6503083openalex-snapshot
A new routing scheme based on adaptive selection of geographic directions
inferred← citeshttps://doi.org/10.1109/glocom.2013.6831380openalex-snapshot
MobiCCN: Mobility support with greedy routing in Content-Centric Networks
inferred← citeshttps://doi.org/10.1109/glocom.2014.7417435openalex-snapshot
Geometric Routing on Flat Names for ICN
inferred← citeshttps://doi.org/10.1109/glocom.2015.7417435openalex-snapshot
Geometric Routing on Flat Names for ICN
inferred← citeshttps://doi.org/10.1109/i-span.2009.20openalex-snapshot
On Succinctness of Geometric Greedy Routing in Euclidean Plane
inferred← citeshttps://doi.org/10.1109/icc.2010.5502391openalex-snapshot
Tree Cover Based Geographic Routing with Guaranteed Delivery
inferred← citeshttps://doi.org/10.1109/icc.2012.6363880openalex-snapshot
On graphs supporting greedy forwarding for directional wireless networks
inferred← citeshttps://doi.org/10.1109/icc.2014.6883313openalex-snapshot
FLYER: Fine-grained landmark based greedy geographic routing under uncertain locations
inferred← citeshttps://doi.org/10.1109/icc.2019.8762055openalex-snapshot
Content-Based Hyperbolic Routing and Push Mechanism in Named Data Networking
inferred← citeshttps://doi.org/10.1109/iccnc.2014.6785477openalex-snapshot
Greedy Failure-Carrying Packets
inferred← citeshttps://doi.org/10.1109/iccwamtip47768.2019.9067503openalex-snapshot
Navigation in Complex Networks Using Random Walk Theory and Principal Component Analysis
inferred← citeshttps://doi.org/10.1109/icdcs.2017.129openalex-snapshot
Uncovering the Useful Structures of Complex Networks in Socially-Rich and Dynamic Environments
inferred← citeshttps://doi.org/10.1109/icdcsw.2012.76openalex-snapshot
Poincaré: A Hyperbolic Data Center Architecture
inferred← citeshttps://doi.org/10.1109/icdm.2013.77openalex-snapshot
Tree-Like Structure in Large Social and Information Networks
inferred← citeshttps://doi.org/10.1109/icicisys.2009.5358156openalex-snapshot
Loop-free greedy routing in ad hoc or sensor networks using muti-hop geographic information
inferred← citeshttps://doi.org/10.1109/icis.2008.82openalex-snapshot
Dimensionality Reduction in Hyperbolic Data Spaces: Bounding Reconstructed-Information Loss
inferred← citeshttps://doi.org/10.1109/icnc57223.2023.10074285openalex-snapshot
Hyperbolic Routing for Cache Privacy in Information Centric Networking
inferred← citeshttps://doi.org/10.1109/icnc64010.2025.10993766openalex-snapshot
Analysis of Greedy Hyperbolic Routing in Named Data Networking
inferred← citeshttps://doi.org/10.1109/icnp.2010.5762753openalex-snapshot
Practical Virtual Coordinates for large wireless sensor networks
inferred← citeshttps://doi.org/10.1109/icnp.2011.6089081openalex-snapshot
Scalable routing easy as PIE: A practical isometric embedding protocol
inferred← citeshttps://doi.org/10.1109/icpads.2009.13openalex-snapshot
HyperSpring: Accurate and Stable Latency Estimation in the Hyperbolic Space
inferred← citeshttps://doi.org/10.1109/ict.2016.7500371openalex-snapshot
Hyperbolic Traffic Load Centrality for large-scale complex communications networks
inferred← citeshttps://doi.org/10.1109/ifipnetworking.2015.7145303openalex-snapshot
AS path inference: From complex network perspective
inferred← citeshttps://doi.org/10.1109/ifipnetworking.2016.7497240openalex-snapshot
Let's collect names: How PANINI limits FIB tables in name based routing
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062083openalex-snapshot
Hyperbolic Embedding and Routing for Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062093openalex-snapshot
Greedy Routing with Bounded Stretch
inferred← citeshttps://doi.org/10.1109/infcom.2009.5062240openalex-snapshot
Scalable Routing Via Greedy Embedding
inferred← citeshttps://doi.org/10.1109/infcom.2010.5461988openalex-snapshot
Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space
inferred← citeshttps://doi.org/10.1109/infcom.2010.5462131openalex-snapshot
Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces
inferred← citeshttps://doi.org/10.1109/infcom.2011.5935240openalex-snapshot
Spherical representation and polyhedron routing for load balancing in wireless sensor networks
inferred← citeshttps://doi.org/10.1109/infcom.2012.6195678openalex-snapshot
Scalable routing in 3D high genus sensor networks using graph embedding
inferred← citeshttps://doi.org/10.1109/infcom.2013.6567046openalex-snapshot
Compact conformal map for greedy routing in wireless mobile sensor networks
inferred← citeshttps://doi.org/10.1109/infcomw.2012.6193497openalex-snapshot
Low-stretch greedy embedding heuristics
inferred← citeshttps://doi.org/10.1109/infocom.2008.134openalex-snapshot
An Information Model for Geographic Greedy Forwarding in Wireless Ad-Hoc Sensor Networks
inferred← citeshttps://doi.org/10.1109/infocom.2008.135openalex-snapshot
Randomized 3D Geographic Routing
inferred← citeshttps://doi.org/10.1109/infocom.2014.6848027openalex-snapshot
Bounded stretch geographic homotopic routing in sensor networks
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218394openalex-snapshot
On the impossibility of efficient self-stabilization in virtual overlays with churn
inferred← citeshttps://doi.org/10.1109/infocom.2015.7218515openalex-snapshot
Robust geometric forest routing with tunable load balancing
inferred← citeshttps://doi.org/10.1109/infocom.2016.7524553openalex-snapshot
Anonymous addresses for efficient and resilient routing in F2F overlays
inferred← citeshttps://doi.org/10.1109/infocom.2017.8057003openalex-snapshot
BD-CAT: Balanced dynamic content addressing in trees
inferred← citeshttps://doi.org/10.1109/infocommst.2017.8246432openalex-snapshot
Metric tensor definition model for service-oriented network based on curvilinear coordinates systems
inferred← citeshttps://doi.org/10.1109/ipdpsw.2012.317openalex-snapshot
Coverage-aware Geocast Routing in Urban Vehicular Networks
inferred← citeshttps://doi.org/10.1109/iscc.2011.5983793openalex-snapshot
Overlay addressing and routing system based on hyperbolic geometry
inferred← citeshttps://doi.org/10.1109/iscc.2012.6249275openalex-snapshot
FPC: A self-organized greedy routing in scale-free networks
inferred← citeshttps://doi.org/10.1109/iscc.2013.6755040openalex-snapshot
LMD: A local minimum driven and self-organized method to obtain locators
inferred← citeshttps://doi.org/10.1109/issnip.2014.6827667openalex-snapshot
Load balanced routing with constant stretch for wireless sensor network with holes
inferred← citeshttps://doi.org/10.1109/isvd.2010.13openalex-snapshot
Revisiting Hyperbolic Voronoi Diagrams from Theoretical, Applied and Generalized Viewpoints
showing the first 200 of 358 · page through all 358
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.