Folgen
Andrej Sajenko
Andrej Sajenko
THM, University of Applied Sciences Mittelhessen, Germany
Bestätigte E-Mail-Adresse bei mni.thm.de
Titel
Zitiert von
Zitiert von
Jahr
Two moves per time step make a difference
T Erlebach, F Kammer, K Luo, A Sajenko, JT Spooner
46th International Colloquium on Automata, Languages, and Programming, ICALP …, 2019
242019
Multistage graph problems on a global budget
K Heeger, AS Himmel, F Kammer, R Niedermeier, M Renken, A Sajenko
Theoretical Computer Science 868, 46-64, 2021
162021
Simple 2^ f-color choice dictionaries
F Kammer, A Sajenko
29th International Symposium on Algorithms and Computation (ISAAC 2018), 2018
92018
Multistage problems on a global budget
K Heeger, A Himmel, F Kammer, R Niedermeier, M Renken, A Sajenko
CoRR. arXiv: abs/1912.0439 2, 2019
82019
Linear-time in-place DFS and BFS on the word RAM
F Kammer, A Sajenko
Algorithms and Complexity: 11th International Conference, CIAC 2019, Rome …, 2019
72019
Space-efficient vertex separators for treewidth
F Kammer, J Meintrup, A Sajenko
Algorithmica 84 (9), 2414-2461, 2022
42022
Space efficient (graph) algorithms
F Kammer, A Sajenko
42018
Linear-time in-place DFS and BFS in the restore model
F Kammer, A Sajenko
Computing Research Repository (CoRR), 2018
32018
FPT-space graph kernelizations
F Kammer, A Sajenko
CoRR, abs/2007.11643, 2020
22020
Extra space during initialization of succinct data structures and dynamical initializable arrays
F Kammer, A Sajenko
arXiv preprint arXiv:1803.09675, 2018
22018
Sorting and ranking of self-delimiting numbers with applications to tree isomorphism
F Kammer, J Meintrup, A Sajenko
International Workshop on Combinatorial Algorithms, 356-367, 2023
12023
Check for updates
F Kammer, J Meintrup, A Sajenko
Combinatorial Algorithms: 34th International Workshop, IWOCA 2023, Tainan …, 2023
2023
Space-Efficient Graph Kernelizations
F Kammer, A Sajenko
arXiv preprint arXiv:2007.11643, 2020
2020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–13