On the public citation graph
Complexity and infinite games on finite graphs
0 signed · 91 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.1006/jagm.1995.1009openalex-snapshot
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
inferredcites →https://doi.org/10.1006/jctb.1993.1027openalex-snapshot
Graph Searching and a Min-Max Theorem for Tree-Width
inferredcites →https://doi.org/10.1006/jctb.1995.1006openalex-snapshot
Graph Minors .XIII. The Disjoint Paths Problem
inferredcites →https://doi.org/10.1007/10722167_18openalex-snapshot
A Discrete Strategy Improvement Algorithm for Solving Parity Games
inferredcites →https://doi.org/10.1007/11496915_17openalex-snapshot
Jumping Doesn’t Help in Abstract Cubes
inferredcites →https://doi.org/10.1007/11549345_32openalex-snapshot
Nondeterministic Graph Searching: From Pathwidth to Treewidth
inferredcites →https://doi.org/10.1007/11549345_43openalex-snapshot
Complexity Bounds for Regular Games
inferredcites →https://doi.org/10.1007/11549345_64openalex-snapshot
D-Width: A More Natural Measure for Directed Tree Width
inferredcites →https://doi.org/10.1007/11841036_60openalex-snapshot
On Exact Algorithms for Treewidth
inferredcites →https://doi.org/10.1007/3-540-19488-6_110openalex-snapshot
Dynamic programming on graphs with bounded treewidth
inferredcites →https://doi.org/10.1007/3-540-36379-3_24openalex-snapshot
Complexity of Some Infinite Games Played on Finite Graphs
inferredcites →https://doi.org/10.1007/3-540-46541-3_24openalex-snapshot
Small Progress Measures for Solving Parity Games
inferredcites →https://doi.org/10.1007/3-540-47813-2_17openalex-snapshot
Weak Muller Acceptance Conditions for Tree Automata
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_29openalex-snapshot
Solving Sequential Conditions by Finite-State Strategies
inferredcites →https://doi.org/10.1007/978-3-540-32275-7_15openalex-snapshot
Entanglement – A Measure for the Complexity of Directed Graphs with Applications to Logic and Games
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_7openalex-snapshot
Fast Mu-Calculus Model Checking when Tree-Width Is Bounded
inferredcites →https://doi.org/10.1007/978-3-540-74839-7_26openalex-snapshot
Characterization and Recognition of Digraphs of Bounded Kelly-width
inferredcites →https://doi.org/10.1007/bf01934985openalex-snapshot
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
inferredcites →https://doi.org/10.1007/bfb0029946openalex-snapshot
Treewidth: Algorithmic techniques and results
inferredcites →https://doi.org/10.1007/s00373-005-0627-yopenalex-snapshot
Directed Path-width and Monotonicity in Digraph Searching
inferredcites →https://doi.org/10.1007/s00453-004-1117-yopenalex-snapshot
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
inferredcites →https://doi.org/10.1016/0022-247x(70)90282-9openalex-snapshot
Triangulated graphs and the elimination process
inferredcites →https://doi.org/10.1016/0095-8956(83)90079-5openalex-snapshot
Graph minors. I. Excluding a forest
inferredcites →https://doi.org/10.1016/0095-8956(84)90013-3openalex-snapshot
Graph minors. III. Planar tree-width
inferredcites →https://doi.org/10.1016/0095-8956(91)90068-uopenalex-snapshot
Quickly excluding a forest
inferredcites →https://doi.org/10.1016/0166-218x(88)90042-xopenalex-snapshot
Completely unimodal numberings of a simple polytope
inferredcites →https://doi.org/10.1016/0166-218x(89)90031-0openalex-snapshot
Linear time algorithms for NP-hard problems restricted to partial k-trees
inferredcites →https://doi.org/10.1016/0168-0072(93)90036-dopenalex-snapshot
Infinite games played on finite graphs
inferredcites →https://doi.org/10.1016/0168-0072(94)90086-8openalex-snapshot
Progress measures, immediate determinacy, and a subset construction for tree automata
inferredcites →https://doi.org/10.1016/0168-0072(95)00032-1openalex-snapshot
McNaughton games and extracting strategies for concurrent programs
inferredcites →https://doi.org/10.1016/0196-6774(91)90003-hopenalex-snapshot
Monotonicity in graph searching
inferredcites →https://doi.org/10.1016/0304-3975(80)90009-2openalex-snapshot
The directed subgraph homeomorphism problem
inferredcites →https://doi.org/10.1016/0304-3975(94)90269-0openalex-snapshot
CTL∗ and ECTL∗ as fragments of the modal μ-calculus
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50010-xopenalex-snapshot
Graph Rewriting: An Algebraic and Logic Approach
inferredcites →https://doi.org/10.1016/j.jctb.2004.08.001openalex-snapshot
Graph Minors. XX. Wagner's conjecture
inferredcites →https://doi.org/10.1016/j.jctb.2006.12.006openalex-snapshot
Directed tree-width examples
inferredcites →https://doi.org/10.1016/s0019-9958(66)80013-xopenalex-snapshot
Testing and generating infinite sequences by a finite automaton
inferredcites →https://doi.org/10.1016/s0019-9958(82)91258-xopenalex-snapshot
Propositional dynamic logic of looping and converse is elementarily decidable
inferredcites →https://doi.org/10.1016/s0022-0000(03)00030-8openalex-snapshot
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
inferredcites →https://doi.org/10.1016/s0166-218x(02)00459-6openalex-snapshot
On the monotonicity of games generated by symmetric submodular functions
inferredcites →https://doi.org/10.1016/s0304-3975(00)00034-7openalex-snapshot
On model checking for the μ-calculus and its fragments
inferredcites →https://doi.org/10.1016/s0304-3975(96)00177-6openalex-snapshot
Fugitive-search games on graphs and related parameters
inferredcites →https://doi.org/10.1016/s0304-3975(98)00009-7openalex-snapshot
Infinite games on finitely coloured graphs with applications to automata on infinite trees
inferredcites →https://doi.org/10.1063/1.4822863openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science
inferredcites →https://doi.org/10.1090/cbms/013openalex-snapshot
Automata on Infinite Objects and Church’s Problem
inferredcites →https://doi.org/10.1109/lics.1997.614939openalex-snapshot
How much memory is needed to win infinite games?
inferredcites →https://doi.org/10.1109/sfcs.2001.959931openalex-snapshot
Unique sink orientations of cubes
inferredcites →https://doi.org/10.1109/swct.1963.8openalex-snapshot
Infinite sequences and finite machines
inferredcites →https://doi.org/10.1137/0134014openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Directed Graphs
inferredcites →https://doi.org/10.1137/0401019openalex-snapshot
From Linear Separability to Unimodality: A Hierarchy of Pseudo-Boolean Functions
inferredcites →https://doi.org/10.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
inferredcites →https://doi.org/10.1137/0611010openalex-snapshot
The Role of Elimination Trees in Sparse Factorization
inferredcites →https://doi.org/10.1137/0614024openalex-snapshot
Elimination Structures for Unsymmetric Sparse $LU$ Factors
inferredcites →https://doi.org/10.1137/s0097539793251219openalex-snapshot
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
inferredcites →https://doi.org/10.1137/s0895480199350477openalex-snapshot
Graph Searching and Interval Completion
inferredcites →https://doi.org/10.1145/151261.151263openalex-snapshot
Recontamination does not help to search a graph
inferredcites →https://doi.org/10.1145/800116.803775openalex-snapshot
Algorithmic aspects of vertex elimination
inferredcites →https://doi.org/10.48550/arxiv.1301.6718openalex-snapshot
On the Complexity of Policy Iteration
inferredcites →https://doi.org/10.5555/1109557.1109590openalex-snapshot
Constraint solving via fractional edge covers
inferredcites →https://doi.org/10.5555/1109557.1109647openalex-snapshot
DAG-width: connectivity measure for directed graphs
inferredcites →https://doi.org/10.5555/1283383.1283452openalex-snapshot
Digraph measures: Kelly decompositions, games, and orderings
inferredcites →https://doi.org/10.82444/warw.33496135openalex-snapshot
A deterministic subexponential algorithm for solving parity games
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-1-4419-7997-1_76openalex-snapshot
Graph Searching and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-87531-4_26openalex-snapshot
The Descriptive Complexity of Parity Games
inferred← citeshttps://doi.org/10.1007/978-3-642-03409-1_16openalex-snapshot
Directed Graphs of Entanglement Two
inferred← citeshttps://doi.org/10.1007/s00236-016-0273-2openalex-snapshot
Assume-admissible synthesis
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.04.005openalex-snapshot
Complexity of semi-stable and stage semantics in argumentation frameworks
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.09.001openalex-snapshot
Are there any good digraph width measures?
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.02.040openalex-snapshot
An annotated bibliography on guaranteed graph searching
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.07.010openalex-snapshot
Entanglement and the complexity of directed graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.11.032openalex-snapshot
Alternating traps in Muller and parity games
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.09.016openalex-snapshot
Jumping robbers in digraphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.12.008openalex-snapshot
Forbidden directed minors and Kelly-width
inferred← citeshttps://doi.org/10.1109/lics.2015.42openalex-snapshot
Defining Winning Strategies in Fixed-Point Logic
inferred← citeshttps://doi.org/10.1142/9789811278631_0016openalex-snapshot
Weak Muller Conditions Make Delay Games Hard
inferred← citeshttps://doi.org/10.1145/2603088.2603143openalex-snapshot
The complexity of admissibility in Omega-regular games
inferred← citeshttps://doi.org/10.1145/3055399.3055409openalex-snapshot
Deciding parity games in quasipolynomial time
inferred← citeshttps://doi.org/10.2168/lmcs-11(2:9)2015openalex-snapshot
Pure Nash Equilibria in Concurrent Deterministic Games
inferred← citeshttps://doi.org/10.4230/lipics.fsttcs.2008.1768openalex-snapshot
Banach-Mazur Games on Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1110.5575openalex-snapshot
Graph Searching, Parity Games and Imperfect Information
inferred← citeshttps://doi.org/10.6100/ir757862openalex-snapshot
Advanced reduction techniques for model checking
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.