On the public citation graph

Incremental Dynamic Controllability in Cubic Worst-Case Time

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.
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/11889205_28openalex-snapshot
A Structural Characterization of Temporal Dynamic Controllability
inferredcites →https://doi.org/10.1007/978-3-319-07046-9_33openalex-snapshot
Dynamic Controllability and Dispatchability Relationships
inferredcites →https://doi.org/10.1016/0004-3702(91)90006-6openalex-snapshot
Temporal constraint networks
inferredcites →https://doi.org/10.1109/time.2009.25openalex-snapshot
Fixing the Semantics for Dynamic Controllability and Providing a More Practical Characterization of Dynamic Execution Strategies
inferredcites →https://doi.org/10.1109/time.2013.13openalex-snapshot
A Faster Execution Algorithm for Dynamically Controllable STNUs
inferredcites →https://doi.org/10.1609/aaai.v28i1.9040openalex-snapshot
Using Timed Game Automata to Synthesize Execution Strategies for Simple Temporal Networks with Uncertainty
inferredcites →https://doi.org/10.1609/icaps.v23i1.13603openalex-snapshot
Incremental Dynamic Controllability Revisited
inferredcites →https://doi.org/10.1609/icaps.v24i1.13646openalex-snapshot
EfficientIDC: A Faster Incremental Dynamic Controllability Algorithm
inferredcites →https://doi.org/10.3233/978-1-60750-606-5-471openalex-snapshot
Analyzing Flexible Timeline-based Plans
inferredcites →https://doi.org/10.5220/0004815801300141openalex-snapshot
Classical Dynamic Controllability Revisited - A Tighter Bound on the Classical Algorithm

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-319-25210-0_11openalex-snapshot
New Techniques for Checking Dynamic Controllability of Simple Temporal Networks with Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-319-25210-0_15openalex-snapshot
Revisiting Classical Dynamic Controllability: A Tighter Complexity Analysis
inferred← citeshttps://doi.org/10.1007/s00236-015-0227-0openalex-snapshot
Efficient execution of dynamically controllable simple temporal networks with uncertainty
inferred← citeshttps://doi.org/10.1007/s00236-015-0248-8openalex-snapshot
Efficient processing of simple temporal networks with uncertainty: algorithms for dynamic controllability verification
inferred← citeshttps://doi.org/10.1016/j.artint.2014.11.003openalex-snapshot
Deliberation for autonomous robots: A survey
inferred← citeshttps://doi.org/10.1016/j.knosys.2016.08.029openalex-snapshot
Hierarchical task network-based emergency task planning with incomplete information, concurrency and uncertain duration
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.11.005openalex-snapshot
Dynamic controllability of simple temporal networks with uncertainty: Simple rules and fast real-time execution
inferred← citeshttps://doi.org/10.1613/jair.1.11375openalex-snapshot
Dynamic Controllability of Controllable Conditional Temporal Problems with Uncertainty
inferred← citeshttps://doi.org/10.1613/jair.1.13019openalex-snapshot
Probabilistic Temporal Networks with Ordinary Distributions: Theory, Robustness and Expected Utility
inferred← citeshttps://doi.org/10.24963/ijcai.2017/598openalex-snapshot
Faster Conflict Generation for Dynamic Controllability
inferred← citeshttps://doi.org/10.24963/ijcai.2018/648openalex-snapshot
Variable-Delay Controllability
inferred← citeshttps://doi.org/10.3233/jifs-161557openalex-snapshot
HTN planning with uncontrollable durations for emergency decision-making
inferred← citeshttps://doi.org/10.3233/jifs-17681openalex-snapshot
Resource-constrained Hierarchical Task Network planning under uncontrollable durations for emergency decision-making
inferred← citeshttps://doi.org/10.70675/40c2985dz31eaz4c21zb123z805114da3a7fopenalex-snapshot
Temporal and Hierarchical Models for Planning and Acting in Robotics
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.