:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Ganian, Robert, Korchemna, Viktoriia
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Artificial Intelligence
Online Access:	https://arxiv.org/abs/2602.10253
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Parameterized Complexity of Efficient Sortation
by: Ganian, Robert, et al.
Published: (2024)

EF1 and EFX Orientations
by: Deligkas, Argyrios, et al.
Published: (2024)

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

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

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

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

Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity
by: Pham, Canh V.
Published: (2024)

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

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

Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search
by: Benomar, Ziyad, et al.
Published: (2025)

Efficiently Learning Branching Networks for Multitask Algorithmic Reasoning
by: Li, Dongyue, et al.
Published: (2025)

Query Complexity of Tournament Solutions
by: Maiti, Arnab, et al.
Published: (2016)

COL-Trees: Efficient Hierarchical Object Search in Road Networks
by: Abeywickrama, Tenindra, et al.
Published: (2026)

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

Uncovering Fairness through Data Complexity as an Early Indicator
by: Ferreira, Juliett Suárez, et al.
Published: (2025)

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

Adaptive Multi-Round Allocation with Stochastic Arrivals
by: Pan, Yuqi, et al.
Published: (2026)

Online Allocation with Unknown Shared Supply
by: Neoh, Tzeh Yuan, et al.
Published: (2026)

Variance Computation for Weighted Model Counting with Knowledge Compilation Approach
by: Nakamura, Kengo, et al.
Published: (2026)

Nearly Optimal Attention Coresets
by: Liberty, Edo, et al.
Published: (2026)

Scalable Algorithms for Approximate DNF Model Counting
by: Burkhardt, Paul, et al.
Published: (2026)

A canonical generalization of OBDD
by: Capelli, Florent, et al.
Published: (2026)

Skyline-First Traversal as a Control Mechanism for Multi-Criteria Graph Search
by: Tacheny, Nicolas
Published: (2026)

Online Algorithms with Unreliable Guidance
by: Dallot, Julien, et al.
Published: (2026)

Limited Perfect Monotonical Surrogates constructed using low-cost recursive linkage discovery with guaranteed output
by: Przewozniczek, M. W., et al.
Published: (2026)

Approximating Optimal Labelings for Temporal Connectivity
by: Carnevale, Daniele, et al.
Published: (2025)

FAMST: Fast Approximate Minimum Spanning Tree Construction for Large-Scale and High-Dimensional Data
by: Almansoori, Mahmood K. M., et al.
Published: (2025)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
by: Nguyen, Hue T., et al.
Published: (2025)

Efficient Detection of Exchangeable Factors in Factor Graphs
by: Luttermann, Malte, et al.
Published: (2024)

Linearithmic Clean-up for Vector-Symbolic Key-Value Memory with Kroneker Rotation Products
by: Liu, Ruipeng, et al.
Published: (2025)

Masked Matrix Multiplication for Emergent Sparsity
by: Wheatman, Brian, et al.
Published: (2024)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
by: Wang, Long, et al.
Published: (2025)

Queueing, Predictions, and LLMs: Challenges and Open Problems
by: Mitzenmacher, Michael, et al.
Published: (2025)

Compatibility of Max and Sum Objectives for Committee Selection and $k$-Facility Location
by: Han, Yue, et al.
Published: (2025)

Knapsack: Connectedness, Path, and Shortest-Path
by: Dey, Palash, et al.
Published: (2023)

A Survey on the Densest Subgraph Problem and Its Variants
by: Lanciano, Tommaso, et al.
Published: (2023)

Parameterized Analysis of Bribery in Challenge the Champ Tournaments
by: Chaudhary, Juhi, et al.
Published: (2024)

Stochastic Multi-round Submodular Optimization with Budget
by: Auletta, Vincenzo, et al.
Published: (2024)