| Publication | Date of Publication | Type |
|---|
| Adjacency graphs of polyhedral surfaces | 2026-04-27 | Paper |
Deciding the feasibility and minimizing the height of tangles
Journal of Graph Algorithms and Applications | 2026-04-22 | Paper |
Morphing graph drawings in the presence of point obstacles
Journal of Computer and System Sciences | 2026-02-11 | Paper |
| Eliminating crossings in ordered graphs | 2025-12-02 | Paper |
| Constrained and ordered level planarity parameterized by the number of levels | 2025-11-24 | Paper |
Outside-obstacle representations with all vertices on the outer face
CGT. Computing in Geometry and Topology | 2025-10-21 | Paper |
| Graph harvester (software abstract) | 2025-10-07 | Paper |
| Storylines with a protagonist | 2025-10-07 | Paper |
| Bounding the treewidth of outer k-planar graphs via triangulations | 2025-10-07 | Paper |
| The price of upwardness | 2025-10-07 | Paper |
Parameterized approaches to orthogonal compaction
Journal of Computer and System Sciences | 2025-09-29 | Paper |
Constrained and ordered level planarity parameterized by the number of levels
Journal of Computational Geometry | 2025-08-28 | Paper |
| Coloring and recognizing mixed interval graphs | 2025-07-24 | Paper |
| Bounding and computing obstacle numbers of graphs | 2025-06-19 | Paper |
| The parametrized complexity of the segment number | 2024-10-14 | Paper |
| A simple pipeline for orthogonal graph drawing | 2024-10-14 | Paper |
Bounding and computing obstacle numbers of graphs
SIAM Journal on Discrete Mathematics | 2024-05-22 | Paper |
Adjacency graphs of polyhedral surfaces
Discrete & Computational Geometry | 2024-05-21 | Paper |
The Computational Complexity of the ChordLink Model
Journal of Graph Algorithms and Applications | 2023-12-20 | Paper |
Morphing planar graph drawings through 3D
CGT. Computing in Geometry and Topology | 2023-12-16 | Paper |
| Planar L-drawings of directed graphs | 2023-12-16 | Paper |
scientific article; zbMATH DE number 7759289 (Why is no real title available?)
(available as arXiv preprint) | 2023-11-02 | Paper |
The Complexity of Drawing Graphs on Few Lines and Few Planes
Journal of Graph Algorithms and Applications | 2023-09-20 | Paper |
Coloring mixed and directional interval graphs
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Morphing rectangular duals
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Outside-obstacle representations with all vertices on the outer face
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Parameterized approaches to orthogonal compaction
Lecture Notes in Computer Science | 2023-08-14 | Paper |
The complexity of finding tangles
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Visualizing multispecies coalescent trees: drawing gene trees inside species trees
Lecture Notes in Computer Science | 2023-08-14 | Paper |
Morphing planar graph drawings through 3D
Lecture Notes in Computer Science | 2023-08-14 | Paper |
An efficient and effective approximation algorithm for the Map Labeling Problem
Lecture Notes in Computer Science | 2023-05-08 | 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 |
Extending partial representations of rectangular duals with given contact orientations
(available as arXiv preprint) | 2023-03-22 | Paper |
scientific article; zbMATH DE number 7561415 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Layered drawing of undirected graphs with generalized port constraints
Computational Geometry | 2022-06-13 | Paper |
Simple algorithms for partial and simultaneous rectangular duals with given contact orientations
Theoretical Computer Science | 2022-05-10 | Paper |
Minimum rectilinear polygons for given angle sequences
Computational Geometry | 2021-12-15 | Paper |
Layered Drawing of Undirected Graphs with Generalized Port Constraints
Lecture Notes in Computer Science | 2021-12-01 | Paper |
Multi-level Steiner trees
ACM Journal of Experimental Algorithmics | 2021-04-21 | Paper |
Recognizing stick graphs with and without length constraints
Journal of Graph Algorithms and Applications | 2020-12-18 | Paper |
Bundled crossings revisited
Journal of Graph Algorithms and Applications | 2020-12-18 | Paper |
Multi-Level Steiner Trees.
(available as arXiv preprint) | 2020-12-16 | Paper |
| Drawing graphs on few lines and few planes | 2020-11-12 | Paper |
On arrangements of orthogonal circles
(available as arXiv preprint) | 2020-10-26 | Paper |
Stick graphs with length constraints
(available as arXiv preprint) | 2020-10-26 | Paper |
Representing graphs and hypergraphs by touching polygons in 3D
(available as arXiv preprint) | 2020-10-26 | Paper |
Bundled crossings revisited
(available as arXiv preprint) | 2020-10-26 | Paper |
Computing height-optimal tangles faster
(available as arXiv preprint) | 2020-10-26 | Paper |
Line and plane cover numbers revisited
(available as arXiv preprint) | 2020-10-26 | Paper |
Variants of the segment number of a graph
(available as arXiv preprint) | 2020-10-26 | Paper |
Angle covers: algorithms and complexity
(available as arXiv preprint) | 2020-07-22 | Paper |
| Analysis of expression profile and gene variation via development of methods for next generation sequencing data | 2020-01-28 | Paper |
| Analysis of expression profile and gene variation via development of methods for next generation sequencing data | 2020-01-28 | Paper |
Compact drawings of 1-planar graphs with right-angle crossings and few bends
Computational Geometry | 2019-10-25 | Paper |
Drawing binary tanglegrams: an experimental evaluation
2009 Proceedings of the Eleventh Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Drawing graphs on few circles and few spheres
Journal of Graph Algorithms and Applications | 2019-07-12 | Paper |
Faster force-directed graph drawing with the well-separated pair decomposition
Algorithms | 2019-03-26 | Paper |
Beyond outerplanarity
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Planar L-drawings of directed graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Computing storyline visualizations with few block crossings
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Compact drawings of 1-planar graphs with right-angle crossings and few bends
Lecture Notes in Computer Science | 2019-02-15 | Paper |
The hardness of approximating set cover
Lectures on Proof Verification and Approximation Algorithms | 2018-07-03 | Paper |
| On the maximum crossing number | 2018-06-15 | Paper |
Drawing graphs on few circles and few spheres
(available as arXiv preprint) | 2018-06-05 | Paper |
Approximating the generalized minimum Manhattan network problem
Algorithmica | 2018-05-23 | Paper |
On the Maximum Crossing Number
Journal of Graph Algorithms and Applications | 2018-01-12 | Paper |
Progress on partial edge drawings
Journal of Graph Algorithms and Applications | 2017-10-12 | Paper |
Block crossings in storyline visualizations
Journal of Graph Algorithms and Applications | 2017-10-12 | Paper |
The complexity of drawing graphs on few lines and few planes
(available as arXiv preprint) | 2017-09-22 | 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 |
| Cover contact graphs | 2017-03-09 | Paper |
Obstructing visibilities with one obstacle
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Drawing Graphs on Few Lines and Few Planes
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Drawing Graphs on Few Lines and Few Planes
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Snapping graph drawings to the grid optimally
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Block Crossings in Storyline Visualizations
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Pixel and voxel representations of graphs
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Minimum rectilinear polygons for given angle sequences
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Multi-sided boundary labeling
Algorithmica | 2016-11-01 | Paper |
Simultaneous drawing of planar graphs with right-angle crossings and few bends
Journal of Graph Algorithms and Applications | 2016-03-03 | Paper |
Colored Non-crossing Euclidean Steiner Forest
Algorithms and Computation | 2016-01-11 | Paper |
Ordering metro lines by block crossings
Journal of Graph Algorithms and Applications | 2015-03-04 | Paper |
Approximating minimum Manhattan networks in higher dimensions
Algorithmica | 2015-03-02 | Paper |
Simultaneous drawing of planar graphs with right-angle crossings and few bends
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
On monotone drawings of trees
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Drawing graphs within restricted area
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Improved approximation algorithms for box contact representations
Algorithms - ESA 2014 | 2014-10-08 | Paper |
Computing large matchings fast
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Universal Point Sets for Drawing Planar Graphs with Circular Arcs
Journal of Graph Algorithms and Applications | 2014-06-10 | 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 |
Approximating the generalized minimum Manhattan network problem
Algorithms and Computation | 2014-01-14 | Paper |
Two-sided boundary labeling with adjacent sides
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Augmenting the connectivity of planar and geometric graphs
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Drawing metro maps using Bézier curves
Graph Drawing | 2013-04-03 | Paper |
Progress on partial edge drawings
Graph Drawing | 2013-04-03 | Paper |
| Trimming of graphs, with application to point labeling | 2013-03-19 | Paper |
Trimming of graphs, with application to point labeling
(available as arXiv preprint) | 2013-03-19 | Paper |
Augmenting the connectivity of planar and geometric graphs
Journal of Graph Algorithms and Applications | 2012-12-04 | Paper |
Approximation algorithms for the maximum leaf spanning tree problem on acyclic digraphs
Approximation and Online Algorithms | 2012-07-16 | Paper |
Drawing graphs with vertices at specified positions and crossings at large angles
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
Drawing (complete) binary tanglegrams
Algorithmica | 2012-04-26 | Paper |
Drawing Graphs with Vertices at Specified Positions and Crossings at Large Angles
Graph Drawing | 2012-03-09 | Paper |
| The traveling salesman problem under squared Euclidean distances | 2012-01-23 | Paper |
Approximating minimum Manhattan networks in higher dimensions
Lecture Notes in Computer Science | 2011-09-16 | Paper |
Trimming of graphs, with application to point labeling
Theory of Computing Systems | 2010-10-06 | Paper |
| scientific article; zbMATH DE number 5764781 (Why is no real title available?) | 2010-08-06 | Paper |
Manhattan-geodesic embedding of planar graphs
Graph Drawing | 2010-04-27 | Paper |
Untangling a planar graph
Discrete & Computational Geometry | 2009-12-14 | Paper |
Optimizing active ranges for consistent dynamic map labeling
Computational Geometry | 2009-11-16 | Paper |
A POLYNOMIAL-TIME APPROXIMATION ALGORITHM FOR A GEOMETRIC DISPERSION PROBLEM
International Journal of Computational Geometry & Applications | 2009-07-20 | Paper |
CONSTRUCTING OPTIMAL HIGHWAYS
International Journal of Foundations of Computer Science | 2009-04-14 | Paper |
Drawing (Complete) Binary Tanglegrams
Graph Drawing | 2009-03-03 | Paper |
Optimizing active ranges for consistent dynamic map labeling
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Matching points with rectangles and squares
Computational Geometry | 2008-11-19 | Paper |
CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER
International Journal of Computational Geometry & Applications | 2008-09-29 | Paper |
Decomposing a simple polygon into pseudo-triangles and convex polygons
Computational Geometry | 2008-07-29 | Paper |
Constructing minimum-interference networks
Computational Geometry | 2008-06-18 | Paper |
A practical map labeling algorithm.
Computational Geometry | 2008-04-25 | Paper |
Delineating boundaries for imprecise regions
Algorithmica | 2008-04-03 | Paper |
Moving Vertices to Make Drawings Plane
Graph Drawing | 2008-03-25 | Paper |
Cover Contact Graphs
Graph Drawing | 2008-03-25 | Paper |
The Minimum Manhattan Network Problem: A Fast Factor-3 Approximation
Discrete and Computational Geometry | 2008-03-18 | Paper |
Farthest-Point Queries with Geometric and Combinatorial Constraints
Discrete and Computational Geometry | 2008-03-18 | Paper |
Untangling a Planar Graph
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
Straightening Drawings of Clustered Hierarchical Graphs
Lecture Notes in Computer Science | 2008-03-07 | Paper |
A Polynomial-Time Approximation Algorithm for a Geometric Dispersion Problem
Lecture Notes in Computer Science | 2007-09-10 | Paper |
Minimizing Intra-edge Crossings in Wiring Diagrams and Public Transportation Maps
Graph Drawing | 2007-08-28 | Paper |
Configurations with few crossings in topological graphs
Computational Geometry | 2007-04-18 | Paper |
Boundary labeling: Models and efficient algorithms for rectangular maps
Computational Geometry | 2007-02-19 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
The minimum Manhattan network problem: Approximations and exact solutions
Computational Geometry | 2006-10-25 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry | 2006-04-28 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
LABELING POINTS WITH CIRCLES
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
Optimal spanners for axis-aligned rectangles
Computational Geometry | 2005-02-09 | Paper |
Labeling points with weights
Algorithmica | 2004-12-02 | Paper |
A SIMPLE FACTOR-2/3 APPROXIMATION ALGORITHM FOR TWO-CIRCLE POINT LABELING
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
| scientific article; zbMATH DE number 2081025 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2081028 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2080265 (Why is no real title available?) | 2004-08-04 | Paper |
Facility location and the geometric minimum-diameter spanning tree.
Computational Geometry | 2004-01-23 | Paper |
| scientific article; zbMATH DE number 1947054 (Why is no real title available?) | 2003-07-07 | Paper |
Three rules suffice for good label placement
Algorithmica | 2002-05-14 | Paper |
| scientific article; zbMATH DE number 1670674 (Why is no real title available?) | 2001-12-18 | Paper |
Point labeling with sliding labels
Computational Geometry | 2000-02-09 | Paper |
Bounding and computing obstacle numbers of graphs
(available as arXiv preprint) | N/A | Paper |
