Determinantal sieving
From MaRDI portal
Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)
Cites work
- \((k,n-k)\)-\textsc{Max-Cut}: an \(\mathcal{O}^*(2^p)\)-time algorithm and a polynomial kernel
- k-distinct in- and out-branchings in digraphs
- A faster parameterized algorithm for set packing
- A note on algebraic techniques for subgraph detection
- A parameterized view on matroid optimization problems
- A randomized algorithm for long directed cycle
- Abusing the Tutte matrix: an algebraic instance compression for the K-set-cycle problem
- An Improved Algorithm for Finding Cycles Through Elements
- Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space
- Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle
- Bipartite TSP in o(1.9999ⁿ) time, assuming quadratic time matrix multiplication
- Can you beat treewidth?
- Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and Turing kernels
- Clifford algebras meet tree decompositions
- Color-coding
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Constrained multilinear detection and generalized graph motifs
- Constrained multilinear detection for faster functional motif discovery
- Counting problems in parameterized complexity
- Determinant sums for undirected Hamiltonicity
- Determinantal sieving
- Determining a Minimum Spanning Tree with Disjunctive Constraints
- Deterministic truncation of linear matroids
- Directed Hamiltonicity and out-branchings via generalized Laplacians
- Diverse collections in matroids and graphs
- Diverse pairs of matchings
- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Edge-disjoint in- and out-branchings in tournaments and related path problems
- Editing to Connected F-Degree Graph
- Efficient computation of representative families with applications in parameterized and exact algorithms
- Engineering Motif Search for Large Graphs
- Everything you always wanted to know about the parameterized complexity of subgraph isomorphism (but were afraid to ask)
- Extensor-coding
- Fast exact algorithms for survivable network design with uniform requirements
- Fast Hamiltonicity checking via bases of perfect matchings
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast witness extraction using a decision oracle
- Faster Algebraic Algorithms for Path and Packing Problems
- Faster algorithms for finding and counting subgraphs
- Faster counting and sampling algorithms using colorful decision oracle
- Faster deterministic parameterized algorithm for k-path
- Finding even subgraphs even faster
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Fine-Grained Reductions from Approximate Counting to Decision
- Fixed-parameter tractability of maximum colored path and beyond
- Fourier meets M\"{o}bius: fast subset convolution
- FPT algorithms for connected feedback vertex set
- Graphs and geometry
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3698383 (Why is no real title available?)
- scientific article; zbMATH DE number 3561367 (Why is no real title available?)
- scientific article; zbMATH DE number 1764950 (Why is no real title available?)
- scientific article; zbMATH DE number 863490 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- scientific article; zbMATH DE number 6472651 (Why is no real title available?)
- K-distinct branchings admits a polynomial kernel
- Limits and Applications of Group Algebras for Parameterized Problems
- LIMITS and applications of group algebras for parameterized problems
- Linear representation of transversal matroids and gammoids parameterized by rank
- Matching is as easy as matrix inversion
- Matrices and matroids for systems analysis
- Matroid matching via mixed skew-symmetric matrices
- Modern computer algebra
- Narrow sieves for parameterized paths and packings
- On problems as hard as CNF-SAT
- Parameterized algorithms
- Parameterized algorithms for list \(K\)-cycle
- Parameterized algorithms for non-separating trees and branchings in digraphs
- Parameterized complexity of conflict-free matchings and paths
- Parameterized complexity of conflict-free set cover
- Parameterized complexity of Eulerian deletion problems
- Parameterized complexity of even/odd subgraph problems
- Parameterized pre-coloring extension and list coloring problems
- Paths, trees and matchings under disjunctive constraints
- Proportionally Fair Matching with Multiple Groups
- Quasipolynomial representation of transversal matroids with applications in parameterized complexity
- Randomized divide-and-conquer: improved path, matching, and packing algorithms
- Representative families of product families
- Representative sets and irrelevant vertices: new tools for kernelization
- Rural postman parameterized by the number of components of required edges
- Shortest two disjoint paths in polynomial time
- Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- The Factorization of Linear Graphs
- The minimum spanning strong subdigraph problem is fixed parameter tractable
- The NP-Completeness of Edge-Coloring
- The parameterized complexity of the survivable network design problem
This page was built for publication: Determinantal sieving
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912580)
