Arpad Rimmel

Available identifiers

Publication	Date of Publication	Type
On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts	2023-06-22	Paper
New lower bounds for Schur and weak Schur numbers	2021-12-06	Paper
The First Approximation Algorithm for the Maximin Latin Hypercube Design Problem	2020-10-05	Paper
Fixed-parameter tractability of counting small minimum \((S,T)\)-cuts	2020-02-24	Paper
Multiple canadians on the road: minimizing the distance competitive ratio	2019-12-13	Paper
On the parameterized complexity of separating certain sources from the target	2019-10-18	Paper
On the competitiveness of memoryless strategies for the \(k\)-Canadian traveller problem	2019-10-11	Paper
A lower bound for weak Schur numbers with a deterministic algorithm	2019-01-04	Paper
Bandits help simulated annealing to complete a maximin Latin hypercube design	2018-11-21	Paper
Completion of partial Latin hypercube designs: NP-completeness and inapproximability	2018-02-09	Paper
Biasing Monte-Carlo Simulations through RAVE Values	2011-02-11	Paper
Scalability and Parallelization of Monte-Carlo Tree Search	2011-02-11	Paper

This page was built for person: Arpad Rimmel