Janosch Fuchs

Orcid: 0000-0003-3993-222X

Affiliations:
  • RWTH Aachen University, Aachen, Germany


According to our database1, Janosch Fuchs authored at least 13 papers between 2015 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The 2-Attractor Problem Is NP-Complete.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

The Complexity of Online Graph Games.
Proceedings of the SOFSEM 2024: Theory and Practice of Computer Science, 2024

2023
The Complexity of Graph Exploration Games.
CoRR, 2023

2022
Graph exploration with advice and online crossing minimization.
PhD thesis, 2022

Exploring sparse graphs with advice.
Inf. Comput., 2022

The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

2020
Waiting for Trains: Complexity Results.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019
The Complexity of Packing Edge-Disjoint Paths.
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018
Online Matching in Regular Bipartite Graphs.
Parallel Process. Lett., 2018

The Graph Exploration Problem with Advice.
CoRR, 2018

Exploring Sparse Graphs with Advice (Extended Abstract).
Proceedings of the Approximation and Online Algorithms - 16th International Workshop, 2018

2016
Online Exploration of Rectangular Grids.
CoRR, 2016

2015
Learning-based control strategies for hybrid electric vehicles.
Proceedings of the 2015 IEEE Conference on Control Applications, 2015


  Loading...