| Publication | Date of Publication | Type |
|---|
A frequency-competitive query strategy for maintaining low collision potential among moving entities
| 2024-07-19 | Paper |
Minimizing query frequency to bound congestion potential for moving entities at a fixed target time
| 2024-05-29 | Paper |
Reachability of turn sequences
| 2022-03-01 | Paper |
Minimum rectilinear polygons for given angle sequences
Computational Geometry | 2021-12-15 | Paper |
Simultaneous visibility representations of undirected pairs of graphs
Computational Geometry | 2021-09-17 | Paper |
On area-universal quadrangulations
Journal of Graph Algorithms and Applications | 2021-03-29 | Paper |
Representing graphs and hypergraphs by touching polygons in 3D
| 2020-10-26 | Paper |
Angle covers: algorithms and complexity
| 2020-07-22 | Paper |
Minimizing Interference Potential Among Moving Entities
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Visibility representations of boxes in 2.5 dimensions
Computational Geometry | 2018-10-31 | Paper |
Ortho-polygon visibility representations of embedded graphs
Algorithmica | 2018-07-25 | Paper |
Covering points with convex sets of minimum size
Theoretical Computer Science | 2018-03-16 | Paper |
Table cartogram
Computational Geometry | 2018-02-19 | Paper |
New results on edge partitions of 1-plane graphs
Theoretical Computer Science | 2018-02-06 | Paper |
Recognizing a DOG is hard, but not when it is thin and unit
| 2017-07-17 | Paper |
On characterizing terrain visibility graphs
| 2017-03-30 | Paper |
Ortho-polygon visibility representations of embedded graphs
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Visibility representations of boxes in 2.5 dimensions
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Alternating paths and cycles of minimum length
Lecture Notes in Computer Science | 2017-02-10 | Paper |
Recognizing and drawing IC-planar 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 |
Alternating paths and cycles of minimum length
Computational Geometry | 2016-11-14 | Paper |
Minimizing co-location potential of moving entities
SIAM Journal on Computing | 2016-10-28 | Paper |
Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
Theoretical Computer Science | 2016-08-31 | Paper |
SEFE without mapping via large induced outerplane graphs in plane graphs
Journal of Graph Theory | 2016-06-10 | Paper |
Recognizing and drawing IC-planar graphs
Theoretical Computer Science | 2016-06-01 | Paper |
Covering Points with Convex Sets of Minimum Size
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
Contact representations of graphs in 3D
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ
ACM Transactions on Algorithms | 2015-09-02 | Paper |
Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ
| 2015-08-03 | Paper |
Competitive query strategies for minimising the ply of the potential locations of moving points
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Bar 1-visibility graphs and their relation to other nearly planar graphs
Journal of Graph Algorithms and Applications | 2015-01-15 | Paper |
Column planarity and partial simultaneous geometric embedding
Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications | 2015-01-07 | Paper |
SEFE with no mapping via large induced outerplane graphs in plane graphs
Algorithms and Computation | 2014-01-14 | Paper |
Table cartograms
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Approximate proximity drawings
Computational Geometry | 2013-04-29 | Paper |
On representing graphs by touching cuboids
Graph Drawing | 2013-04-03 | Paper |
Universal point subsets for planar graphs
Algorithms and Computation | 2013-03-21 | Paper |
On point-sets that support planar graphs
Computational Geometry | 2012-10-12 | Paper |
Approximate proximity drawings
Graph Drawing | 2012-03-09 | Paper |
On point-sets that support planar graphs
Graph Drawing | 2012-03-09 | Paper |
On graphs supported by line sets
Graph Drawing | 2011-02-11 | Paper |
Directed one-trees
| 2010-07-30 | Paper |
Bar k-Visibility Graphs
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
On the maximum tolerable noise of k-input gates for reliable computation by formulas
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
SIAM Journal on Discrete Mathematics | 2007-05-22 | Paper |
COMPUTING THE SET OF ALL THE DISTANT HORIZONS OF A TERRAIN
International Journal of Computational Geometry & Applications | 2006-03-13 | Paper |
Broadcasting on trees and the Ising model.
The Annals of Applied Probability | 2004-10-27 | Paper |
Restructuring ordered binary trees
Journal of Algorithms | 2004-10-01 | Paper |
DIAMONDS ARE NOT A MINIMUM WEIGHT TRIANGULATION'S BEST FRIEND
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
scientific article; zbMATH DE number 2086250 (Why is no real title available?)
| 2004-08-11 | Paper |
Right-triangulated irregular networks
Algorithmica | 2002-01-09 | Paper |
Signal propagation and noisy circuits
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
scientific article; zbMATH DE number 1445337 (Why is no real title available?)
| 2000-05-10 | Paper |
