On the public citation graph

On a generalization of Nemhauser and Trotter's local optimization theorem

0 signed · 75 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/jagm.2001.1186openalex-snapshot
Vertex Cover: Further Observations and Further Improvements
inferredcites →https://doi.org/10.1007/978-3-540-30559-0_22openalex-snapshot
Linear Kernels in Linear Time, or How to Save k Colors in O(n 2) Steps
inferredcites →https://doi.org/10.1007/978-3-642-14031-0_18openalex-snapshot
A Note on Vertex Cover in Graphs with Maximum Degree 3
inferredcites →https://doi.org/10.1007/978-3-642-14355-7_10openalex-snapshot
A Linear Kernel for Co-Path/Cycle Packing
inferredcites →https://doi.org/10.1007/bf01580444openalex-snapshot
Vertex packings: Structural properties and algorithms
inferredcites →https://doi.org/10.1007/s00224-007-1328-0openalex-snapshot
Crown Structures for Vertex Cover Kernelization
inferredcites →https://doi.org/10.1007/s00453-011-9578-2openalex-snapshot
An Improved FPT Algorithm and a Quadratic Kernel for Pathwidth One Vertex Deletion
inferredcites →https://doi.org/10.1016/j.dam.2005.02.029openalex-snapshot
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
inferredcites →https://doi.org/10.1016/j.dam.2011.08.013openalex-snapshot
On Bounded-Degree Vertex Deletion parameterized by treewidth
inferredcites →https://doi.org/10.1016/j.jcss.2010.12.001openalex-snapshot
A generalization of Nemhauser and Trotterʼs local optimization theorem
inferredcites →https://doi.org/10.1016/j.tcs.2005.10.009openalex-snapshot
Looking at the stars
inferredcites →https://doi.org/10.1016/j.tcs.2009.04.021openalex-snapshot
Isolation concepts for efficiently enumerating dense subgraphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)73101-3openalex-snapshot
A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem
inferredcites →https://doi.org/10.1080/0022250x.1978.9989883openalex-snapshot
A graph‐theoretic generalization of the clique concept
inferredcites →https://doi.org/10.1109/sfcs.1975.5openalex-snapshot
An O (N2.5) algorithm for maximum matching in general graphs
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0211045openalex-snapshot
Approximation Algorithms for the Set Covering and Vertex Cover Problems
inferredcites →https://doi.org/10.1137/090773313openalex-snapshot
An Extension of the Nemhauser–Trotter Theorem to Generalized Vertex Cover with Applications
inferredcites →https://doi.org/10.1137/140997889openalex-snapshot
Hitting Forbidden Minors: Approximation and Kernelization
inferredcites →https://doi.org/10.1137/s0097539791199334openalex-snapshot
Improved Algorithms for Bipartite Network Flow
inferredcites →https://doi.org/10.1145/1721837.1721848openalex-snapshot
A 4 k 2 kernel for feedback vertex set
inferredcites →https://doi.org/10.1145/2566616openalex-snapshot
Faster Parameterized Algorithms Using Linear Programming
inferredcites →https://doi.org/10.1145/2629620openalex-snapshot
Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses
inferredcites →https://doi.org/10.1145/564585.564598openalex-snapshot
Algorithms column
inferredcites →https://doi.org/10.1145/800133.804353openalex-snapshot
On the completeness of a generalized matching problem
inferredcites →https://doi.org/10.1287/opre.1100.0851openalex-snapshot
Clique Relaxations in Social Network Analysis: The Maximum k -Plex Problem

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-031-30448-4_16openalex-snapshot
Approximating Power Node-Deletion Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-55911-7_47openalex-snapshot
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-319-57586-5_20openalex-snapshot
Approximating Bounded Degree Deletion via Matroid Matching
inferred← citeshttps://doi.org/10.1007/978-3-319-75172-6_4openalex-snapshot
Approximating Partially Bounded Degree Deletion on Directed Graphs
inferred← citeshttps://doi.org/10.1007/s10878-022-00917-3openalex-snapshot
Faster deterministic algorithms for Co-path Packing and Co-path/cycle Packing
inferred← citeshttps://doi.org/10.1016/j.asoc.2022.109758openalex-snapshot
Reinforcement learning based coarse-to-fine search for the maximum k -plex problem
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105406openalex-snapshot
Solving Co-Path/Cycle Packing and Co-Path Packing faster than 3k
inferred← citeshttps://doi.org/10.1016/j.ipl.2018.10.006openalex-snapshot
A (3 + ϵ)k-vertex kernel for edge-disjoint triangle packing
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.04.004openalex-snapshot
Linear kernels for separating a graph into components of bounded size
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.11.011openalex-snapshot
Complexity and kernels for bipartition into degree-bounded induced graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.04.018openalex-snapshot
Kernels for packing and covering problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.113872openalex-snapshot
A 5k-vertex kernel for 3-path vertex cover
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114733openalex-snapshot
Approximating power node-deletion problems
inferred← citeshttps://doi.org/10.1017/9781107415157openalex-snapshot
Kernelization
inferred← citeshttps://doi.org/10.1017/9781107415157.001openalex-snapshot
Preface
inferred← citeshttps://doi.org/10.1017/9781107415157.002openalex-snapshot
Acknowledgements
inferred← citeshttps://doi.org/10.1017/9781107415157.003openalex-snapshot
What Is a Kernel?
inferred← citeshttps://doi.org/10.1017/9781107415157.004openalex-snapshot
Warm Up
inferred← citeshttps://doi.org/10.1017/9781107415157.005openalex-snapshot
Inductive Priorities
inferred← citeshttps://doi.org/10.1017/9781107415157.006openalex-snapshot
Crown Decomposition
inferred← citeshttps://doi.org/10.1017/9781107415157.007openalex-snapshot
Expansion Lemma
inferred← citeshttps://doi.org/10.1017/9781107415157.008openalex-snapshot
Linear Programming
inferred← citeshttps://doi.org/10.1017/9781107415157.009openalex-snapshot
Hypertrees
inferred← citeshttps://doi.org/10.1017/9781107415157.010openalex-snapshot
Sunflower Lemma
inferred← citeshttps://doi.org/10.1017/9781107415157.011openalex-snapshot
Modules
inferred← citeshttps://doi.org/10.1017/9781107415157.012openalex-snapshot
Matroids
inferred← citeshttps://doi.org/10.1017/9781107415157.013openalex-snapshot
Representative Families
inferred← citeshttps://doi.org/10.1017/9781107415157.014openalex-snapshot
Greedy Packing
inferred← citeshttps://doi.org/10.1017/9781107415157.015openalex-snapshot
Euler–s Formula
inferred← citeshttps://doi.org/10.1017/9781107415157.016openalex-snapshot
Introduction to Treewidth
inferred← citeshttps://doi.org/10.1017/9781107415157.017openalex-snapshot
Bidimensionality and Protrusions
inferred← citeshttps://doi.org/10.1017/9781107415157.018openalex-snapshot
Surgery on Graphs
inferred← citeshttps://doi.org/10.1017/9781107415157.019openalex-snapshot
Framework
inferred← citeshttps://doi.org/10.1017/9781107415157.020openalex-snapshot
Instance Selectors
inferred← citeshttps://doi.org/10.1017/9781107415157.021openalex-snapshot
Polynomial Parameter Transformation
inferred← citeshttps://doi.org/10.1017/9781107415157.022openalex-snapshot
Polynomial Lower Bounds
inferred← citeshttps://doi.org/10.1017/9781107415157.023openalex-snapshot
Extending Distillation
inferred← citeshttps://doi.org/10.1017/9781107415157.024openalex-snapshot
Turing Kernelization
inferred← citeshttps://doi.org/10.1017/9781107415157.025openalex-snapshot
Lossy Kernelization
inferred← citeshttps://doi.org/10.1017/9781107415157.026openalex-snapshot
Open Problems
inferred← citeshttps://doi.org/10.1017/9781107415157.027openalex-snapshot
Graphs and SAT Notation
inferred← citeshttps://doi.org/10.1017/9781107415157.028openalex-snapshot
Problem Definitions
inferred← citeshttps://doi.org/10.1017/9781107415157.029openalex-snapshot
Author Index
inferred← citeshttps://doi.org/10.1017/9781107415157.030openalex-snapshot
Index
inferred← citeshttps://doi.org/10.1145/3665156openalex-snapshot
Structural Parameterizations for Two Bounded Degree Problems Revisited
inferred← citeshttps://doi.org/10.15807/jorsj.66.112openalex-snapshot
KERNELIZATION ALGORITHMS FOR A GENERALIZATION OF THE COMPONENT ORDER CONNECTIVITY PROBLEM
inferred← citeshttps://doi.org/10.1609/aaai.v31i1.10655openalex-snapshot
A Fast Algorithm to Compute Maximum k-Plexes in Social Network Analysis
inferred← citeshttps://doi.org/10.3390/axioms11050191openalex-snapshot
A Survey on the k-Path Vertex Cover Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1903.05537openalex-snapshot
Effective reinforcement learning based local search for the maximum k-plex problem
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.