Related references
Note: Only part of the references are listed.A Parameterized Complexity View on Collapsing k-Cores
Junjie Luo et al.
THEORY OF COMPUTING SYSTEMS (2021)
EDITING TO CONNECTED F-DEGREE GRAPH
Fedor Fomin et al.
SIAM JOURNAL ON DISCRETE MATHEMATICS (2019)
Finding even subgraphs even faster
Prachi Goyal et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2018)
Tight lower bounds on the matching number in a graph with given maximum degree
Michael A. Henning et al.
JOURNAL OF GRAPH THEORY (2018)
Editing to a connected graph of given degrees
Petr A. Golovach
INFORMATION AND COMPUTATION (2017)
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks
Fan Zhang et al.
PROCEEDINGS OF THE VLDB ENDOWMENT (2017)
Parameterized complexity of the anchored k-core problem for directed graphs
Rajesh Chitnis et al.
INFORMATION AND COMPUTATION (2016)
PREVENTING UNRAVELING IN SOCIAL NETWORKS: THE ANCHORED K-CORE PROBLEM
Kshipra Bhawalkar et al.
SIAM JOURNAL ON DISCRETE MATHEMATICS (2015)
Kernelization Lower Bounds Through Colors and IDs
Michael Dom et al.
ACM TRANSACTIONS ON ALGORITHMS (2014)
Editing graphs to satisfy degree constraints: A parameterized approach
Luke Mathieson et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2012)
Infeasibility of instance compression and succinct PCPs for NP
Lance Fortnow et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2011)
Understanding Edge Connectivity in the Internet through Core Decomposition
J. Ignacio Alvarez-Hamelin et al.
INTERNET MATHEMATICS (2011)
On problems without polynomial kernels
Hans L. Bodlaender et al.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2009)
K-core decomposition of Internet graphs: Hierarchies, selfsimilarity and measurement biases
Jose Ignacio Alvarez-Hamelin et al.
NETWORKS AND HETEROGENEOUS MEDIA (2008)
Peeling the yeast protein network
S Wuchty et al.
PROTEOMICS (2005)
A note on a theorem of Erdos & Gallai
A Tripathi et al.
DISCRETE MATHEMATICS (2003)
Communication and coordination in social networks
MSY Chwe
REVIEW OF ECONOMIC STUDIES (2000)
Share Paper
