No article text was recorded for this version.
exponential parameter scaling
Version 1 of 1301 papers313 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Identification, location-domination and metric dimension on interval and permutation graphs
- Blog: Improved non-adaptive algorithms for threshold group testing with a gap
- Blog: Chain minors are FPT
- Blog: Explaining k-Nearest Neighbors: Abductive and Counterfactual Explanations
- Blog: Fixed parameter complexity of distance constrained labeling and uniform channel assignment problems
- Blog: Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
- Blog: A new quantum algorithm for the hidden shift problem in $\mathbb{Z}_{2^t}^n$
- Blog: Coresets for Robust Clustering via Black-box Reductions to Vanilla Case
- Blog: Fixed-Parameter Tractability of Directed Multiway Cut Parameterized by the Size of the Cutset
- Blog: Tight FPT Approximation for Constrained k-Center and k-Supplier
- Blog: On the Fixed-Parameter Tractability of Capacitated Clustering
- Blog: Solving MAX-2-SAT Above a Tight Lower Bound
- Blog: Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms
- Blog: Parallel Planar Subgraph Isomorphism and Vertex Connectivity
- Blog: Escaping from Moderately Constrained Saddles
- Blog: Distributed Hierarchical Control for State Estimation With Robotic Sensor Networks
- Blog: Non-stationary Bandits and Meta-Learning with a Small Set of Optimal Arms
- Blog: Approximating the MaxCover Problem with Bounded Frequencies in FPT Time
- Blog: BNN-DP: Robustness Certification of Bayesian Neural Networks via Dynamic Programming
- Blog: Algorithms for Finding Small Attractors in Boolean Networks
- Blog: An Improved FPT Algorithm for the Flip Distance Problem
- Blog: Spectrum Alignment: Efficient Resequencing by Hybridization
- Blog: When Can We Solve the Weighted Low Rank Approximation Problem in Truly Subquadratic Time?
- Blog: Satisfiability of Ordering CSPs above Average is Fixed-Parameter Tractable
- Blog: Fixed-Parameter Tractable Submodular Maximization over a Matroid
- Blog: On Flipping Edge Sets in Unique Sink Orientations
- Blog: Robust Fitting in Computer Vision: Easy or Hard?
- Blog: The Parameterized Complexity of Global Constraints
- Blog: Representative Families: A Unified Tradeoff-Based Approach
- Blog: FPT approximation for capacitated sum of radii
- Blog: Efficient Truncated Linear Regression with Unknown Noise Variance
- Blog: Parameterized Approximation Schemes for Fair-Range Clustering
- Blog: An improved cutting plane method for convex optimization, convex-concave games, and its applications
- Blog: An Efficient Benders Decomposition Approach for Optimal Large-Scale Network Slicing
- Blog: Nearly Optimal Algorithms for Contextual Dueling Bandits from Adversarial Feedback
- Blog: Balanced Independent and Dominating Sets on Colored Interval Graphs
- Blog: Conformal Prediction in Hierarchical Classification with Constrained Representation Complexity
- Blog: Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
- Blog: On Maximization of Weakly Modular Functions: Guarantees of Multi-stage Algorithms, Tractability, and Hardness
- Blog: Fixed-Parameter Tractable Reductions to SAT
- Blog: Adaptive Manipulation for Coalitions in Knockout Tournaments
- Blog: Better algorithms for satisfiability problems for formulas of bounded rank-width
- Blog: Streaming PTAS for Binary $\ell_0$-Low Rank Approximation
- Blog: Distance constrained labeling on graphs with bounded neighborhood diversity
- Blog: Finding Points in General Position
- Blog: FPRAS for the Potts Model and the Number of $k$-colorings
- Blog: Some Probabilistic Results on Width Measures of Graphs
- Blog: Improved smoothed analysis of the k-means method
- Blog: Robust Fitting in Computer Vision: Easy or Hard?
- Blog: Simultaneous Feedback Edge Set: A Parameterized Perspective
- Blog: Removing Connected Obstacles in the Plane is FPT
- Blog: Model Counting for Formulas of Bounded Clique-Width
- Blog: FPT Approximation Schemes for Maximizing Submodular Functions
- Blog: Learning Small Decision Trees with Large Domain
- Blog: Minimization of Gini impurity via connections with the k-means problem
- Blog: Value of Information Lattice: Exploiting Probabilistic Independence for Effective Feature Subset Acquisition
- Blog: Clustering is difficult only when it does not matter
- Blog: Spreadsheet table transformations from examples
- Blog: A State-Space Acyclicity Property for Exponentially Tighter Plan Length Bounds
- Blog: Proximal-Proximal-Gradient Method
Showing 60 of 301 papers.
History & citation
Current · Permanent link
- Parameterized Approximation Schemes for Constrained Clustering merged into this direction (65% overlap)
- Practical Efficiency of Fixed Parameter Tractable Algorithms merged into this direction (82% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_exponential_parameter_scaling_56c93ddf,
title = {exponential parameter scaling},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/exponential-parameter-scaling/rdr_56c93ddf348742e78786e17f505c2341},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_exponential_parameter_scaling_56c93ddf_v1,
title = {exponential parameter scaling},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/exponential-parameter-scaling/rdr_56c93ddf348742e78786e17f505c2341/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}