default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJanosch Fuchs
Person information
- affiliation: RWTH Aachen University, Aachen, Germany
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Janosch Fuchs
, Christoph Grüne, Tom Janßen:
The Complexity of Online Graph Games. SOFSEM 2024: 269-282- [c6]Janosch Fuchs, Philip Whittington:
The 2-Attractor Problem Is NP-Complete. STACS 2024: 35:1-35:13 - 2023
- [i7]Janosch Fuchs, Christoph Grüne, Tom Janßen:
The Complexity of Graph Exploration Games. CoRR abs/2302.08420 (2023) - [i6]Janosch Fuchs, Philip Whittington:
The 2-Attractor Problem is NP-Complete. CoRR abs/2304.06523 (2023) - 2022
- [b1]Janosch Fuchs:
Graph exploration with advice and online crossing minimization. RWTH Aachen University, Germany, 2022 - [j2]Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger:
Exploring sparse graphs with advice. Inf. Comput. 289(Part): 104950 (2022) - [c5]Elisabet Burjons, Janosch Fuchs, Henri Lotze:
The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs. IWOCA 2022: 243-256 - [i5]Elisabet Burjons, Janosch Fuchs, Henri Lotze:
The Slotted Online One-Sided Crossing Minimization Problem on 2-Regular Graphs. CoRR abs/2201.04061 (2022) - [i4]Janosch Fuchs, Christoph Grüne, Tom Janßen:
The Complexity of Online Graph Games. CoRR abs/2210.01694 (2022) - 2020
- [c4]Bjoern Tauer, Dennis Fischer, Janosch Fuchs, Laura Vargas Koch, Stephan Zieger:
Waiting for Trains: Complexity Results. CALDAM 2020: 282-303
2010 – 2019
- 2019
- [c3]Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang:
The Complexity of Packing Edge-Disjoint Paths. IPEC 2019: 10:1-10:16 - [i3]Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang:
The Complexity of Packing Edge-Disjoint Paths. CoRR abs/1910.00440 (2019) - 2018
- [j1]Lali Barrière, Xavier Muñoz, Janosch Fuchs, Walter Unger:
Online Matching in Regular Bipartite Graphs. Parallel Process. Lett. 28(2): 1850008:1-1850008:13 (2018) - [c2]Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger:
Exploring Sparse Graphs with Advice (Extended Abstract). WAOA 2018: 102-117 - [i2]Hans-Joachim Böckenhauer, Janosch Fuchs, Walter Unger:
The Graph Exploration Problem with Advice. CoRR abs/1804.06675 (2018) - 2016
- [i1]Hans-Joachim Böckenhauer, Janosch Fuchs, Ulla Karhumäki, Walter Unger:
Online Exploration of Rectangular Grids. CoRR abs/1611.00934 (2016) - 2015
- [c1]Sascha Geulen, Martina Josevski, Johanna Nellen, Janosch Fuchs, Lukas Netz, Benedikt Wolters, Dirk Abel, Erika Ábrahám, Walter Unger:
Learning-based control strategies for hybrid electric vehicles. CCA 2015: 1722-1728
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
