Almost consistent systems of linear equations
From MaRDI portal
Cites work
- 0/1/all CSPs, half-integral A-path packing, and linear-time FPT algorithms
- Almost consistent systems of linear equations
- An improved parameterized algorithm for the minimum node multiway cut problem
- Arithmetical rings
- Biased graphs. I: Bias, balance, and gains
- Building tractable disjunctive constraints
- Candidate hard unique game
- Classifying problems on linear congruences and Abelian permutation groups using logspace counting classes
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Constant ratio fixed-parameter approximation of the edge multicut problem
- Designing FPT algorithms for cut problems using randomized contractions
- Directed subset feedback vertex set is fixed-parameter tractable
- Disjunctions, independence, refinements
- Edge bipartization faster than \(2^k\)
- Faster parameterized algorithms using linear programming
- Finding odd cycle transversals.
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- Flow-augmentation. III: Complexity dichotomy for Boolean CSPs parameterized by the number of unsatisfied constraints
- FPT algorithms for path-transversal and cycle-transversal problems
- Half-integrality, LP-branching, and FPT algorithms
- Helly dimension of algebraic groups
- Helly-type problems
- How ordinary elimination became Gaussian elimination
- scientific article; zbMATH DE number 3860390 (Why is no real title available?)
- scientific article; zbMATH DE number 5152049 (Why is no real title available?)
- scientific article; zbMATH DE number 3743408 (Why is no real title available?)
- scientific article; zbMATH DE number 7650225 (Why is no real title available?)
- LP-branching algorithms based on biased graphs
- Multicut Is FPT
- On group feedback vertex set parameterized by the size of the cutset
- On multiway cut parameterized above lower bounds
- On the parameterized complexity of multiple-interval graph problems
- On the power of unique 2-prover 1-round games
- On Weighted Graph Separation Problems and Flow Augmentation
- Parameterized algorithms
- Parameterized complexity classification for interval constraints
- Parameterized complexity of equality MinCSP
- Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\)
- Parameterized graph separation problems
- Parameterized tractability of multiway cut with parity constraints
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
- Rings with linearly ordered right annihilators
- Rings, modules, and closure operations
- Simple and improved parameterized algorithms for multiterminal cuts
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes
- Solving hard cut problems via flow-augmentation
- Solving systems of linear equations over polynomials
- Some optimal inapproximability results
- Typical separating invariants
- Untersuchungen über Teilbarkeitseigenschaften in Körpern.
- Wedderburn's Theorem and a Theorem of Jacobson
This page was built for publication: Almost consistent systems of linear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907342)
