| Publication | Date of Publication | Type |
|---|
Reconfiguration of non-crossing spanning trees
Journal of Computational Geometry | 2024-12-19 | Paper |
Compacting squares: input-sensitive in-place reconfiguration of sliding squares
| 2024-05-27 | Paper |
Kinetic Geodesic Voronoi Diagrams in a Simple Polygon
SIAM Journal on Discrete Mathematics | 2023-10-26 | Paper |
Reconfiguration of connected graph partitions
Journal of Graph Theory | 2023-10-05 | Paper |
Negative instance for the edge patrolling beacon problem
| 2023-03-31 | Paper |
Reconfiguration of connected graph partitions via recombination
Lecture Notes in Computer Science | 2023-03-22 | Paper |
Distance Bounds for High Dimensional Consistent Digital Rays and 2-D Partially-Consistent Digital Rays
| 2023-02-07 | Paper |
Graphs with large total angular resolution
Theoretical Computer Science | 2023-01-05 | Paper |
Distance bounds for high dimensional consistent digital rays and 2-D partially-consistent digital rays
Discrete & Computational Geometry | 2022-09-16 | Paper |
Rectilinear link diameter and radius in a rectilinear polygonal domain
| 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559209 (Why is no real title available?)
| 2022-07-18 | Paper |
Reconfiguration of connected graph partitions via recombination
Theoretical Computer Science | 2022-06-13 | Paper |
Circumscribing polygons and polygonizations for disjoint line segments
Discrete & Computational Geometry | 2022-06-03 | Paper |
Weight balancing on boundaries
| 2022-05-18 | Paper |
Universal Reconfiguration of Facet-Connected Modular Robots by Pivots: The O(1) Musketeers
| 2022-05-11 | Paper |
Efficient segment folding is hard
Computational Geometry | 2022-04-08 | Paper |
Snipperclips: cutting tools into desired polygons using themselves
Computational Geometry | 2021-09-17 | Paper |
Universal reconfiguration of facet-connected modular robots by pivots: the \(O(1)\) musketeers
Algorithmica | 2021-04-19 | Paper |
Constrained routing between non-visible vertices
Theoretical Computer Science | 2021-03-09 | Paper |
Rectilinear link diameter and radius in a rectilinear polygonal domain
Computational Geometry | 2021-01-07 | Paper |
Experimental study of compressed stack algorithms in limited memory environments
| 2020-12-16 | Paper |
Routing in polygonal domains
| 2020-11-25 | Paper |
Routing on the visibility graph
| 2020-11-25 | Paper |
scientific article; zbMATH DE number 7278008 (Why is no real title available?)
| 2020-11-25 | Paper |
Graphs with large total angular resolution
Lecture Notes in Computer Science | 2020-10-26 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces
Computational Geometry | 2020-10-23 | Paper |
Routing in histograms
| 2020-07-22 | Paper |
Routing in polygonal domains
Computational Geometry | 2020-04-22 | Paper |
Balanced line separators of unit disk graphs
Computational Geometry | 2020-04-22 | Paper |
Packing plane spanning graphs with short edges in complete geometric graphs
Computational Geometry | 2019-10-25 | Paper |
Faster algorithms for growing prioritized disks and rectangles
Computational Geometry | 2019-10-18 | Paper |
Dynamic graph coloring
Algorithmica | 2019-04-25 | Paper |
Stabbing segments with rectilinear objects
Applied Mathematics and Computation | 2019-03-29 | Paper |
Improved time-space trade-offs for computing Voronoi diagrams
Journal of Computational Geometry | 2019-02-27 | Paper |
Routing on the Visibility Graph
| 2019-02-27 | Paper |
Gap-Planar Graphs
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Computing the geodesic centers of a polygonal domain
Computational Geometry | 2018-11-19 | Paper |
High Dimensional Consistent Digital Segments
SIAM Journal on Discrete Mathematics | 2018-11-19 | Paper |
On the complexity of barrier resilience for fat regions and bounded ply
Computational Geometry | 2018-10-31 | Paper |
Time-space trade-offs for triangulations and Voronoi diagrams
Computational Geometry | 2018-10-31 | Paper |
On the complexity of barrier resilience for fat regions
| 2018-10-17 | Paper |
Gap-planar graphs
Theoretical Computer Science | 2018-09-24 | Paper |
High dimensional consistent digital segments
| 2018-08-13 | Paper |
Time-space trade-offs for triangulating a simple polygon
| 2018-06-05 | Paper |
On interference among moving sensors and related problems
| 2018-06-05 | Paper |
Weight Balancing on Boundaries and Skeletons
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Improved time-space trade-offs for computing Voronoi diagrams
| 2018-04-19 | Paper |
Packing short plane spanning trees in complete geometric graphs
| 2018-04-19 | Paper |
On interference among moving sensors and related problems
| 2018-03-02 | Paper |
Colored spanning graphs for set visualization
Computational Geometry | 2018-02-19 | Paper |
The dual diameter of triangulations
Computational Geometry | 2018-02-19 | Paper |
Computing the \(L_1\) geodesic diameter and center of a polygonal domain
| 2018-01-24 | Paper |
Constrained routing between non-visible vertices
Lecture Notes in Computer Science | 2017-10-23 | Paper |
Line segment covering of cells in arrangements
Information Processing Letters | 2017-10-18 | Paper |
Time-space trade-offs for triangulating a simple polygon
| 2017-10-17 | Paper |
scientific article; zbMATH DE number 6789192 (Why is no real title available?)
| 2017-10-10 | Paper |
Balanced line separators of unit disk graphs
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Dynamic graph coloring
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Hanabi is NP-complete, even for cheaters who look at their cards
| 2017-07-17 | Paper |
Packing plane spanning trees and paths in complete geometric graphs
Information Processing Letters | 2017-06-13 | Paper |
Hanabi is NP-hard, even for cheaters who look at their cards
Theoretical Computer Science | 2017-05-12 | Paper |
Computing the \(L_1\) geodesic diameter and center of a polygonal domain
Discrete & Computational Geometry | 2017-05-11 | Paper |
The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited
Annals of Operations Research | 2017-03-03 | Paper |
Symmetric assembly puzzles are hard, beyond a few pieces
Lecture Notes in Computer Science | 2017-02-01 | Paper |
Space-time trade-offs for stack-based algorithms
| 2017-01-30 | Paper |
A linear-time algorithm for the geodesic center of a simple polygon
Discrete & Computational Geometry | 2016-12-20 | Paper |
Locating a single facility and a high-speed line
European Journal of Operational Research | 2016-06-23 | Paper |
Line segment covering of cells in arrangements
Lecture Notes in Computer Science | 2016-02-05 | Paper |
Time-space trade-offs for triangulations and Voronoi diagrams
Lecture Notes in Computer Science | 2015-10-30 | Paper |
Stabbing segments with rectilinear objects
Lecture Notes in Computer Science | 2015-09-29 | Paper |
Space-time trade-offs for stack-based algorithms
Algorithmica | 2015-09-02 | Paper |
Geodesic-preserving polygon simplification
International Journal of Computational Geometry & Applications | 2015-07-01 | Paper |
Computing the \(L_1\) geodesic diameter and center of a simple polygon in linear time
Computational Geometry | 2015-06-17 | Paper |
Geometric biplane graphs. II: Graph augmentation
Graphs and Combinatorics | 2015-05-22 | Paper |
Geometric biplane graphs. I: Maximal graphs
Graphs and Combinatorics | 2015-05-22 | Paper |
Reprint of: Theta-3 is connected
Computational Geometry | 2015-04-27 | Paper |
Cell-paths in mono- and bichromatic line arrangements in the plane
| 2015-02-09 | Paper |
Geodesic order types
Algorithmica | 2015-01-19 | Paper |
Balanced partitions of 3-colored geometric sets in the plane
Discrete Applied Mathematics | 2014-12-05 | Paper |
New results on stabbing segments with a polygon
Computational Geometry | 2014-11-24 | Paper |
Theta-3 is connected
Computational Geometry | 2014-08-13 | Paper |
Computing a visibility polygon using few variables
Computational Geometry | 2014-08-13 | Paper |
The 1-median and 1-highway problem
European Journal of Operational Research | 2014-07-27 | Paper |
Computing the \(L _{1}\) geodesic diameter and center of a simple polygon in linear time
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
scientific article; zbMATH DE number 6257577 (Why is no real title available?)
| 2014-02-14 | Paper |
Reprint of: Memory-constrained algorithms for simple polygons
Computational Geometry | 2014-01-22 | Paper |
Geodesic-preserving polygon simplification
Algorithms and Computation | 2014-01-14 | Paper |
Colored spanning graphs for set visualization
Graph Drawing | 2013-12-20 | Paper |
Helly numbers of polyominoes
Graphs and Combinatorics | 2013-09-26 | Paper |
The geodesic diameter of polygonal domains
Discrete & Computational Geometry | 2013-09-23 | Paper |
Coloring planar homothets and three-dimensional hypergraphs
Computational Geometry | 2013-09-03 | Paper |
Memory-constrained algorithms for simple polygons
Computational Geometry | 2013-07-31 | Paper |
New results on stabbing segments with a polygon
Lecture Notes in Computer Science | 2013-06-07 | Paper |
Establishing strong connectivity using optimal radius half-disk antennas
Computational Geometry | 2013-01-25 | Paper |
Locating a service facility and a rapid transit line
Lecture Notes in Computer Science | 2013-01-07 | Paper |
The 1-center and 1-highway problem
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs
Computational Geometry | 2012-12-04 | Paper |
Minimizing interference in ad hoc networks with bounded communication radius
Information Processing Letters | 2012-10-23 | Paper |
Geodesic order types
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Coloring Planar Homothets and Three-Dimensional Hypergraphs
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Colorful strips
Graphs and Combinatorics | 2012-01-24 | Paper |
Minimizing interference in ad-hoc networks with bounded communication radius
Lecture Notes in Computer Science | 2011-12-16 | Paper |
Computing the visibility polygon using few variables
Algorithms and Computation | 2011-12-16 | Paper |
Effect of corner information in simultaneous placement of \(k\) rectangles and tableaux
Discrete Mathematics, Algorithms and Applications | 2011-03-25 | Paper |
Covering points by disjoint boxes with outliers
Computational Geometry | 2011-01-21 | Paper |
The geodesic diameter of polygonal domains
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Effect of corner information in simultaneous placement of \(K\) rectangles and tableaux
Lecture Notes in Computer Science | 2010-07-20 | Paper |
Colorful strips
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Algorithms for Computing the Maximum Weight Region Decomposable into Elementary Shapes
Algorithms and Computation | 2009-12-17 | Paper |
Consistent digital rays
Discrete & Computational Geometry | 2009-08-27 | Paper |
Square and Rectangle Covering with Outliers
Frontiers in Algorithmics | 2009-07-14 | Paper |
All Farthest Neighbors in the Presence of Highways and Obstacles
WALCOM: Algorithms and Computation | 2009-02-24 | Paper |
Consistent digital rays
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Optimal Insertion of a Segment Highway in a City Metric
Lecture Notes in Computer Science | 2008-07-10 | Paper |
