On the public citation graph

Efficient parameterized algorithms for data packing

https://doi.org/10.1145/3290366
0 signed · 53 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.1006/inco.1997.2697openalex-snapshot
All Structured Programs Have Small Tree Width and Good Register Allocation
inferredcites →https://doi.org/10.1006/jcss.1995.1021openalex-snapshot
Competitive Paging with Locality of Reference
inferredcites →https://doi.org/10.1007/3-540-19488-6_110openalex-snapshot
Dynamic programming on graphs with bounded treewidth
inferredcites →https://doi.org/10.1007/3-540-45643-0_7openalex-snapshot
The Treewidth of Java Programs
inferredcites →https://doi.org/10.1007/978-3-319-21275-3openalex-snapshot
Parameterized Algorithms
inferredcites →https://doi.org/10.1007/978-3-319-21690-4_9openalex-snapshot
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_2openalex-snapshot
Ascertaining Uncertainty for Efficient Exact Cache Analysis
inferredcites →https://doi.org/10.1007/978-3-319-68167-2_4openalex-snapshot
JTDec: A Tool for Tree Decompositions in Soot
inferredcites →https://doi.org/10.1007/bfb0029946openalex-snapshot
Treewidth: Algorithmic techniques and results
inferredcites →https://doi.org/10.1016/0095-8956(84)90013-3openalex-snapshot
Graph minors. III. Planar tree-width
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferredcites →https://doi.org/10.1109/tpds.2006.88openalex-snapshot
Exploiting locality for irregular scientific codes
inferredcites →https://doi.org/10.1137/s0097539793251219openalex-snapshot
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
inferredcites →https://doi.org/10.1145/1111037.1111040openalex-snapshot
A hierarchical model of data locality
inferredcites →https://doi.org/10.1145/1132516.1132587openalex-snapshot
On adequate performance measures for paging
inferredcites →https://doi.org/10.1145/216585.216588openalex-snapshot
Hitting the memory wall
inferredcites →https://doi.org/10.1145/2591971.2591992openalex-snapshot
CApRI
inferredcites →https://doi.org/10.1145/2637364.2591992openalex-snapshot
CApRI
inferredcites →https://doi.org/10.1145/2676726.2676979openalex-snapshot
Faster Algorithms for Algebraic Path Properties in Recursive State Machines with Constant Treewidth
inferredcites →https://doi.org/10.1145/2786.2793openalex-snapshot
Amortized efficiency of list update and paging rules
inferredcites →https://doi.org/10.1145/2837614.2837669openalex-snapshot
The hardness of data packing
inferredcites →https://doi.org/10.1145/291006.291036openalex-snapshot
Cache-conscious data placement
inferredcites →https://doi.org/10.1145/291069.291036openalex-snapshot
Cache-conscious data placement
inferredcites →https://doi.org/10.1145/301618.301670openalex-snapshot
Improving cache performance in dynamic applications through data and computation reorganization at run time
inferredcites →https://doi.org/10.1145/3210257openalex-snapshot
Algorithms for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components
inferredcites →https://doi.org/10.1145/3290366openalex-snapshot
Efficient parameterized algorithms for data packing
inferredcites →https://doi.org/10.1145/503272.503283openalex-snapshot
The hardness of cache conscious data placement
inferredcites →https://doi.org/10.1145/996841.996872openalex-snapshot
Array regrouping and structure splitting using whole-program reference affinity
inferredcites →https://doi.org/10.4230/lipics.swat.2016.12openalex-snapshot
Lower Bounds for Approximation Schemes for Closest String
inferredcites →https://doi.org/10.5555/2884435.2884463openalex-snapshot
Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs

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-44914-8_5openalex-snapshot
Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-59152-6_14openalex-snapshot
Faster Algorithms for Quantitative Analysis of MCs and MDPs with Small Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-031-24950-1_9openalex-snapshot
Efficient Interprocedural Data-Flow Analysis Using Treedepth and Treewidth
inferred← citeshttps://doi.org/10.1007/978-981-95-7826-9_15openalex-snapshot
Efficient Algorithms for Partial Constraint Satisfaction Problems over Control-Flow Graphs
inferred← citeshttps://doi.org/10.1007/978-981-96-0602-3_21openalex-snapshot
Faster Lifetime-Optimal Speculative Partial Redundancy Elimination for Goto-Free Programs
inferred← citeshttps://doi.org/10.1007/s10878-024-01249-0openalex-snapshot
Optimal blocks for maximizing the transaction fee revenue of Bitcoin miners
inferred← citeshttps://doi.org/10.1016/j.ress.2019.106665openalex-snapshot
An efficient algorithm for computing network reliability in small treewidth
inferred← citeshttps://doi.org/10.1016/j.sysarc.2026.103732openalex-snapshot
Series–parallel-loop decompositions of control-flow graphs
inferred← citeshttps://doi.org/10.1109/blockchain55522.2022.00044openalex-snapshot
Optimal Mining: Maximizing Bitcoin Miners' Revenues from Transaction Fees
inferred← citeshttps://doi.org/10.1109/blockchain62396.2024.00072openalex-snapshot
Pixiu: Optimal Block Production Revenues on Cardano
inferred← citeshttps://doi.org/10.1109/icdcs60910.2024.00056openalex-snapshot
Interleaved Function Stream Execution Model for Cache-Aware High-Speed Stateful Packet Processing
inferred← citeshttps://doi.org/10.1145/3297280.3297322openalex-snapshot
The treewidth of smart contracts
inferred← citeshttps://doi.org/10.1145/3302516.3307358openalex-snapshot
Codestitcher: inter-procedural basic block layout optimization
inferred← citeshttps://doi.org/10.1145/3498714openalex-snapshot
Profile inference revisited
inferred← citeshttps://doi.org/10.1145/3519939.3523436openalex-snapshot
Efficient approximations for cache-conscious data placement
inferred← citeshttps://doi.org/10.1145/3589610.3596277openalex-snapshot
Optimizing Function Layout for Mobile Applications
inferred← citeshttps://doi.org/10.1145/3622807openalex-snapshot
The Bounded Pathwidth of Control-Flow Graphs
inferred← citeshttps://doi.org/10.1145/3622868openalex-snapshot
Exploiting the Sparseness of Control-Flow and Call Graphs for Efficient and On-Demand Algebraic Program Analysis
inferred← citeshttps://doi.org/10.1145/3660635openalex-snapshot
Reordering Functions in Mobiles Apps for Reduced Size and Faster Start-Up
inferred← citeshttps://doi.org/10.1145/3669940.3707286openalex-snapshot
Faster Chaitin-like Register Allocation via Grammatical Decompositions of Control-Flow Graphs
inferred← citeshttps://doi.org/10.1145/3689801openalex-snapshot
Fast and Optimal Extraction for Sparse Equality Graphs
showing the first 21 of 22 · page through all 22
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.