On the public citation graph
A Faster Execution Algorithm for Dynamically Controllable STNUs
0 signed · 20 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/11889205_28openalex-snapshot
A Structural Characterization of Temporal Dynamic Controllability
inferredcites →https://doi.org/10.1007/978-0-230-37405-8_1openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1016/0004-3702(91)90006-6openalex-snapshot
Temporal constraint networks
inferredcites →https://doi.org/10.1109/tai.1996.560477openalex-snapshot
Incremental algorithms for managing temporal constraints
inferredcites →https://doi.org/10.1109/time.1998.674134openalex-snapshot
Qualitative and quantitative temporal reasoning with points and durations
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.2010.16openalex-snapshot
A Fast Incremental Algorithm for Managing the Execution of Dynamically Controllable Temporal Networks
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-016-0257-2openalex-snapshot
Dynamic controllability via Timed Game Automata
inferred← citeshttps://doi.org/10.1109/time.2014.13openalex-snapshot
Incremental Dynamic Controllability in Cubic Worst-Case Time
inferred← citeshttps://doi.org/10.1109/time.2014.21openalex-snapshot
Sound and Complete Algorithms for Checking the Dynamic Controllability of Temporal Networks with Uncertainty, Disjunction and Observation
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.9040openalex-snapshot
Using Timed Game Automata to Synthesize Execution Strategies for Simple Temporal Networks with Uncertainty
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10401openalex-snapshot
Dynamic Controllability of Disjunctive Temporal Networks: Validation and Synthesis of Executable Strategies
inferred← citeshttps://doi.org/10.3233/ia-170112openalex-snapshot
Disjunctive temporal networks with uncertainty via SMT: Recent results and directions
inferred← citeshttps://doi.org/10.3384/lic.diva-119409openalex-snapshot
Efficient Temporal Reasoning with Uncertainty
inferred← citeshttps://doi.org/10.5220/0004758100630073openalex-snapshot
A Faster Algorithm for Checking the Dynamic Controllability of Simple Temporal Networks with Uncertainty
inferred← citeshttps://doi.org/10.5220/0004815801300141openalex-snapshot
Classical Dynamic Controllability Revisited - A Tighter Bound on the Classical Algorithm
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.