On the public citation graph
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
0 signed · 26 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-94830-0_11openalex-snapshot
Network Design Problem with Cut Constraints
inferred← citeshttps://doi.org/10.1007/978-3-662-46800-5_8openalex-snapshot
Better Algorithms for LWE and LWR
inferred← citeshttps://doi.org/10.1007/978-3-662-48324-4_20openalex-snapshot
Improved Side-Channel Analysis of Finite-Field Multiplication
inferred← citeshttps://doi.org/10.1016/j.cie.2021.107539openalex-snapshot
Stochastic customer order scheduling on heterogeneous parallel machines with resource allocation consideration
inferred← citeshttps://doi.org/10.1016/j.comnet.2023.110163openalex-snapshot
Programmable device deployment for efficient network function offloading
inferred← citeshttps://doi.org/10.1016/j.dam.2022.11.001openalex-snapshot
Locally defined independence systems on graphs
inferred← citeshttps://doi.org/10.1016/j.eswa.2022.119078openalex-snapshot
Iterated hyperplane search for the budgeted maximum coverage problem
inferred← citeshttps://doi.org/10.1016/j.ipm.2022.103211openalex-snapshot
Leveraging heuristic client selection for enhanced secure federated submodel learning
inferred← citeshttps://doi.org/10.1016/j.jcp.2015.10.012openalex-snapshot
A fast block low-rank dense solver with applications to finite-element matrices
inferred← citeshttps://doi.org/10.1016/j.orl.2018.10.002openalex-snapshot
An approximation algorithm for vehicle routing with compatibility constraints
inferred← citeshttps://doi.org/10.1016/j.patrec.2014.10.005openalex-snapshot
Low-rank matrix approximations for Coherent point drift
inferred← citeshttps://doi.org/10.1016/j.phycom.2019.100902openalex-snapshot
Low-complexity Kaczmarz precoding in DL massive MIMO with partial CSI and correlation
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.006openalex-snapshot
Traveling salesman problems in temporal graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.06.007openalex-snapshot
The online food delivery problem on stars
inferred← citeshttps://doi.org/10.1016/j.trb.2018.07.013openalex-snapshot
Moulin mechanism design for freight consolidation
inferred← citeshttps://doi.org/10.1103/physreva.99.012332openalex-snapshot
Symmetric versus bosonic extension for bipartite states
inferred← citeshttps://doi.org/10.1103/physrevlett.113.210501openalex-snapshot
Fixed-Point Quantum Search with an Optimal Number of Queries
inferred← citeshttps://doi.org/10.1103/physrevx.14.011013openalex-snapshot
Continuous-Variable Quantum State Designs: Theory and Applications
inferred← citeshttps://doi.org/10.1103/revmodphys.89.015004openalex-snapshot
Quantum random number generators
inferred← citeshttps://doi.org/10.1145/2898420.2898422openalex-snapshot
Creating Cryptographic Challenges Using Multi-Party Computation
inferred← citeshttps://doi.org/10.1145/3078853openalex-snapshot
A Real-Time Framework for Task Assignment in Hyperlocal Spatial Crowdsourcing
inferred← citeshttps://doi.org/10.1145/3397180openalex-snapshot
Quality-aware Online Task Assignment in Mobile Crowdsourcing
inferred← citeshttps://doi.org/10.70675/0edc9e27z5a66z4c28zbdfaz4cdd245bfa32openalex-snapshot
Security of cryptosystems against power-analysis attacks
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.