scientific article; zbMATH DE number 7359369
From MaRDI portal
Publication:4993296
DOI10.4230/LIPIcs.ITCS.2018.32zbMath1462.68081MaRDI QIDQ4993296
Saket Saurabh, Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Meirav Zehavi
Publication date: 15 June 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (2)
FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective ⋮ Finding temporal paths under waiting time constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Constrained multilinear detection and generalized graph motifs
- Deterministic parameterized algorithms for the graph motif problem
- Constrained multilinear detection for faster functional motif discovery
- A parameterized view on matroid optimization problems
- Matching is as easy as matrix inversion
- A probabilistic remark on algebraic program testing
- Finding and counting vertex-colored subtrees
- Algorithms for topology-free and alignment network queries
- Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
- Deterministic Algorithms for Matching and Packing Problems Based on Representative Sets
- Deterministic Truncation of Linear Matroids
- Powers of tensors and fast matrix multiplication
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Parameterized Algorithms for List K-Cycle
- Linear matroid intersection is in quasi-NC
- Bipartite Perfect Matching in Pseudo-Deterministic NC
- Bipartite perfect matching is in quasi-NC
- Linear representation of transversal matroids and gammoids parameterized by rank
This page was built for publication:
