default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon D. Fink
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Simon Dominik Fink:
Constrained Planarity Algorithms in Theory and Practice. University of Passau, Germany, 2024- [c9]Simon D. Fink, Ignaz Rutter:
Constrained Planarity in Practice: Engineering the Synchronized Planarity Algorithm. ALENEX 2024: 1-14 - [c8]Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg:
The Parameterized Complexity Of Extending Stack Layouts. GD 2024: 12:1-12:17 - [c7]Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Peter Stumpf:
Level Planarity Is More Difficult Than We Thought (Poster Abstract). GD 2024: 50:1-50:3 - [i8]Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Marie Diana Sieper:
Clustered Planarity Variants for Level Graphs. CoRR abs/2402.13153 (2024) - [i7]Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter, Peter Stumpf:
Level Planarity Is More Difficult Than We Thought. CoRR abs/2409.01727 (2024) - [i6]Thomas Depian, Simon D. Fink, Robert Ganian, Martin Nöllenburg:
The Parameterized Complexity of Extending Stack Layouts. CoRR abs/2409.02833 (2024) - 2023
- [j2]Simon D. Fink
, Matthias Pfretzschner, Ignaz Rutter:
Experimental Comparison of PC-Trees and PQ-Trees. ACM J. Exp. Algorithmics 28: 1.10:1-1.10:24 (2023) - [j1]Thomas Bläsius, Simon D. Fink, Ignaz Rutter:
Synchronized Planarity with Applications to Constrained Planarity Problems. ACM Trans. Algorithms 19(4): 34:1-34:23 (2023) - [c6]Simon D. Fink, Ignaz Rutter:
Maintaining Triconnected Components Under Node Expansion. CIAC 2023: 202-216 - [c5]Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
Parameterized Complexity of Simultaneous Planarity. GD (2) 2023: 82-96 - [i5]Simon D. Fink, Ignaz Rutter:
Maintaining Triconnected Components under Node Expansion. CoRR abs/2301.03972 (2023) - [i4]Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
Parameterized Complexity of Simultaneous Planarity. CoRR abs/2308.11401 (2023) - [i3]Simon D. Fink, Ignaz Rutter:
Constrained Planarity in Practice - Engineering the Synchronized Planarity Algorithm. CoRR abs/2310.20632 (2023) - 2021
- [c4]Thomas Bläsius, Simon D. Fink, Ignaz Rutter:
Synchronized Planarity with Applications to Constrained Planarity Problems. ESA 2021: 19:1-19:14 - [c3]Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
Experimental Comparison of PC-Trees and PQ-Trees. ESA 2021: 43:1-43:13 - [i2]Simon D. Fink, Matthias Pfretzschner, Ignaz Rutter:
Experimental Comparison of PC-Trees and PQ-Trees. CoRR abs/2106.14805 (2021) - 2020
- [i1]Thomas Bläsius, Simon D. Fink, Ignaz Rutter:
Synchronized Planarity with Applications to Constrained Planarity Problems. CoRR abs/2007.15362 (2020)
2010 – 2019
- 2017
- [c2]Simon Dominik Fink, Lukasz Golab, Srinivasan Keshav, Hermann de Meer:
How Similar is the Usage of Electric Cars and Electric Bicycles? e-Energy 2017: 334-340 - 2016
- [c1]Tobias Marktscheffel, Wolfram Gottschlich, Wolfgang Popp, Philemon Werli, Simon Dominik Fink, Arne Bilzhause, Hermann de Meer:
QR code based mutual authentication protocol for Internet of Things. WoWMoM 2016: 1-6
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-30 21:31 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:
