On the public citation graph

Approximation Schemes for First-Order Definable Optimisation Problems

0 signed · 56 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/inco.1994.1100openalex-snapshot
Logical Definability of NP Optimization Problems
inferredcites →https://doi.org/10.1006/jcss.1995.1031openalex-snapshot
Approximation Properties of NP Minimization Classes
inferredcites →https://doi.org/10.1007/11523468_116openalex-snapshot
Preservation Under Extensions on Well-Behaved Finite Structures
inferredcites →https://doi.org/10.1007/3-540-28788-4openalex-snapshot
Finite Model Theory
inferredcites →https://doi.org/10.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/s00224-007-1346-yopenalex-snapshot
The Complexity of Polynomial-Time Approximation
inferredcites →https://doi.org/10.1007/s00493-003-0037-9openalex-snapshot
Local Tree-Width, Excluded Minors, and Approximation Algorithms
inferredcites →https://doi.org/10.1016/0022-0000(91)90023-xopenalex-snapshot
Optimization, approximation, and complexity classes
inferredcites →https://doi.org/10.1016/0196-6774(91)90006-kopenalex-snapshot
Easy problems for tree-decomposable graphs
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
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.apal.2004.01.004openalex-snapshot
Shrinking games and local formulas
inferredcites →https://doi.org/10.1016/j.apal.2004.01.005openalex-snapshot
An existential locality theorem
inferredcites →https://doi.org/10.1016/j.jctb.2004.08.001openalex-snapshot
Graph Minors. XX. Wagner's conjecture
inferredcites →https://doi.org/10.1016/s0049-237x(08)71879-2openalex-snapshot
On Local and Non-Local Properties
inferredcites →https://doi.org/10.1093/comjnl/bxm048openalex-snapshot
Parameterized Complexity and Approximation Algorithms
inferredcites →https://doi.org/10.1109/sfcs.2005.14openalex-snapshot
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
inferredcites →https://doi.org/10.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/060658709openalex-snapshot
Preservation under Extensions on Well-Behaved Finite Structures
inferredcites →https://doi.org/10.1145/100216.100254openalex-snapshot
A separator theorem for graphs with an excluded minor and its applications
inferredcites →https://doi.org/10.1145/174644.174650openalex-snapshot
Approximation algorithms for NP-complete problems on planar graphs
inferredcites →https://doi.org/10.1145/237814.237979openalex-snapshot
Towards a syntactic characterization of PTAS
inferredcites →https://doi.org/10.7155/jgaa.00014openalex-snapshot
Subgraph Isomorphism in Planar Graphs and Related Problems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11523468_116openalex-snapshot
Preservation Under Extensions on Well-Behaved Finite Structures
inferred← citeshttps://doi.org/10.1007/978-3-030-10564-8_2openalex-snapshot
Parameterized Computational Geometry via Decomposition Theorems
inferred← citeshttps://doi.org/10.1007/978-3-031-43380-1_21openalex-snapshot
Maximum Edge Colouring Problem On Graphs That Exclude a Fixed Minor
inferred← citeshttps://doi.org/10.1007/978-3-319-06686-8_2openalex-snapshot
Algorithmic Meta Theorems for Sparse Graph Classes
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_50openalex-snapshot
Boundedness of Monadic FO over Acyclic Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_78openalex-snapshot
Model Theory Makes Formulas Large
inferred← citeshttps://doi.org/10.1007/978-3-540-74456-6_2openalex-snapshot
Finite Model Theory on Tame Classes of Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_20openalex-snapshot
Complexity and Approximation Results for the Connected Vertex Cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_10openalex-snapshot
The Power of Counting Logics on Restricted Classes of Finite Structures
inferred← citeshttps://doi.org/10.1007/978-3-540-79723-4_3openalex-snapshot
Algorithmic Meta-theorems
inferred← citeshttps://doi.org/10.1007/978-3-540-92248-3_3openalex-snapshot
Algorithmic Meta Theorems
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_47openalex-snapshot
Algorithmic Meta-theorems for Restrictions of Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-642-39206-1_57openalex-snapshot
Model Checking Lower Bounds for Simple Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-48971-0_10openalex-snapshot
On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems
inferred← citeshttps://doi.org/10.1007/s00453-011-9554-xopenalex-snapshot
Algorithmic Meta-theorems for Restrictions of Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-017-0278-4openalex-snapshot
On the Approximability of the Minimum Rainbow Subgraph Problem and Other Related Problems
inferred← citeshttps://doi.org/10.1016/j.dam.2012.03.025openalex-snapshot
On the approximability of some degree-constrained subgraph problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.061openalex-snapshot
Universal augmentation schemes for network navigability
inferred← citeshttps://doi.org/10.1017/9781139028868openalex-snapshot
Descriptive Complexity, Canonisation, and Definable Graph Structure Theory
inferred← citeshttps://doi.org/10.1109/lics.2013.11openalex-snapshot
An Optimal Gaifman Normal Form Construction for Structures of Bounded Degree
inferred← citeshttps://doi.org/10.1137/060658709openalex-snapshot
Preservation under Extensions on Well-Behaved Finite Structures
inferred← citeshttps://doi.org/10.1137/1.9781611973075.30openalex-snapshot
On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic
inferred← citeshttps://doi.org/10.1137/1.9781611975994.137openalex-snapshot
Baker game and polynomial-time approximation schemes
inferred← citeshttps://doi.org/10.1137/1.9781611976465.29openalex-snapshot
Treewidth-Pliability and PTAS for Max-CSPs
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch84openalex-snapshot
A Framework for Approximation Schemes on Disk Graphs
inferred← citeshttps://doi.org/10.1145/2591796.2591851openalex-snapshot
Deciding first-order properties of nowhere dense graphs
inferred← citeshttps://doi.org/10.1145/3051095openalex-snapshot
Deciding First-Order Properties of Nowhere Dense Graphs
inferred← citeshttps://doi.org/10.1145/3154833openalex-snapshot
Excluded Grid Minors and Efficient Polynomial-Time Approximation Schemes
inferred← citeshttps://doi.org/10.1145/3531130.3532498openalex-snapshot
When Locality Meets Preservation
inferred← citeshttps://doi.org/10.1145/3626515openalex-snapshot
Pliability and Approximating Max-CSPs
inferred← citeshttps://doi.org/10.2168/lmcs-10(1:18)2014openalex-snapshot
Model Checking Lower Bounds for Simple Graphs
inferred← citeshttps://doi.org/10.4230/lipics.swat.2022.22openalex-snapshot
Approximation Metatheorems for Classes with Bounded Expansion
inferred← citeshttps://doi.org/10.48550/arxiv.0910.0582openalex-snapshot
Algorithmic Meta-Theorems for Graphs of Bounded Vertex Cover
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.