On the public citation graph
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
0 signed · 38 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/11537311_18openalex-snapshot
On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems
inferredcites →https://doi.org/10.1007/11785293_17openalex-snapshot
Exact Computation of Maximum Induced Forest
inferredcites →https://doi.org/10.1007/11847250_17openalex-snapshot
Finding a Minimum Feedback Vertex Set in Time $\mathcal{O} (1.7548^n)$
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.1007/s00224-007-1334-2openalex-snapshot
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
inferredcites →https://doi.org/10.1007/s10878-007-9045-9openalex-snapshot
Maximum k-regular induced subgraphs
inferredcites →https://doi.org/10.1016/0020-0190(82)90077-1openalex-snapshot
NP-completeness of some generalizations of the maximum matching problem
inferredcites →https://doi.org/10.1016/0022-0000(82)90009-5openalex-snapshot
Isomorphism of graphs of bounded valence can be tested in polynomial time
inferredcites →https://doi.org/10.1016/0166-218x(92)90272-copenalex-snapshot
Matchings and ▵-matroids
inferredcites →https://doi.org/10.1016/0196-6774(86)90032-5openalex-snapshot
Algorithms for maximum independent sets
inferredcites →https://doi.org/10.1016/j.orl.2004.03.002openalex-snapshot
Enumerating maximal independent sets with applications to graph colouring
inferredcites →https://doi.org/10.1109/sfcs.1983.10openalex-snapshot
Computational complexity and the classification of finite simple groups
inferredcites →https://doi.org/10.5555/1109557.1109560openalex-snapshot
Measure and conquer: a simple O(20.288n) independent set algorithm
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.21631openalex-snapshot
Feedback Vertex Sets in Tournaments
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_44openalex-snapshot
Branch and Recharge: Exact Algorithms for Generalized Domination
inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_23openalex-snapshot
Feedback Vertex Sets in Tournaments
inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_25openalex-snapshot
Exact Algorithm for the Maximum Induced Planar Subgraph Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-33293-7_3openalex-snapshot
Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n
inferred← citeshttps://doi.org/10.1007/978-3-642-35452-6_7openalex-snapshot
An O ∗ (1.4786 n )-Time Algorithm for the Maximum Induced Matching Problem
inferred← citeshttps://doi.org/10.1007/s00453-010-9418-9openalex-snapshot
Branch and Recharge: Exact Algorithms for Generalized Domination
inferred← citeshttps://doi.org/10.1016/j.amc.2025.129700openalex-snapshot
Induced cycles vertex number and (1,2)-domination in cubic graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.01.009openalex-snapshot
Induced 2-regular subgraphs in k -chordal cubic graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2011.08.002openalex-snapshot
Covering and packing in linear space
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.03.036openalex-snapshot
The complexity of uniform Nash equilibria and related regular subgraph problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.06.014openalex-snapshot
Maximum regular induced subgraphs in 2P3 -free graphs
inferred← citeshttps://doi.org/10.1109/tnse.2020.2993691openalex-snapshot
Subgraph Detection for Average Detectability of LTI Systems
inferred← citeshttps://doi.org/10.1145/1552285.1552286openalex-snapshot
A measure & conquer approach for the analysis of exact algorithms
inferred← citeshttps://doi.org/10.1587/transinf.e96.d.443openalex-snapshot
Inapproximability of Maximum r-Regular Induced Connected Subgraph Problems
inferred← citeshttps://doi.org/10.4208/csiam-am.2020-0031openalex-snapshot
Social Distancing as a Population Game in Networked Social Environments
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2010.2470openalex-snapshot
Finding Induced Subgraphs via Minimal Triangulations
inferred← citeshttps://doi.org/10.48550/arxiv.0905.0567openalex-snapshot
Feedback Vertex Sets in Tournaments
inferred← citeshttps://doi.org/10.48550/arxiv.2005.12506openalex-snapshot
Social Distancing as a Network Population Game in a Socially Connected World
inferred← citeshttps://doi.org/10.70675/b582ab43z06bcz4057z9278z04ec24d07118openalex-snapshot
Network partitioning algorithms with scale-free objective
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.