research
∙
07/04/2023
Heuristic Algorithms for the Approximation of Mutual Coherence
Mutual coherence is a measure of similarity between two opinions. Althou...
share
research
∙
04/14/2023
Identifying Cluttering Edges in Near-Planar Graphs
Planar drawings of graphs tend to be favored over non-planar drawings. T...
research
∙
09/02/2022
Can an NN model plainly learn planar layouts?
Planar graph drawings tend to be aesthetically pleasing. In this poster ...
research
∙
08/29/2022
Recognizing DAGs with Page-Number 2 is NP-complete
The page-number of a directed acyclic graph (a DAG, for short) is the mi...
research
∙
02/24/2022
Removing Popular Faces in Curve Arrangements
A face in a curve arrangement is called popular if it is bounded by the ...
research
∙
06/05/2021
Upward planar drawings with two slopes
In an upward planar 2-slope drawing of a digraph, edges are drawn as str...
research
∙
12/18/2020
Upward Point Set Embeddings of Paths and Trees
We study upward planar straight-line embeddings (UPSE) of directed trees...
research
∙
08/24/2020
On Mixed Linear Layouts of Series-Parallel Graphs
A mixed s-stack q-queue layout of a graph consists of a linear order of ...
research
∙
07/31/2019
Level-Planar Drawings with Few Slopes
We introduce and study level-planar straight-line drawings with a fixed ...
research
∙
03/20/2019
Drawing planar graphs with few segments on a polynomial grid
The visual complexity of a plane graph drawing is defined to be the numb...
research
∙
03/19/2019
Upward Book Embeddings of st-Graphs
We study k-page upward book embeddings (kUBEs) of st-graphs, that is, bo...
research
∙
11/02/2018
Planar Graphs of Bounded Degree have Constant Queue Number
A queue layout of a graph consists of a linear order of its vertices and...
research
∙
11/02/2018
Drawing Clustered Graphs on Disk Arrangements
Let G=(V, E) be a planar graph and let C be a partition of V. We refer t...
research
∙
09/04/2018
Aesthetic Discrimination of Graph Layouts
This paper addresses the following basic question: given two layouts of ...
research
∙
08/30/2018
β-Stars or On Extending a Drawing of a Connected Subgraph
We consider the problem of extending the drawing of a subgraph of a give...
research
∙
08/27/2018
Greedy Rectilinear Drawings
A drawing of a graph is greedy if for each ordered pair of vertices u an...
research
∙
07/25/2018
A Greedy Heuristic for Crossing Angle Maximization
The crossing angle of a straight-line drawing Γ of a graph G=(V, E) is t...
research
∙
08/30/2017
Planar Drawings of Fixed-Mobile Bigraphs
A fixed-mobile bigraph G is a bipartite graph such that the vertices of ...
research
∙
08/30/2017
Experimental Evaluation of Book Drawing Algorithms
A k-page book drawing of a graph G=(V,E) consists of a linear ordering o...
research
∙
08/29/2017
