Volkmar Sauerland

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

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
The Exact Query Complexity of Yes-No Permutation Mastermind.
Games, 2020

2018
On the Query Complexity of Black-Peg AB-Mastermind.
Games, 2018

2015
Exact and heuristic algorithms for the Travelling Salesman Problem with Multiple Time Windows and Hotel Selection.
J. Oper. Res. Soc., 2015

2013
A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

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

2007
Fixed-point-coefficient FIR filters and filter banks: Improved design by randomized quantizations.
Proceedings of the 9th International Symposium on Signal Processing and Its Applications, 2007


  Loading...