Person:436549: Difference between revisions

From MaRDI portal
Person:436549
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Antonios Symvonis to Antonios Symvonis: Duplicate
 
(No difference)

Latest revision as of 21:28, 11 December 2023

Available identifiers

zbMath Open symvonis.antoniosMaRDI QIDQ436549

List of research outcomes

PublicationDate of PublicationType
Convex grid drawings of planar graphs with constant edge-vertex resolution2024-02-23Paper
On the complexity of the storyplan problem2023-10-24Paper
Strictly-convex drawings of 3-connected planar graphs2023-08-16Paper
On the complexity of the storyplan problem2023-08-16Paper
Dynamic tree routing under the “matching with consumption” model2023-01-25Paper
Routing on trees via matchings2022-12-16Paper
Convex grid drawings of planar graphs with constant edge-vertex resolution2022-08-30Paper
One-bend drawings of outerplanar graphs inside simple polygons2022-07-01Paper
Grid drawings of graphs with constant edge-vertex resolution2021-09-17Paper
Drawing planar graphs with few segments on a polynomial grid2020-10-26Paper
Geometric representations of dichotomous ordinal data2020-02-24Paper
Coloring outerplanar graphs and planar 3-trees with small monochromatic components2019-11-25Paper
Planar drawings of fixed-mobile bigraphs2019-10-18Paper
Greedy rectilinear drawings2019-10-18Paper
Planar drawings of fixed-mobile bigraphs2019-02-20Paper
Simple Compact Monotone Tree Drawings2019-02-20Paper
Monotone drawings of \(k\)-inner planar graphs2019-02-15Paper
Greedy rectilinear drawings2019-02-15Paper
Rooted Uniform Monotone Minimum Spanning Trees2017-07-21Paper
Vertex-Coloring with Defects2017-04-05Paper
Low Ply Drawings of Trees2017-02-21Paper
Many-to-One Boundary Labeling with Backbones2016-01-07Paper
Fan-planarity: properties and complexity2015-06-01Paper
Monotone drawings of graphs with fixed embedding2015-05-26Paper
ON THE ROUTING NUMBER OF COMPLETE d-ARY TREES2015-04-30Paper
Computing upward topological book embeddings of upward planar digraphs2015-02-13Paper
Many-to-One Boundary Labeling with Backbones2013-12-20Paper
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs2013-11-28Paper
Smooth Orthogonal Layouts2013-10-29Paper
On upward point set embeddability2013-04-29Paper
Smooth Orthogonal Layouts2013-04-03Paper
Geometric RAC Simultaneous Drawings of Graphs2013-01-07Paper
The Straight-Line RAC Drawing Problem is NP-Hard2012-12-04Paper
Geometric RAC Simultaneous Drawings of Graphs2012-09-25Paper
Drawing trees in a streaming model2012-07-25Paper
Monotone Drawings of Graphs with Fixed Embedding2012-03-09Paper
Upward Point Set Embeddability for Convex Point Sets Is in P2012-03-09Paper
Combining Problems on RAC Drawings and Simultaneous Graph Drawings2012-03-09Paper
Colored simultaneous geometric embeddings and universal pointsets2011-06-30Paper
On the Perspectives Opened by Right Angle Crossing Drawings2011-04-19Paper
The Straight-Line RAC Drawing Problem Is NP-Hard2011-02-15Paper
Combining Traditional Map Labeling with Boundary Labeling2011-02-15Paper
Upward Point-Set Embeddability2011-02-15Paper
Upward Geometric Graph Embeddings into Point Sets2011-02-11Paper
Maximizing the Total Resolution of Graphs2011-02-11Paper
Boundary labeling with octilinear leaders2010-05-19Paper
Drawing Trees in a Streaming Model2010-04-27Paper
On the Perspectives Opened by Right Angle Crossing Drawings2010-04-27Paper
On Metro-Line Crossing Minimization2010-02-04Paper
Unilateral Orientation of Mixed Graphs2010-01-28Paper
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs2009-12-17Paper
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs2009-07-23Paper
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem2009-03-03Paper
Spine Crossing Minimization in Upward Topological Book Embeddings2009-03-03Paper
Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings2009-02-24Paper
Efficient Labeling of Collinear Sites2009-01-19Paper
Boundary Labeling with Octilinear Leaders2008-07-15Paper
Computing Upward Topological Book Embeddings of Upward Planar Digraphs2008-05-27Paper
Multi-stack Boundary Labeling Problems2008-04-17Paper
Line Crossing Minimization on Metro Maps2008-03-25Paper
Flit-serial packet routing on meshes and tori2007-06-11Paper
Boundary labeling: Models and efficient algorithms for rectangular maps2007-02-19Paper
Graph Drawing2005-12-07Paper
Dimension-exchange algorithms for token distribution on tree-connected architectures2004-10-04Paper
https://portal.mardi4nfdi.de/entity/Q44723202004-08-04Paper
An empirical study of off-line permutation packet routing on two-dimensional meshes based on the multistage routing method2003-11-10Paper
A note on deflection worm routing on meshes.2002-07-25Paper
Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms2002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q45208282001-02-27Paper
https://portal.mardi4nfdi.de/entity/Q45257392001-01-24Paper
On-line matching routing on trees2000-08-23Paper
Three-dimensional orthogonal graph drawing algorithms2000-07-11Paper
Optimal algorithms for multipacket routing problems on rings2000-06-21Paper
A note on parallel algorithms for optimal h-v drawings of binary trees1998-08-19Paper
Many-to-many routing on trees via matchings1998-07-22Paper
Routing on trees1997-02-27Paper
SEARCHING A PSEUDO 3-SIDED SOLID ORTHOCONVEX GRID1995-01-12Paper
Drawing Graphs in the Plane with High Resolution1994-10-10Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Antonios Symvonis