Skip to Main content Skip to Navigation
New interface

hal-02105265v1  Conference papers
Pierre BergéBenjamin MouscadetArpad RimmelJoanna Tomasik. Fixed-parameter tractability of counting small minimum (S,T)-cuts
45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Jun 2019, Vall de Núria, Spain
hal-02022459v1  Conference papers
Pierre BergéJulien HemeryArpad RimmelJoanna Tomasik. On the competitiveness of memoryless strategies for the $k$-Canadian Traveller Problem
International Conference Combinatorial Optimization and Applications (COCOA), Dec 2018, Atlanta, United States
hal-01308582v1  Conference papers
Pierre BergéArpad RimmelKaourintin Le GuibanJoanna Tomasik. Search space exploration and an optimization criterion for hard design problems
Genetic and Evolutionary Computation Conference (ACM GECCO), ACM, Jul 2016, Denver, United States
hal-01896511v1  Conference papers
Pierre BergéJulien HemeryArpad RimmelJoanna Tomasik. The Competitiveness of Randomized Strategies for Canadians via Systems of Linear Inequalities
International Symposium on Computer and Information Sciences, Sep 2018, Poznan, Poland