| Publication | Date of Publication | Type |
|---|
Computing conforming partitions with low stabbing number for rectilinear polygons
Information and Computation | 2026-03-20 | Paper |
Approximation algorithms for minimum ply covering of points with unit squares and unit disks
Theoretical Computer Science | 2024-12-12 | Paper |
On the oriented diameter of planar triangulations
Journal of Combinatorial Optimization | 2024-11-28 | Paper |
StreamTable: an area proportional visualization for tables with flowing streams
CGT. Computing in Geometry and Topology | 2024-11-18 | Paper |
| On the 3-tree core of plane graphs | 2024-11-12 | Paper |
| Finding a maximum clique in a disk graph | 2024-10-16 | Paper |
| Linear-time rectilinear drawings of subdivisions of triconnected cubic planar graphs with orthogonally convex faces | 2024-04-09 | Paper |
Relating planar graph drawings to planar satisfiability problems
Information Processing Letters | 2024-03-26 | Paper |
Minimum ply covering of points with unit squares
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Improved and generalized algorithms for burning a planar point set
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Improved and generalized algorithms for burning a planar point set
WALCOM: Algorithms and Computation | 2023-11-24 | Paper |
Minimum shared‐power edge cut
Networks | 2023-11-15 | Paper |
| Parameterized complexity of two-interval pattern problem | 2023-11-02 | Paper |
Bounds for the oriented diameter of planar triangulations
Frontiers of Algorithmic Wisdom | 2023-08-03 | Paper |
Bottleneck Convex Subsets: Finding k Large Convex Sets in a Point Set
International Journal of Computational Geometry & Applications | 2023-07-21 | Paper |
Token Swapping on Trees
Discrete Mathematics & Theoretical Computer Science | 2023-05-31 | Paper |
Drawing partial 2-trees with few slopes
Algorithmica | 2023-04-28 | Paper |
Emanation graph: a plane geometric spanner with Steiner points
Graphs and Combinatorics | 2023-04-24 | Paper |
Bottleneck convex subsets: finding \(k\) large convex sets in a point set
(available as arXiv preprint) | 2023-03-30 | Paper |
Finding a Maximum Clique in a Grounded 1-Bend String Graph
Journal of Graph Algorithms and Applications | 2023-03-30 | Paper |
The complexity of drawing a graph in a polygonal region
Journal of Graph Algorithms and Applications | 2022-11-14 | Paper |
APX-hardness and approximation for the \(k\)-burning number problem
Theoretical Computer Science | 2022-09-16 | Paper |
StreamTable: an area proportional visualization for tables with flowing streams
(available as arXiv preprint) | 2022-07-13 | Paper |
Positive planar satisfiability problems under 3-connectivity constraints
Theoretical Computer Science | 2022-05-31 | Paper |
Computing maximum independent set on outerstring graphs and their relatives
Computational Geometry | 2022-04-08 | Paper |
Parameterized complexity of two-interval pattern problem
Theoretical Computer Science | 2022-01-18 | Paper |
Faster multi-sided one-bend boundary labelling
(available as arXiv preprint) | 2021-10-04 | Paper |
Simultaneous embedding of colored graphs
Graphs and Combinatorics | 2021-08-12 | Paper |
Local routing in convex subdivisions
International Journal of Computational Geometry & Applications | 2021-02-11 | Paper |
Boundary labeling for rectangular diagrams
(available as arXiv preprint) | 2020-08-25 | Paper |
On compatible triangulations with a minimum number of Steiner points
Theoretical Computer Science | 2020-08-17 | Paper |
Simplified emanation graphs: a sparse plane spanner with Steiner points
SOFSEM 2020: Theory and Practice of Computer Science | 2020-07-20 | Paper |
| Partitioning orthogonal histograms into rectangular boxes | 2020-02-12 | Paper |
Computing maximum independent set on outerstring graphs and their relatives
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Recognition and drawing of stick graphs
Theoretical Computer Science | 2019-11-13 | Paper |
Polygon simplification by minimizing convex corners
Theoretical Computer Science | 2019-09-10 | Paper |
Construction and Local Routing for Angle-Monotone Graphs
Journal of Graph Algorithms and Applications | 2019-05-24 | Paper |
On upward drawings of trees on a given grid
Lecture Notes in Computer Science | 2019-02-20 | Paper |
The complexity of drawing a graph in a polygonal region
(available as arXiv preprint) | 2019-02-15 | Paper |
Recognition and drawing of stick graphs
Lecture Notes in Computer Science | 2019-02-15 | Paper |
Relating graph thickness to planar layers and bend complexity
SIAM Journal on Discrete Mathematics | 2018-11-28 | Paper |
| Construction and local routing for angle-monotone graphs | 2018-11-22 | Paper |
Drawing plane triangulations with few segments
Computational Geometry | 2018-11-19 | Paper |
Orthogonal layout with optimal face complexity
Computational Geometry | 2018-11-01 | Paper |
On the planar split thickness of graphs
Algorithmica | 2018-04-11 | Paper |
Table cartogram
Computational Geometry | 2018-02-19 | Paper |
Thickness and colorability of geometric graphs
Computational Geometry | 2018-01-19 | Paper |
| Relating graph thickness to planar layers and bend complexity | 2017-12-19 | Paper |
A necessary condition and a sufficient condition for pairwise compatibility graphs
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
Drawing Planar Graphs with Reduced Height
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
Polygon simplification by minimizing convex corners
Lecture Notes in Computer Science | 2016-09-02 | Paper |
On the planar split thickness of graphs
Lecture Notes in Computer Science | 2016-05-03 | Paper |
Orthogonal layout with optimal face complexity
Lecture Notes in Computer Science | 2016-03-10 | Paper |
Plane 3-trees: embeddability and approximation
SIAM Journal on Discrete Mathematics | 2015-05-20 | Paper |
Local routing in convex subdivisions
Lecture Notes in Computer Science | 2015-02-20 | Paper |
On graphs that are not PCGs
Theoretical Computer Science | 2015-01-30 | Paper |
Trade-Offs in Planar Polyline Drawings
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Drawing planar graphs with reduced height
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
Acyclic coloring with few division vertices
Lecture Notes in Computer Science | 2014-08-19 | Paper |
Acyclic coloring with few division vertices
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Indexed geometric jumbled pattern matching
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Drawing HV-Restricted Planar Graphs
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Planar and plane slope number of partial 2-trees
Graph Drawing | 2013-12-20 | Paper |
On balanced +-contact representations
Graph Drawing | 2013-12-20 | Paper |
Thickness and colorability of geometric graphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Table cartograms
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Plane 3-trees: embeddability and approximation (extended abstract)
Lecture Notes in Computer Science | 2013-08-12 | Paper |
A note on minimum-segment drawings of planar graphs
Journal of Graph Algorithms and Applications | 2013-07-09 | Paper |
Minimum-segment convex drawings of 3-connected cubic plane graphs
Journal of Combinatorial Optimization | 2013-06-28 | Paper |
On graphs that are not PCGs
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Touching triangle representations for 3-connected planar graphs
Graph Drawing | 2013-04-03 | Paper |
Universal line-sets for drawing planar 3-trees
Journal of Graph Algorithms and Applications | 2013-03-19 | Paper |
Acyclic colorings of graph subdivisions revisited
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Cool-lex order and \(k\)-ary Catalan structures
Journal of Discrete Algorithms | 2013-01-18 | Paper |
Visibility drawings of plane 3-trees with minimum area
Mathematics in Computer Science | 2012-12-03 | Paper |
Hamiltonian Paths and Cycles in Planar Graphs
Combinatorial Optimization and Applications | 2012-11-02 | Paper |
Point-set embeddings of plane \(3\)-trees
Computational Geometry | 2012-06-13 | Paper |
On the hardness of point-set embeddability (extended abstract)
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
Universal line-sets for drawing planar 3-trees
WALCOM: Algorithms and Computation | 2012-06-08 | Paper |
Embedding plane 3-trees in \(\mathbb R^{2}\) and \(\mathbb R^{3}\)
Graph Drawing | 2012-03-09 | Paper |
Acyclic colorings of graph subdivisions
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Ranking and loopless generation of \(k\)-ary Dyck words in cool-lex order
Lecture Notes in Computer Science | 2012-01-13 | Paper |
Minimum-area drawings of plane 3-trees
Journal of Graph Algorithms and Applications | 2011-04-19 | Paper |
Minimum-layer drawings of trees (extended abstract)
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
Point-set embeddings of plane 3-trees (extended abstract)
Graph Drawing | 2011-02-11 | Paper |
Minimum-segment convex drawings of 3-connected cubic plane graphs (extended abstract)
Lecture Notes in Computer Science | 2010-07-20 | Paper |
