:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Antipov, Leonid, Kratsch, Stefan
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2504.18476
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Boundaried Kernelization via Representative Sets
por: Antipov, Leonid, et al.
Publicado: (2025)

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

Efficient parameterized approximation
por: Kratsch, Stefan, et al.
Publicado: (2025)

On polynomial kernelization for Stable Cutset
por: Kratsch, Stefan, et al.
Publicado: (2024)

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

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

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

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

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

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

Dynamic Meta-Kernelization
por: Bertram, Christian, et al.
Publicado: (2025)

Kernelization for $H$-Coloring
por: Berkman, Yael, et al.
Publicado: (2025)

Kernelization for Orthogonality Dimension
por: Haviv, Ishay, et al.
Publicado: (2024)

Coresets for Kernel Clustering
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2021)

Space-Efficient Graph Kernelizations
por: Kammer, Frank, et al.
Publicado: (2020)

Dynamic Kernel Graph Sparsifiers
por: Cao, Yang, et al.
Publicado: (2022)

Protrusion Decompositions Revisited: Uniform Lossy Kernels for Reducing Treewidth and Linear Kernels for Hitting Disconnected Minors
por: Sharma, Roohani, et al.
Publicado: (2026)

A Refined Kernel for $d$-Hitting Set
por: Liu, Yuxi, et al.
Publicado: (2025)

Quadratic Kernel for Cliques or Trees Vertex Deletion
por: Kumabe, Soh
Publicado: (2025)

Efficient Kernelization Algorithm for Bipartite Graph Matching
por: Wu, Guang, et al.
Publicado: (2024)

A Near-Optimal Kernel for a Coloring Problem
por: Haviv, Ishay, et al.
Publicado: (2025)

Linear Kernels for $l$-Exact Component Order Connectivity
por: Liu, Yuxi, et al.
Publicado: (2026)

Polynomial Kernels with Reachability for Weighted $d$-Matroid Intersection
por: Huang, Chien-Chung, et al.
Publicado: (2026)

Improved Kernelization and Fixed-parameter Algorithms for Bicluster Editing
por: Lafond, Manuel
Publicado: (2024)

An Improved Kernel and Parameterized Algorithm for Almost Induced Matching
por: Liu, Yuxi, et al.
Publicado: (2023)

Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion
por: Houari-Durand, Séhane Bel, et al.
Publicado: (2025)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
por: Bentert, Matthias, et al.
Publicado: (2024)

An Almost Quadratic Vertex Kernel for Subset Feedback Arc Set in Tournaments
por: Bai, Tian
Publicado: (2025)

A $2\ell k$ Kernel for $\ell$-Component Order Connectivity
por: Kumar, Mithilesh, et al.
Publicado: (2016)

A Quasi-Monte Carlo Data Structure for Smooth Kernel Evaluations
por: Charikar, Moses, et al.
Publicado: (2024)

Kernelization for list $H$-coloring for graphs with small vertex cover
por: Piecyk, Marta, et al.
Publicado: (2025)

Improved FPT Approximation Scheme and Approximate Kernel for Biclique-Free Max k-Weight SAT: Greedy Strikes Back
por: Manurangsi, Pasin
Publicado: (2024)

Kernelization Bounds for Constrained Coloring
por: Haviv, Ishay
Publicado: (2026)

Kernels for Storage Capacity and Dual Index Coding
por: Haviv, Ishay
Publicado: (2025)

Polynomial Kernels for Spanning Tree with Diversity Requirements
por: Golovach, Petr A., et al.
Publicado: (2026)

Limits of Kernelization and Parametrization for Phylogenetic Diversity with Dependencies
por: Holtgrefe, Niels, et al.
Publicado: (2026)

Optimal Kernel Orchestration for Tensor Programs with Korch
por: Hu, Muyan, et al.
Publicado: (2024)

Finer-Grained Hardness of Kernel Density Estimation
por: Alman, Josh, et al.
Publicado: (2024)

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

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