Saved in:
| Main Authors: | Simonov, Kirill, Soheil, Farehe, Verma, Shaily |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2603.21442 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Parameterized Complexity of Vehicle Routing
by: Döring, Michelle, et al.
Published: (2025)
by: Döring, Michelle, et al.
Published: (2025)
(Independent) Roman Domination Parameterized by Distance to Cluster
by: Ashok, Pradeesha, et al.
Published: (2024)
by: Ashok, Pradeesha, et al.
Published: (2024)
Finding a Minimum Spanning Tree with a Small Non-Terminal Set
by: Hanaka, Tesshu, et al.
Published: (2023)
by: Hanaka, Tesshu, et al.
Published: (2023)
The Parameterized Complexity of Vertex-Coloring Edge-Weighting
by: Aute, Shubhada, et al.
Published: (2026)
by: Aute, Shubhada, et al.
Published: (2026)
Parameterized Complexity of Streaming Diameter and Connectivity Problems
by: Oostveen, Jelle J., et al.
Published: (2022)
by: Oostveen, Jelle J., et al.
Published: (2022)
Metric Dimension and Geodetic Set Parameterized by Vertex Cover
by: Foucaud, Florent, et al.
Published: (2024)
by: Foucaud, Florent, et al.
Published: (2024)
On Stable Cutsets in General and Minimum Degree Constrained Graphs
by: Vroon, Mats, et al.
Published: (2025)
by: Vroon, Mats, et al.
Published: (2025)
Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
by: Conrado, Giovanna K., et al.
Published: (2023)
by: Conrado, Giovanna K., et al.
Published: (2023)
On the Constant-Factor Approximability of Minimum Cost Constraint Satisfaction Problems
by: DeHaan, Ian, et al.
Published: (2025)
by: DeHaan, Ian, et al.
Published: (2025)
Linear-Time MaxCut in Multigraphs Parameterized Above the Poljak-Turzík Bound
by: Lill, Jonas, et al.
Published: (2024)
by: Lill, Jonas, et al.
Published: (2024)
The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
by: Dreier, Jan, et al.
Published: (2026)
by: Dreier, Jan, et al.
Published: (2026)
Problems in NP can Admit Double-Exponential Lower Bounds when Parameterized by Treewidth or Vertex Cover
by: Foucaud, Florent, et al.
Published: (2023)
by: Foucaud, Florent, et al.
Published: (2023)
On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
by: Scheffler, Robert
Published: (2025)
by: Scheffler, Robert
Published: (2025)
Parameterized Complexity of (d,r)-Domination via Modular Decomposition
by: Cordasco, Gennaro, et al.
Published: (2024)
by: Cordasco, Gennaro, et al.
Published: (2024)
Distance Vector Domination
by: Cordasco, Gennaro, et al.
Published: (2024)
by: Cordasco, Gennaro, et al.
Published: (2024)
Parameterized Saga of First-Fit and Last-Fit Coloring
by: Agrawal, Akanksha, et al.
Published: (2024)
by: Agrawal, Akanksha, et al.
Published: (2024)
Finding $d$-Cuts in Probe $H$-Free Graphs
by: Dabrowski, Konrad K., et al.
Published: (2025)
by: Dabrowski, Konrad K., et al.
Published: (2025)
Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
by: Lucke, Felicia, et al.
Published: (2024)
by: Lucke, Felicia, et al.
Published: (2024)
Total Variation Distance Meets Probabilistic Inference
by: Bhattacharyya, Arnab, et al.
Published: (2023)
by: Bhattacharyya, Arnab, et al.
Published: (2023)
A Dichotomy for Maximum PCSPs on Graphs
by: Nakajima, Tamio-Vesa, et al.
Published: (2024)
by: Nakajima, Tamio-Vesa, et al.
Published: (2024)
A note on approximating the average degree of bounded arboricity graphs
by: Eden, Talya, et al.
Published: (2026)
by: Eden, Talya, et al.
Published: (2026)
A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
by: Hamm, Thekla, et al.
Published: (2026)
by: Hamm, Thekla, et al.
Published: (2026)
A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees
by: Shao, Shuai, et al.
Published: (2023)
by: Shao, Shuai, et al.
Published: (2023)
Microscopic Structure of Random 3-SAT: A Discrete Geometric Approach to Phase Transitions and Algorithmic Complexity
by: Zhan, Yongjian
Published: (2026)
by: Zhan, Yongjian
Published: (2026)
Flip Distance of Triangulations of Convex Polygons / Rotation Distance of Binary Trees is NP-complete
by: Dorfer, Joseph
Published: (2026)
by: Dorfer, Joseph
Published: (2026)
Breadth-First Search Trees with Many or Few Leaves
by: Beisegel, Jesse, et al.
Published: (2026)
by: Beisegel, Jesse, et al.
Published: (2026)
On the parameterized complexity of Broadcast Independence and Broadcast Packing
by: Dumont, Joanne, et al.
Published: (2026)
by: Dumont, Joanne, et al.
Published: (2026)
One Color Makes All the Difference in the Tractability of Partial Coloring in Semi-Streaming
by: Das, Avinandan
Published: (2026)
by: Das, Avinandan
Published: (2026)
$O(n +f(k))$: Truly Linear FPT
by: Bumpus, Benjamin Merlin, et al.
Published: (2026)
by: Bumpus, Benjamin Merlin, et al.
Published: (2026)
Bipartite Exact Matching in P
by: Du, Yuefeng
Published: (2026)
by: Du, Yuefeng
Published: (2026)
Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
by: Fei, Yumou, et al.
Published: (2025)
by: Fei, Yumou, et al.
Published: (2025)
Relative-error unateness testing
by: Chen, Xi, et al.
Published: (2025)
by: Chen, Xi, et al.
Published: (2025)
Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms
by: Antoniadis, Antonios, et al.
Published: (2025)
by: Antoniadis, Antonios, et al.
Published: (2025)
Parameterised distance to local irregularity
by: Fioravantes, Foivos, et al.
Published: (2023)
by: Fioravantes, Foivos, et al.
Published: (2023)
Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration
by: Hirahara, Shuichi, et al.
Published: (2024)
by: Hirahara, Shuichi, et al.
Published: (2024)
On Approximate Reconfigurability of Label Cover
by: Ohsaka, Naoto
Published: (2023)
by: Ohsaka, Naoto
Published: (2023)
Counting Locally Optimal Tours in the TSP
by: Manthey, Bodo, et al.
Published: (2024)
by: Manthey, Bodo, et al.
Published: (2024)
Relative-error testing of conjunctions and decision lists
by: Chen, Xi, et al.
Published: (2025)
by: Chen, Xi, et al.
Published: (2025)
Placing Green Bridges Optimally, with a Multivariate Analysis
by: Fluschnik, Till, et al.
Published: (2021)
by: Fluschnik, Till, et al.
Published: (2021)
Relative-error monotonicity testing
by: Chen, Xi, et al.
Published: (2024)
by: Chen, Xi, et al.
Published: (2024)
Similar Items
-
Parameterized Complexity of Vehicle Routing
by: Döring, Michelle, et al.
Published: (2025) -
(Independent) Roman Domination Parameterized by Distance to Cluster
by: Ashok, Pradeesha, et al.
Published: (2024) -
Finding a Minimum Spanning Tree with a Small Non-Terminal Set
by: Hanaka, Tesshu, et al.
Published: (2023) -
The Parameterized Complexity of Vertex-Coloring Edge-Weighting
by: Aute, Shubhada, et al.
Published: (2026) -
Parameterized Complexity of Streaming Diameter and Connectivity Problems
by: Oostveen, Jelle J., et al.
Published: (2022)