On the public citation graph

Adaptative Generalisation Over a Value Hierarchy for the K-Anonymisation of Origin-Destination Matrices

0 signed · 32 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-0037(199807)31:4<205::aid-net1>3.0.co;2-hopenalex-snapshot
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
inferredcites →https://doi.org/10.1007/11552338openalex-snapshot
Secure Data Management
inferredcites →https://doi.org/10.1007/978-3-540-79228-4openalex-snapshot
Theory and Applications of Models of Computation
inferredcites →https://doi.org/10.1007/s11280-021-00922-2openalex-snapshot
Data privacy preservation algorithm with k-anonymity
inferredcites →https://doi.org/10.1016/j.cose.2020.101753openalex-snapshot
Optimization-based k-anonymity algorithms
inferredcites →https://doi.org/10.1016/j.is.2010.05.003openalex-snapshot
Anonymization of moving objects databases by clustering and perturbation
inferredcites →https://doi.org/10.1038/srep01376openalex-snapshot
Unique in the Crowd: The privacy bounds of human mobility
inferredcites →https://doi.org/10.1080/25726668.2020.1866369openalex-snapshot
An efficient algorithm for the precedence constraint knapsack problem with reference to large-scale open-pit mining pushback design
inferredcites →https://doi.org/10.1109/icde.2006.101openalex-snapshot
Mondrian Multidimensional K-Anonymity
inferredcites →https://doi.org/10.1109/icde.2007.367856openalex-snapshot
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
inferredcites →https://doi.org/10.1109/icde.2008.4497446openalex-snapshot
Never Walk Alone: Uncertainty for Anonymity in Moving Objects Databases
inferredcites →https://doi.org/10.1109/iscsic54682.2021.00021openalex-snapshot
Scaling Time-Dependent Origin-Destination Matrix Using Growth Factor Model
inferredcites →https://doi.org/10.1109/sahcn.2017.7964921openalex-snapshot
Beyond K-Anonymity: Protect Your Trajectory from Semantic Attack
inferredcites →https://doi.org/10.1142/s021848850200165xopenalex-snapshot
ACHIEVING k-ANONYMITY PRIVACY PROTECTION USING GENERALIZATION AND SUPPRESSION
inferredcites →https://doi.org/10.1145/1142473openalex-snapshot
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
inferredcites →https://doi.org/10.1145/1217299.1217302openalex-snapshot
L -diversity
inferredcites →https://doi.org/10.1145/1989323openalex-snapshot
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
inferredcites →https://doi.org/10.1145/2274576.2274608openalex-snapshot
Differentially private summaries for sparse data
inferredcites →https://doi.org/10.1145/2714576openalex-snapshot
Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security
inferredcites →https://doi.org/10.1145/2716281openalex-snapshot
Proceedings of the 11th ACM Conference on Emerging Networking Experiments and Technologies
inferredcites →https://doi.org/10.1145/355744.355745openalex-snapshot
An Algorithm for Finding Best Matches in Logarithmic Expected Time
inferredcites →https://doi.org/10.1287/mnsc.22.11.1268openalex-snapshot
Maximal Closure of a Graph and Applications to Combinatorial Problems
inferredcites →https://doi.org/10.1287/moor.8.1.1openalex-snapshot
On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
inferredcites →https://doi.org/10.1515/itit-2015-0024openalex-snapshot
Quantifying and protecting location privacy
inferredcites →https://doi.org/10.1561/9781601988195openalex-snapshot
The Algorithmic Foundations of Differential Privacy
inferredcites →https://doi.org/10.18662/eljpa/11openalex-snapshot
2018 Reform Of Eu Data Protection Rules
inferredcites →https://doi.org/10.21552/edpl/2019/2/8openalex-snapshot
Differential Privacy and the GDPR
inferredcites →https://doi.org/10.4230/lipics.cosit.2022.17openalex-snapshot
A Weather-Aware Framework for Population Mobility Modelling (Short Paper)
inferredcites →https://doi.org/10.48550/arxiv.1201.0490openalex-snapshot
Scikit-learn: Machine Learning in Python

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s11116-024-10524-2openalex-snapshot
Improving the generation of synthetic travel demand using origin–destination matrices from mobile phone data
inferred← citeshttps://doi.org/10.1007/s44443-025-00179-zopenalex-snapshot
Survey of privacy-preserving data aggregation schemes in smart grid
inferred← citeshttps://doi.org/10.3390/electronics13224545openalex-snapshot
DistOD: A Hybrid Privacy-Preserving and Distributed Framework for Origin–Destination Matrix Computation
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.