Faster algorithms on linear delta-matroids

DOI10.4230/LIPICS.STACS.2025.62MaRDI QIDQ7287801zbMATH OpenFDO

Authors Tomohiro Koana, Magnus Wahlström

Publication date 24 June 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2025.62

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A weighted linear matroid parity algorithm
• Algebraic algorithms for linear matroid parity problems
• Algebraic algorithms for matching and matroid problems
• Algorithmic applications of Baur-Strassen's theorem, shortest cycles, diameter, and matchings
• Algorithms for weighted matching generalizations. I: Bipartite graphs, b-matching, and unweighted f-factors
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Compression via Matroids
• Coverings and delta-coverings
• Delta-matroids for graph theorists
• Determinantal sieving
• Efficient computation of representative families with applications in parameterized and exact algorithms
• Even delta-matroids and the complexity of planar Boolean CSPs
• Fanout limitations on constraint systems
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• General factors of graphs
• Greedy algorithm and symmetric matroids
• scientific article; zbMATH DE number 3156382 (Why is no real title available?)
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• Kernelization. Theory of parameterized preprocessing
• Matching problems with delta-matroid constraints
• Matchings and \(\Delta\)-matroids
• Matroid matching and some applications
• Maximum matchings in general graphs through randomization
• Minor summation formula of pfaffians
• Modern computer algebra
• On Planar Boolean CSP
• Optimal general factor problem and jump system intersection
• Parameterized algorithms
• Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
• Representative set statements for delta-matroids and the Mader delta-matroid
• Representative sets and irrelevant vertices: new tools for kernelization
• The delta-sum of matching delta-matroids
• The linear delta-matroid parity problem

This page was built for publication: Faster algorithms on linear delta-matroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7287801)