On the public citation graph
Faster Pseudopolynomial Time Algorithms for Subset Sum
0 signed · 94 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 this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199612)28:4<221::aid-net6>3.0.co;2-nopenalex-snapshot
The bottleneck graph partition problem
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199905)33:3<189::aid-net5>3.0.co;2-2openalex-snapshot
A note on the bottleneck graph partition problem
inferredcites →https://doi.org/10.1002/nav.20202openalex-snapshot
Parallel machine scheduling with job assignment restrictions
inferredcites →https://doi.org/10.1002/nav.3800030107openalex-snapshot
Notes on the theory of dynamic programming IV ‐ Maximization over discrete sets
inferredcites →https://doi.org/10.1006/jagm.1996.0841openalex-snapshot
Minimum Range Balanced Cuts via Dynamic Subset Sums
inferredcites →https://doi.org/10.1006/jagm.1999.1034openalex-snapshot
Linear Time Algorithms for Knapsack Problems with Bounded Weights
inferredcites →https://doi.org/10.1007/11847250_22openalex-snapshot
Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
inferredcites →https://doi.org/10.1007/3-540-11607-9_1openalex-snapshot
Asymptotically fast algorithms for the numerical muitiplication and division of polynomials with complex coefficients
inferredcites →https://doi.org/10.1007/3-540-54233-7_177openalex-snapshot
An almost linear-time algorithm for the dense subset-sum problem
inferredcites →https://doi.org/10.1007/978-3-030-34209-8_4openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-85221-6_19openalex-snapshot
A Structural Approach to Subset-Sum Problems
inferredcites →https://doi.org/10.1007/s00453-002-0989-yopenalex-snapshot
Dynamic Programming on the Word RAM
inferredcites →https://doi.org/10.1007/s006070050042openalex-snapshot
Dynamic Programming Revisited: Improving Knapsack Algorithms
inferredcites →https://doi.org/10.1007/s10208-016-9326-8openalex-snapshot
Structural Approach to Subset Sum Problems
inferredcites →https://doi.org/10.1016/j.jcta.2007.12.007openalex-snapshot
On complete subsets of the cyclic group
inferredcites →https://doi.org/10.1016/s0021-9800(68)80027-4openalex-snapshot
An addition theorem modulo p
inferredcites →https://doi.org/10.1017/s0025557200071461openalex-snapshot
An Introduction to the Theory of Numbers. By G. H. Hardy and E. M. Wright. 2nd edition. Pp. xvi, 407 25s. 1945. (Oxford)
inferredcites →https://doi.org/10.1023/a:1018930613891openalex-snapshot
A new lower bound for the open‐shop problem
inferredcites →https://doi.org/10.1038/157390a0openalex-snapshot
An Introduction to the Theory of Numbers
inferredcites →https://doi.org/10.1089/cmb.2015.0013openalex-snapshot
A Fast Numerical Method for Max-Convolution and the Application to Efficient Max-Product Inference in Bayesian Networks
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/tase.2006.887159openalex-snapshot
Coordinated Logistics Scheduling for In-House Production and Outsourcing
inferredcites →https://doi.org/10.1109/tassp.1986.1164800openalex-snapshot
Fast algorithms for digital signal processing
inferredcites →https://doi.org/10.1109/tit.2014.2338078openalex-snapshot
Covering Sets for Limited-Magnitude Errors
inferredcites →https://doi.org/10.1137/0220072openalex-snapshot
An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
inferredcites →https://doi.org/10.1137/1.9781611974782.68openalex-snapshot
A Faster Pseudopolynomial Time Algorithm for Subset Sum
inferredcites →https://doi.org/10.1137/1.9781611974782.69openalex-snapshot
A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum
inferredcites →https://doi.org/10.1137/1.9781611975482.3openalex-snapshot
SETH-Based Lower Bounds for Subset Sum and Bicriteria Path
inferredcites →https://doi.org/10.1137/1.9781611975482.4openalex-snapshot
Fast Modular Subset Sum using Linear Sketching
inferredcites →https://doi.org/10.1137/1.9781611975482.5openalex-snapshot
A Subquadratic Approximation Scheme for Partition
inferredcites →https://doi.org/10.1145/1806689.1806735openalex-snapshot
Saving space by algebraization
inferredcites →https://doi.org/10.1145/2063576.2063791openalex-snapshot
Evaluation of set-based queries with aggregation constraints
inferredcites →https://doi.org/10.1145/321812.321823openalex-snapshot
Computing Partitions with Applications to the Knapsack Problem
inferredcites →https://doi.org/10.1287/moor.4.4.339openalex-snapshot
Fast Approximation Algorithms for Knapsack Problems
inferredcites →https://doi.org/10.1287/opre.21.1.332openalex-snapshot
Technical Note—Solution of the Value-Independent Knapsack Problem by Partitioning
inferredcites →https://doi.org/10.1287/opre.5.2.266openalex-snapshot
Discrete-Variable Extremum Problems
inferredcites →https://doi.org/10.1371/journal.pone.0091507openalex-snapshot
The Probabilistic Convolution Tree: Efficient Exact Bayesian Inference for Faster LC-MS/MS Protein Inference
inferredcites →https://doi.org/10.24033/ast.460openalex-snapshot
New Algorithm for Dense Subset-Sum Problem
inferredcites →https://doi.org/10.4064/aa-17-3-227-229openalex-snapshot
On a conjecture of Erdös and Heilbronn
inferredcites →https://doi.org/10.4064/aa-28-2-147-156openalex-snapshot
Sums of sets of group elements
inferredcites →https://doi.org/10.4064/aa-42-4-367-389openalex-snapshot
Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n
inferredcites →https://doi.org/10.4064/cm-20-1-53-56openalex-snapshot
A theorem in additive number theory
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-030-95018-7_19openalex-snapshot
Algebraic Algorithms for Variants of Subset Sum
inferred← citeshttps://doi.org/10.1007/978-3-030-97099-4_3openalex-snapshot
Faster Algorithms for $$k\text {-}\textsc {Subset}\,\textsc {Sum}$$ and Variations
inferred← citeshttps://doi.org/10.1007/978-3-031-06678-8_6openalex-snapshot
Approximating Subset Sum Ratio via Subset Sum Computations
inferred← citeshttps://doi.org/10.1007/978-3-031-23015-8_6openalex-snapshot
Computing the Public Good Index for Weighted Voting Games with Precoalitions Using Dynamic Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-38906-1_42openalex-snapshot
Quick Minimization of Tardy Processing Time on a Single Machine
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_18openalex-snapshot
On Two Simple[st] Learning Tasks
inferred← citeshttps://doi.org/10.1007/978-981-96-1090-7_39openalex-snapshot
Almost Optimum $$\ell $$-Covering of $$\mathbb {Z}_n$$
inferred← citeshttps://doi.org/10.1007/s00236-023-00451-7openalex-snapshot
Approximating subset sum ratio via partition computations
inferred← citeshttps://doi.org/10.1007/s10107-026-02348-yopenalex-snapshot
An Improved Pseudopolynomial Time Algorithm for Subset Sum
inferred← citeshttps://doi.org/10.1007/s10623-022-01073-9openalex-snapshot
The Modular Subset-Sum Problem and the size of deletion correcting codes
inferred← citeshttps://doi.org/10.1007/s10878-022-00928-0openalex-snapshot
Faster algorithms for k-subset sum and variations
inferred← citeshttps://doi.org/10.1007/s10878-022-00944-0openalex-snapshot
Approximation algorithms for some extensions of the maximum profit routing problem
inferred← citeshttps://doi.org/10.1007/s11432-021-3334-1openalex-snapshot
Quantum algorithm and experimental demonstration for the subset sum problem
inferred← citeshttps://doi.org/10.1007/s11433-024-2385-7openalex-snapshot
Solving the subset sum problem by the quantum Ising model with variational quantum optimization based on conditional values at risk
inferred← citeshttps://doi.org/10.1016/j.cor.2021.105692openalex-snapshot
Knapsack problems — An overview of recent advances. Part I: Single knapsack problems
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106280openalex-snapshot
One-dimensional stock cutting resilient against singular random defects
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.04.023openalex-snapshot
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
inferred← citeshttps://doi.org/10.1016/j.jcss.2021.09.005openalex-snapshot
More on change-making and related problems
inferred← citeshttps://doi.org/10.1016/j.jcss.2022.01.005openalex-snapshot
Scheduling lower bounds via AND subset sum
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114541openalex-snapshot
Upward planarity testing of biconnected outerplanar DAGs solves partition
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115653openalex-snapshot
On the parameterized complexity of diverse SAT
inferred← citeshttps://doi.org/10.1080/00207543.2024.2362414openalex-snapshot
A note on scheduling identical parallel machines with preemptions and setup times
inferred← citeshttps://doi.org/10.1109/cict67193.2025.11399047openalex-snapshot
Efficient Pruning in Subset Sum Backtracking Using Residual Sum Checks
inferred← citeshttps://doi.org/10.1109/cscs66924.2025.00077openalex-snapshot
Linear Time Approximation Algorithms for Subset Sum
inferred← citeshttps://doi.org/10.1109/focs61266.2024.00129openalex-snapshot
An Improved Pseudopolynomial Time Algorithm for Subset Sum
inferred← citeshttps://doi.org/10.1109/synasc61333.2023.00019openalex-snapshot
On the Variants of Subset Sum: Projected and Unbounded
inferred← citeshttps://doi.org/10.1109/tsp.2021.3088215openalex-snapshot
Binary Discrete Fourier Transform and Its Inversion
inferred← citeshttps://doi.org/10.1134/s0965542523010116openalex-snapshot
Generalization of the Subset Sum Problem and Cubic Forms
inferred← citeshttps://doi.org/10.1137/1.9781611976014.7openalex-snapshot
On the Change-Making Problem
inferred← citeshttps://doi.org/10.1137/1.9781611976465.106openalex-snapshot
Fast Low-Space Algorithms for Subset Sum
inferred← citeshttps://doi.org/10.1137/1.9781611976496.5openalex-snapshot
Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets
inferred← citeshttps://doi.org/10.1137/1.9781611977073.119openalex-snapshot
Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution
inferred← citeshttps://doi.org/10.1137/1.9781611977073.141openalex-snapshot
On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch113openalex-snapshot
Approximating Knapsack and Partition via Dense Subset Sums
inferred← citeshttps://doi.org/10.1145/3406325.3451090openalex-snapshot
Sparse nonnegative convolution is equivalent to dense nonnegative convolution
inferred← citeshttps://doi.org/10.1145/3618260.3649605openalex-snapshot
Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More
inferred← citeshttps://doi.org/10.1145/3618260.3649618openalex-snapshot
0-1 Knapsack in Nearly Quadratic Time
inferred← citeshttps://doi.org/10.1609/aaai.v35i6.16722openalex-snapshot
A Model of Winners Allocation
inferred← citeshttps://doi.org/10.31857/s0044466923010118openalex-snapshot
Generalization of the Subset Sum Problem and Cubic Forms
inferred← citeshttps://doi.org/10.3390/math12121878openalex-snapshot
An Improved Unbounded-DP Algorithm for the Unbounded Knapsack Problem with Bounded Coefficients
inferred← citeshttps://doi.org/10.37943/23afrz7022openalex-snapshot
METHODS AND ALGORITHMS FOR SOLVING THE PROBLEM ON THE SUM OF SUBSETS
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2020.27openalex-snapshot
Finding Small Satisfying Assignments Faster Than Brute Force: A Fine-Grained Perspective into Boolean Constraint Satisfaction
inferred← citeshttps://doi.org/10.4230/lipics.esa.2021.76openalex-snapshot
Faster Deterministic Modular Subset Sum
inferred← citeshttps://doi.org/10.48550/arxiv.1908.06821openalex-snapshot
An Efficient Algorithm to Test Potentially Bipartiteness of Graphical Degree Sequences
inferred← citeshttps://doi.org/10.48550/arxiv.2007.09282openalex-snapshot
An APX for the Maximum-Profit Routing Problem with Variable Supply
inferred← citeshttps://doi.org/10.48550/arxiv.2110.02503openalex-snapshot
More on Change-Making and Related Problems
inferred← citeshttps://doi.org/10.70675/80f73784z475az47adzb2ccz764d88c268e2openalex-snapshot
Contributions to approximation and parameterization in combinatorial optimization
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.