| Publication | Date of Publication | Type |
|---|
| Parameterized and approximation algorithms for the maximum bimodal subgraph problem | 2024-10-14 | Paper |
| Simultaneous drawing of layered trees | 2024-07-19 | Paper |
| Balancing between the local and global structures (LGS) in graph embedding | 2024-06-21 | Paper |
Multi-priority graph sparsification
Lecture Notes in Computer Science | 2023-12-22 | Paper |
| Computing β-Stretch Paths in Drawings of Graphs. | 2023-11-02 | Paper |
An FPT algorithm for bipartite vertex splitting
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Spherical graph drawing by multi-dimensional scaling
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Visualizing evolving trees
Lecture Notes in Computer Science | 2023-08-16 | Paper |
The Rique-number of graphs
Lecture Notes in Computer Science | 2023-08-16 | Paper |
scientific article; zbMATH DE number 7700598 (Why is no real title available?)
(available as arXiv preprint) | 2023-06-23 | Paper |
The segment number: algorithms and universal lower bounds for some classes of planar graphs
Graph-Theoretic Concepts in Computer Science | 2023-05-05 | Paper |
Approximation algorithms for priority Steiner tree problems
(available as arXiv preprint) | 2023-03-30 | Paper |
scientific article; zbMATH DE number 7651143 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7650284 (Why is no real title available?) | 2023-02-03 | Paper |
Weighted additive spanners
(available as arXiv preprint) | 2022-12-21 | Paper |
Polygons with prescribed angles in 2D and 3D
Journal of Graph Algorithms and Applications | 2022-11-14 | Paper |
Visualizing JIT compiler graphs
(available as arXiv preprint) | 2022-07-01 | Paper |
Packing trees into 1-planar graphs
Journal of Graph Algorithms and Applications | 2022-06-28 | Paper |
On additive spanners in weighted graphs with local error
(available as arXiv preprint) | 2022-06-08 | Paper |
Graph Drawing via Gradient Descent, $$(GD)^2$$
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Polygons with Prescribed Angles in 2D and 3D
Lecture Notes in Computer Science | 2021-12-01 | Paper |
The Turing Test for Graph Drawing Algorithms
Lecture Notes in Computer Science | 2021-12-01 | Paper |
The Turing Test for Graph Drawing Algorithms
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Graph spanners: a tutorial review
Computer Science Review | 2021-05-19 | Paper |
Multi-level Steiner trees
ACM Journal of Experimental Algorithmics | 2021-04-21 | Paper |
On area-universal quadrangulations
Journal of Graph Algorithms and Applications | 2021-03-29 | Paper |
Multi-Level Steiner Trees.
(available as arXiv preprint) | 2020-12-16 | Paper |
Computing stable Demers cartograms
(available as arXiv preprint) | 2020-10-26 | Paper |
| Computing stable Demers cartograms | 2020-10-26 | Paper |
Stress-Plus-X (SPX) graph layout
(available as arXiv preprint) | 2020-10-26 | Paper |
Symmetry detection and classification in drawings of graphs
(available as arXiv preprint) | 2020-10-26 | Paper |
Packing trees into 1-planar graphs
(available as arXiv preprint) | 2020-07-22 | Paper |
Weighted Additive Spanners
(available as arXiv preprint) | 2020-02-15 | Paper |
Online facility assignment
Theoretical Computer Science | 2020-01-16 | Paper |
| Lombardi drawings of knots and links | 2020-01-13 | Paper |
Recognition and drawing of stick graphs
Theoretical Computer Science | 2019-11-13 | Paper |
Packing Trees into 1-planar Graphs
(available as arXiv preprint) | 2019-11-05 | Paper |
The QuaSEFE Problem
(available as arXiv preprint) | 2019-08-23 | Paper |
Combinatorial and geometric properties of planar Laman graphs
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Planar and poly-arc Lombardi drawings
Journal of Computational Geometry | 2019-02-27 | Paper |
Drawing dynamic graphs without timeslices
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Drawing dynamic graphs without timeslices
Lecture Notes in Computer Science | 2019-02-20 | Paper |
On vertex- and empty-ply proximity drawings
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Lombardi drawings of knots and links
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Revisited experimental comparison of node-link and matrix representations
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Revisited experimental comparison of node-link and matrix representations
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Recognition and drawing of stick graphs
Lecture Notes in Computer Science | 2019-02-15 | Paper |
Turning cliques into paths to achieve planarity
(available as arXiv preprint) | 2019-02-15 | Paper |
Perception of symmetries in drawings of graphs
(available as arXiv preprint) | 2019-02-15 | Paper |
Same stats, different graphs (graph statistics and why we need graph drawings)
(available as arXiv preprint) | 2019-02-15 | Paper |
An experimental study on the ply number of straight-line drawings
Journal of Graph Algorithms and Applications | 2019-02-14 | Paper |
Orthogonal layout with optimal face complexity
Computational Geometry | 2018-11-01 | Paper |
Online facility assignment
WALCOM: Algorithms and Computation | 2018-06-15 | Paper |
| On the maximum crossing number | 2018-06-15 | Paper |
Approximating the generalized minimum Manhattan network problem
Algorithmica | 2018-05-23 | Paper |
On the planar split thickness of graphs
Algorithmica | 2018-04-11 | Paper |
Table cartogram
Computational Geometry | 2018-02-19 | Paper |
On the Maximum Crossing Number
Journal of Graph Algorithms and Applications | 2018-01-12 | Paper |
The maximum \(k\)-differential coloring problem
Journal of Discrete Algorithms | 2017-10-06 | Paper |
The geometric thickness of low degree graphs
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
An annotated bibliography on 1-planarity
Computer Science Review | 2017-09-28 | Paper |
An experimental study on the ply number of straight-line drawings
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Improved approximation algorithms for box contact representations
Algorithmica | 2017-04-12 | Paper |
Improved approximation algorithms for box contact representations
Algorithmica | 2017-04-12 | Paper |
Vertex-coloring with defects
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
Low Ply Drawings of Trees
Lecture Notes in Computer Science | 2017-02-21 | Paper |
On embeddability of buses in point sets
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Threshold-coloring and unit-cube contact representation of planar graphs
Discrete Applied Mathematics | 2016-11-24 | Paper |
Weak unit disk and interval representation of graphs
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Weak unit disk and interval representation of graphs
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
On the planar split thickness of graphs
Lecture Notes in Computer Science | 2016-05-03 | Paper |
On Contact Graphs with Cubes and Proportional Boxes
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Orthogonal layout with optimal face complexity
Lecture Notes in Computer Science | 2016-03-10 | Paper |
MapSets: visualizing embedded and clustered graphs
Journal of Graph Algorithms and Applications | 2016-01-07 | Paper |
Contact representations of graphs in 3D
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Contact Graphs of Circular Arcs
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Fitting planar graphs on planar maps
Journal of Graph Algorithms and Applications | 2015-10-29 | Paper |
Optimal constrained graph exploration
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Monotone drawings of graphs with fixed embedding
Algorithmica | 2015-05-26 | Paper |
Approximating minimum Manhattan networks in higher dimensions
Algorithmica | 2015-03-02 | Paper |
The maximum k-differential coloring problem
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Fitting Planar Graphs on Planar Maps
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
MapSets: visualizing embedded and clustered graphs
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Balanced circle packings for planar graphs
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Are crossings important for drawing large graphs?
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
A note on maximum differential coloring of planar graphs
Journal of Discrete Algorithms | 2014-11-24 | Paper |
Improved approximation algorithms for box contact representations
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Computing cartograms with optimal complexity
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Semantic word cloud representations: hardness and approximation algorithms
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Smooth Orthogonal Drawings of Planar Graphs
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Embedding, clustering and coloring for dynamic maps
Journal of Graph Algorithms and Applications | 2014-01-22 | Paper |
Approximating the generalized minimum Manhattan network problem
Algorithms and Computation | 2014-01-14 | Paper |
Straight-line grid drawings of 3-connected 1-planar graphs
Graph Drawing | 2013-12-20 | Paper |
Equilateral L-contact graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Threshold-coloring and unit-cube contact representation of graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Linear-time algorithms for hole-free rectilinear proportional contact graph representations
Algorithmica | 2013-11-11 | Paper |
Computing cartograms with optimal complexity
Discrete & Computational Geometry | 2013-11-06 | Paper |
Smooth orthogonal layouts
Journal of Graph Algorithms and Applications | 2013-10-29 | Paper |
Table cartograms
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Planar preprocessing for spring embedders
Graph Drawing | 2013-04-03 | Paper |
Smooth orthogonal layouts
Graph Drawing | 2013-04-03 | Paper |
On the usability of Lombardi graph drawings
Graph Drawing | 2013-04-03 | Paper |
On representing graphs by touching cuboids
Graph Drawing | 2013-04-03 | Paper |
Touching triangle representations for 3-connected planar graphs
Graph Drawing | 2013-04-03 | Paper |
Proportional contact representations of 4-connected planar graphs
Graph Drawing | 2013-04-03 | Paper |
Drawing trees with perfect angular resolution and polynomial area
Discrete & Computational Geometry | 2013-03-20 | Paper |
| On Maximum Differential Coloring of Planar Graphs | 2013-02-28 | Paper |
Proportional Contact Representations of Planar Graphs
Journal of Graph Algorithms and Applications | 2012-12-07 | Paper |
Optimal polygonal representation of planar graphs
Algorithmica | 2012-04-26 | Paper |
Planar and poly-arc Lombardi drawings
Lecture Notes in Computer Science | 2012-03-09 | Paper |
Monotone Drawings of Graphs with Fixed Embedding
Graph Drawing | 2012-03-09 | Paper |
Force-directed Lombardi-style graph drawing
Graph Drawing | 2012-03-09 | Paper |
Proportional contact representations of planar graphs
Graph Drawing | 2012-03-09 | Paper |
Lombardi drawings of graphs
Journal of Graph Algorithms and Applications | 2012-01-12 | Paper |
Linear-time algorithms for hole-free rectilinear proportional contact graph representations
Algorithms and Computation | 2011-12-16 | Paper |
Approximating minimum Manhattan networks in higher dimensions
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Colored simultaneous geometric embeddings and universal pointsets
Algorithmica | 2011-06-30 | Paper |
Planar drawings of higher-genus graphs
Journal of Graph Algorithms and Applications | 2011-04-19 | Paper |
Lombardi Drawings of Graphs
Graph Drawing | 2011-02-11 | Paper |
On graphs supported by line sets
Graph Drawing | 2011-02-11 | Paper |
On touching triangle graphs
Graph Drawing | 2011-02-11 | Paper |
Drawing Trees with Perfect Angular Resolution and Polynomial Area
Graph Drawing | 2011-02-11 | Paper |
On maximum differential graph coloring
Graph Drawing | 2011-02-11 | Paper |
Planar drawings of higher-genus graphs
Graph Drawing | 2010-04-27 | Paper |
Optimal polygonal representation of planar graphs
Lecture Notes in Computer Science | 2010-04-27 | Paper |
On the characterization of level planar trees by minimal patterns
Graph Drawing | 2010-04-27 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Constrained simultaneous and near-simultaneous embeddings
Journal of Graph Algorithms and Applications | 2010-02-04 | Paper |
Error-correcting graphs for software watermarking.
Lecture Notes in Computer Science | 2010-01-12 | Paper |
Upward straight-line embeddings of directed graphs into point sets
Computational Geometry | 2009-11-16 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Characterization of unlabeled level planar trees
Computational Geometry | 2009-07-27 | Paper |
Graph Simultaneous Embedding Tool, GraphSET
Graph Drawing | 2009-03-03 | Paper |
Upward Straight-Line Embeddings of Directed Graphs into Point Sets
Graph-Theoretic Concepts in Computer Science | 2009-01-20 | Paper |
Fixed-Location Circular Arc Drawing of Planar Graphs
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Fixed-Location Circular Arc Drawing of Planar Graphs
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Morphing Planar Graphs in Spherical Space
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Morphing Planar Graphs in Spherical Space
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Simultaneous Embedding of Planar Graphs with Few Bends
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Simultaneous Embedding of Planar Graphs with Few Bends
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Simultaneous graph embedding with bends and circular arcs
Computational Geometry | 2008-11-19 | Paper |
Graph Drawing Contest Report
Graph Drawing | 2008-03-25 | Paper |
Characterization of Unlabeled Level Planar Graphs
Graph Drawing | 2008-03-25 | Paper |
Minimum Level Nonplanar Patterns for Trees
Graph Drawing | 2008-03-25 | Paper |
Constrained Simultaneous and Near-Simultaneous Embeddings
Graph Drawing | 2008-03-25 | Paper |
Graph-Drawing Contest Report
Graph Drawing | 2007-08-28 | Paper |
Morphing Planar Graphs in Spherical Space
Graph Drawing | 2007-08-28 | Paper |
Characterization of Unlabeled Level Planar Trees
Graph Drawing | 2007-08-28 | Paper |
Simultaneous Graph Embedding with Bends and Circular Arcs
Graph Drawing | 2007-08-28 | Paper |
On simultaneous planar graph embeddings
Computational Geometry | 2006-12-14 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Computing homotopic shortest paths efficiently
Computational Geometry | 2006-10-25 | Paper |
DRAWING WITH FAT EDGES
International Journal of Foundations of Computer Science | 2006-10-16 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Simultaneous embedding of a planar graph and its dual on the grid
Theory of Computing Systems | 2005-06-14 | Paper |
Polar Coordinate Drawing of Planar Graphs with Good Angular Resolution
Journal of Graph Algorithms and Applications | 2005-05-25 | Paper |
A multi-dimensional approach to force-directed layouts of large graphs
Computational Geometry | 2004-10-13 | Paper |
Tight bounds on maximal and maximum matchings
Discrete Mathematics | 2004-08-19 | Paper |
| scientific article; zbMATH DE number 2084293 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2084275 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2080101 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080100 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081000 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1979531 (Why is no real title available?) | 2003-09-14 | Paper |
| scientific article; zbMATH DE number 1947410 (Why is no real title available?) | 2003-07-08 | Paper |
GRIP: Graph Drawing with Intelligent Placement
Journal of Graph Algorithms and Applications | 2003-06-23 | Paper |
Planarity-preserving clustering and embedding for large planar graphs
Computational Geometry | 2003-04-28 | Paper |
| Optimal constrained graph exploration | 2002-09-11 | Paper |
Drawing planar graphs with circular arcs
Discrete & Computational Geometry | 2001-10-10 | Paper |
Balanced aspect ratio trees: Combining the advantages of \(k\)-\(d\) trees and octrees
Journal of Algorithms | 2001-10-07 | Paper |
Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs
Journal of Graph Algorithms and Applications | 2001-01-03 | Paper |
Balanced Aspect Ratio Trees and Their Use for Drawing Large Graphs
Journal of Graph Algorithms and Applications | 2001-01-03 | Paper |
| scientific article; zbMATH DE number 1500683 (Why is no real title available?) | 2000-09-04 | Paper |
| scientific article; zbMATH DE number 1305419 (Why is no real title available?) | 2000-04-13 | Paper |
