Janosch Fuchs

Philip Whittington

Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

The Complexity of Online Graph Games.

[BibT_eX]

[DOI]

Christoph Grüne

Tom Janßen

Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023

The Complexity of Graph Exploration Games.

[BibT_eX]

[DOI]

Christoph Grüne

Tom Janßen

CoRR, 2023

2022

Graph exploration with advice and online crossing minimization.

[BibT_eX]

[DOI]

PhD thesis, 2022

Exploring sparse graphs with advice.

[BibT_eX]

[DOI]

Inf. Comput., 2022

The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs.

[BibT_eX]

[DOI]

Elisabet Burjons

Henri Lotze

Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2020

Waiting for Trains: Complexity Results.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019

The Complexity of Packing Edge-Disjoint Paths.

[BibT_eX]

[DOI]

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018

Online Matching in Regular Bipartite Graphs.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2018

The Graph Exploration Problem with Advice.

[BibT_eX]

[DOI]

CoRR, 2018

Exploring Sparse Graphs with Advice (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

2016

Online Exploration of Rectangular Grids.

[BibT_eX]

[DOI]

Ulla Karhumäki