Walter Didimo

From MaRDI portal
Person:290509

Available identifiers

zbMath Open didimo.walterWikidataQ124612115 ScholiaQ124612115MaRDI QIDQ290509

List of research outcomes





PublicationDate of PublicationType
On the parameterized complexity of bend-minimum orthogonal planarity2024-10-24Paper
On the parameterized complexity of bend-minimum orthogonal planarity2024-10-14Paper
Parameterized and approximation algorithms for the maximum bimodal subgraph problem2024-10-14Paper
Min-\(k\)-planar drawings of graphs2024-10-08Paper
Min-\(k\)-planar drawings of graphs2024-06-21Paper
Nonplanar Graph Drawings with k Vertices per Face2024-05-03Paper
Small Point-Sets Supporting Graph Stories2023-12-20Paper
Rectilinear Planarity of Partial 2-Trees2023-12-20Paper
$st$-Orientations with Few Transitive Edges2023-12-20Paper
Upward book embeddability of \(st\)-graphs: complexity and algorithms2023-12-13Paper
Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time2023-09-27Paper
Small point-sets supporting graph stories2023-08-16Paper
Rectilinear planarity of partial 2-trees2023-08-16Paper
\(st\)-orientations with few transitive edges2023-08-16Paper
Parameterized approaches to orthogonal compaction2023-08-14Paper
On Turn-Regular Orthogonal Representations2022-11-14Paper
1-planarity testing and embedding: an experimental study2022-10-06Paper
Computing orthogonal drawings with the minimum number of bends2022-08-19Paper
Universal slope sets for upward planar drawings2022-08-18Paper
Upward Book Embeddings of st-Graphs2022-07-18Paper
A user study on hybrid graph visualizations2022-07-01Paper
Storyline Visualizations with Ubiquitous Actors2021-12-01Paper
VAIM: Visual Analytics for Influence Maximization2021-12-01Paper
On Turn-Regular Orthogonal Representations2021-12-01Paper
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time2021-12-01Paper
Right Angle Crossing Drawings of Graphs2021-07-22Paper
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time2021-02-02Paper
ChordLink: a new hybrid visualization model2020-10-26Paper
An experimental study of a 1-planarity testing and embedding algorithm2020-07-22Paper
Greedy rectilinear drawings2019-10-18Paper
Planar drawings of fixed-mobile bigraphs2019-10-18Paper
Planar drawings of fixed-mobile bigraphs2019-02-20Paper
Edge partitions of optimal 2-plane and 3-plane graphs2019-02-20Paper
Greedy rectilinear drawings2019-02-15Paper
Bend-minimum orthogonal drawings in quadratic time2019-02-15Paper
Universal slope sets for upward planar drawings2019-02-15Paper
An Experimental Study on the Ply Number of Straight-line Drawings2019-02-14Paper
HV-planarity: algorithms and complexity2018-12-10Paper
Edge partitions of optimal 2-plane and 3-plane graphs2018-11-22Paper
Ortho-polygon visibility representations of embedded graphs2018-07-25Paper
Computing orthogonal drawings with the minimum number of bends2018-07-09Paper
New results on edge partitions of 1-plane graphs2018-02-06Paper
On the relationship between \(k\)-planar and \(k\)-quasi-planar graphs2018-01-04Paper
1-bend RAC drawings of 1-planar graphs2017-09-07Paper
An experimental study on the ply number of straight-line drawings2017-05-05Paper
Algorithms and characterizations for 2-layer fan-planarity: from caterpillar to stegosaurus2017-04-05Paper
Vertex-coloring with defects2017-04-05Paper
A distributed multilevel force-directed algorithm2017-02-21Paper
Placing arrows in directed graph drawings2017-02-21Paper
1-bend RAC drawings of 1-planar graphs2017-02-21Paper
Ortho-polygon visibility representations of embedded graphs2017-02-21Paper
A million edge drawing for a fistful of dollars2017-02-10Paper
\textsc{Kojaph}: visual definition and exploration of patterns in graph databases2017-02-10Paper
2-layer fan-planarity: from caterpillar to stegosaurus2017-02-10Paper
Recognizing and drawing IC-planar graphs2017-02-10Paper
Recognizing and drawing IC-planar graphs2016-06-01Paper
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs2016-01-15Paper
Fast layout computation of clustered networks: algorithmic advances and experimental analysis2016-01-14Paper
Fan-planarity: properties and complexity2015-06-01Paper
Monotone drawings of graphs with fixed embedding2015-05-26Paper
On the complexity of HV-rectilinear planarity testing2015-01-07Paper
Planar and Quasi Planar Simultaneous Geometric Embedding2015-01-07Paper
Fan-planar graphs: combinatorial properties and complexity results2015-01-07Paper
2-layer right angle crossing drawings2014-12-02Paper
Upward and quasi-upward planarity testing of embedded mixed graphs2014-03-13Paper
Quasi-upward planar drawings of mixed graphs with few bends: heuristics and exact methods2014-02-18Paper
Exploring Complex Drawings via Edge Stratification2013-12-20Paper
Drawing non-planar graphs with crossing-free subgraphs2013-12-20Paper
Switch-regular upward planarity testing of directed trees2013-11-28Paper
The crossing-angle resolution in graph drawing2013-09-25Paper
Area requirement of graph drawings with few crossings per edge2013-07-31Paper
Density of straight-line 1-planar graph drawings2013-03-20Paper
Large angle crossing drawings of planar graphs in subquadratic area2013-01-07Paper
\(h\)-quasi planar drawings of bounded treewidth graphs in linear area2012-11-06Paper
Vertex angle and crossing angle resolution of leveled tree drawings2012-10-23Paper
Drawing trees in a streaming model2012-07-25Paper
Heuristics for the maximum 2-layer RAC subgraph problem2012-06-08Paper
Drawing a tree as a minimum spanning tree approximation2012-05-11Paper
A characterization of complete bipartite RAC graphs2012-03-19Paper
Bounds on the crossing resolution of complete geometric graphs2012-03-19Paper
Monotone Drawings of Graphs with Fixed Embedding2012-03-09Paper
Upward planarity testing of embedded mixed graphs2012-03-09Paper
2-layer right angle crossing drawings2012-01-13Paper
Area, curve complexity, and crossing resolution of non-planar graph drawings2011-11-30Paper
Drawing graphs with right angle crossings2011-10-10Paper
On the perspectives opened by right angle crossing drawings2011-04-19Paper
Topology-driven force-directed algorithms2011-02-11Paper
Constrained point-set embeddability of planar graphs2010-12-15Paper
Drawing a tree as a minimum spanning tree approximation2010-12-09Paper
Upward spirality and upward planarity testing2010-12-03Paper
On the perspectives opened by right angle crossing drawings2010-04-27Paper
Area, curve complexity, and crossing resolution of non-planar graph drawings2010-04-27Paper
Drawing trees in a streaming model2010-04-27Paper
Switch-regular upward planar embeddings of trees2010-02-09Paper
Matched drawings of planar graphs2010-02-04Paper
Visual Analysis of One-To-Many Matched Graphs2010-02-04Paper
Drawing planar graphs on a curve.2010-01-12Paper
Upward straight-line embeddings of directed graphs into point sets2009-11-16Paper
Drawing Graphs with Right Angle Crossings2009-10-20Paper
Graph Drawing2009-08-11Paper
Point-set embeddings of trees with given partial drawings2009-07-27Paper
Visual Analysis of One-to-Many Matched Graphs2009-03-03Paper
Constrained Point-Set Embeddability of Planar Graphs2009-03-03Paper
k-colored Point-set Embeddability of Outerplanar Graphs2009-01-19Paper
Computing Radial Drawings on the Minimum Number of Circles2009-01-19Paper
Upward Planar Drawings and Switch-regularity Heuristics2009-01-19Paper
Overlapping Cluster Planarity2009-01-19Paper
Radial drawings of graphs: geometric constraints and trade-offs2008-11-18Paper
Maximum upward planar subgraphs of embedded planar digraphs2008-09-19Paper
Point-Set Embedding of Trees with Edge Constraints2008-03-25Paper
Matched Drawings of Planar Graphs2008-03-25Paper
Maximum Upward Planar Subgraphs of Embedded Planar Digraphs2008-03-25Paper
k-Colored Point-Set Embeddability of Outerplanar Graphs2007-08-28Paper
Radial Drawings of Graphs: Geometric Constraints and Trade-Offs2007-08-28Paper
Graph Drawing2006-11-13Paper
Book embeddability of series-parallel digraphs2006-09-26Paper
\(k\)-spine, 1-bend planarity2006-09-14Paper
Graph Drawing2005-12-07Paper
SOFSEM 2005: Theory and Practice of Computer Science2005-12-07Paper
SOFSEM 2005: Theory and Practice of Computer Science2005-12-07Paper
Graph Drawing2005-12-07Paper
Orthogonal drawings of graphs with vertex and edge labels2005-11-07Paper
Curve-constrained drawings of planar graphs2005-02-09Paper
https://portal.mardi4nfdi.de/entity/Q30437122004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q30437812004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q30437592004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q30437552004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q30437052004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44723022004-08-04Paper
Upward Embeddings and Orientations of Undirected Planar Graphs2003-11-30Paper
https://portal.mardi4nfdi.de/entity/Q44222632003-09-03Paper
https://portal.mardi4nfdi.de/entity/Q44222722003-09-03Paper
Visualization of the High Level Structure of the Internet with Hermes2003-06-23Paper
Drawing database schemas2003-02-04Paper
https://portal.mardi4nfdi.de/entity/Q47785682002-11-18Paper
Quasi-upward planarity2002-05-21Paper
https://portal.mardi4nfdi.de/entity/Q45016932000-11-16Paper
Turn-regularity and optimal area drawings of orthogonal representations2000-06-05Paper

Research outcomes over time

This page was built for person: Walter Didimo