On the public citation graph

Destroying Densest Subgraphs is Hard

https://doi.org/10.2139/ssrn.4877057
0 signed · 30 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.1002/jgt.3190100214openalex-extracted
Strongly balanced graphs and random graphs
inferredcites →https://doi.org/10.1002/net.20464openalex-extracted
Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs
inferredcites →https://doi.org/10.1007/978-3-030-86838-3_16openalex-extracted
Feedback Vertex Set on Hamiltonian Graphs
inferredcites →https://doi.org/10.1007/978-3-319-08404-6_17openalex-extracted
Win-Win Kernelization for Degree Sequence Completion Problems
inferredcites →https://doi.org/10.1007/978-3-642-11269-0_10openalex-extracted
What Makes Equitable Connected Partition Easy
inferredcites →https://doi.org/10.1007/bf01534980openalex-extracted
On graphs and rigidity of plane skeletal structures
inferredcites →https://doi.org/10.1007/bf02579200openalex-extracted
An application of simultaneous diophantine approximation in combinatorial optimization
inferredcites →https://doi.org/10.1007/s00453-017-0311-7openalex-extracted
Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth
inferredcites →https://doi.org/10.1007/s10878-021-00708-2openalex-extracted
On maximum $$P_3$$-packing in claw-free subcubic graphs
inferredcites →https://doi.org/10.1016/b978-0-12-374092-2.50017-5openalex-extracted
Network Survivability
inferredcites →https://doi.org/10.1016/j.cosrev.2023.100556openalex-extracted
A survey of parameterized algorithms and the complexity of edge modification
inferredcites →https://doi.org/10.1016/j.dam.2008.03.012openalex-extracted
Transforming a graph into a 1-balanced graph
inferredcites →https://doi.org/10.1016/j.dam.2011.04.023openalex-extracted
The complexity of dissociation set problems in graphs
inferredcites →https://doi.org/10.1016/j.disc.2013.07.014openalex-extracted
On 1 -improper 2 -coloring of sparse graphs
inferredcites →https://doi.org/10.1016/j.disc.2013.10.022openalex-extracted
Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2 -distance (Δ+2) -colorable
inferredcites →https://doi.org/10.1016/j.disc.2017.06.014openalex-extracted
Maximum average degree and relaxed coloring
inferredcites →https://doi.org/10.1016/j.jcss.2011.02.001openalex-extracted
Editing graphs to satisfy degree constraints: A parameterized approach
inferredcites →https://doi.org/10.1016/j.tcs.2008.09.065openalex-extracted
On the parameterized complexity of multiple-interval graph problems
inferredcites →https://doi.org/10.1016/j.tcs.2022.08.025openalex-extracted
Further parameterized algorithms for the F -free edge deletion problem
inferredcites →https://doi.org/10.1109/focs57990.2023.00060openalex-extracted
The Subspace Flatness Conjecture and Faster Integer Programming
inferredcites →https://doi.org/10.1109/sfcs.1980.12openalex-extracted
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
inferredcites →https://doi.org/10.1134/s0037446611050041openalex-extracted
Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1
inferredcites →https://doi.org/10.1145/3610940openalex-extracted
Almost-Linear-Time Algorithms for Maximum Flow and Minimum-Cost Flow
inferredcites →https://doi.org/10.1145/3653298openalex-extracted
A Survey on the Densest Subgraph Problem and its Variants
inferredcites →https://doi.org/10.1145/3828.3829openalex-extracted
Optimal attack and reinforcement of a network
inferredcites →https://doi.org/10.1145/800119.803884openalex-extracted
Some simplified NP-complete problems
inferredcites →https://doi.org/10.1287/moor.12.3.415openalex-extracted
Minkowski's Convex Body Theorem and Integer Programming
inferredcites →https://doi.org/10.1287/moor.8.4.538openalex-extracted
Integer Programming with a Fixed Number of Variables
inferredcites →https://doi.org/10.14279/depositonce-4415openalex-extracted
Degree-constrained editing of small-degree graphs
inferredcites →https://doi.org/10.37236/9455openalex-extracted
Decreasing the Maximum Average Degree by Deleting an Independent Set or a $d$-Degenerate Subgraph
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.