The following pages link to Florian Jamain (Q307768):
Displaying 5 items.
- On the complexity of connection games (Q307770) (← links)
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels (Q1753501) (← links)
- Approximate Pareto sets of minimal size for multi-objective optimization problems (Q1785308) (← links)
- On the number of non-dominated points of a multicriteria optimization problem (Q2446874) (← links)
- Havannah and TwixT are PSPACE-complete (Q2947922) (← links)
