Q6324072

MaRDI QIDQ6324072zbMATH OpenDBLPWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On k-planar graphs without short cycles	2025-10-07	Paper
Monotone arc diagrams with few biarcs	2025-10-07	Paper
Bounding and computing obstacle numbers of graphs	2025-06-19	Paper
Recognition of unit segment and polyline graphs is \(\exists \mathbb{R} \)-complete	2025-05-02	Paper
Drawings of complete multipartite graphs up to triangle flips Journal of Computational Geometry	2025-04-23	Paper
Universal geometric graphs Combinatorics, Probability and Computing	2024-11-05	Paper
The number of edges in maximal 2-planar graphs	2024-10-16	Paper
Drawings of complete multipartite graphs up to triangle flips	2024-10-16	Paper
Bounding and computing obstacle numbers of graphs SIAM Journal on Discrete Mathematics	2024-05-22	Paper
Long plane trees	2024-05-14	Paper
The Number of Edges in Maximal 2-planar Graphs	2023-03-15	Paper
On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens (available as arXiv preprint)	2020-08-25	Paper
Simple Topological Drawings of $k$-Planar Graphs (available as arXiv preprint)	2020-08-24	Paper
Universal Geometric Graphs (available as arXiv preprint)	2020-06-19	Paper
The QuaSEFE Problem (available as arXiv preprint)	2019-08-23	Paper
Halving balls in deterministic linear time Algorithms - ESA 2014	2014-10-08	Paper
On universal point sets for planar graphs Computational Geometry and Graphs	2013-12-06	Paper
Counting plane graphs: flippability and its applications Thirty Essays on Geometric Graph Theory	2013-09-25	Paper
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles Lecture Notes in Computer Science	2013-08-12	Paper
Planar packing of binary trees Lecture Notes in Computer Science	2013-08-12	Paper
Counting plane graphs: flippability and its applications Lecture Notes in Computer Science	2011-08-12	Paper
Bounding and computing obstacle numbers of graphs (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: