default search action
Felix Schröder
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j6]Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher
, Felix Schröder, Raphael Steiner, Birgit Vogtenhuber:
Coloring circle arrangements: New 4-chromatic planar graphs. Eur. J. Comb. 121: 103839 (2024) - [j5]Marcin Brianski, Martin Koutecký, Daniel Král', Kristýna Pekárková
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. Math. Program. 208(1): 497-531 (2024) - [c8]Helena Bergold, Joachim Orthaber, Manfred Scheucher, Felix Schröder:
Holes in Convex and Simple Drawings. GD 2024: 5:1-5:9 - [c7]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 - [i10]Helena Bergold, Manfred Scheucher, Felix Schröder:
Finding hardness reductions automatically using SAT solvers. CoRR abs/2402.06397 (2024) - [i9]Helena Bergold, Joachim Orthaber, Manfred Scheucher, Felix Schröder:
Holes in Convex and Simple Drawings. CoRR abs/2409.01723 (2024) - 2023
- [j4]Helena Bergold
Topological Drawings Meet Classical Theorems from Convex Geometry. Discret. Comput. Geom. 70(3): 1121-1143 (2023) - [j3]Boris Klemz, Kristin Knorr, Meghana M. Reddy
Simplifying Non-Simple Fan-Planar Drawings. J. Graph Algorithms Appl. 27(2): 147-172 (2023) - [c6]Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder
Linear Size Universal Point Sets for Classes of Planar Graphs. SoCG 2023: 31:1-31:16 - [i8]Stefan Felsner, Hendrik Schrezenmaier, Felix Schröder, Raphael Steiner
Linear Size Universal Point Sets for Classes of Planar Graphs. CoRR abs/2303.00109 (2023) - [i7]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
- [j2]Christoph Hertrich
Coloring Drawings of Graphs. Electron. J. Comb. 29(1) (2022) - [c5]Marcin Brianski
Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming. ICALP 2022: 29:1-29:20 - [i6]Marcin Brianski, Martin Koutecký, Daniel Král, Kristýna Pekárková, Felix Schröder:
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. CoRR abs/2202.05299 (2022) - [i5]Man-Kwun Chiu, Stefan Felsner, Manfred Scheucher, Felix Schröder, Raphael Steiner
Coloring circle arrangements: New 4-chromatic planar graphs. CoRR abs/2205.08181 (2022) - 2021
- [c4]Boris Klemz, Kristin Knorr
Simplifying Non-simple Fan-Planar Drawings. GD 2021: 57-71 - [i4]Boris Klemz, Kristin Knorr, Meghana M. Reddy, Felix Schröder
Simplifying Non-Simple Fan-Planar Drawings. CoRR abs/2108.13345 (2021) - 2020
- [j1]Winfried Hochstättler, Felix Schröder
On the Complexity of Digraph Colourings and Vertex Arboricity. Discret. Math. Theor. Comput. Sci. 22(1) (2020) - [c3]Helena Bergold
Topological Drawings Meet Classical Theorems from Convex Geometry. GD 2020: 281-294 - [c2]Michal Debski, Stefan Felsner, Piotr Micek, Felix Schröder
Improved bounds for centered colorings. SODA 2020: 2212-2226 - [i3]Helena Bergold, Stefan Felsner, Manfred Scheucher, Felix Schröder
Topological Drawings meet Classical Theorems from Convex Geometry. CoRR abs/2005.12568 (2020) - [i2]Christoph Hertrich
Coloring Drawings of Graphs. CoRR abs/2008.09692 (2020)
2010 – 2019
- 2019
- [c1]Oswin Aichholzer, Linda Kleist
On the Edge-Vertex Ratio of Maximal Thrackles. GD 2019: 482-495 - [i1]Oswin Aichholzer, Linda Kleist, Boris Klemz, Felix Schröder
On the edge-vertex ratio of maximal thrackles. CoRR abs/1908.08857 (2019)
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-12-10 20:49 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: