:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Eiben, Eduard, Koana, Tomohiro, Wahlström, Magnus
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2304.02091
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

FPT algorithms over linear delta-matroids with applications
par: Eiben, Eduard, et autres
Publié: (2025)

Faster algorithms on linear delta-matroids
par: Koana, Tomohiro, et autres
Publié: (2024)

Faster Edge Coloring by Partition Sieving
par: Akmal, Shyan, et autres
Publié: (2025)

Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion
par: Houari-Durand, Séhane Bel, et autres
Publié: (2025)

Representative set statements for delta-matroids and the Mader delta-matroid
par: Wahlström, Magnus
Publié: (2023)

Graph Coloring Below Guarantees via Co-Triangle Packing
par: Akmal, Shyan, et autres
Publié: (2025)

Structural Parameterizations of the Biclique-Free Vertex Deletion Problem
par: Goldmann, Lito, et autres
Publié: (2023)

A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a $K_4$-Minor
par: Groenland, Carla, et autres
Publié: (2024)

Faster Minimization of Total Weighted Completion Time on Parallel Machines
par: Hermelin, Danny, et autres
Publié: (2025)

Fully Polynomial-time Algorithms Parameterized by Vertex Integrity Using Fast Matrix Multiplication
par: Bentert, Matthias, et autres
Publié: (2024)

Lawler-Moore Speedups via Additive Combinatorics
par: Bringmann, Karl, et autres
Publié: (2026)

Parameterized Complexity of MinCSP over the Point Algebra
par: Osipov, George, et autres
Publié: (2023)

Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs
par: Koana, Tomohiro, et autres
Publié: (2024)

Minimizing Reachability Times on Temporal Graphs via Shifting Labels
par: Deligkas, Argyrios, et autres
Publié: (2021)

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
par: Ameli, Afrouz Jabal, et autres
Publié: (2026)

Kronecker scaling of tensors with applications to arithmetic circuits and algorithms
par: Björklund, Andreas, et autres
Publié: (2025)

Kernelization for list $H$-coloring for graphs with small vertex cover
par: Piecyk, Marta, et autres
Publié: (2025)

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
par: Eiben, Eduard, et autres
Publié: (2024)

Maximizing Reachability via Shifting of Temporal Paths
par: Deligkas, Argyrios, et autres
Publié: (2026)

Parameterized Approximability for Modular Linear Equations
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Optimal FPT-Approximability for Modular Linear Equations
par: Dabrowski, Konrad K., et autres
Publié: (2026)

Flow-augmentation III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
par: Kim, Eun Jung, et autres
Publié: (2022)

Going Beyond Twin-width? CSPs with Unbounded Domain and Few Variables
par: Jonsson, Peter, et autres
Publié: (2025)

Individual Rationality in Topological Distance Games is Surprisingly Hard
par: Deligkas, Argyrios, et autres
Publié: (2024)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
par: Deligkas, Argyrios, et autres
Publié: (2026)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
par: Eiben, Eduard, et autres
Publié: (2023)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
par: Deligkas, Argyrios, et autres
Publié: (2025)

EF1 and EFX Orientations
par: Deligkas, Argyrios, et autres
Publié: (2024)

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings
par: Dabrowski, Konrad K., et autres
Publié: (2024)

Comparing the Hardness of Online Minimization and Maximization Problems with Predictions
par: Berg, Magnus
Publié: (2024)

Shaving Logs via Large Sieve Inequality: Faster Algorithms for Sparse Convolution and More
par: Jin, Ce, et autres
Publié: (2024)

R-enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies
par: Kimura, Kotaro, et autres
Publié: (2025)

Space-efficient SLP encoding for $O(\log N)$-time random access
par: Takasaka, Akito, et autres
Publié: (2024)

Almost succinct representation of maximal palindromes
par: Mieno, Takuya, et autres
Publié: (2025)

Online Matching with Delays and Size-based Costs
par: Kawase, Yasushi, et autres
Publié: (2024)

Online Bin Covering with Frequency Predictions
par: Berg, Magnus, et autres
Publié: (2024)

Beyond Brooks: $(Δ-1)$-Coloring in Semi-Streaming
par: Flin, Maxime, et autres
Publié: (2026)

Faster Dynamic $(Δ+1)$-Coloring Against Adaptive Adversaries
par: Flin, Maxime, et autres
Publié: (2025)

Inverting Parameterized Burrows-Wheeler Transform
par: Kawanami, Shogen, et autres
Publié: (2025)

On the Smallest Size of Internal Collage Systems
par: Migita, Soichiro, et autres
Publié: (2025)