Imagen de Portada

Parameterized Complexity of Efficient Sortation

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Ganian, Robert, Hoang, Hung P., Wietheger, Simon
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Matrix Editing Meets Fair Clustering: Parameterized Algorithms and Complexity
por: Ganian, Robert, et al.
Publicado: (2025)

Fair Correlation Clustering Meets Graph Parameters
por: Blaha, Johannes, et al.
Publicado: (2026)

The Parameterized Complexity Landscape of the Unsplittable Flow Problem
por: Ganian, Robert, et al.
Publicado: (2024)

The Parameterized Complexity of Extending Stack Layouts
por: Depian, Thomas, et al.
Publicado: (2024)

Clustering Permutations under the Ulam Metric: A Parameterized Complexity Study
por: Bai, Tian, et al.
Publicado: (2026)

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
por: Bergougnoux, Benjamin, et al.
Publicado: (2023)

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
por: Eiben, Eduard, et al.
Publicado: (2024)

The Complexity of Bayesian Network Learning: Revisiting the Superstructure
por: Ganian, Robert, et al.
Publicado: (2026)

Fine-Grained Complexity of Computing Degree-Constrained Spanning Trees
por: Bojikian, Narek, et al.
Publicado: (2025)

Parameterized Complexity of Simultaneous Planarity
por: Fink, Simon D., et al.
Publicado: (2023)

Twin-Width Meets Feedback Edges and Vertex Integrity
por: Balabán, Jakub, et al.
Publicado: (2024)

Bilateral Treewidth for QBF: Where Strategies and Resolution Meet
por: Ganian, Robert, et al.
Publicado: (2026)

Linear Layouts Revisited: Stacks, Queues, and Exact Algorithms
por: Depian, Thomas, et al.
Publicado: (2025)

The Peculiarities of Extending Queue Layouts
por: Depian, Thomas, et al.
Publicado: (2025)

Parameterized Complexity of Finding Dissimilar Shortest Paths
por: Funayama, Ryo, et al.
Publicado: (2024)

On the Parameterized Complexity of Eulerian Strong Component Arc Deletion
por: Blažej, Václav, et al.
Publicado: (2024)

EF(X) Orientations: A Parameterized Complexity Perspective
por: Kanellopoulos, Sotiris, et al.
Publicado: (2025)

Complexity of Local Search for CSPs Parameterized by Constraint Difference
por: Anand, Aditya, et al.
Publicado: (2025)

Parameterized Complexity of MinCSP over the Point Algebra
por: Osipov, George, et al.
Publicado: (2023)

Parameterized Algorithms for the Drone Delivery Problem
por: Bartlmae, Simon, et al.
Publicado: (2026)

Independence-Number Parameterized Space Complexity for Directed Connectivity Certificate
por: Chen, Ho-Lin, et al.
Publicado: (2026)

Clustering under Constraints: Efficient Parameterized Approximation Schemes
por: Bhore, Sujoy, et al.
Publicado: (2025)

Parameterized Complexity of Dominating Set Variants in Almost Cluster and Split Graphs
por: Goyal, Dishant, et al.
Publicado: (2024)

A Quasi-Polynomial Time Algorithm for 3-Coloring Circle Graphs
por: S, Ajaykrishnan E, et al.
Publicado: (2025)

On the Parameterized Complexity of Diverse SAT
por: Misra, Neeldhara, et al.
Publicado: (2024)

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

On the Parameterized Complexity of Odd Coloring
por: Bhyravarapu, Sriram, et al.
Publicado: (2025)

Parameterized Complexity of Path Set Packing
por: Aravind, N. R., et al.
Publicado: (2022)

On the Parameterized Complexity of Min-Sum-Radii
por: Kumar, Pankaj, et al.
Publicado: (2026)

Parameterizing Path Partitions
por: Fernau, Henning, et al.
Publicado: (2022)

Parameterized algorithms for $k$-Inversion
por: Antony, Dhanyamol, et al.
Publicado: (2026)

Structural Parameterizations of Vertex Integrity
por: Gima, Tatsuya, et al.
Publicado: (2023)

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

Faster Parameterized Vertex Multicut
por: Chu, Huairui, et al.
Publicado: (2026)

Parameterized Complexity of Submodular Minimization under Uncertainty
por: Kakimura, Naonori, et al.
Publicado: (2024)

Parameterized Linear Time Transitive Closure
por: Kritikakis, Giorgos, et al.
Publicado: (2024)

Algorithms for Parameterized String Matching with Mismatches
por: Saha, Apurba, et al.
Publicado: (2024)

Subexponential Parameterized Algorithms for Hitting Subgraphs
por: Lokshtanov, Daniel, et al.
Publicado: (2024)

Dynamic Parameterized Feedback Problems in Tournaments
por: Zych-Pawlewicz, Anna, et al.
Publicado: (2024)

Parameterized Approximability for Modular Linear Equations
por: Dabrowski, Konrad K., et al.
Publicado: (2025)