Results 61 to 70 of about 394,763 (294)
Structural Parameterizations of $k$-Planarity
Journal of Graph Algorithms and ApplicationsThe concept of $k$-planarity is extensively studied in the context of Beyond Planarity. A graph is $k$-planar if it admits a drawing in the plane in which each edge is crossed at most $k$ times.
Tatsuya Gima +2 more
doaj +1 more source
Diminishable parameterized problems and strict polynomial kernelization [PDF]
Conference on Computability in Europe, 2016 Kernelization – a mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems – plays a central role in parameterized complexity and has triggered an extensive line of research.
H. Fernau +5 more
semanticscholar +1 more source
Natural Frequencies of Levodopa‐Induced Dyskinesia in Parkinson's Disease
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objectives Abnormal involuntary movements, known as dyskinesias, are common complications of levodopa treatment in patients with Parkinson's disease and can significantly impair quality of life. The underlying pathophysiology remains unclear, and current therapeutic options are limited.
Ioannis U. Isaias +3 more
wiley +1 more source
On the kernelization complexity of string problems
Theoretical Computer Science, 2018 In Closest String problem we are given an alphabet Σ, a set of strings S = {s 1,s 2, …,s k } over Σ such that |s i | = n and an integer d. The objective is to check whether there exists a string s over Σ such that d H (s,s i ) ≤ d, i ∈ {1,…, k}, where d ...
Manu Basavaraju +4 more
semanticscholar +1 more source
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover [PDF]
Theory and Applications of Models of Computation, 2016 A 3-path vertex cover in a graph is a vertex subset $C$ such that every path of three vertices contains at least one vertex from $C$. The parameterized 3-path vertex cover problem asks whether a graph has a 3-path vertex cover of size at most $k$.
Mingyu Xiao, Shaowei Kou
semanticscholar +1 more source
Stage‐Dependent β‐Synuclein Links MRI and Cognitive Decline in Alzheimer's Disease
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Synaptic degeneration drives cognitive decline in Alzheimer's disease (AD), but synaptic biomarkers are scarce. Brain‐enriched β‐synuclein emerged as a synaptic damage marker. We investigated its diagnostic, prognostic, and structural correlates across the AD continuum.
Ulaş Ay +15 more
wiley +1 more source
Propagation via Kernelization: The Vertex Cover Constraint [PDF]
International Conference on Principles and Practice of Constraint Programming, 2016 The technique of kernelization consists in extracting, from an instance of a problem, an essentially equivalent instance whose size is bounded in a parameter \(k\). Besides being the basis for efficient parameterized algorithms, this method also provides
Clément Carbonnel, E. Hébrard
semanticscholar +1 more source
Advanced Engineering Materials, EarlyView.Predicting extreme defects in additive manufacturing remains a key challenge limiting its structural reliability. This study proposes a statistical framework that integrates Extreme Value Theory with advanced process indicators to explore defect–process relationships and improve the estimation of critical defect sizes. The approach provides a basis for
Muhammad Muteeb Butt +8 more
wiley +1 more source
Parameterized Algorithmics and Computational Experiments for Finding 2-Clubs
Journal of Graph Algorithms and Applications, 2015 Given an undirected graph G=(V,E) and an integer l ≥ 1, the NP-hard 2-CLUB problem asks for a vertex set S ⊆ V of size at least l such that the subgraph induced by S has diameter at most two.
Sepp Hartung +2 more
doaj +1 more source
J. Mach. Learn. Res., 2021 Accepted for presentation as an extended abstract at the Conference on Learning Theory (COLT) 2021, and published in the Journal of Machine Learning Research (JMLR ...
Raaz Dwivedi, Lester Mackey
openaire +4 more sources