:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Soheil, Farehe, Simonov, Kirill, Friedrich, Tobias
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2503.01445
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Finding Minimum Distance Preservers: A Parameterized Study
por: Simonov, Kirill, et al.
Publicado: (2026)

Parameterized Complexity of Vehicle Routing
por: Döring, Michelle, et al.
Publicado: (2025)

Combining Crown Structures for Vulnerability Measures
por: Casel, Katrin, et al.
Publicado: (2024)

Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes
por: Mallek, Nadym, et al.
Publicado: (2025)

Structural Parameterization of Steiner Tree Packing
por: Hastrich, Niko, et al.
Publicado: (2025)

Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs
por: Koana, Tomohiro, et al.
Publicado: (2024)

Connected Partitions via Connected Dominating Sets
por: Niklanovits, Aikaterini, et al.
Publicado: (2025)

Algorithmic Extensions of Dirac's Theorem
por: Fomin, Fedor V., et al.
Publicado: (2020)

Edge Clique Partition and Cover Beyond Independence
por: Fomin, Fedor V., et al.
Publicado: (2025)

On Parallel $k$-Center Clustering
por: Coy, Sam, et al.
Publicado: (2023)

Fixed-Parameter Tractability of Hedge Cut
por: Fomin, Fedor V., et al.
Publicado: (2024)

The k-Center Problem of Uncertain Points on Graphs
por: Xu, Haitao, et al.
Publicado: (2025)

Beyond 2-approximation for k-Center in Graphs
por: Jin, Ce, et al.
Publicado: (2025)

Moderate Dimension Reduction for $k$-Center Clustering
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2023)

On Algorithmic Meta-Theorems for Solution Discovery: Tractability and Barriers
por: Bousquet, Nicolas, et al.
Publicado: (2025)

Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
por: Pilipczuk, Michał, et al.
Publicado: (2025)

The Connected k-Vertex One-Center Problem on Graphs
por: Zhang, Jingru
Publicado: (2024)

Generalized $k$-Center: Distinguishing Doubling and Highway Dimension
por: Feldmann, Andreas Emil, et al.
Publicado: (2022)

Fixed-Parameter Tractable Submodular Maximization over a Matroid
por: Nematollahi, Shamisa, et al.
Publicado: (2025)

Hardness, Tractability and Density Thresholds of finite Pinwheel Scheduling Variants
por: Kanellopoulos, Sotiris, et al.
Publicado: (2026)

Fully Dynamic Matching and Ordered Ruzsa-Szemerédi Graphs
por: Behnezhad, Soheil, et al.
Publicado: (2024)

Tractable Graph Structures in EFX Orientation
por: Blažej, Václav, et al.
Publicado: (2025)

Packing Short Cycles
por: Bentert, Matthias, et al.
Publicado: (2024)

Faster Approximation Algorithms for k-Center via Data Reduction
por: Filtser, Arnold, et al.
Publicado: (2025)

Tractable Maximization of Budgeted Phylogenetic Diversity on Networks Utilizing Node Scanwidth
por: Holtgrefe, Niels, et al.
Publicado: (2026)

Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse
por: Bhattacharya, Sayan, et al.
Publicado: (2024)

Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
por: Fomin, Fedor V., et al.
Publicado: (2024)

Structural Parameterizations of $k$-Planarity
por: Gima, Tatsuya, et al.
Publicado: (2025)

Hybrid k-Clustering: Blending k-Median and k-Center
por: Fomin, Fedor V., et al.
Publicado: (2024)

Binary weights spanning trees and the $k$-red spanning tree problem in linear time
por: Hochbaum, Dorit S.
Publicado: (2024)

Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
por: Arenas, Marcelo, et al.
Publicado: (2024)

Leveraging Fixed-Parameter Tractability for Robot Inspection Planning
por: Mizutani, Yosuke, et al.
Publicado: (2024)

On Fixed-Parameter Tractability of Weighted 0-1 Timed Matching Problem on Temporal Graphs
por: Kumar, Rinku, et al.
Publicado: (2025)

Faster Fixed Parameter Tractable Algorithms for Counting Markov Equivalence Classes with Special Skeletons
por: Sharma, Vidya Sagar
Publicado: (2023)

The General Expiration Streaming Model: Diameter, $k$-Center, Counting, Sampling, and Friends
por: Blank, Lotte, et al.
Publicado: (2025)

Approximating Maximum Matching Requires Almost Quadratic Time
por: Behnezhad, Soheil, et al.
Publicado: (2024)

Single-Pass Streaming CSPs via Two-Tier Sampling
por: Azarmehr, Amir, et al.
Publicado: (2026)

Bipartite Matching in Massive Graphs: A Tight Analysis of EDCS
por: Azarmehr, Amir, et al.
Publicado: (2024)

Fully Dynamic (Δ+1) Coloring Against Adaptive Adversaries
por: Behnezhad, Soheil, et al.
Publicado: (2024)

A Fixed Parameter Tractable Approach for Solving the Vertex Cover Problem in Polynomial Time Complexity
por: Tayal, Mumuksh
Publicado: (2025)