On the public citation graph
Algorithms and Computations
0 signed · 66 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/11427186_15openalex-snapshot
Implementation of Approximation Algorithms for the Multicast Congestion Problem
inferred← citeshttps://doi.org/10.1007/11429647_16openalex-snapshot
Biangular Circle Formation by Asynchronous Mobile Robots
inferred← citeshttps://doi.org/10.1007/11429647_20openalex-snapshot
On the Feasibility of Gathering by Autonomous Mobile Robots
inferred← citeshttps://doi.org/10.1007/11430919_45openalex-snapshot
Speeding-Up Hierarchical Agglomerative Clustering in Presence of Expensive Metrics
inferred← citeshttps://doi.org/10.1007/11496915_5openalex-snapshot
Disjoint Cycles: Integrality Gap, Hardness, and Approximation
inferred← citeshttps://doi.org/10.1007/11499107_35openalex-snapshot
Automated Generation of Simplification Rules for SAT and MAXSAT
inferred← citeshttps://doi.org/10.1007/11533719_80openalex-snapshot
A Linear Time Algorithm for Finding a Maximal Planar Subgraph Based on PC-Trees
inferred← citeshttps://doi.org/10.1007/11534273_13openalex-snapshot
Succinct Representation of Triangulations with a Boundary
inferred← citeshttps://doi.org/10.1007/11573937_41openalex-snapshot
Dynamic Delaunay Triangulation for Wireless Ad Hoc Network
inferred← citeshttps://doi.org/10.1007/11602613_113openalex-snapshot
Space-Efficient Construction of LZ-Index
inferred← citeshttps://doi.org/10.1007/11814948_26openalex-snapshot
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time
inferred← citeshttps://doi.org/10.1007/978-3-031-79870-2_3openalex-snapshot
The Power of Enumeration–BDD/ZDD-Based Algorithms for Tackling Combinatorial Explosion
inferred← citeshttps://doi.org/10.1007/978-3-319-08494-7_17openalex-snapshot
BDD Operations for Quantum Graph States
inferred← citeshttps://doi.org/10.1007/978-3-319-13915-9_3openalex-snapshot
Rectilinear Steiner Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-14313-2_17openalex-snapshot
A Scalable Parallel Approach for Subgraph Census Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_75openalex-snapshot
Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic
inferred← citeshttps://doi.org/10.1007/978-3-540-24592-6_16openalex-snapshot
Online Deadline Scheduling: Team Adversary and Restart
inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_10openalex-snapshot
Approximations for Two Decomposition-Based Geometric Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24775-3_12openalex-snapshot
ParaDualMiner: An Efficient Parallel Implementation of the DualMiner Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-540-24838-5_12openalex-snapshot
Distributed Circle Formation for Anonymous Oblivious Robots
inferred← citeshttps://doi.org/10.1007/978-3-540-27798-9_17openalex-snapshot
An Approximation Algorithm for Weighted Weak Vertex Cover Problem in Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-28632-5_6openalex-snapshot
Efficient Linear Array for Multiplication in GF(2 m ) Using a Normal Basis for Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-28639-4_22openalex-snapshot
Automated Proofs of Upper Bounds on the Running Time of Splitting Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-31815-6_27openalex-snapshot
Signed Digit Representation with NAF and Balanced Ternary Form and Efficient Exponentiation in GF(q n ) Using a Gaussian Normal Basis of Type II
inferred← citeshttps://doi.org/10.1007/978-3-540-45238-6_19openalex-snapshot
Efficient Exponentiation for a Class of Finite Fields GF(2 n ) Determined by Gauss Periods
inferred← citeshttps://doi.org/10.1007/978-3-540-46515-7_8openalex-snapshot
Algorithms for Packing Two Circles in a Convex Polygon
inferred← citeshttps://doi.org/10.1007/978-3-540-68552-4_6openalex-snapshot
On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations
inferred← citeshttps://doi.org/10.1007/978-3-540-72788-0_7openalex-snapshot
Partial Max-SAT Solvers with Clause Learning
inferred← citeshttps://doi.org/10.1007/978-3-540-72914-3_11openalex-snapshot
Robots and Demons (The Code of the Origins)
inferred← citeshttps://doi.org/10.1007/978-3-540-75520-3_42openalex-snapshot
Improved Upper Bounds on the Competitive Ratio for Online Realtime Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-92221-6_10openalex-snapshot
A Self-stabilizing Marching Algorithm for a Group of Oblivious Robots
inferred← citeshttps://doi.org/10.1007/978-3-642-00312-7_15openalex-snapshot
On the Value of Ignorance: Balancing Tracking and Privacy Using a Two-Bit Sensor
inferred← citeshttps://doi.org/10.1007/978-3-642-01536-6_8openalex-snapshot
A Tutorial on Multi-label Classification Techniques
inferred← citeshttps://doi.org/10.1007/978-3-642-02094-0_12openalex-snapshot
Multicast Routing and Design of Sparse Connectors
inferred← citeshttps://doi.org/10.1007/978-3-642-10631-6_120openalex-snapshot
Two-Vertex Connectivity Augmentations for Graphs with a Partition Constraint (Extended Abstract)
inferred← citeshttps://doi.org/10.1007/978-3-642-10877-8_8openalex-snapshot
Deaf, Dumb, and Chatting Asynchronous Robots
inferred← citeshttps://doi.org/10.1007/978-3-642-11659-9_16openalex-snapshot
A Distributed Algorithm for Pattern Formation by Autonomous Robots, with No Agreement on Coordinate Compass
inferred← citeshttps://doi.org/10.1007/978-3-642-24553-4_55openalex-snapshot
An Effective Ant Colony Algorithm for Graph Planarization Problem
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-31585-5_38openalex-snapshot
Growing Half-Balls: Minimizing Storage and Communication Costs in CDNs
inferred← citeshttps://doi.org/10.1007/978-3-642-32589-2_37openalex-snapshot
Observe and Remain Silent (Communication-Less Agent Location Discovery)
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_6openalex-snapshot
A New Algorithm for Parameterized MAX-SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-36065-7_17openalex-snapshot
Shared-Memory Parallel Frontier-Based Search
inferred← citeshttps://doi.org/10.1007/978-3-642-45249-9_10openalex-snapshot
Gathering and Exclusive Searching on Rings under Minimal Assumptions
inferred← citeshttps://doi.org/10.1007/s00222-010-0303-6openalex-snapshot
Geometric analysis for the metropolis algorithm on Lipschitz domains
inferred← citeshttps://doi.org/10.1016/j.bpj.2012.01.063openalex-snapshot
A Bayesian Inference Scheme to Extract Diffusivity and Potential Fields from Confined Single-Molecule Trajectories
inferred← citeshttps://doi.org/10.1016/j.cam.2009.07.017openalex-snapshot
Numerical integration over polygons using an eight-node quadrilateral spline finite element
inferred← citeshttps://doi.org/10.1016/j.csbj.2018.03.001openalex-snapshot
Ordering Protein Contact Matrices
inferred← citeshttps://doi.org/10.1016/j.dam.2010.05.006openalex-snapshot
Enumeration of matchings in families of self-similar graphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.12.018openalex-snapshot
Solving the Multiobjective Quasi-clique Problem
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.08.057openalex-snapshot
FPT Algorithms to Enumerate and Count Acyclic and Totally Cyclic Orientations
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.07.018openalex-snapshot
On suffix extensions in suffix trees
inferred← citeshttps://doi.org/10.1103/physreve.87.012104openalex-snapshot
Correlations between the dynamics of parallel tempering and the free-energy landscape in spin glasses
inferred← citeshttps://doi.org/10.1103/physreve.89.033307openalex-snapshot
Collective translational and rotational Monte Carlo moves for attractive particles
inferred← citeshttps://doi.org/10.1103/physreve.90.033302openalex-snapshot
Collective translational and rotational Monte Carlo cluster move for general pairwise interaction
inferred← citeshttps://doi.org/10.1103/physrevlett.108.265301openalex-snapshot
Supersolid Vortex Crystals in Rydberg-Dressed Bose-Einstein Condensates
inferred← citeshttps://doi.org/10.1103/physrevlett.117.197203openalex-snapshot
Sign-Problem-Free Monte Carlo Simulation of Certain Frustrated Quantum Magnets
inferred← citeshttps://doi.org/10.1142/s012918311650128xopenalex-snapshot
Monte Carlo estimation of the number of tatami tilings
inferred← citeshttps://doi.org/10.1145/2897518.2897635openalex-snapshot
Approximating connectivity domination in weighted bounded-genus graphs
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.1419openalex-snapshot
Techniques of BDD/ZDD: Brief History and Recent Activity
inferred← citeshttps://doi.org/10.2200/s00612ed1v01y201411dcs045openalex-snapshot
Applications of Zero-Suppressed Decision Diagrams
inferred← citeshttps://doi.org/10.3938/jkps.61.679openalex-snapshot
Exact time evolution of the total spin components and its application to the classical spin van der Waals model in transverse magnetic fields
inferred← citeshttps://doi.org/10.3938/npsm.64.560openalex-snapshot
Geometric Algorithm for the Classical Spin van der Waals Model in Transverse Magnetic Fields
inferred← citeshttps://doi.org/10.48550/arxiv.0905.1629openalex-snapshot
Introduction to Monte Carlo Methods
inferred← citeshttps://doi.org/10.7275/zqm3-ew06openalex-snapshot
Replica Exchange Monte Carlo Simulations of the Ising Spin Glass: Static and Dynamic Properties
inferred← citeshttps://doi.org/10.82444/warw.33648580openalex-snapshot
Computer simulation of mesocrystals
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.