On the public citation graph
Not-First and Not-Last Detection for Cumulative Scheduling in ${\cal O}(n^3\log n)$
0 signed · 24 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.1007/978-1-4615-1479-4openalex-snapshot
Constraint - based scheduling : applying constraint programming to scheduling problems
inferredcites →https://doi.org/10.1007/978-3-540-24664-0_23openalex-snapshot
O(nlog n) Filtering Algorithms for Unary Resource Constraint
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_8openalex-snapshot
Unary Resource Constraint with Optional Activities
inferredcites →https://doi.org/10.1007/978-3-642-60744-8_40openalex-snapshot
Constraint-Based Scheduling in Oz
inferredcites →https://doi.org/10.1007/b100482openalex-snapshot
Principles and Practice of Constraint Programming – CP 2004
inferredcites →https://doi.org/10.1016/0895-7177(89)90449-4openalex-snapshot
Optimal sizes of facilities on a linear market
inferredcites →https://doi.org/10.1016/0895-7177(94)90127-9openalex-snapshot
Introducing global constraints in CHIP
inferredcites →https://doi.org/10.1023/a:1009822502231openalex-snapshot
Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems
inferredcites →https://doi.org/10.1023/a:1018995000688openalex-snapshot
Satisfiability tests and time‐bound adjustmentsfor cumulative scheduling problems
inferredcites →https://doi.org/10.1023/a:1024016929283openalex-snapshot
Constraint Based Scheduling: Applying Constraint Programming to Scheduling Problems
inferredcites →https://doi.org/10.1287/ijoc.1070.0226openalex-snapshot
Edge Finding for Cumulative Scheduling
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-031-33271-5_22openalex-snapshot
Constraint Propagation on GPU: A Case Study for the Cumulative Constraint
inferred← citeshttps://doi.org/10.1007/978-3-319-93031-2_34openalex-snapshot
A $$O(n \log ^2 n)$$ Checker and $$O(n^2 \log n)$$ Filtering Algorithm for the Energetic Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-68194-6_11openalex-snapshot
Symmetrien und Redundanzen
inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_22openalex-snapshot
Max Energy Filtering Algorithm for Discrete Cumulative Resources
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_62openalex-snapshot
Edge Finding Filtering Algorithm for Discrete Cumulative Resources in ${\mathcal O}(kn {\rm log} n)$
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_36openalex-snapshot
A New ${\mathcal O}(n^2\log n)$ Not-First/Not-Last Pruning Algorithm for Cumulative Resource Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-21311-3_22openalex-snapshot
Timetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources
inferred← citeshttps://doi.org/10.1007/s10601-010-9103-2openalex-snapshot
Explaining the cumulative propagator
inferred← citeshttps://doi.org/10.1007/s10601-018-9282-9openalex-snapshot
Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last
inferred← citeshttps://doi.org/10.1007/s10601-024-09371-wopenalex-snapshot
Constraint propagation on GPU: a case study for the cumulative constraint
inferred← citeshttps://doi.org/10.1007/s13218-011-0161-4openalex-snapshot
firstCS—New Aspects on Combining Constraint Programming with Object-Orientation in Java
inferred← citeshttps://doi.org/10.1007/s13226-013-0005-zopenalex-snapshot
A cumulative not-first/not-last filtering algorithm in O(n 2log(n))
inferred← citeshttps://doi.org/10.14279/depositonce-3602openalex-snapshot
Hybrid Solving Techniques for Project Scheduling Problems
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.