Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Ioannis. G. Tollis - MaRDI portal

Ioannis. G. Tollis

From MaRDI portal
(Redirected from Person:1969946)
Person:1384190

Available identifiers

zbMath Open tollis.ioannis-gMaRDI QIDQ1384190

List of research outcomes





PublicationDate of PublicationType
A fixed-parameter algorithm for dominance drawings of DAGs2024-11-07Paper
Effective Computation of a Feedback Arc Set Using PageRank2023-12-20Paper
https://portal.mardi4nfdi.de/entity/Q61793432023-12-16Paper
Computing a feedback arc set using PageRank2023-08-16Paper
Dominance drawings for DAGs with bounded modular width2023-08-14Paper
How to draw a series-parallel digraph2022-12-09Paper
Orthogonal drawing of high degree graphs with small area and few bends2022-08-19Paper
Algorithms for visualizing phylogenetic networks2020-08-17Paper
Planar drawings of fixed-mobile bigraphs2019-10-18Paper
A New Framework for Hierarchical Drawings2019-09-16Paper
Modifying orthogonal drawings for label placement2019-03-26Paper
Planar drawings of fixed-mobile bigraphs2019-02-20Paper
Planar L-Drawings of Directed Graphs2019-02-20Paper
Algorithms and bounds for drawing directed graphs2019-02-15Paper
Algorithms and Bounds for L-Drawings of Directed Graphs2018-07-24Paper
Interactive orthogonal graph drawing2018-07-09Paper
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus2017-04-05Paper
Algorithms for visualizing phylogenetic networks2017-02-21Paper
2-Layer Fan-Planarity: From Caterpillar to Stegosaurus2017-02-10Paper
Area requirement of visibility representations of trees2016-05-26Paper
L-Drawings of Directed Graphs2016-03-10Paper
Algorithms and Bounds for Overloaded Orthogonal Drawings2016-03-03Paper
Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs2016-01-15Paper
Fan-planarity: properties and complexity2015-06-01Paper
Fan-Planar Graphs: Combinatorial Properties and Complexity Results2015-01-07Paper
Drawing Non-Planar Graphs with Crossing-Free Subgraphs2013-12-20Paper
Exploring Complex Drawings via Edge Stratification2013-12-20Paper
DAGView: An Approach for Visualizing Large Graphs2013-04-03Paper
DAGmaps and ε-Visibility Representations for DAGs: Algorithms and Characterizations2012-12-04Paper
Overloaded Orthogonal Drawings2012-03-09Paper
Applications of Parameterized st-Orientations2011-02-16Paper
DAGmaps and ε-Visibility Representations of DAGs2010-04-27Paper
DAGmaps: Space Filling Visualization of Directed Acyclic Graphs2010-02-04Paper
Graph Drawing2009-08-11Paper
Algorithms for computing a parameterized \(st\)-orientation2008-12-12Paper
On the Topologies of Local Minimum Spanning Trees2008-04-17Paper
Treemaps for Directed Acyclic Graphs2008-03-25Paper
A framework and algorithms for circular drawings of graphs2008-01-11Paper
Parameterized st-Orientations of Graphs: Algorithms and Experiments2007-08-28Paper
Graph Drawing2006-11-13Paper
Algorithms for the multiple label placement problem2006-10-25Paper
Graph Drawing2005-12-07Paper
https://portal.mardi4nfdi.de/entity/Q31543752004-12-16Paper
A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT2004-09-29Paper
https://portal.mardi4nfdi.de/entity/Q30437032004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q30437852004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44723012004-08-04Paper
Automatic layout of statecharts2002-06-02Paper
On the complexity of the Edge Label Placement problem2002-01-02Paper
THE THREE-PHASE METHOD: A UNIFIED APPROACH TO ORTHOGONAL GRAPH DRAWING2001-04-17Paper
Techniques for the Refinement of Orthogonal Graph Drawings2000-12-14Paper
Efficient orthogonal drawings of high degree graphs2000-12-12Paper
Algorithms for Incremental Orthogonal Graph Drawing in Three Dimensions2000-09-19Paper
Algorithms for area-efficient orthogonal drawing1998-07-01Paper
Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar $ST$-Digraphs1996-04-11Paper
HOW TO DRAW A SERIES-PARALLEL DIGRAPH1995-04-06Paper
Algorithms for drawing graphs: An annotated bibliography1994-11-30Paper
Dynamic reachability in planar digraphs with one source and one sink1993-11-28Paper
Area requirement and symmetry display of planar upward drawings1992-09-26Paper
Constrained visibility representations of graphs1992-06-28Paper
Lower bounds for planar orthogonal drawings of graphs1992-06-27Paper
Representations of Graphs on a Cylinder1991-01-01Paper
Wiring layouts in the tri-hexagonal grid1990-01-01Paper
On finding a minimum vertex cover of a series-parallel graph1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47324131989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37859821987-01-01Paper
A unified approach to visibility representations of planar graphs1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37427361986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33155561983-01-01Paper

Research outcomes over time

This page was built for person: Ioannis. G. Tollis