scientific article; zbMATH DE number 7559406
From MaRDI portal
Publication:5089202
DOI10.4230/LIPIcs.MFCS.2020.35MaRDI QIDQ5089202
Fedor V. Fomin, Kirill Simonov, Danil Sagunov
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2002.07612
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Parameterized complexity of the anchored \(k\)-core problem for directed graphs
- Editing graphs to satisfy degree constraints: a parameterized approach
- \(k\)-core decomposition of internet graphs: hierarchies, self-similarity and measurement biases
- An application of simultaneous diophantine approximation in combinatorial optimization
- Can we create large \(k\)-cores by adding few edges?
- Finding even subgraphs even faster
- A note on a theorem of Erdős and Gallai
- Editing to a graph of given degrees
- Editing to a connected graph of given degrees
- Graph Theory
- Understanding Edge Connectivity in the Internet through Core Decomposition
- Integer Programming with a Fixed Number of Variables
- Preventing Unraveling in Social Networks: The Anchored k-Core Problem
- Minkowski's Convex Body Theorem and Integer Programming
- Tight lower bounds on the matching number in a graph with given maximum degree
- Editing to Connected f-Degree Graph
- Communication and Coordination in Social Networks
- Kernelization Lower Bounds Through Colors and IDs
- Preventing Unraveling in Social Networks: The Anchored $k$-Core Problem
- Parameterized Algorithms
This page was built for publication:
