On the public citation graph
Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331)
0 signed · 19 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/3-540-36478-1_17openalex-snapshot
Exact Algorithms for NP-Hard Problems: A Survey
inferredcites →https://doi.org/10.1109/focs.2010.24openalex-snapshot
Determinant Sums for Undirected Hamiltonicity
inferredcites →https://doi.org/10.1109/focs.2013.83openalex-snapshot
The Parity of Directed Hamiltonian Cycles
inferredcites →https://doi.org/10.1137/0110015openalex-snapshot
A Dynamic Programming Approach to Sequencing Problems
inferredcites →https://doi.org/10.1145/2488608.2488646openalex-snapshot
Fast hamiltonicity checking via bases of perfect matchings
inferredcites →https://doi.org/10.1145/321105.321111openalex-snapshot
Dynamic Programming Treatment of the Travelling Salesman Problem
inferredcites →https://doi.org/10.4230/lipics.swat.2016.17openalex-snapshot
Below All Subsets for Some Permutational Counting 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/978-3-319-08404-6_25openalex-snapshot
Assigning Channels via the Meet-in-the-Middle Approach
inferred← citeshttps://doi.org/10.1007/s00453-015-0004-zopenalex-snapshot
Assigning Channels Via the Meet-in-the-Middle Approach
inferred← citeshttps://doi.org/10.1007/s00453-018-0496-4openalex-snapshot
Counting Linear Extensions: Parameterizations by Treewidth
inferred← citeshttps://doi.org/10.1137/1.9781611973730.45openalex-snapshot
Tight lower bound for the channel assignment problem
inferred← citeshttps://doi.org/10.1137/1.9781611974331.ch87openalex-snapshot
Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky
inferred← citeshttps://doi.org/10.1137/1.9781611974782.69openalex-snapshot
A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum
inferred← citeshttps://doi.org/10.1145/2876505openalex-snapshot
Tight Lower Bound for the Channel Assignment Problem
inferred← citeshttps://doi.org/10.1145/3051094openalex-snapshot
Tight Lower Bounds on Graph Embedding Problems
inferred← citeshttps://doi.org/10.1145/3402926openalex-snapshot
Deterministic APSP, Orthogonal Vectors, and More
inferred← citeshttps://doi.org/10.1145/3618260.3649656openalex-snapshot
The Asymptotic Rank Conjecture and the Set Cover Conjecture Are Not Both True
inferred← citeshttps://doi.org/10.4230/lipics.esa.2016.69openalex-snapshot
Finding Large Set Covers Faster via the Representation Method
inferred← citeshttps://doi.org/10.48550/arxiv.1602.05016openalex-snapshot
Tight Lower Bounds on Graph Embedding Problems
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.