On the public citation graph

This side up!

https://doi.org/10.1145/1150334.1150339
0 signed · 29 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.1007/978-3-540-24698-5_40openalex-snapshot
Packing Problems with Orthogonal Rotations
inferredcites →https://doi.org/10.1007/978-3-540-45138-9_34openalex-snapshot
Two Dimensional Packing: The Power of Rotation
inferredcites →https://doi.org/10.1016/0743-7315(90)90024-jopenalex-snapshot
Static job scheduling in partitionable mesh connected systems
inferredcites →https://doi.org/10.1016/s0166-218x(01)00253-0openalex-snapshot
A lower bound for the non-oriented two-dimensional bin packing problem
inferredcites →https://doi.org/10.1016/s0304-3975(01)00410-8openalex-snapshot
Two-dimensional on-line bin packing problem with rotatable items
inferredcites →https://doi.org/10.1109/sfcs.2002.1181973openalex-snapshot
Packing 2-dimensional bins in harmony
inferredcites →https://doi.org/10.1137/0209062openalex-snapshot
Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
inferredcites →https://doi.org/10.1137/1.9780898715583openalex-snapshot
Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
inferredcites →https://doi.org/10.1137/s009753979631391xopenalex-snapshot
Approximation Algorithms for the Orthogonal Z -Oriented Three-Dimensional Packing Problem
inferredcites →https://doi.org/10.5555/982792.982820openalex-snapshot
Approximation schemes for multidimensional packing
inferredcites →https://doi.org/10.5555/982792.982821openalex-snapshot
New approximability and inapproximability results for 2-dimensional Bin Packing
inferredcites →https://doi.org/10.5555/982792.982823openalex-snapshot
Optimal online bounded space multidimensional packing

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.1744076openalex-extracted
Non-Tariff Measures: Evidence from Selected Developing Countries and Future Research Agenda
inferred← citeshttps://doi.org/10.1007/978-3-540-72504-6_3openalex-snapshot
Approximation Algorithms for 3D Orthogonal Knapsack
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_2openalex-snapshot
Bin Packing Games with Selfish Items
inferred← citeshttps://doi.org/10.1007/s00381-015-2769-4openalex-snapshot
Long-term outcomes in treatment of deformational plagiocephaly and brachycephaly using helmet therapy and repositioning: a longitudinal cohort study
inferred← citeshttps://doi.org/10.1007/s00453-023-01130-2openalex-snapshot
A Tight $$(3/2+\varepsilon )$$-Approximation for Skewed Strip Packing
inferred← citeshttps://doi.org/10.1007/s10900-015-0060-yopenalex-snapshot
Infant Safe Sleep Interventions, 1990–2015: A Review
inferred← citeshttps://doi.org/10.1007/s11390-008-9170-7openalex-snapshot
Approximation Algorithms for 3D Orthogonal Knapsack
inferred← citeshttps://doi.org/10.1016/j.cor.2008.12.015openalex-snapshot
Three-dimensional packings with rotations
inferred← citeshttps://doi.org/10.1016/j.cosrev.2016.12.001openalex-snapshot
Approximation and online algorithms for multidimensional bin packing: A survey
inferred← citeshttps://doi.org/10.1016/j.jas.2012.05.015openalex-snapshot
Applying GIS tools to define prehistoric megalith transport route corridors: Olmec megalith transport routes: a case study
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.01.004openalex-snapshot
Online Circle and Sphere Packing
inferred← citeshttps://doi.org/10.1053/j.nainr.2009.07.006openalex-snapshot
Back to Sleep: A Culture Change to Improve Practice
inferred← citeshttps://doi.org/10.1287/inte.2021.1086openalex-snapshot
Developing a Maximum Inscribed Rectangle Heuristic to Satisfy Rush Orders for Heavy Plate Steel
inferred← citeshttps://doi.org/10.32398/cjhp.v10isi-latino.1478openalex-snapshot
Reducing Maternal and Child Health Disparities among Latino Immigrants in South Carolina Through a Tailored, Culturally Appropriate and Participant-Driven Initiative
inferred← citeshttps://doi.org/10.4230/lipics.esa.2019.62openalex-snapshot
Closing the Gap for Pseudo-Polynomial Strip Packing
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2016.9openalex-snapshot
Improved Pseudo-Polynomial-Time Approximation for Strip Packing
inferred← citeshttps://doi.org/10.4236/iim.2017.93005openalex-snapshot
Decision Support through Intelligent Agent Based Simulation and Multiple Goal Based Evolutionary 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.