Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeon Kellerhals
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c14]Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier:
Parameterized Algorithms for Colored Clustering. AAAI 2023: 4400-4408- [c13]Matthias Bentert, Leon Kellerhals, Rolf Niedermeier:
Fair Short Paths in Vertex-Colored Graphs. AAAI 2023: 12346-12354 - [i15]Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier:
Parameterized Algorithms for Colored Clustering. CoRR abs/2302.00630 (2023) - [i14]Lito Goldmann, Leon Kellerhals, Tomohiro Koana:
Structural Parameterizations of the Biclique-Free Vertex Deletion Problem. CoRR abs/2308.00501 (2023) - [i13]Leon Kellerhals, Jannik Peters:
Proportional Fairness in Clustering: A Social Choice Perspective. CoRR abs/2310.18162 (2023) - 2022
- [j3]Leon Kellerhals, Tomohiro Koana:
Parameterized Complexity of Geodetic Set. J. Graph Algorithms Appl. 26(4): 401-419 (2022) - [j2]Matthias Bentert, Leon Kellerhals
, Rolf Niedermeier:
The structural complexity landscape of finding balance-fair shortest paths. Theor. Comput. Sci. 933: 149-162 (2022) - [c12]Vincent Froese, Leon Kellerhals, Rolf Niedermeier:
Modification-Fair Cluster Editing. AAAI 2022: 6631-6638 - [c11]Robert Bredereck, Anne-Marie George, Jonas Israel, Leon Kellerhals:
Single-Peaked Opinion Updates. IJCAI 2022: 137-143 - [c10]Maike Herkenrath, Till Fluschnik, Francesco Grothe, Leon Kellerhals:
Placing Green Bridges Optimally, with Habitats Inducing Cycles. IJCAI 2022: 3825-3831 - [c9]Leon Kellerhals, Tomohiro Koana, Pascal Kunz:
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. IPEC 2022: 19:1-19:14 - [i12]Maike Herkenrath, Till Fluschnik, Francesco Grothe, Leon Kellerhals:
Placing Green Bridges Optimally, with Habitats Inducing Cycles. CoRR abs/2201.12273 (2022) - [i11]Leon Kellerhals, Tomohiro Koana, Pascal Kunz:
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. CoRR abs/2203.05887 (2022) - [i10]Matthias Bentert, Leon Kellerhals, Rolf Niedermeier:
Finding Balance-Fair Short Paths in Graphs. CoRR abs/2203.17132 (2022) - [i9]Robert Bredereck, Anne-Marie George, Jonas Israel, Leon Kellerhals:
Single-Peaked Opinion Updates. CoRR abs/2204.14094 (2022) - 2021
- [c8]Till Fluschnik, Leon Kellerhals:
Placing Green Bridges Optimally, with a Multivariate Analysis. CiE 2021: 204-216 - [c7]Leon Kellerhals, Malte Renken, Philipp Zschoche:
Parameterized Algorithms for Diverse Multistage Problems. ESA 2021: 55:1-55:17 - [c6]Leon Kellerhals, Tomohiro Koana, André Nichterlein, Philipp Zschoche:
The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing. IPEC 2021: 26:1-26:18 - [c5]Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche:
Optimal Virtual Network Embeddings for Tree Topologies. SPAA 2021: 221-231 - [i8]Till Fluschnik, Leon Kellerhals:
Placing Green Bridges Optimally, with a Multivariate Analysis. CoRR abs/2102.04539 (2021) - [i7]Leon Kellerhals, Malte Renken, Philipp Zschoche:
Parameterized Algorithms for Diverse Multistage Problems. CoRR abs/2105.04856 (2021) - [i6]Aleksander Figiel, Leon Kellerhals, Rolf Niedermeier, Matthias Rost, Stefan Schmid, Philipp Zschoche:
Optimal Virtual Network Embeddings for Tree Topologies. CoRR abs/2105.07006 (2021) - [i5]Vincent Froese, Leon Kellerhals, Rolf Niedermeier:
Modification-Fair Cluster Editing. CoRR abs/2112.03183 (2021) - 2020
- [j1]Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier:
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. J. Graph Algorithms Appl. 24(3): 483-522 (2020) - [c4]Robert Bredereck, Lilian Jacobs, Leon Kellerhals:
Maximizing the Spread of an Opinion in Few Steps: Opinion Diffusion in Non-Binary Networks. IJCAI 2020: 1622-1628 - [c3]Leon Kellerhals, Tomohiro Koana:
Parameterized Complexity of Geodetic Set. IPEC 2020: 20:1-20:14 - [i4]Leon Kellerhals, Tomohiro Koana:
Parameterized Complexity of Geodetic Set. CoRR abs/2001.03098 (2020) - [i3]Danny Hermelin, Leon Kellerhals, Rolf Niedermeier, Rami Pugatch:
Approximating Sparse Quadratic Programs. CoRR abs/2007.01252 (2020)
2010 – 2019
- 2018
- [c2]Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier:
An Adaptive Version of Brandes' Algorithm for Betweenness Centrality. ISAAC 2018: 36:1-36:13 - [i2]Matthias Bentert, Alexander Dittmann, Leon Kellerhals, André Nichterlein, Rolf Niedermeier:
Towards Improving Brandes' Algorithm for Betweenness Centrality. CoRR abs/1802.06701 (2018) - 2017
- [c1]Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen:
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. TAMC 2017: 348-361 - [i1]Leon Kellerhals, Viatcheslav Korenwein, Philipp Zschoche, Robert Bredereck, Jiehua Chen:
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections. CoRR abs/1701.05108 (2017)
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 2023-11-03 18:07 CET 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:
