The following pages link to (Q4288579):
Displayed 12 items.
- Minimizing elimination tree height can increase fill more than linearly (Q671941) (← links)
- Separators and structure prediction in sparse orthogonal factorization (Q1361831) (← links)
- Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069) (← links)
- Algorithms for automatic ranking of participants and tasks in an anonymized contest (Q2272379) (← links)
- Minimum fill-in: inapproximability and almost tight lower bounds (Q2304536) (← links)
- Searching for better fill-in (Q2453556) (← links)
- Minimal elimination of planar graphs (Q5054857) (← links)
- (Q5126619) (← links)
- Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
- (Q5874487) (← links)
- On the ordering of sparse linear systems (Q5906733) (← links)
- Complexity classification of some edge modification problems (Q5948964) (← links)