Cover Image

On polynomial kernelization for Stable Cutset

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kratsch, Stefan, Le, Van Bang
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A faster polynomial-space algorithm for Hamiltonian cycle parameterized by treedepth
by: Kratsch, Stefan
Published: (2026)

Boundaried Kernelization via Representative Sets
by: Antipov, Leonid, et al.
Published: (2025)

Efficient parameterized approximation
by: Kratsch, Stefan, et al.
Published: (2025)

Boundaried Kernelization
by: Antipov, Leonid, et al.
Published: (2025)

On Stable Cutsets in General and Minimum Degree Constrained Graphs
by: Vroon, Mats, et al.
Published: (2025)

Tight Bounds for some W[1]-hard Problems Parameterized by Multi-clique-width
by: Bergougnoux, Benjamin, et al.
Published: (2026)

Tight Algorithm for Connected Odd Cycle Transversal Parameterized by Clique-width
by: Bojikian, Narek, et al.
Published: (2024)

Tight Bounds for Feedback Vertex Set Parameterized by Clique-width
by: Bojikian, Narek, et al.
Published: (2025)

A tight Monte-Carlo algorithm for Steiner Tree parameterized by clique-width
by: Bojikian, Narek, et al.
Published: (2023)

Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
by: Kim, Eun Jung, et al.
Published: (2022)

Tight Bounds for some Classical Problems Parameterized by Cutwidth
by: Bojikian, Narek, et al.
Published: (2025)

A polynomial kernel for vertex deletion into bipartite permutation graphs
by: Derbisz, Jan
Published: (2021)

Minimum sum vertex cover: kernelization and parameterized algorithms
by: Cao, Yixin, et al.
Published: (2024)

Enumeration kernels for Vertex Cover and Feedback Vertex Set
by: Bougeret, Marin, et al.
Published: (2025)

Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs
by: Le, Hoang-Oanh, et al.
Published: (2024)

Randomized matrix-free quadrature: unified and uniform bounds for stochastic Lanczos quadrature and the kernel polynomial method
by: Chen, Tyler, et al.
Published: (2022)

Randomized $k$-server in polynomial time
by: Coester, Christian, et al.
Published: (2026)

A more versatile model for enumerative kernelization: a case study for Vertex Cover
by: Bougeret, Marin, et al.
Published: (2026)

Canonical forms for matrix tuples in polynomial time
by: Qiao, Youming, et al.
Published: (2024)

On Computing the Dollo-1 phylogeny in polynomial time
by: Bonizzoni, Paola, et al.
Published: (2016)

The parameterized complexity of Strong Conflict-Free Vertex-Connection Colorability
by: Feghali, Carl, et al.
Published: (2025)

Generating the Spanning Trees of Series-Parallel Graphs up to Graph Automorphism
by: Karamchedu, Mithra, et al.
Published: (2025)

ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting
by: Abrahamsen, Mikkel
Published: (2024)

Improving polynomial bounds for the Graphical Traveling Salesman Problem with release dates on paths
by: Clementino, Thailsson, et al.
Published: (2025)

Coloring for dispersion: A polynomial-time algorithm for cardinality-constrained 2-anticlustering
by: Tran, Nguyen Khoa, et al.
Published: (2026)

The complexity of strong conflict-free vertex-connection $k$-colorability
by: Hsieh, Sun-Yuan, et al.
Published: (2024)

Location-Restricted Stable Matching
by: Castro, Garret
Published: (2025)

A polynomial delay algorithm generating all potential maximal cliques in triconnected planar graphs
by: Grigoriev, Alexander, et al.
Published: (2025)

A Separator for Minor-Free Graphs Beyond the Flow Barrier
by: Le, Hung
Published: (2026)

Course Allocation with Credits via Stable Matching
by: Rodríguez, José, et al.
Published: (2025)

Stable coresets: Unleashing the power of uniform sampling
by: Carmel, Amir, et al.
Published: (2025)

Selection Improvements on the Parallel Iterative Algorithm for Stable Matching
by: Wynn, Scott, et al.
Published: (2024)

New weighted additive spanners
by: La, An, et al.
Published: (2024)

Generating Satisfiable Benchmark Instances for Stable Roommates Problems with Optimization
by: Yılmaz, Baturay, et al.
Published: (2025)

zSort: Stable Distribution Sort using Z-Score Partitioning
by: Jain, Hriday, et al.
Published: (2026)

Improved Online Reachability Preservers
by: Bodwin, Greg, et al.
Published: (2024)

Enumerating all minimal hitting sets in polynomial total time
by: Wild, Marcel
Published: (2023)

A Subquadratic Bound for Online Bisection
by: Bienkowski, Marcin, et al.
Published: (2023)

Engineering Minimal k-Perfect Hash Functions
by: Hermann, Stefan, et al.
Published: (2025)

PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
by: Hermann, Stefan, et al.
Published: (2024)