default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKristin Knorr
Person information
- affiliation: FU Berlin, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[c9]Jesse Beisegel, Katharina Klost
, Kristin Knorr, Fabienne Ratajczak, Robert Scheffler:
A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers. IPEC 2025: 30:1-30:19- [i10]Jesse Beisegel, Katharina Klost, Kristin Knorr, Fabienne Ratajczak, Robert Scheffler:
A Graph Width Perspective on Partially Ordered Hamiltonian Paths. CoRR abs/2503.03553 (2025) - [i9]Jesse Beisegel, Katharina Klost, Kristin Knorr, Fabienne Ratajczak, Robert Scheffler:
A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs. CoRR abs/2506.23790 (2025) - [i8]Jesse Beisegel, Katharina Klost, Kristin Knorr, Fabienne Ratajczak, Robert Scheffler:
A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles II: Vertex and Edge Deletion Numbers. CoRR abs/2510.08378 (2025) - 2024
- [j3]Alexander Baumann, Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Dynamic Connectivity in Disk Graphs. Discret. Comput. Geom. 71(1): 214-277 (2024) - [c8]Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, Torsten Ueckerdt:
The Density Formula: One Lemma to Bound Them All. GD 2024: 7:1-7:17 - [c7]Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty:
Insertion-Only Dynamic Connectivity in General Disk Graphs. SOSA 2024: 299-305 - 2023
- [j2]Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder:
Simplifying Non-Simple Fan-Planar Drawings. J. Graph Algorithms Appl. 27(2): 147-172 (2023) - [c6]Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul, Birgit Vogtenhuber:
Flipping Plane Spanning Paths. WALCOM 2023: 49-60 - [i7]Haim Kaplan, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty:
Insertion-Only Dynamic Connectivity in General Disk Graphs. CoRR abs/2306.15338 (2023) - [i6]Michael Kaufmann, Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder, Torsten Ueckerdt:
The Density Formula: One Lemma to Bound Them All. CoRR abs/2311.06193 (2023) - 2022
- [j1]Stefan Felsner, Michael Hoffmann, Kristin Knorr, Jan Kyncl, Irene Parada:
On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. J. Graph Algorithms Appl. 26(3): 381-399 (2022) - [c5]Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Dynamic Connectivity in Disk Graphs. SoCG 2022: 49:1-49:17 - [c4]Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Nicolas El Maalouly, Johannes Obenaus, Rosna Paul, Meghana M. Reddy, Birgit Vogtenhuber, Alexandra Weinberger:
Compatible Spanning Trees in Simple Drawings of Kn. GD 2022: 16-24 - [c3]Jonas Cleve, Nicolas Grelier, Kristin Knorr, Maarten Löffler, Wolfgang Mulzer, Daniel Perz:
Nearest-Neighbor Decompositions of Drawings. SWAT 2022: 21:1-21:16 - [i5]Oswin Aichholzer, Kristin Knorr, Maarten Löffler, Zuzana Masárová, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul, Birgit Vogtenhuber:
Flipping Plane Spanning Paths. CoRR abs/2202.10831 (2022) - [i4]Jonas Cleve, Nicolas Grelier, Kristin Knorr, Maarten Löffler, Wolfgang Mulzer, Daniel Perz:
Nearest-Neighbor Decompositions of Drawings. CoRR abs/2209.02103 (2022) - 2021
- [c2]Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder:
Simplifying Non-simple Fan-Planar Drawings. GD 2021: 57-71 - [i3]Haim Kaplan, Alexander Kauer, Katharina Klost, Kristin Knorr, Wolfgang Mulzer, Liam Roditty, Paul Seiferth:
Dynamic Connectivity in Disk Graphs. CoRR abs/2106.14935 (2021) - [i2]Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder:
Simplifying Non-Simple Fan-Planar Drawings. CoRR abs/2108.13345 (2021) - 2020
- [c1]Stefan Felsner, Michael Hoffmann, Kristin Knorr, Irene Parada:
On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. GD 2020: 382-389 - [i1]Stefan Felsner, Michael Hoffmann, Kristin Knorr, Irene Parada:
On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. CoRR abs/2008.11058 (2020)
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 2025-12-28 00:15 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:
