3 citations · 3 across the 6 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
Note on Long Paths in Eulerian Digraphs
Charlotte Knierim, Maxime Larcher, Anders Martinsson
Long Paths and Cycles in eulerian digraphs have gotten a lot of attention recently. In this short note, we show how to use methods from Knierim, Larcher, Martinsson, Noever (2021)…
math.CO2021
Solving Static Permutation Mastermind using Queries
Maxime Larcher, Anders Martinsson, Angelika Steger
Permutation Mastermind is a version of the classical mastermind game in which the number of positions is equal to the number of colors , and repetition of colors is not allo…