scientific article; zbMATH DE number 7376001
From MaRDI portal
Publication:5002753
DOI10.4230/LIPIcs.ICALP.2018.74zbMath1499.68368MaRDI QIDQ5002753
Rohit Gurjar, Nisheeth K. Vishnoi, Thomas Thierauf
Publication date: 28 July 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial aspects of matroids and geometric lattices (05B35)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial bound on the number of light cycles in an undirected graph
- Nonlinear discrete optimization. An algorithmic theory
- Matching is as easy as matrix inversion
- Decomposition of regular matroids
- Matching and multidimensional matching in chordal and strongly chordal graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Deterministically isolating a perfect matching in bipartite planar graphs
- Directed Planar Reachability Is in Unambiguous Log-Space
- Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
- The Polynomially Bounded Perfect Matching Problem Is in NC 2
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- The number of shortest cycles and the chromatic uniqueness of a graph
- Randomized Parallel Algorithms for Matroid Union and Intersection, with Applications to Arborescences and Edge-Disjoint Spanning Trees
- Making Nondeterminism Unambiguous
- Linear matroid intersection is in quasi-NC
- Shortest Two Disjoint Paths in Polynomial Time
- Entropy, optimization and counting
- Bipartite perfect matching is in quasi-NC
This page was built for publication:
