The following pages link to Joanna Tomasik (Q683749):
Displayed 11 items.
- Completion of partial Latin hypercube designs: NP-completeness and inapproximability (Q683750) (← links)
- Bandits help simulated annealing to complete a maximin Latin hypercube design (Q1626742) (← links)
- A lower bound for weak Schur numbers with a deterministic algorithm (Q1757462) (← links)
- Multiple canadians on the road: minimizing the distance competitive ratio (Q2279750) (← links)
- Fixed-parameter tractability of counting small minimum \((S,T)\)-cuts (Q2301536) (← links)
- On the competitiveness of memoryless strategies for the \(k\)-Canadian traveller problem (Q2327138) (← links)
- On the parameterized complexity of separating certain sources from the target (Q2330108) (← links)
- (Q4630433) (← links)
- The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem (Q4969322) (← links)
- On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts (Q6157971) (← links)
- New lower bounds for Schur and weak Schur numbers (Q6384945) (← links)