On the public citation graph
https://doi.org/10.4086/toc.2010.v006a005
0 signed · 189 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/11604686openalex-snapshot
Graph-Theoretic Concepts in Computer Science
inferredcites →https://doi.org/10.1007/11604686_1openalex-snapshot
Hypertree Decompositions: Structure, Algorithms, and Applications
inferredcites →https://doi.org/10.1007/11821069openalex-snapshot
Optimal Linear Arrangement of Interval Graphs
inferredcites →https://doi.org/10.1007/11821069_5openalex-snapshot
The Structure of Tractable Constraint Satisfaction Problems
inferredcites →https://doi.org/10.1007/3-540-29953-xopenalex-snapshot
Parameterized Complexity Theory
inferredcites →https://doi.org/10.1007/3-540-46135-3_21openalex-snapshot
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
inferredcites →https://doi.org/10.1007/978-3-540-92800-3_7openalex-snapshot
Uniform Constraint Satisfaction Problems and Database Theory
inferredcites →https://doi.org/10.1007/s00224-009-9248-9openalex-snapshot
Tractable Structures for Constraint Satisfaction with Truth Tables
inferredcites →https://doi.org/10.1016/0022-0000(81)90040-4openalex-snapshot
Explicit constructions of linear-sized superconcentrators
inferredcites →https://doi.org/10.1016/0095-8956(86)90030-4openalex-snapshot
Graph minors. V. Excluding a planar graph
inferredcites →https://doi.org/10.1016/0196-6774(86)90023-4openalex-snapshot
Graph minors. II. Algorithmic aspects of tree-width
inferredcites →https://doi.org/10.1016/j.jcss.2010.04.003openalex-snapshot
Constraint satisfaction with succinctly specified relations
inferredcites →https://doi.org/10.1016/j.jctb.2008.06.004openalex-snapshot
On tree width, bramble size, and expansion
inferredcites →https://doi.org/10.1016/j.tcs.2008.09.065openalex-snapshot
On the parameterized complexity of multiple-interval graph problems
inferredcites →https://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferredcites →https://doi.org/10.1017/cbo9780511662119.006openalex-snapshot
Tree Width and Tangles: A New Connectivity Measure and Some Applications
inferredcites →https://doi.org/10.1093/comjnl/bxm056openalex-snapshot
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems
inferredcites →https://doi.org/10.1109/ccc.2004.1313826openalex-snapshot
Tight lower bounds for certain parameterized NP-hard problems
inferredcites →https://doi.org/10.1109/lics.2003.1210072openalex-snapshot
Tractable conservative constraint satisfaction problems
inferredcites →https://doi.org/10.1109/sfcs.1998.743516openalex-snapshot
Which problems have strongly exponential complexity?
inferredcites →https://doi.org/10.1137/05064299xopenalex-snapshot
Improved Approximation Algorithms for Minimum Weight Vertex Separators
inferredcites →https://doi.org/10.1137/060673898openalex-snapshot
Closest Substring Problems with Small Distances
inferredcites →https://doi.org/10.1137/1.9781611973075.42openalex-snapshot
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
inferredcites →https://doi.org/10.1137/100812653openalex-snapshot
Sparse Balanced Partitions and the Complexity of Subgraph Problems
inferredcites →https://doi.org/10.1137/s0097539794266766openalex-snapshot
The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
inferredcites →https://doi.org/10.1145/1007352.1007391openalex-snapshot
Linear FPT reductions and computational lower bounds
inferredcites →https://doi.org/10.1145/1109557.1109590openalex-snapshot
Constraint solving via fractional edge covers
inferredcites →https://doi.org/10.1145/1120582.1120584openalex-snapshot
A dichotomy theorem for constraint satisfaction problems on a 3-element set
inferredcites →https://doi.org/10.1145/1206035.1206036openalex-snapshot
The complexity of homomorphism and constraint satisfaction problems seen from the other side
inferredcites →https://doi.org/10.1145/1721837.1721845openalex-snapshot
Approximating fractional hypertree width
inferredcites →https://doi.org/10.1145/1806689.1806790openalex-snapshot
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
inferredcites →https://doi.org/10.1145/263867.263489openalex-snapshot
Closure properties of constraints
inferredcites →https://doi.org/10.1145/331524.331526openalex-snapshot
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
inferredcites →https://doi.org/10.1145/380752.380867openalex-snapshot
When is the evaluation of conjunctive queries tractable?
inferredcites →https://doi.org/10.1145/380752.380868openalex-snapshot
The complexity of maximal constraint languages
inferredcites →https://doi.org/10.1145/800133.804350openalex-snapshot
The complexity of satisfiability problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4640092openalex-extracted
On the Complexity of Winner Determination and Strategic Control in Conditional Approval Voting
inferred← citeshttps://doi.org/10.1002/jgt.21813openalex-snapshot
Treewidth of the Line Graph of a Complete Graph
inferred← citeshttps://doi.org/10.1007/978-3-030-34029-2_19openalex-snapshot
Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_4openalex-snapshot
Parameterized Inapproximability of Independent Set in H-Free Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-96731-4_22openalex-snapshot
Parameterized Complexity of Reconfiguration of Atoms
inferred← citeshttps://doi.org/10.1007/978-3-031-09574-0_4openalex-snapshot
Parameterized Complexity of List Coloring and Max Coloring
inferred← citeshttps://doi.org/10.1007/978-3-031-92932-8_15openalex-snapshot
A Parameterized Perspective of All-Colors
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_44openalex-snapshot
Counting Large Patterns in Degenerate Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_19openalex-snapshot
Quantifier Elimination Meets Treewidth
inferred← citeshttps://doi.org/10.1007/978-3-319-03898-8_29openalex-snapshot
Treewidth and Pure Nash Equilibria
inferred← citeshttps://doi.org/10.1007/978-3-319-11433-0_18openalex-snapshot
Treewidth and the Computational Complexity of MAP Approximations
inferred← citeshttps://doi.org/10.1007/978-3-319-21275-3_14openalex-snapshot
Lower Bounds Based on the Exponential-Time Hypothesis
inferred← citeshttps://doi.org/10.1007/978-3-319-68705-6_3openalex-snapshot
Critical Node Cut Parameterized by Treewidth and Solution Size is W[1]-Hard
inferred← citeshttps://doi.org/10.1007/978-3-319-90530-3_7openalex-snapshot
A Tight Lower Bound for Steiner Orientation
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_27openalex-snapshot
On Moderately Exponential Time for SAT
inferred← citeshttps://doi.org/10.1007/978-3-642-14444-8_1openalex-snapshot
Universality, Tolerance, Chaos and Order
inferred← citeshttps://doi.org/10.1007/978-3-642-25591-5_63openalex-snapshot
The Parameterized Complexity of Local Search for TSP, More Refined
inferred← citeshttps://doi.org/10.1007/978-3-642-30891-8_20openalex-snapshot
What’s Next? Future Directions in Parameterized Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-38756-2_21openalex-snapshot
Fixed-Parameter Tractability of Workflow Satisfiability in the Presence of Seniority Constraints
inferred← citeshttps://doi.org/10.1007/978-3-662-47672-7_39openalex-snapshot
Lower Bounds for the Graph Homomorphism Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-53536-3_22openalex-snapshot
On Directed Steiner Trees with Multiple Roots
inferred← citeshttps://doi.org/10.1007/978-981-92-3309-0_13openalex-snapshot
Parameterized Complexity of Odd Domination and its Generalization
inferred← citeshttps://doi.org/10.1007/s00224-009-9248-9openalex-snapshot
Tractable Structures for Constraint Satisfaction with Truth Tables
inferred← citeshttps://doi.org/10.1007/s00453-012-9685-8openalex-snapshot
The Parameterized Complexity of Local Search for TSP, More Refined
inferred← citeshttps://doi.org/10.1007/s00453-014-9923-3openalex-snapshot
Pure Nash Equilibria in Graphical Games and Treewidth
inferred← citeshttps://doi.org/10.1007/s00453-017-0387-0openalex-snapshot
Complexity of Token Swapping and Its Variants
inferred← citeshttps://doi.org/10.1007/s00453-019-00579-4openalex-snapshot
Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality is the Key to Single-Exponential Parameterized Algorithms
inferred← citeshttps://doi.org/10.1007/s00453-019-00580-xopenalex-snapshot
A Tight Lower Bound for Planar Steiner Orientation
inferred← citeshttps://doi.org/10.1007/s00453-020-00716-4openalex-snapshot
The Inverse Voronoi Problem in Graphs I: Hardness
inferred← citeshttps://doi.org/10.1007/s00453-021-00805-yopenalex-snapshot
Parameterized Counting of Partially Injective Homomorphisms
inferred← citeshttps://doi.org/10.1007/s00453-021-00812-zopenalex-snapshot
Finding and Counting Permutations via CSPs
inferred← citeshttps://doi.org/10.1007/s00453-021-00813-yopenalex-snapshot
Beating Treewidth for Average-Case Subgraph Isomorphism
inferred← citeshttps://doi.org/10.1007/s00453-022-00970-8openalex-snapshot
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
inferred← citeshttps://doi.org/10.1007/s00453-022-01001-2openalex-snapshot
Grundy Coloring and Friends, Half-Graphs, Bicliques
inferred← citeshttps://doi.org/10.1007/s00453-022-01052-5openalex-snapshot
Parameterized Inapproximability of Independent Set in H-Free Graphs
inferred← citeshttps://doi.org/10.1007/s00453-022-01064-1openalex-snapshot
The Complexity of Routing Problems in Forbidden-Transition Graphs and Edge-Colored Graphs
inferred← citeshttps://doi.org/10.1007/s00453-023-01108-0openalex-snapshot
Monotone Arithmetic Complexity of Graph Homomorphism Polynomials
inferred← citeshttps://doi.org/10.1007/s00453-024-01262-zopenalex-snapshot
Parameterized Complexity of Reconfiguration of Atoms
inferred← citeshttps://doi.org/10.1007/s00453-025-01336-6openalex-snapshot
On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
inferred← citeshttps://doi.org/10.1007/s00454-021-00282-8openalex-snapshot
Fractal Dimension and Lower Bounds for Geometric Problems
inferred← citeshttps://doi.org/10.1007/s00454-025-00782-xopenalex-snapshot
Multicut Problems in Embedded Graphs: The Dependency of Complexity on the Demand Pattern
inferred← citeshttps://doi.org/10.1007/s10107-020-01563-5openalex-snapshot
New limits of treewidth-based tractability in optimization
inferred← citeshttps://doi.org/10.1007/s10601-015-9181-2openalex-snapshot
Structural decompositions for problems with global constraints
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103826openalex-snapshot
Parameterized complexity of envy-free resource allocation in social networks
inferred← citeshttps://doi.org/10.1016/j.artint.2023.103880openalex-snapshot
Solving infinite-domain CSPs using the patchwork property
inferred← citeshttps://doi.org/10.1016/j.artint.2025.104322openalex-snapshot
The influence of dimensions on the complexity of computing decision trees
inferred← citeshttps://doi.org/10.1016/j.artint.2026.104563openalex-snapshot
Balancing the spread of two opinions in sparse social networks
inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100837openalex-snapshot
Parameterised counting complexity theory
inferred← citeshttps://doi.org/10.1016/j.dam.2014.10.035openalex-snapshot
Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns
inferred← citeshttps://doi.org/10.1016/j.dam.2016.11.016openalex-snapshot
The Graph Motif problem parameterized by the structure of the input graph
inferred← citeshttps://doi.org/10.1016/j.ipl.2019.105836openalex-snapshot
Routing with congestion in acyclic digraphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2025.106561openalex-snapshot
On the Tractability Landscape of the Conditional Minisum Approval Voting Rule
inferred← citeshttps://doi.org/10.1016/j.jcss.2012.04.004openalex-snapshot
Bin packing with fixed number of bins revisited
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.07.008openalex-snapshot
Strong partial clones and the time complexity of SAT problems
inferred← citeshttps://doi.org/10.1016/j.jctb.2018.03.007openalex-snapshot
The treewidth of line graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.12.061openalex-snapshot
Universal augmentation schemes for network navigability
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.11.038openalex-snapshot
Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.11.013openalex-snapshot
Fixing improper colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.11.003openalex-snapshot
Preference swaps for the stable matching problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115396openalex-snapshot
On the complexity of winner determination and strategic control in conditional approval voting
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115573openalex-snapshot
A parameterized perspective of all-colors
inferred← citeshttps://doi.org/10.1017/cbo9781139177801.005openalex-snapshot
Tractable Valued Constraints
inferred← citeshttps://doi.org/10.1109/focs.2014.22openalex-snapshot
Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts
inferred← citeshttps://doi.org/10.1109/focs.2015.65openalex-snapshot
Parameterizing the Permanent: Genus, Apices, Minors, Evaluation Mod 2k
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00012openalex-snapshot
Tree-depth and the Formula Complexity of Subgraph Isomorphism
inferred← citeshttps://doi.org/10.1109/focs46700.2020.00128openalex-snapshot
Counting Small Induced Subgraphs Satisfying Monotone Properties
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00036openalex-snapshot
Exact and Approximate Pattern Counting in Degenerate Graphs: New Algorithms, Hardness Results, and Complexity Dichotomies
inferred← citeshttps://doi.org/10.1109/tst.2014.6867521openalex-snapshot
Counting problems in parameterized complexity
inferred← citeshttps://doi.org/10.1137/1.9781611973402.129openalex-snapshot
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch81openalex-snapshot
Directed multicut is W [1]-hard, even for four terminal pairs
inferred← citeshttps://doi.org/10.1137/1.9781611975994.133openalex-snapshot
Counting and Finding Homomorphisms is Universal for Parameterized Complexity Theory
inferred← citeshttps://doi.org/10.1137/1.9781611975994.134openalex-snapshot
Parameterized Complexity and Approximability of Directed Odd Cycle Transversal
inferred← citeshttps://doi.org/10.1137/1.9781611975994.135openalex-snapshot
Approximately counting and sampling small witnesses using a colourful decision oracle
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch12openalex-snapshot
A tight quasi-polynomial bound for Global Label Min-Cut
inferred← citeshttps://doi.org/10.1137/100812653openalex-snapshot
Sparse Balanced Partitions and the Complexity of Subgraph Problems
inferred← citeshttps://doi.org/10.1137/130910932openalex-snapshot
Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
inferred← citeshttps://doi.org/10.1137/130947076openalex-snapshot
Known Algorithms for Edge Clique Cover are Probably Optimal
inferred← citeshttps://doi.org/10.1137/14099721xopenalex-snapshot
On the $AC^0$ Complexity of Subgraph Isomorphism
inferred← citeshttps://doi.org/10.1137/15m103618xopenalex-snapshot
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
inferred← citeshttps://doi.org/10.1137/18m122371xopenalex-snapshot
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
inferred← citeshttps://doi.org/10.1137/19m130604xopenalex-snapshot
Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle
inferred← citeshttps://doi.org/10.1137/20m1337624openalex-snapshot
Target Set Selection in Dense Graph Classes
inferred← citeshttps://doi.org/10.1137/20m1365624openalex-snapshot
Counting Small Induced Subgraphs Satisfying Monotone Properties
inferred← citeshttps://doi.org/10.1137/20m1372925openalex-snapshot
Tree-Depth and the Formula Complexity of Subgraph Isomorphism
inferred← citeshttps://doi.org/10.1137/22m1479804openalex-snapshot
Parameterized Counting and Cayley Graph Expanders
inferred← citeshttps://doi.org/10.1137/22m1535668openalex-snapshot
Counting Subgraphs in Somewhere Dense Graphs
inferred← citeshttps://doi.org/10.1142/9789813272880_0187openalex-snapshot
LOWER BOUNDS FOR SUBGRAPH ISOMORPHISM
inferred← citeshttps://doi.org/10.1145/1806689.1806790openalex-snapshot
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
inferred← citeshttps://doi.org/10.1145/2535926openalex-snapshot
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
inferred← citeshttps://doi.org/10.1145/2582112.2582124openalex-snapshot
The limited blessing of low dimensionality
inferred← citeshttps://doi.org/10.1145/2751316openalex-snapshot
The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space
inferred← citeshttps://doi.org/10.1145/3026744.3026746openalex-snapshot
An improved homomorphism preservation theorem from lower bounds in circuit complexity
inferred← citeshttps://doi.org/10.1145/3051094openalex-snapshot
Tight Lower Bounds on Graph Embedding Problems
inferred← citeshttps://doi.org/10.1145/3055399.3055502openalex-snapshot
Homomorphisms are a good basis for counting small subgraphs
inferred← citeshttps://doi.org/10.1145/3170442openalex-snapshot
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal
inferred← citeshttps://doi.org/10.1145/3201775openalex-snapshot
Directed Multicut is W[1]-hard, Even for Four Terminal Pairs
inferred← citeshttps://doi.org/10.1145/3212622openalex-snapshot
The Parameterized Complexity of the k -Biclique Problem
inferred← citeshttps://doi.org/10.1145/3398684openalex-snapshot
Parameterized Hardness of Art Gallery Problems
inferred← citeshttps://doi.org/10.1145/3417759openalex-snapshot
On Existential MSO and Its Relation to ETH
inferred← citeshttps://doi.org/10.1145/3447584openalex-snapshot
Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
inferred← citeshttps://doi.org/10.1145/3450704openalex-snapshot
Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs
inferred← citeshttps://doi.org/10.1145/3452021.3458814openalex-snapshot
Modern Lower Bound Techniques in Database Theory and Constraint Satisfaction
inferred← citeshttps://doi.org/10.1145/3483425openalex-snapshot
Optimal Parameterized Algorithms for Planar Facility Location Problems Using Voronoi Diagrams
inferred← citeshttps://doi.org/10.1145/3517804.3526231openalex-snapshot
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations
inferred← citeshttps://doi.org/10.1145/3564246.3585204openalex-snapshot
The Complexity of Pattern Counting in Directed Graphs, Parameterised by the Outdegree
inferred← citeshttps://doi.org/10.1145/3571278openalex-snapshot
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL
inferred← citeshttps://doi.org/10.1145/3584372.3588675openalex-snapshot
Space-Time Tradeoffs for Conjunctive Queries with Access Patterns
inferred← citeshttps://doi.org/10.1145/3618260.3649644openalex-snapshot
Counting Small Induced Subgraphs with Edge-Monotone Properties
inferred← citeshttps://doi.org/10.1145/3651591openalex-snapshot
Evaluating Datalog over Semirings: A Grounding-based Approach
inferred← citeshttps://doi.org/10.1145/3689634openalex-snapshot
Approximately Counting Answers to Conjunctive Queries with Disequalities and Negations
inferred← citeshttps://doi.org/10.1145/3717823.3718130openalex-snapshot
Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH
inferred← citeshttps://doi.org/10.1145/3717823.3718141openalex-snapshot
A Fine-Grained Classification of Subquadratic Patterns for Subgraph Listing and Friends
inferred← citeshttps://doi.org/10.1145/3717823.3718257openalex-snapshot
Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity
inferred← citeshttps://doi.org/10.1145/3743130openalex-snapshot
Space-Time Tradeoffs for Conjunctive Queries with Access Patterns
inferred← citeshttps://doi.org/10.1145/3796220openalex-snapshot
A Tight Quasi-Polynomial Bound for Global Label Min-Cut
inferred← citeshttps://doi.org/10.1145/3798129.3800913openalex-snapshot
Tight (S)ETH-Based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-machine Scheduling
inferred← citeshttps://doi.org/10.14279/depositonce-3922openalex-snapshot
Exploring parameter spaces in coping with computational intractability
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8131openalex-snapshot
A Dichotomy for 2-Constraint Forbidden CSP Patterns
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8609openalex-snapshot
On the Subexponential Time Complexity of CSP
inferred← citeshttps://doi.org/10.1613/jair.3651openalex-snapshot
The Tractability of CSP Classes Defined by Forbidden Patterns
inferred← citeshttps://doi.org/10.1613/jair.4540openalex-snapshot
On the Subexponential-Time Complexity of CSP
inferred← citeshttps://doi.org/10.1613/jair.4794openalex-snapshot
Tree-Width and the Computational Complexity of MAP Approximations in Bayesian Networks
inferred← citeshttps://doi.org/10.24963/ijcai.2021/48openalex-snapshot
Winner Determination and Strategic Control in Conditional Approval Voting
inferred← citeshttps://doi.org/10.4230/lipics.ccc.2019.31openalex-snapshot
A Fine-Grained Analogue of Schaefer’s Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties
inferred← citeshttps://doi.org/10.4230/lipics.esa.2019.23openalex-snapshot
Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP
inferred← citeshttps://doi.org/10.4230/lipics.icalp.2022.83openalex-snapshot
Finding and Counting Patterns in Sparse Graphs
inferred← citeshttps://doi.org/10.4230/lipics.ipec.2019.24openalex-snapshot
Beating Treewidth for Average-Case Subgraph Isomorphism
inferred← citeshttps://doi.org/10.4230/lipics.ipec.2021.22openalex-snapshot
Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder
inferred← citeshttps://doi.org/10.4230/lipics.isaac.2020.59openalex-snapshot
The Complexity of Connectivity Problems in Forbidden-Transition Graphs And Edge-Colored Graphs
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2019.25openalex-snapshot
Complexity of the Steiner Network Problem with Respect to the Number of Terminals
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2020.58openalex-snapshot
Grundy Coloring & Friends, Half-Graphs, Bicliques
inferred← citeshttps://doi.org/10.48550/arxiv.0911.0801openalex-snapshot
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
inferred← citeshttps://doi.org/10.48550/arxiv.1108.2385openalex-snapshot
Width-parameterized SAT: Time-Space Tradeoffs
inferred← citeshttps://doi.org/10.48550/arxiv.1304.1996openalex-snapshot
On the Subexponential Time Complexity of CSP
inferred← citeshttps://doi.org/10.48550/arxiv.1601.03240openalex-snapshot
Counting Answers to Existential Positive Queries: A Complexity Classification
inferred← citeshttps://doi.org/10.48550/arxiv.1602.05016openalex-snapshot
Tight Lower Bounds on Graph Embedding Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1604.02761openalex-snapshot
Tractable Lineages on Treelike Instances: Limits and Extensions
inferred← citeshttps://doi.org/10.48550/arxiv.1607.06911openalex-snapshot
Fixing improper colorings of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1607.08067openalex-snapshot
The Descriptive Complexity of Subgraph Isomorphism without Numerics
inferred← citeshttps://doi.org/10.48550/arxiv.1612.01171openalex-snapshot
The limited blessing of low dimensionality: when $1-1/d$ is the best possible exponent for $d$-dimensional geometric problems
inferred← citeshttps://doi.org/10.48550/arxiv.1811.12547openalex-snapshot
The inverse Voronoi problem in graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1910.11850openalex-snapshot
Tight Running Time Lower Bounds for Strong Inapproximability of Maximum $k$-Coverage, Unique Set Cover and Related Problems (via $t$-Wise Agreement Testing Theorem)
inferred← citeshttps://doi.org/10.48550/arxiv.1912.03185openalex-snapshot
Parameterized Complexity of Partial Scheduling
inferred← citeshttps://doi.org/10.48550/arxiv.2008.08368openalex-snapshot
Disjoint Shortest Paths with Congestion on DAGs
inferred← citeshttps://doi.org/10.7916/d8zp45ktopenalex-snapshot
Unconditional Lower Bounds in Complexity Theory
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.