1 citations · 2 across the 7 of their papers we have counts for
10 papers
Plane Hamiltonian Cycles in Convex Drawings
Helena Bergold, Stefan Felsner, Meghana M. Reddy +2
A conjecture by Rafla from 1988 asserts that every simple drawing of the complete graph admits a plane Hamiltonian cycle. It turned out that already the existence of much sim…
The Density Formula: One Lemma to Bound Them All
Michael Kaufmann, Boris Klemz, Kristin Knorr +3
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in t…
Optimizing Symbol Visibility through Displacement
Bernd Gärtner, Vishwas Kalani, Meghana M. Reddy +3
In information visualization, the position of symbols often encodes associated data values. When visualizing data elements with both a numerical and a categorical dimension, positi…
Using SAT to study plane Hamiltonian substructures in simple drawings
Helena Bergold, Stefan Felsner, Meghana M. Reddy +1
In 1988 Rafla conjectured that every simple drawing of a complete graph contains a plane, i.e., non-crossing, Hamiltonian cycle. The conjecture is far from being resolved. Th…
The Number of Edges in Maximal 2-planar Graphs
Michael Hoffmann, Meghana M. Reddy
A graph is -planar if it has local crossing number two, that is, it can be drawn in the plane such that every edge has at most two crossings. A graph is maximal -planar if no…
Compatible Spanning Trees in Simple Drawings of
Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer +6
For a simple drawing of the complete graph , two (plane) subdrawings are compatible if their union is plane. Let be the set of all plane spanning trees on…
Simplifying Non-Simple Fan-Planar Drawings
Boris Klemz, Kristin Knorr, Meghana M. Reddy +1
A drawing of a graph is fan-planar if the edges intersecting a common edge share a vertex on the same side of . More precisely, orienting arbitrarily and the other e…
Local Complexity of Polygons
Fabian Klute, Meghana M. Reddy, Tillmann Miltzow
Many problems in Discrete and Computational Geometry deal with simple polygons or polygonal regions. Many algorithms and data-structures perform considerably faster, if the underly…
Simple Topological Drawings of -Planar Graphs
Michael Hoffmann, Chih-Hung Liu, Meghana M. Reddy +1
Every finite graph admits a \emph{simple (topological) drawing}, that is, a drawing where every pair of edges intersects in at most one point. However, in combination with other re…
FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding
Akanksha Agrawal, Pradeesha Ashok, Meghana M Reddy +2
We present fixed parameter tractable algorithms for the conflict-free coloring problem on graphs. Given a graph , \emph{conflict-free coloring} of refers to coloring a…