default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohannes Blum 0001
Person information
- affiliation: University of Konstanz, Germany
Other persons with the same name
- Johannes Blum 0002
![[0000-0003-1368-1573]](https://dblp.org/img/orcid-mark.12x12.png "0000-0003-1368-1573")
— University of Freiburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[b1]Johannes Blum:
A Parameterized View on Transportation Networks : Algorithms, Hierarchy, and Complexity. University of Konstanz, Germany, 2023- [c11]Johannes Blum, Ruoying Li, Sabine Storandt:
Convexity Hierarchies in Grid Networks. ICAPS 2023: 52-60 - 2022
- [j5]Johannes Blum, Ruoying Li, Sabine Storandt:
Fission: Practical algorithms for computing minimum balanced node separators. Discret. Math. Algorithms Appl. 14(8): 2250048:1-2250048:26 (2022) - [j4]Johannes Blum:
W[1]-hardness of the k-center problem parameterized by the skeleton dimension. J. Comb. Optim. 44(4): 2762-2781 (2022) - [c10]Johannes Blum, Sabine Storandt:
Customizable Hub Labeling: Properties and Algorithms. COCOON 2022: 345-356 - [c9]Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz:
On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. IPEC 2022: 5:1-5:23 - [i5]Johannes Blum, Sabine Storandt:
Customizable Hub Labeling: Properties and Algorithms. CoRR abs/2208.08709 (2022) - [i4]Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz:
On Sparse Hitting Sets: from Fair Vertex Cover to Highway Dimension. CoRR abs/2208.14132 (2022) - 2021
- [j3]Johannes Blum, Stefan Funke, Sabine Storandt:
Sublinear search spaces for shortest path planning in grid and road networks. J. Comb. Optim. 42(2): 231-257 (2021) - [j2]Johannes Grohmann, Simon Eismann, André Bauer, Simon Spinner, Johannes Blum, Nikolas Herbst, Samuel Kounev:
SARDE: A Framework for Continuous and Self-Adaptive Resource Demand Estimation. ACM Trans. Auton. Adapt. Syst. 15(2): 6:1-6:31 (2021) - 2020
- [c8]Johannes Blum, Ruoying Li, Sabine Storandt:
FISSION: A Practical Algorithm for Computing Minimum Balanced Node Separators. COCOA 2020: 817-832 - [c7]Johannes Blum:
W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension. COCOON 2020: 210-221 - [c6]Johannes Blum, Sabine Storandt:
Lower Bounds and Approximation Algorithms for Search Space Sizes in Contraction Hierarchies. ESA 2020: 20:1-20:14 - [i3]Johannes Blum:
W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension. CoRR abs/2008.07252 (2020)
2010 – 2019
- 2019
- [j1]Johannes Blum, Frank Drewes:
Language theoretic properties of regular DAG languages. Inf. Comput. 265: 57-76 (2019) - [c5]Johannes Blum:
Hierarchy of Transportation Network Parameters and Hardness Results. IPEC 2019: 4:1-4:15 - [i2]Johannes Blum:
Hierarchy of Transportation Network Parameters and Hardness Results. CoRR abs/1905.11166 (2019) - 2018
- [c4]Johannes Blum, Stefan Funke, Sabine Storandt:
Sublinear Search Spaces for Shortest Path Planning in Grid and Road Networks. AAAI 2018: 6119-6126 - [c3]Johannes Blum, Sabine Storandt:
Scalability of Route Planning Techniques. ICAPS 2018: 20-28 - [c2]Johannes Blum, Sabine Storandt:
Computation and Growth of Road Network Dimensions. COCOON 2018: 230-241 - [i1]Moritz Beck, Johannes Blum, Myroslav Kryven, Andre Löffler, Johannes Zink:
Planar Steiner Orientation is NP-complete. CoRR abs/1804.07496 (2018) - 2016
- [c1]Johannes Blum, Frank Drewes:
Properties of Regular DAG Languages. LATA 2016: 427-438
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-10-07 21:14 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:
