The following pages link to (Q3682487):
Displaying 17 items.
- Spanning trees of 3-uniform hypergraphs (Q720597) (← links)
- Bidirectional retracting-free double tracings and upper embeddability of graphs (Q751672) (← links)
- An augmenting path algorithm for linear matroid parity (Q1087880) (← links)
- On-line updating of solutions to a class of matroid intersection problems (Q1090461) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- Local search for the minimum label spanning tree problem with bounded color classes. (Q1811627) (← links)
- Faster deterministic \textsc{Feedback Vertex Set} (Q2015151) (← links)
- Exact and approximation algorithms for weighted matroid intersection (Q2316615) (← links)
- Algebraic algorithms for linear matroid parity problems (Q2799476) (← links)
- A Fast, Simpler Algorithm for the Matroid Parity Problem (Q3503851) (← links)
- On Finding Hamiltonian Cycles in Barnette Graphs (Q5880941) (← links)
- An orientation theorem with parity conditions (Q5954236) (← links)
- 1.61-approximation for min-power strong connectivity with two power levels (Q5963620) (← links)
- On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition (Q6098462) (← links)
- Fully Dynamic Transitive Closure in plane dags with one source and one sink (Q6102301) (← links)
- An improved algorithm for finding maximum outerplanar subgraphs (Q6184327) (← links)
- Graph ear decompositions and graph embeddings (Q6184633) (← links)
