Structural parameterizations of vertex integrity (best paper)
From MaRDI portal
Publication:6575412
DOI10.1007/978-981-97-0566-5_29MaRDI QIDQ6575412FDOQ6575412
Authors: Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi 
Publication date: 19 July 2024
Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Title not available (Why is that?)
- Fixed-parameter algorithms for cluster vertex deletion
- Modular decomposition and transitive orientation
- Parameterized Algorithms
- Cluster vertex deletion: a parameterization between vertex cover and clique-width
- Measuring the vulnerability for classes of intersection graphs
- Parameterized Algorithms for Modular-Width
- A survey of integrity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some notes on bounded starwidth graphs
- On the computational complexity of vertex integrity and component order connectivity
- Vulnerability parameters of split graphs
- Safe sets in graphs: graph classes and structural parameters
- Safe number and integrity of graphs
- Parameterized Complexity of Safe Set
- Partitioning a graph into small pieces with applications to path transversal
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
- Exploring the gap between treedepth and vertex cover through vertex integrity
- Title not available (Why is that?)
- Extended MSO model checking via small vertex integrity
- Fully polynomial-time algorithms parameterized by vertex integrity using fast matrix multiplication
This page was built for publication: Structural parameterizations of vertex integrity (best paper)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575412)
