On the public citation graph

Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph

https://doi.org/10.1007/11795490_19
0 signed · 58 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/wcm.108openalex-snapshot
Robust position‐based routing in wireless ad hoc networks with irregular transmission ranges
inferredcites →https://doi.org/10.1007/3-540-45071-8_38openalex-snapshot
Efficient Construction of Low Weight Bounded Degree Planar Spanner
inferredcites →https://doi.org/10.1007/978-3-540-27796-5_3openalex-snapshot
Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks
inferredcites →https://doi.org/10.1007/bf02187821openalex-snapshot
Classes of graphs which approximate the complete euclidean graph
inferredcites →https://doi.org/10.1016/0031-3203(80)90066-7openalex-snapshot
The relative neighbourhood graph of a finite planar set
inferredcites →https://doi.org/10.1023/a:1013985610753openalex-snapshot
Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/5.163414openalex-snapshot
Relative neighborhood graphs and their relatives
inferredcites →https://doi.org/10.1109/cdcs.2001.918745openalex-snapshot
Internal node and shortcut based routing with guaranteed delivery in wireless networks
inferredcites →https://doi.org/10.1109/hicss.2002.994518openalex-snapshot
Sparse power efficient topology for wireless networks
inferredcites →https://doi.org/10.1109/infcom.2002.1019377openalex-snapshot
Distributed construction of a planar spanner and routing for ad hoc wireless networks
inferredcites →https://doi.org/10.1109/tpds.2003.1239871openalex-snapshot
Localized Delaunay triangulation with application in ad hoc wireless networks
inferredcites →https://doi.org/10.1137/0211059openalex-snapshot
On Constructing Minimum Spanning Trees in k -Dimensional Spaces and Related Problems
inferredcites →https://doi.org/10.1142/s0218195904001366openalex-snapshot
EFFICIENT CONSTRUCTION OF LOW WEIGHTED BOUNDED DEGREE PLANAR SPANNER
inferredcites →https://doi.org/10.1145/225058.225191openalex-snapshot
Euclidean spanners
inferredcites →https://doi.org/10.1145/288235.288256openalex-snapshot
A performance comparison of multi-hop wireless ad hoc network routing protocols
inferredcites →https://doi.org/10.1145/313239.313282openalex-snapshot
Routing with guaranteed delivery in ad hoc wireless networks
inferredcites →https://doi.org/10.1145/381448.381451openalex-snapshot
Robust position-based routing in wireless Ad Hoc networks with unstable transmission ranges
inferredcites →https://doi.org/10.1145/501422.501424openalex-snapshot
Geometric spanner for routing in mobile networks
inferredcites →https://doi.org/10.1145/570810.570814openalex-snapshot
Asymptotically optimal geometric mobile ad-hoc routing
inferredcites →https://doi.org/10.2307/2412323openalex-snapshot
A New Statistical Approach to Geographic Variation Analysis

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4474408openalex-extracted
inferred← citeshttps://doi.org/10.1007/978-3-030-32047-8_13openalex-snapshot
Indexability-Based Dataset Partitioning
inferred← citeshttps://doi.org/10.1007/978-3-030-60936-8_21openalex-snapshot
Reverse k-Nearest Neighbors Centrality Measures and Local Intrinsic Dimension
inferred← citeshttps://doi.org/10.1007/978-3-030-89657-7_14openalex-snapshot
Structural Intrinsic Dimensionality
inferred← citeshttps://doi.org/10.1007/978-3-031-17849-8_11openalex-snapshot
Generalized Relative Neighborhood Graph (GRNG) for Similarity Search
inferred← citeshttps://doi.org/10.1007/978-3-031-17849-8_13openalex-snapshot
HubHSP Graph: Effective Data Sampling for Pivot-Based Representation Strategies
inferred← citeshttps://doi.org/10.1007/978-3-031-17849-8_5openalex-snapshot
Stable Anchors for Matching Unlabelled Point Clouds
inferred← citeshttps://doi.org/10.1007/978-3-031-46994-7_1openalex-snapshot
Finding HSP Neighbors via an Exact, Hierarchical Approach
inferred← citeshttps://doi.org/10.1007/978-3-031-75823-2_25openalex-snapshot
Top-Down Construction of Locally Monotonic Graphs for Similarity Search
inferred← citeshttps://doi.org/10.1007/978-3-032-06069-3_38openalex-snapshot
Refinement-Based Graph Construction for Search in Low-Memory Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-72951-8_16openalex-snapshot
Local Edge Colouring of Yao-Like Subgraphs of Unit Disk Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_27openalex-snapshot
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies
inferred← citeshttps://doi.org/10.1007/s11042-023-18023-9openalex-snapshot
Design of a Brief Perceptual Loss Function with Hadamard Codes
inferred← citeshttps://doi.org/10.1016/j.comgeo.2011.01.002openalex-snapshot
On a family of strong geometric spanners that admit local routing strategies
inferred← citeshttps://doi.org/10.1016/j.compbiolchem.2015.07.010openalex-snapshot
Machine Learnable Fold Space Representation based on Residue Cluster Classes
inferred← citeshttps://doi.org/10.1016/j.is.2023.102341openalex-snapshot
HubHSP graph: Capturing local geometrical and statistical data properties via spanning graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2006.05.004openalex-snapshot
Local solutions for global problems in wireless networks
inferred← citeshttps://doi.org/10.1021/acsomega.2c03398openalex-snapshot
Network Science and Group Fusion Similarity-Based Searching to Explore the Chemical Space of Antiparasitic Peptides
inferred← citeshttps://doi.org/10.1021/acsomega.5c07055openalex-snapshot
Half-Space Proximal Networks (HSPNs): A Proxy for Multi-Query Similarity Searching Models Predicting Tumor-Homing Peptides
inferred← citeshttps://doi.org/10.1021/acsomega.5c07679openalex-snapshot
Mapping the Antibiofilm Peptide Space with Similarity Networks and Curated Negative Sets
inferred← citeshttps://doi.org/10.1038/s41540-024-00429-2openalex-snapshot
Peptide hemolytic activity analysis using visual data mining of similarity-based complex networks
inferred← citeshttps://doi.org/10.1038/s41598-020-75029-1openalex-snapshot
Automatic construction of molecular similarity networks for visual graph mining in chemical space of bioactive peptides: an unsupervised learning approach
inferred← citeshttps://doi.org/10.1093/bioinformatics/btad506openalex-snapshot
StarPep Toolbox: an open-source software to assist chemical space analysis of bioactive peptides and their functions using complex networks
inferred← citeshttps://doi.org/10.1109/access.2021.3137767openalex-snapshot
Boosting Perturbation-Based Iterative Algorithms to Compute the Median String
inferred← citeshttps://doi.org/10.1109/icc.2009.5198670openalex-snapshot
A Set of Topological Graphs for 2-D Sensor Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/icc.2010.5502434openalex-snapshot
Enhanced Topological Graphs for 2-D Sensor Networks
inferred← citeshttps://doi.org/10.1109/sccc51225.2020.9281215openalex-snapshot
New initialization for algorithms to solve Median String Problem
inferred← citeshttps://doi.org/10.1109/wimob.2011.6085419openalex-snapshot
Routing on Mini-Gabriel graphs in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1145/3698814openalex-snapshot
iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
inferred← citeshttps://doi.org/10.1186/1687-1499-2012-120openalex-snapshot
The significant impact of a set of topologies on wireless sensor networks
inferred← citeshttps://doi.org/10.26434/chemrxiv-2021-tgv69openalex-snapshot
Exploring the Chemical Space of Antiparasitic Peptides and Discovery of New Promising Leads through a Novel Approach based on Network Science and Similarity Searching
inferred← citeshttps://doi.org/10.33774/chemrxiv-2021-tgv69openalex-snapshot
Exploring the Chemical Space of Antiparasitic Peptides and Discovery of New Promising Leads through a Novel Approach based on Network Science and Similarity Searching
inferred← citeshttps://doi.org/10.3390/antibiotics12040747openalex-snapshot
Complex Networks Analyses of Antibiofilm Peptides: An Emerging Tool for Next-Generation Antimicrobials’ Discovery
inferred← citeshttps://doi.org/10.3390/biom16071007openalex-snapshot
Complex Networks in Bioactive Peptide Research: A Methodological Review
inferred← citeshttps://doi.org/10.3390/computers14100423openalex-snapshot
Mapping the Chemical Space of Antiviral Peptides with Half-Space Proximal and Metadata Networks Through Interactive Data Mining
inferred← citeshttps://doi.org/10.4018/978-1-60566-250-3.ch006openalex-snapshot
Local Algorithms for Topology Control in Ad-Hoc Networks
inferred← citeshttps://doi.org/10.48550/arxiv.1404.1646openalex-snapshot
Proximal Navigation Graphs and t-spanners
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.