default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPascal Kunz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j2]Vincent Froese, Pascal Kunz, Philipp Zschoche:
Disentangling the Computational Complexity of Network Untangling. Theory Comput. Syst. 68(1): 103-121 (2024)- 2019
- [j1]Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz
, Vincent Froese, Manuel Sorge:
Computational complexity aspects of point visibility graphs. Discret. Appl. Math. 254: 283-290 (2019)
Conference and Workshop Papers
- 2024
- [c9]Nicholas Mayone, Pascal Kunz, Beytüllah Yigit, Wissem Soussi, Burkhard Stiller, Gürkan Gür:
IPv6 Connection Shuffling for Moving Target Defense (MTD) in SDN. CSR 2024: 373-378 - 2023
- [c8]Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier:
Parameterized Algorithms for Colored Clustering. AAAI 2023: 4400-4408 - [c7]Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge:
On Computing Optimal Tree Ensembles. ICML 2023: 17364-17374 - [c6]Pascal Kunz, Hendrik Molter, Meirav Zehavi:
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? IJCAI 2023: 180-188 - [c5]Stefan Kratsch, Pascal Kunz:
Approximate Turing Kernelization and Lower Bounds for Domination Problems. IPEC 2023: 32:1-32:17 - 2022
- [c4]Vincent Froese, Pascal Kunz, Philipp Zschoche:
Disentangling the Computational Complexity of Network Untangling. IJCAI 2022: 2037-2043 - [c3]Leon Kellerhals, Tomohiro Koana, Pascal Kunz:
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. IPEC 2022: 19:1-19:14 - [c2]Till Fluschnik, Pascal Kunz:
Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring. SAND 2022: 16:1-16:18 - [c1]Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken:
Most Classic Problems Remain NP-Hard on Relative Neighborhood Graphs and Their Relatives. SWAT 2022: 29:1-29:19
Informal and Other Publications
- 2023
- [i9]Pascal Kunz, Hendrik Molter, Meirav Zehavi:
In Which Graph Structures Can We Efficiently Find Temporally Disjoint Paths and Walks? CoRR abs/2301.10503 (2023) - [i8]Leon Kellerhals, Tomohiro Koana, Pascal Kunz, Rolf Niedermeier:
Parameterized Algorithms for Colored Clustering. CoRR abs/2302.00630 (2023) - [i7]Christian Komusiewicz, Pascal Kunz, Frank Sommer, Manuel Sorge:
On Computing Optimal Tree Ensembles. CoRR abs/2306.04423 (2023) - [i6]Stefan Kratsch, Pascal Kunz:
Approximate Turing kernelization and lower bounds for domination problems. CoRR abs/2307.02241 (2023) - 2022
- [i5]Leon Kellerhals, Tomohiro Koana, Pascal Kunz:
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. CoRR abs/2203.05887 (2022) - [i4]Vincent Froese, Pascal Kunz, Philipp Zschoche:
Disentangling the Computational Complexity of Network Untangling. CoRR abs/2204.02668 (2022) - 2021
- [i3]Pascal Kunz, Till Fluschnik, Rolf Niedermeier, Malte Renken:
Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives. CoRR abs/2107.04321 (2021) - [i2]Till Fluschnik, Pascal Kunz:
Bipartite Temporal Graphs and the Parameterized Complexity of Multistage 2-Coloring. CoRR abs/2111.09049 (2021) - 2017
- [i1]Anne-Sophie Himmel, Clemens Hoffmann, Pascal Kunz, Vincent Froese, Manuel Sorge:
Algorithmic Aspects of Point Visibility Graphs. CoRR abs/1711.01811 (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 2024-10-02 21:36 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:
