Jan Schiemann

According to our database, Jan Schiemann authored at least 7 papers between 2016 and 2023.

Collaborative distances:

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

2023

A One Pass Streaming Algorithm for Finding Euler Tours.

Christian Glazik, Jan Schiemann, Anand Srivastav

Theory Comput. Syst., August, 2023

2022

Algorithms for Big Data Problems in de Novo Genome Assembly.

Anand Srivastav, Axel Wedemeyer, Christian Schielke, Jan Schiemann

Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

2021

On Euler Tours in Streaming Models and some Games on Graphs

Jan Schiemann

PhD thesis, 2021

Bounds for the Static Permutation Mastermind game.

Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav

Discret. Math., 2021

2017

Finding Euler Tours in One Pass in the W-Streaming Model with O(n log(n)) RAM.

Christian Glazik, Jan Schiemann, Anand Srivastav

CoRR, 2017

Bounds for Static Black-Peg AB Mastermind.

Christian Glazik, Gerold Jäger, Jan Schiemann, Anand Srivastav

Proceedings of the Combinatorial Optimization and Applications, 2017

2016

Finding Euler Tours in the StrSort Model.

Lasse Kliemann, Jan Schiemann, Anand Srivastav

CoRR, 2016