| Publication | Date of Publication | Type |
|---|
Rectilinear-upward planarity testing of digraphs
Journal of Computer and System Sciences | 2026-03-12 | Paper |
| Eliminating crossings in ordered graphs | 2025-12-02 | Paper |
Drawing graphs with k vertices per face: complexity and algorithms
Theoretical Computer Science | 2025-12-02 | Paper |
| On the complexity of recognizing k^+-real face graphs | 2025-10-07 | Paper |
| Improving the crossing lemma by characterizing dense 2-planar and 3-planar graphs | 2025-10-07 | Paper |
| On k-planar graphs without short cycles | 2025-10-07 | Paper |
| Monotone arc diagrams with few biarcs | 2025-10-07 | Paper |
| The density formula: one lemma to bound them all | 2025-10-07 | Paper |
| Rectilinear-upward planarity testing of digraphs | 2025-07-24 | Paper |
Min-k-planar drawings of graphs
Journal of Graph Algorithms and Applications | 2024-10-08 | Paper |
| Min-\(k\)-planar drawings of graphs | 2024-06-21 | Paper |
| Nonplanar Graph Drawings with k Vertices per Face | 2024-05-03 | Paper |
Rectilinear Planarity of Partial 2-Trees
Journal of Graph Algorithms and Applications | 2023-12-20 | Paper |
k-Planar Placement and Packing of Δ-Regular Caterpillars
International Journal of Foundations of Computer Science | 2023-11-16 | Paper |
Computing bend-minimum orthogonal drawings of plane series-parallel graphs in linear time
Algorithmica | 2023-09-27 | Paper |
Rectilinear planarity of partial 2-trees
Lecture Notes in Computer Science | 2023-08-16 | Paper |
Beyond the worst-case bisection bound: Fast sorting and ranking on meshes
Lecture Notes in Computer Science | 2023-05-08 | Paper |
| scientific article; zbMATH DE number 7651192 (Why is no real title available?) | 2023-02-07 | Paper |
On triangulating planar graphs under the four-connectivity constraint
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
Optimal multi-packet routing on the torus
Algorithm Theory — SWAT '92 | 2022-12-09 | Paper |
Shorter queues for permutation routing on meshes
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
| Area-efficient static and incremental graph drawings | 2021-12-20 | Paper |
| Solving rectilinear Steiner tree problems exactly in theory and practice | 2021-12-20 | Paper |
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
Lecture Notes in Computer Science | 2021-12-01 | Paper |
On dispersable book embeddings
Theoretical Computer Science | 2021-03-09 | Paper |
The QuaSEFE Problem
(available as arXiv preprint) | 2019-08-23 | Paper |
On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings
Algorithmica | 2019-05-07 | Paper |
An Interactive Tool to Explore and Improve the Ply Number of Drawings
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 |
1-fan-bundle-planar drawings of graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
On smooth orthogonal and octilinear drawings: relations, complexity and Kandinsky drawings
Lecture Notes in Computer Science | 2019-02-20 | Paper |
On dispersable book embeddings
Lecture Notes in Computer Science | 2018-11-22 | Paper |
Small universal point sets for \(k\)-outerplanar graphs
Discrete & Computational Geometry | 2018-10-30 | Paper |
The number of crossings in multigraphs with no empty lens
(available as arXiv preprint) | 2018-08-30 | Paper |
On Optimal 2- and 3-Planar Graphs
(available as arXiv preprint) | 2018-08-13 | Paper |
Planar bus graphs
Algorithmica | 2018-07-25 | Paper |
| Bounded stub resolution for some maximal 1-planar graphs | 2018-06-05 | Paper |
1-fan-bundle-planar drawings of graphs
Theoretical Computer Science | 2018-04-04 | Paper |
Table cartogram
Computational Geometry | 2018-02-19 | Paper |
Progress on partial edge drawings
Journal of Graph Algorithms and Applications | 2017-10-12 | Paper |
On the recognition of fan-planar and maximal outer-fan-planar graphs
Algorithmica | 2017-10-10 | Paper |
The book thickness of 1-planar graphs is constant
Algorithmica | 2017-10-10 | Paper |
The maximum \(k\)-differential coloring problem
Journal of Discrete Algorithms | 2017-10-06 | Paper |
| Algorithms and Insights for RaceTrack | 2017-07-17 | Paper |
On the total number of bends for planar octilinear drawings
Journal of Graph Algorithms and Applications | 2017-07-13 | Paper |
Vertex-coloring with defects
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
On the density of non-simple 3-planar graphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Low Ply Drawings of Trees
Lecture Notes in Computer Science | 2017-02-21 | Paper |
A universal point set for 2-outerplanar graphs
Lecture Notes in Computer Science | 2017-02-10 | Paper |
The book embedding problem from a SAT-solving perspective
Lecture Notes in Computer Science | 2017-02-10 | 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 |
Vertex-coloring with star-defects
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
On the Total Number of Bends for Planar Octilinear Drawings
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
On Contact Graphs with Cubes and Proportional Boxes
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Planar octilinear drawings with one bend per edge
Journal of Graph Algorithms and Applications | 2016-01-07 | Paper |
Many-to-one boundary labeling with backbones
Journal of Graph Algorithms and Applications | 2016-01-07 | Paper |
A new approach to partial MUS enumeration
Lecture Notes in Computer Science | 2015-11-20 | Paper |
1-planar graphs have constant book thickness
Lecture Notes in Computer Science | 2015-11-19 | 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 |
Approximating minimum Manhattan networks in higher dimensions
Algorithmica | 2015-03-02 | Paper |
On bar \((1, j)\)-visibility graphs (extended abstract)
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
The maximum k-differential coloring problem
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Bar 1-visibility graphs and their relation to other nearly planar graphs
Journal of Graph Algorithms and Applications | 2015-01-15 | Paper |
Slanted orthogonal drawings: model, algorithms and evaluations
Journal of Graph Algorithms and Applications | 2015-01-15 | Paper |
Fitting Planar Graphs on Planar Maps
SOFSEM 2014: Theory and Practice of Computer Science | 2015-01-13 | Paper |
On the recognition of fan-planar and maximal outer-fan-planar graphs
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Planar octilinear drawings with one bend per edge
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 |
Computing cartograms with optimal complexity
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Universal Point Sets for Drawing Planar Graphs with Circular Arcs
Journal of Graph Algorithms and Applications | 2014-06-10 | Paper |
On the upward planarity of mixed plane graphs
Journal of Graph Algorithms and Applications | 2014-05-22 | Paper |
Smooth Orthogonal Drawings of Planar Graphs
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
1-bend orthogonal partial edge drawing
Journal of Graph Algorithms and Applications | 2014-03-24 | Paper |
Bend-optimal orthogonal graph drawing in the general position model
Computational Geometry | 2014-01-22 | Paper |
On the area requirements of Euclidean minimum spanning trees
Computational Geometry | 2014-01-22 | Paper |
Many-to-one boundary labeling with backbones
Graph Drawing | 2013-12-20 | Paper |
On the upward planarity of mixed plane graphs
Graph Drawing | 2013-12-20 | Paper |
Slanted orthogonal drawings
Graph Drawing | 2013-12-20 | 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 packing of binary trees
Lecture Notes in Computer Science | 2013-08-12 | Paper |
On the Characterization of Plane Bus Graphs
Lecture Notes in Computer Science | 2013-06-07 | Paper |
On upward point set embeddability
Computational Geometry | 2013-04-29 | Paper |
Approximate proximity drawings
Computational Geometry | 2013-04-29 | Paper |
Progress on partial edge drawings
Graph Drawing | 2013-04-03 | Paper |
Smooth orthogonal layouts
Graph Drawing | 2013-04-03 | Paper |
Geometric RAC simultaneous drawings of graphs
Journal of Graph Algorithms and Applications | 2013-01-07 | Paper |
Large angle crossing drawings of planar graphs in subquadratic area
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Proportional Contact Representations of Planar Graphs
Journal of Graph Algorithms and Applications | 2012-12-07 | Paper |
Vertex angle and crossing angle resolution of leveled tree drawings
Information Processing Letters | 2012-10-23 | Paper |
Geometric RAC Simultaneous Drawings of Graphs
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Optimal polygonal representation of planar graphs
Algorithmica | 2012-04-26 | Paper |
Proportional contact representations of planar graphs
Graph Drawing | 2012-03-09 | Paper |
Approximate proximity drawings
Graph Drawing | 2012-03-09 | Paper |
Upward point set embeddability for convex point sets is in P
Graph Drawing | 2012-03-09 | Paper |
Small point sets for simply-nested planar graphs
Graph Drawing | 2012-03-09 | Paper |
Combining problems on RAC drawings and simultaneous graph drawings
Graph Drawing | 2012-03-09 | Paper |
On a tree and a path with no geometric simultaneous embedding
Journal of Graph Algorithms and Applications | 2012-01-12 | Paper |
Polynomial area bounds for MST embeddings of trees
Computational Geometry | 2011-12-28 | 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 |
On the area requirements of Euclidean minimum spanning trees
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Colored simultaneous geometric embeddings and universal pointsets
Algorithmica | 2011-06-30 | Paper |
On the perspectives opened by right angle crossing drawings
Journal of Graph Algorithms and Applications | 2011-04-19 | Paper |
Straight-line rectangular drawings of clustered graphs
Discrete & Computational Geometry | 2011-03-10 | Paper |
Upward Point-Set Embeddability
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Combining traditional map labeling with boundary labeling
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
Upward geometric graph embeddings into point sets
Graph Drawing | 2011-02-11 | Paper |
On a tree and a path with no geometric simultaneous embedding
Graph Drawing | 2011-02-11 | Paper |
Improving layered graph layouts with edge bundling
Graph Drawing | 2011-02-11 | Paper |
Comparing trees via crossing minimization
Journal of Computer and System Sciences | 2010-08-18 | Paper |
Max-tolerance graphs as intersection graphs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Solving cheap graph problems on Meshes
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Planar packing of trees and spider trees
Information Processing Letters | 2010-06-16 | Paper |
Boundary labeling with octilinear leaders
Algorithmica | 2010-05-19 | Paper |
On the perspectives opened by right angle crossing drawings
Graph Drawing | 2010-04-27 | Paper |
Optimal polygonal representation of planar graphs
Lecture Notes in Computer Science | 2010-04-27 | Paper |
On metro-line crossing minimization
Journal of Graph Algorithms and Applications | 2010-02-04 | Paper |
Constrained simultaneous and near-simultaneous embeddings
Journal of Graph Algorithms and Applications | 2010-02-04 | Paper |
On Map Labeling with Leaders
Lecture Notes in Computer Science | 2009-11-12 | Paper |
Straight-Line Rectangular Drawings of Clustered Graphs
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Modeling and Designing Real–World Networks
Algorithmics of Large and Complex Networks | 2009-07-09 | Paper |
Two trees which are self-intersecting when drawn simultaneously
Discrete Mathematics | 2009-04-09 | Paper |
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem
Graph Drawing | 2009-03-03 | Paper |
Subdivision Drawings of Hypergraphs
Graph Drawing | 2009-03-03 | Paper |
An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Efficient Labeling of Collinear Sites
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Packing and Squeezing Subgraphs into Planar Graphs
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Fixed parameter algorithms for one-sided crossing minimization revisited
Journal of Discrete Algorithms | 2008-08-08 | Paper |
Boundary Labeling with Octilinear Leaders
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Computation of Renameable Horn Backdoors
Theory and Applications of Satisfiability Testing – SAT 2008 | 2008-05-27 | Paper |
A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors
Theory and Applications of Satisfiability Testing – SAT 2008 | 2008-05-27 | Paper |
Multi-stack Boundary Labeling Problems
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Line Crossing Minimization on Metro Maps
Graph Drawing | 2008-03-25 | Paper |
Polynomial Area Bounds for MST Embeddings of Trees
Graph Drawing | 2008-03-25 | Paper |
Constrained Simultaneous and Near-Simultaneous Embeddings
Graph Drawing | 2008-03-25 | Paper |
Boundary labeling: Models and efficient algorithms for rectangular maps
Computational Geometry | 2007-02-19 | Paper |
FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
DESIGNING PARALLEL ALGORITHMS FOR HIERARCHICAL SMP CLUSTERS
International Journal of Foundations of Computer Science | 2005-10-19 | Paper |
| scientific article; zbMATH DE number 2086773 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2084303 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2084272 (Why is no real title available?) | 2004-08-06 | Paper |
An Approach for Mixed Upward Planarization
Journal of Graph Algorithms and Applications | 2003-11-30 | Paper |
| scientific article; zbMATH DE number 1974102 (Why is no real title available?) | 2003-09-03 | Paper |
| scientific article; zbMATH DE number 1974103 (Why is no real title available?) | 2003-09-03 | Paper |
| scientific article; zbMATH DE number 1945160 (Why is no real title available?) | 2003-07-02 | Paper |
| scientific article; zbMATH DE number 1830748 (Why is no real title available?) | 2002-11-18 | Paper |
Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
Journal of Graph Algorithms and Applications | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1500681 (Why is no real title available?) | 2001-01-29 | Paper |
| scientific article; zbMATH DE number 1555950 (Why is no real title available?) | 2001-01-24 | Paper |
| scientific article; zbMATH DE number 1555952 (Why is no real title available?) | 2001-01-24 | Paper |
On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
Algorithmica | 2000-12-12 | Paper |
| scientific article; zbMATH DE number 1445279 (Why is no real title available?) | 2000-05-10 | Paper |
| scientific article; zbMATH DE number 1414312 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1262793 (Why is no real title available?) | 1999-03-15 | Paper |
On triangulating planar graphs under the four-connectivity constraint
Algorithmica | 1998-10-11 | Paper |
| scientific article; zbMATH DE number 1026283 (Why is no real title available?) | 1997-10-16 | Paper |
Deterministic Permutation Routing on Meshes
Journal of Algorithms | 1997-10-13 | Paper |
| scientific article; zbMATH DE number 1003300 (Why is no real title available?) | 1997-10-05 | Paper |
Faster approximation algorithms for the rectilinear Steiner tree problem
Discrete & Computational Geometry | 1997-07-28 | Paper |
Randomized multipacket routing and sorting on meshes
Algorithmica | 1997-06-30 | Paper |
On local routing of two-terminal nets
Journal of Combinatorial Theory. Series B | 1995-02-07 | Paper |
Channel routing of multiterminal nets
Journal of the ACM | 1994-11-20 | Paper |
Drawing Graphs in the Plane with High Resolution
SIAM Journal on Computing | 1994-10-10 | Paper |
A Linear-Time Algorithm for the Homotopic Routing Problem in Grid Graphs
SIAM Journal on Computing | 1994-05-10 | Paper |
Routing in polygons without rectilinearly visible corners
Information and Computation | 1993-05-16 | Paper |
Parity conditions in homotopic knock-knee routing
Algorithmica | 1993-04-01 | Paper |
| scientific article; zbMATH DE number 139794 (Why is no real title available?) | 1993-03-28 | Paper |
Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
Algorithmica | 1993-01-17 | Paper |
| scientific article; zbMATH DE number 4191147 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4083048 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4039320 (Why is no real title available?) | 1987-01-01 | Paper |
Routing through a generalized switchbox
Journal of Algorithms | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3932954 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3910313 (Why is no real title available?) | 1984-01-01 | Paper |
The Density Formula: One Lemma to Bound Them All
(available as arXiv preprint) | N/A | Paper |
