Felix Schröder

Orcid: 0000-0001-8563-3517

According to our database1, Felix Schröder authored at least 11 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Finding hardness reductions automatically using SAT solvers.
CoRR, 2024

2023
Topological Drawings Meet Classical Theorems from Convex Geometry.
Discret. Comput. Geom., October, 2023

Simplifying Non-Simple Fan-Planar Drawings.
J. Graph Algorithms Appl., 2023

The Density Formula: One Lemma to Bound Them All.
CoRR, 2023

Linear Size Universal Point Sets for Classes of Planar Graphs.
Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022
Coloring circle arrangements: New 4-chromatic planar graphs.
CoRR, 2022

Coloring Drawings of Graphs.
Electron. J. Comb., 2022

Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2020
On the Complexity of Digraph Colourings and Vertex Arboricity.
Discret. Math. Theor. Comput. Sci., 2020

Improved bounds for centered colorings.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
On the Edge-Vertex Ratio of Maximal Thrackles.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019


  Loading...