Lattice structure and efficient basis construction for strongly connected orientations

DOI10.1007/978-3-032-28691-8_14MaRDI QIDQ7349457zbMATH OpenFDO

Authors S. Y. Liu, Olha Silina

Publication date 16 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-28691-8_14

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Cites work

• A counterexample to a conjecture of Edmonds and Giles
• A Minimax Theorem for Directed Graphs
• A strongly polynomial algorithm for bimodular integer linear programming
• Approximately packing dijoins via nowhere-zero flows
• Birkhoff-von Neumann graphs that are PM-compact
• Brick decompositions and the matching rank of graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Congruency-constrained TU problems beyond the bimodular case
• Connections in combinatorial optimization
• Dyadic packing of dijoins
• Ear decompositions of matching covered graphs
• Exact matching: correct parity and FPT parameterized by independence number
• How to build a brick
• scientific article; zbMATH DE number 3910407 (Why is no real title available?)
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• scientific article; zbMATH DE number 3604926 (Why is no real title available?)
• Integer and Fractional Matchings
• Matching is as easy as matrix inversion
• Matching structure and the matching lattice
• Matching theory
• Matching theory
• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
• On a conjecture of Lovász concerning bricks. II: Bricks of finite characteristic
• On Packing Dijoins in Digraphs and Weighted Digraphs
• On the congruency-constrained matroid base
• Optimal ear decompositions of matching covered graphs and bases for the matching lattice
• Perfect matchings. A theory of matching covered graphs (to appear)
• Permanents, Pfaffian orientations, and even directed circuits
• Pólya's permanent problem
• Sensitivity, proximity and FPT algorithms for exact matroid problems
• Strongly connected orientations and integer lattices
• Submodular minimization under congruency constraints
• The complexity of facets (and some facets of complexity)
• The Factorization of Locally Finite Graphs
• The perfect matching polytope and solid bricks
• Total dual integrality implies local strong unimodularity

This page was built for publication: Lattice structure and efficient basis construction for strongly connected orientations

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