The following pages link to Michael T. Hallett (Q1575710):
Displaying 19 items.
- The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs (Q1575712) (← links)
- (Q2464324) (redirect page) (← links)
- A faster FPT algorithm for the maximum agreement forest problem (Q2464325) (← links)
- A fixed-parameter approach to 2-layer planarization (Q2498928) (← links)
- Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract) (Q2817636) (← links)
- Absoluteness and the Skolem Paradox (Q2909756) (← links)
- (Q3043700) (← links)
- (Q3526581) (← links)
- (Q3803101) (← links)
- Towards a Theory of Mathematical Research Programmes (I) (Q3879203) (← links)
- Towards a Theory of Mathematical Research Programmes (II) (Q3879204) (← links)
- (Q4249534) (← links)
- (Q4252027) (← links)
- (Q4324697) (← links)
- (Q4472468) (← links)
- (Q4501141) (← links)
- (Q4796197) (← links)
- Analogs & duals of the MAST problem for sequences & trees (Q4820910) (← links)
- Frege on Creation (Q5116960) (← links)
