On the public citation graph

Solving Systems of Difference Constraints Incrementally

https://doi.org/10.1007/pl00009261
0 signed · 50 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/jagm.1996.0046openalex-snapshot
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
inferredcites →https://doi.org/10.1007/3-540-58601-6_92openalex-snapshot
Beyond finite domains
inferredcites →https://doi.org/10.1007/3-540-58715-2_118openalex-snapshot
Incremental algorithms for the single-source shortest path problem
inferredcites →https://doi.org/10.1007/bf01088697openalex-snapshot
RTC: Language support for real-time concurrency
inferredcites →https://doi.org/10.1007/bf01213484openalex-snapshot
Automatically generating consistent schedules for multimedia documents
inferredcites →https://doi.org/10.1016/0004-3702(91)90006-6openalex-snapshot
Temporal constraint networks
inferredcites →https://doi.org/10.1016/0304-3975(95)00079-8openalex-snapshot
On the computational complexity of dynamic graph problems
inferredcites →https://doi.org/10.1016/s0022-0000(05)80064-9openalex-snapshot
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1109/real.1990.128756openalex-snapshot
Language support for the Maruti real-time system
inferredcites →https://doi.org/10.1109/vl.1996.545298openalex-snapshot
Interactive authoring of multimedia documents
inferredcites →https://doi.org/10.1137/0606031openalex-snapshot
Amortized Computational Complexity
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1137/s0097539793251876openalex-snapshot
Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
inferredcites →https://doi.org/10.1145/155090.155106openalex-snapshot
Compiling real-time programs into schedulable code
inferredcites →https://doi.org/10.1145/217279.215261openalex-snapshot
Multimedia documents with elastic time
inferredcites →https://doi.org/10.1145/321694.321699openalex-snapshot
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
inferredcites →https://doi.org/10.1145/322276.322288openalex-snapshot
Deciding Linear Inequalities by Computing Loop Residues
inferredcites →https://doi.org/10.1145/50087.50096openalex-snapshot
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
inferredcites →https://doi.org/10.5555/320176.320180openalex-snapshot
Incremental evaluation of computational circuits

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470611647.ch5openalex-snapshot
Time Petri Nets
inferred← citeshttps://doi.org/10.1007/11591191_23openalex-snapshot
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
inferred← citeshttps://doi.org/10.1007/11691372_9openalex-snapshot
SDSAT: Tight Integration of Small Domain Encoding and Lazy Approaches in a Separation Logic Solver
inferred← citeshttps://doi.org/10.1007/978-3-319-10512-3_7openalex-snapshot
Time Petri Nets with Dynamic Firing Dates: Semantics and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_37openalex-snapshot
Maintaining Longest Paths Incrementally
inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_31openalex-snapshot
Enhancing ASP Systems for Planning with Temporal Constraints
inferred← citeshttps://doi.org/10.1007/s00453-004-1081-6openalex-snapshot
Solving Systems of Difference Constraints Incrementally with Bidirectional Search
inferred← citeshttps://doi.org/10.1007/s10472-009-9116-yopenalex-snapshot
Integrating answer set programming and constraint logic programming
inferred← citeshttps://doi.org/10.1007/s10589-009-9264-3openalex-snapshot
Planning wireless networks by shortest path
inferred← citeshttps://doi.org/10.1007/s10601-005-0554-9openalex-snapshot
Maintaining Longest Paths Incrementally
inferred← citeshttps://doi.org/10.1016/j.ic.2023.105063openalex-snapshot
A faster algorithm for converting simple temporal networks with uncertainty into dispatchable form
inferred← citeshttps://doi.org/10.1016/j.ipl.2003.07.005openalex-snapshot
Depth-First Discovery Algorithm for incremental topological sorting of directed acyclic graphs
inferred← citeshttps://doi.org/10.1109/cvpr.2004.416openalex-snapshot
Output Constraints in Multimedia Database Systems
inferred← citeshttps://doi.org/10.1109/dac.2006.229207openalex-snapshot
Predicate learning and selective theory deduction for a difference logic solver
inferred← citeshttps://doi.org/10.1109/dac.2006.229228openalex-snapshot
An efficient and versatile scheduling algorithm based on SDC formulation
inferred← citeshttps://doi.org/10.1109/etfa.2008.4638569openalex-snapshot
From monotone inequalities to Model Predictive Control
inferred← citeshttps://doi.org/10.1109/fpl.2014.6927490openalex-snapshot
Modulo SDC scheduling with recurrence minimization in high-level synthesis
inferred← citeshttps://doi.org/10.1109/iccad.2013.6691121openalex-snapshot
SDC-based modulo scheduling for pipeline synthesis
inferred← citeshttps://doi.org/10.1109/iccad57390.2023.10323706openalex-snapshot
Accelerating Exact Combinatorial Optimization via RL-based Initialization - A Case Study in Scheduling
inferred← citeshttps://doi.org/10.1109/iscas.2001.922010openalex-snapshot
Adaptive negative cycle detection in dynamic graphs
inferred← citeshttps://doi.org/10.1109/taicpart.2009.26openalex-snapshot
On Complexity of All-Paths Test Generation: From Practice to Theory
inferred← citeshttps://doi.org/10.1145/1146909.1146971openalex-snapshot
Predicate learning and selective theory deduction for a difference logic solver
inferred← citeshttps://doi.org/10.1145/1146909.1147025openalex-snapshot
An efficient and versatile scheduling algorithm based on SDC formulation
inferred← citeshttps://doi.org/10.1145/1389449.1389478openalex-snapshot
Global difference constraint propagation for finite domain solvers
inferred← citeshttps://doi.org/10.1155/s1110865702205053openalex-snapshot
High-Level Synthesis of DSP Applications Using Adaptive Negative Cycle Detection
inferred← citeshttps://doi.org/10.1287/moor.2014.0708openalex-snapshot
The Linear Complementarity Problems with a Few Variables per Constraint
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21213openalex-snapshot
Speeding Up the RUL¯ Dynamic-Controllability-Checking Algorithm for Simple Temporal Networks with Uncertainty
inferred← citeshttps://doi.org/10.1609/icaps.v20i1.13417openalex-snapshot
Incrementally Solving STNs by Enforcing Partial Path Consistency
inferred← citeshttps://doi.org/10.2139/ssrn.5260286openalex-snapshot
Exploiting Incrementality in Branch and Bound for Train Dispatching
inferred← citeshttps://doi.org/10.48550/arxiv.1808.02591openalex-snapshot
A practical Single Source Shortest Path algorithm for random directed graphs with arbitrary weight in expecting linear time
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.