The following pages link to Bruno Jartoux (Q2117343):
Displaying 12 items.
- A tight analysis of geometric local search (Q2117344) (← links)
- The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
- Shallow packings, semialgebraic set systems, macbeath regions, and polynomial partitioning (Q2415378) (← links)
- (Q4580113) (← links)
- On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs (Q5096590) (← links)
- (Q5115816) (← links)
- (Q6059949) (← links)
- The $\epsilon$-$t$-Net Problem (Q6504950) (← links)
- Counting Kernels in Directed Graphs with Arbitrary Orientations (Q6505442) (← links)
- Conflict-Free Colouring of Subsets (Q6506188) (← links)
- Counting kernels in directed graphs with arbitrary orientations (Q6559392) (← links)
- Conflict-free colouring of subsets (Q6624182) (← links)
