Pattern-Sparse Tree Decompositions in $H$-Minor-Free Graphs
arXiv:2603.29825v1 Announce Type: new Abstract: Given an $H$-minor-free graph $G$ and an integer $k$, our main technical contribution is sampling in randomized polynomial time an induced subgraph $G'$ of $G$ and a tree decomposition of $G'$ of width $\widetilde{O}(k)$ such that for every $Z\subseteq V(G)$ of size $k$, with probability at least $\left(2^{\widetilde{O}(\sqrt{k})}|V(G)|^{O(1)}\right)^{-1}$, we have $Z \subseteq V(G')$ and every bag of the tree decomposition contains at most $\widetilde{O}(\sqrt{k})$ vertices of $Z$. Having such a tree decomposition allows us to solve a wide range of problems in (randomized) time $2^{\widetilde{O}(\sqrt{k})}n^{O(1)}$ where the solution is a pattern $Z$ of size $k$, e.g., Directed $k$-Path, $H$-Packing, etc. In particular, our result recovers a
View PDF HTML (experimental)
Abstract:Given an $H$-minor-free graph $G$ and an integer $k$, our main technical contribution is sampling in randomized polynomial time an induced subgraph $G'$ of $G$ and a tree decomposition of $G'$ of width $\widetilde{O}(k)$ such that for every $Z\subseteq V(G)$ of size $k$, with probability at least $\left(2^{\widetilde{O}(\sqrt{k})}|V(G)|^{O(1)}\right)^{-1}$, we have $Z \subseteq V(G')$ and every bag of the tree decomposition contains at most $\widetilde{O}(\sqrt{k})$ vertices of $Z$. Having such a tree decomposition allows us to solve a wide range of problems in (randomized) time $2^{\widetilde{O}(\sqrt{k})}n^{O(1)}$ where the solution is a pattern $Z$ of size $k$, e.g., Directed $k$-Path, $H$-Packing, etc. In particular, our result recovers all the algorithmic applications of the pattern-covering result of Fomin et al. [SIAM J. Computing 2022] (which requires the pattern to be connected) and the planar subgraph-finding algorithms of Nederlof [STOC 2020]. Furthermore, for $K_{h,3}$-free graphs (which include bounded-genus graphs) and for a fixed constant $d$, we signficantly strengthen the result by ensuring that not only $Z$ has intersection $\widetilde{O}(\sqrt{k})$ with each bag, but even the distance-$d$ neighborhood $N^d_{G}[Z]$ as well. This extension makes it possible to handle a wider range of problems where the neighborhood of the pattern also plays a role in the solution, such as partial domination problems and problems involving distance constraints.
Comments: full version of a STOC 2026 paper
Subjects:
Data Structures and Algorithms (cs.DS); Discrete Mathematics (cs.DM)
Cite as: arXiv:2603.29825 [cs.DS]
(or arXiv:2603.29825v1 [cs.DS] for this version)
https://doi.org/10.48550/arXiv.2603.29825
arXiv-issued DOI via DataCite (pending registration)
Submission history
From: Marcin Pilipczuk [view email] [v1] Tue, 31 Mar 2026 14:47:30 UTC (93 KB)
Sign in to highlight and annotate this article
Conversation starters
Daily AI Digest
Get the top 5 AI stories delivered to your inbox every morning.
More about
announceapplicationarxiv
Interview-Informed Generative Agents for Product Discovery: A Validation Study
arXiv:2603.29890v1 Announce Type: new Abstract: Large language models (LLMs) have shown strong performance on standardized social science instruments, but their value for product discovery remains unclear. We investigate whether interview-informed generative agents can simulate user responses in concept testing scenarios. Using in-depth workflow interviews with knowledge workers, we created personalized agents and compared their evaluations of novel AI concepts against the same participants' responses. Our results show that agents are distribution-calibrated but identity-imprecise: they fail to replicate the specific individual they are grounded in, yet approximate population-level response distributions. These findings highlight both the potential and the limits of LLM simulation in desig
Beyond Legacy OFDM: A Mobility-Adaptive Multi-Gear Framework for 6G
arXiv:2603.29721v1 Announce Type: new Abstract: While Third Generation Partnership Project (3GPP) has confirmed orthogonal frequency division multiplexing (OFDM) as the baseline waveform for sixth-generation (6G), its performance is severely compromised in the high-mobility scenarios envisioned for 6G. Building upon the GEARBOX-PHY vision, we present gear-switching OFDM (GS-OFDM): a unified framework in which the base station (BS) adaptively selects among three gears, ranging from legacy OFDM to delay-Doppler domain processing based on the channel mobility conditions experienced by the user equipments (UEs). We illustrate the benefit of adaptive gear switching for communication throughput and, finally, we conclude with an outlook on research challenges and opportunities.
SkillReducer: Optimizing LLM Agent Skills for Token Efficiency
arXiv:2603.29919v1 Announce Type: new Abstract: LLM-based coding agents rely on \emph{skills}, pre-packaged instruction sets that extend agent capabilities, yet every token of skill content injected into the context window incurs both monetary cost and attention dilution. To understand the severity of this problem, we conduct a large-scale empirical study of 55,315 publicly available skills and find systemic inefficiencies: 26.4\% lack routing descriptions entirely, over 60\% of body content is non-actionable, and reference files can inject tens of thousands of tokens per invocation. Motivated by these findings, we present \textsc{SkillReducer}, a two-stage optimization framework. Stage~1 optimizes the routing layer by compressing verbose descriptions and generating missing ones via advers
Knowledge Map
Connected Articles — Knowledge Graph
This article is connected to other articles through shared AI topics and tags.
More in Products
Machine Learning in the Wild: Early Evidence of Non-Compliant ML-Automation in Open-Source Software
arXiv:2603.29698v1 Announce Type: new Abstract: The increasing availability of Machine Learning (ML) models, particularly foundation models, enables their use across a range of downstream applications, from scenarios with missing data to safety-critical contexts. This, in principle, may contravene not only the models' terms of use, but also governmental principles and regulations. This paper presents a preliminary investigation into the use of ML models by 173 open-source projects on GitHub, spanning 16 application domains. We evaluate whether models are used to make decisions, the scope of these decisions, and whether any post-processing measures are taken to reduce the risks inherent in fully autonomous systems. Lastly, we investigate the models' compliance with established terms of use.
Deep Learning-Assisted Improved Differential Fault Attacks on Lightweight Stream Ciphers
arXiv:2603.29382v1 Announce Type: new Abstract: Lightweight cryptographic primitives are widely deployed in resource-constraint environment, particularly in the Internet of Things (IoT) devices. Due to their public accessibility, these devices are vulnerable to physical attacks, especially fault attacks. Recently, deep learning-based cryptanalytic techniques have demonstrated promising results; however, their application to fault attacks remains limited, particularly for stream ciphers. In this work, we investigate the feasibility of deep learning assisted differential fault attack on three lightweight stream ciphers, namely ACORNv3, MORUSv2 and ATOM, under a relaxed fault model, where a single-bit bit-flipping fault is injected at an unknown location. We train multilayer perceptron (MLP)
Uncovering Relationships between Android Developers, User Privacy, and Developer Willingness to Reduce Fingerprinting Risks
arXiv:2603.29063v1 Announce Type: new Abstract: The major mobile platforms, Android and iOS, have introduced changes that restrict user tracking to improve user privacy, yet apps continue to covertly track users via device fingerprinting. We study the opportunity to improve this dynamic with a case study on mobile fingerprinting that evaluates developers' perceptions of how well platforms protect user privacy and how developers perceive platform privacy interventions. Specifically, we study developers' willingness to make changes to protect users from fingerprinting and how developers consider trade-offs between user privacy and developer effort. We do this via a survey of 246 Android developers, presented with a hypothetical Android change that protects users from fingerprinting at the co
Speeding-up Graph Algorithms via Clique Partitioning
arXiv:2502.02477v3 Announce Type: replace Abstract: Reducing the running time of graph algorithms is vital for tackling real-world problems such as shortest paths and matching in large-scale graphs, where path information plays a crucial role. To address this critical challenge, this paper introduces a graph restructuring algorithm that identifies bipartite cliques and replaces them with tripartite graphs. This restructuring leads to fewer edges while preserving complete graph path information, enabling the direct application of algorithms like matching and all-pairs shortest paths to achieve significant runtime reductions, especially for large, dense graphs. The running time of the proposed algorithm for a graph $G(V,E)$, with $|V| = n$ and $|E| = m$ is~$O(mn^\delta)$, which is better tha
Discussion
Sign in to join the discussion
No comments yet — be the first to share your thoughts!