Volkmar Sauerland

According to our database, Volkmar Sauerland authored at least 7 papers between 2007 and 2020.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2020

The Exact Query Complexity of Yes-No Permutation Mastermind.

Mourad El Ouali, Volkmar Sauerland

Games, 2020

2018

On the Query Complexity of Black-Peg AB-Mastermind.

Mourad El Ouali, Christian Glazik, Volkmar Sauerland, Anand Srivastav

Games, 2018

2015

Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection.

Andreas Baltz, Mourad El Ouali, Gerold Jäger, Volkmar Sauerland, Anand Srivastav

J. Oper. Res. Soc., 2015

2013

A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions.

Lasse Kliemann, Ole Kliemann, Chellapilla Patvardhan, Volkmar Sauerland, Anand Srivastav

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation.

Mourad El Ouali, Volkmar Sauerland

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

2012

Algorithm Engineering for some Complex Practise Problems: Exact Algorithms, Heuristics and Hybrid Evolutionary Algorithms.

Volkmar Sauerland

PhD thesis, 2012

2007

Fixed-point-coefficient FIR filters and filter banks: Improved design by randomized quantizations.

Ulrich Heute, Anand Srivastav, Volkmar Sauerland, Jörg Kliewer

Proceedings of the 9th International Symposium on Signal Processing and Its Applications, 2007