| Publication | Date of Publication | Type |
|---|
Optimal algorithms for separating a polyhedron from its single-part mold
CGT. Computing in Geometry and Topology | 2024-11-18 | Paper |
Pursuit-evasion in graphs: zombies, lazy zombies and a survivor
Discrete Mathematics | 2024-11-09 | Paper |
Improved spanning ratio of the Theta-5 graph
Journal of Computational Geometry | 2024-10-18 | Paper |
Pursuit-evasion in graphs: zombies, lazy zombies and a survivor
| 2024-09-11 | Paper |
Routing on heavy path WSPD spanners
Computational Geometry | 2024-09-10 | Paper |
A Steiner-point-based algorithm for approximate shortest paths in weighted equilateral-triangle meshes
Theoretical Computer Science | 2024-05-08 | Paper |
On the spanning and routing ratio of the directed theta-four graph
Discrete \& Computational Geometry | 2024-04-02 | Paper |
Approximating the smallest \(k\)-enclosing geodesic disc in a simple polygon
Lecture Notes in Computer Science | 2024-01-16 | Paper |
On Separating Path and Tree Systems in Graphs
| 2023-12-21 | Paper |
Parameterized complexity of two-interval pattern problem
| 2023-11-02 | Paper |
Bounded-Angle Minimum Spanning Trees
| 2023-11-02 | Paper |
Competitive Online Search Trees on Trees
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Improved routing on the Delaunay triangulation
Discrete \& Computational Geometry | 2023-10-12 | Paper |
Simple linear time algorithms for piercing pairwise intersecting disks
Computational Geometry | 2023-07-31 | Paper |
Piercing pairwise intersecting convex shapes in the plane
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
On the zombie number of various graph classes
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
Local routing algorithms on Euclidean spanners with small diameter
LATIN 2022: Theoretical Informatics | 2023-07-26 | Paper |
On approximating shortest paths in weighted triangular tessellations
Artificial Intelligence | 2023-06-27 | Paper |
Separating layered treewidth and row treewidth
Discrete Mathematics & Theoretical Computer Science | 2023-05-30 | Paper |
The Minimum Moving Spanning Tree Problem
Journal of Graph Algorithms and Applications | 2023-03-30 | Paper |
Fragile complexity of adaptive algorithms
Lecture Notes in Computer Science | 2023-03-22 | Paper |
No quadrangulation is extremely odd
| 2023-03-21 | Paper |
Pattern matching for permutations
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Filling polyhedral molds
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Drawing graphs as spanners
Graph-Theoretic Concepts in Computer Science | 2022-12-21 | Paper |
Geodesic obstacle representation of graphs
Computational Geometry | 2022-11-16 | Paper |
On the restricted \(k\)-Steiner tree problem
Journal of Combinatorial Optimization | 2022-10-18 | Paper |
Flips in higher order Delaunay triangulations
| 2022-10-13 | Paper |
Drawing graphs as spanners
Discrete \& Computational Geometry | 2022-09-16 | Paper |
Computing constrained minimum-width annuli of point sets
Lecture Notes in Computer Science | 2022-08-19 | Paper |
On approximating shortest paths in weighted triangular tessellations
| 2022-07-13 | Paper |
On the spanning and routing ratios of the directed \(\Theta_6\)-graph
Computational Geometry | 2022-06-13 | Paper |
Fragile complexity of adaptive algorithms
Theoretical Computer Science | 2022-05-10 | Paper |
Pursuit-Evasion in Graphs: Zombies, Lazy Zombies and a Survivor
| 2022-04-25 | Paper |
Computing maximum independent set on outerstring graphs and their relatives
Computational Geometry | 2022-04-08 | Paper |
On the spanning and routing ratios of the directed \(\varTheta_6\)-graph
| 2022-03-25 | Paper |
The minimum moving spanning tree problem
| 2022-03-25 | Paper |
Improved bounds on the spanning ratio of the theta-5-graph
| 2022-03-25 | Paper |
Routing on heavy-path WSPD-spanners
| 2022-03-25 | Paper |
An Optimal Algorithm for Product Structure in Planar Graphs
| 2022-02-17 | Paper |
Bounded-angle minimum spanning trees
Algorithmica | 2022-02-01 | Paper |
Parameterized complexity of two-interval pattern problem
Theoretical Computer Science | 2022-01-18 | Paper |
Affine invariant triangulations
Computer Aided Geometric Design | 2022-01-12 | Paper |
Faster multi-sided one-bend boundary labelling
| 2021-10-04 | Paper |
Piercing pairwise intersecting geodesic disks
Computational Geometry | 2021-09-17 | Paper |
Attraction-convexity and normal visibility
Computational Geometry | 2021-09-16 | Paper |
Improved routing on the Delaunay triangulation
| 2021-08-04 | Paper |
Geodesic obstacle representation of graphs
| 2021-07-28 | Paper |
Computing the \(k\)-visibility region of a point in a polygon
Theory of Computing Systems | 2021-06-11 | Paper |
On the restricted 1-Steiner tree problem
| 2021-04-21 | Paper |
Local routing in WSPD-based spanners
| 2021-03-17 | Paper |
Constrained routing between non-visible vertices
Theoretical Computer Science | 2021-03-09 | Paper |
Local routing in convex subdivisions
International Journal of Computational Geometry & Applications | 2021-02-11 | Paper |
Competitive Online Search Trees on Trees
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Routing on the visibility graph
| 2020-11-25 | Paper |
Faster algorithms for some optimization problems on collinear points
| 2020-11-12 | Paper |
Gathering by repulsion
Computational Geometry | 2020-10-23 | Paper |
Hamiltonicity for convex shape Delaunay and Gabriel graphs
Computational Geometry | 2020-10-23 | Paper |
Gathering by repulsion
| 2020-08-25 | Paper |
Improved bounds for guarding plane graphs with edges
| 2020-08-25 | Paper |
Boundary labeling for rectangular diagrams
| 2020-08-25 | Paper |
Faster algorithms for some optimization problems on collinear points
| 2020-08-18 | Paper |
Power domination on triangular grids with triangular and hexagonal shape
Journal of Combinatorial Optimization | 2020-07-29 | Paper |
Asymptotically Optimal Vertex Ranking of Planar Graphs
| 2020-07-13 | Paper |
Self-approaching paths in simple polygons
Computational Geometry | 2020-04-22 | Paper |
Optimal art gallery localization is NP-hard
Computational Geometry | 2020-03-23 | Paper |
Computing the \(k\)-crossing visibility region of a point in a polygon
| 2020-02-25 | Paper |
Computing maximum independent set on outerstring graphs and their relatives
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Hamiltonicity for convex shape Delaunay and Gabriel graphs
Lecture Notes in Computer Science | 2020-01-16 | Paper |
Reconstructing a convex Polygon from its \(\omega\)-cloud
| 2019-10-22 | Paper |
On the spanning and routing ratio of Theta-Four
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Spanning properties of Yao and \(\theta\)-graphs in the presence of constraints
International Journal of Computational Geometry & Applications | 2019-09-24 | Paper |
Pole dancing: 3D morphs for tree drawings
Journal of Graph Algorithms and Applications | 2019-09-16 | Paper |
A characterization of the degree sequences of 2-trees
2007 Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) | 2019-09-16 | Paper |
A time-space trade-off for computing the \(k\)-visibility region of a point in a polygon
Theoretical Computer Science | 2019-09-10 | Paper |
Competitive routing in the half-\(\theta_6\)-graph
| 2019-05-10 | Paper |
Succinct geometric indexes supporting point location queries
| 2019-05-06 | Paper |
Improved bounds for guarding plane graphs with edges
Graphs and Combinatorics | 2019-05-03 | Paper |
On plane constrained bounded-degree spanners
Algorithmica | 2019-04-25 | Paper |
Maximum plane trees in multipartite geometric graphs
Algorithmica | 2019-04-25 | Paper |
Routing on the Visibility Graph
| 2019-02-27 | Paper |
Pole dancing: 3D morphs for tree drawings
| 2019-02-15 | Paper |
Data structures for halfplane proximity queries and incremental Voronoi diagrams
Algorithmica | 2019-01-11 | Paper |
Spanning trees in multipartite geometric graphs
Algorithmica | 2019-01-11 | Paper |
Constrained generalized Delaunay graphs are plane spanners
Computational Geometry | 2018-10-31 | Paper |
Pole Dancing: 3D Morphs for Tree Drawings
| 2018-08-31 | Paper |
Self-approaching paths in simple polygons
| 2018-08-13 | Paper |
Plane bichromatic trees of low degree
Discrete \& Computational Geometry | 2018-07-13 | Paper |
Competitive local routing with constraints
| 2018-06-05 | Paper |
New and improved spanning ratios for Yao graphs
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Towards plane spanners of degree 3
| 2018-04-19 | Paper |
Improved spanning ratio for low degree plane spanners
Algorithmica | 2018-04-11 | Paper |
Competitive online routing on Delaunay triangulations
International Journal of Computational Geometry & Applications | 2018-02-22 | Paper |
Flipping edge-labelled triangulations
Computational Geometry | 2018-02-19 | Paper |
Continuous Yao graphs
Computational Geometry | 2018-02-12 | Paper |
Flips in edge-labelled pseudo-triangulations
Computational Geometry | 2018-01-22 | Paper |
Plane geodesic spanning trees, Hamiltonian cycles, and perfect matchings in a simple polygon
Computational Geometry | 2018-01-19 | Paper |
A general framework for searching on a line
Theoretical Computer Science | 2017-11-07 | Paper |
Constrained routing between non-visible vertices
Lecture Notes in Computer Science | 2017-10-23 | Paper |
scientific article; zbMATH DE number 6792401 (Why is no real title available?)
| 2017-10-17 | Paper |
New bounds for facial nonrepetitive colouring
Graphs and Combinatorics | 2017-10-11 | Paper |
scientific article; zbMATH DE number 6789192 (Why is no real title available?)
| 2017-10-10 | Paper |
Upper and lower bounds for online routing on Delaunay triangulations
Discrete \& Computational Geometry | 2017-10-10 | Paper |
Geodesic ham-sandwich cuts
Proceedings of the twentieth annual symposium on Computational geometry | 2017-09-29 | Paper |
Maximum plane trees in multipartite geometric graphs
Lecture Notes in Computer Science | 2017-09-22 | Paper |
Local routing in spanners based on WSPDs
| 2017-09-22 | Paper |
The price of order
International Journal of Computational Geometry & Applications | 2017-05-19 | Paper |
Faster algorithms for the minimum red-blue-purple spanning graph problem
Journal of Graph Algorithms and Applications | 2017-05-16 | Paper |
Time-space trade-off for finding the \(k\)-visibility region of a point in a polygon
WALCOM: Algorithms and Computation | 2017-05-05 | Paper |
Essential Constraints of Edge-Constrained Proximity Graphs
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
On the stretch factor of convex polyhedra whose vertices are (almost) on a sphere
| 2017-03-30 | Paper |
New and improved spanning ratios for Yao graphs
| 2017-03-30 | Paper |
A plane 1.88-spanner for points in convex position
| 2017-03-30 | Paper |
Towards plane spanners of degree 3
| 2017-03-30 | Paper |
Switching to directional antennas with constant increase in radius and hop distance
Algorithmica | 2017-03-27 | Paper |
On the stretch factor of convex Delaunay graphs
| 2017-03-09 | Paper |
Network farthest-point diagrams
| 2017-03-09 | Paper |
Gabriel triangulations and angle-monotone graphs: local routing and recognition
Lecture Notes in Computer Science | 2017-02-21 | Paper |
Biased predecessor search
Algorithmica | 2016-12-21 | Paper |
The power and limitations of static binary search trees with lazy finger
Algorithmica | 2016-12-21 | Paper |
A linear-time algorithm for the geodesic center of a simple polygon
Discrete \& Computational Geometry | 2016-12-20 | Paper |
Probing convex polygons with a wedge
Computational Geometry | 2016-11-14 | Paper |
Essential constraints of edge-constrained proximity graphs
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Plane bichromatic trees of low degree
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Pattern matching for permutations
Information Processing Letters | 2016-06-09 | Paper |
Improved spanning ratio for low degree plane spanners
Lecture Notes in Computer Science | 2016-05-03 | Paper |
A general framework for searching on a line
WALCOM: Algorithms and Computation | 2016-05-03 | Paper |
Plane Geodesic Spanning Trees, Hamiltonian Cycles, and Perfect Matchings in a Simple Polygon
Topics in Theoretical Computer Science | 2016-04-01 | Paper |
Towards tight bounds on theta-graphs: more is not always better
Theoretical Computer Science | 2016-01-21 | Paper |
Competitive local routing with constraints
Algorithms and Computation | 2016-01-11 | Paper |
Packing plane perfect matchings into a point set
| 2015-12-03 | Paper |
Upper and lower bounds for online routing on Delaunay triangulations
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Optimal local routing on Delaunay triangulations defined by empty equilateral triangles
SIAM Journal on Computing | 2015-11-18 | Paper |
The price of order
Algorithms and Computation | 2015-09-11 | Paper |
Visibility-monotonic polygon deflation
| 2015-08-28 | Paper |
The Shadows of a Cycle Cannot All Be Paths
| 2015-07-08 | Paper |
Reprint of: Theta-3 is connected
Computational Geometry | 2015-04-27 | Paper |
The \(\varTheta_5\)-graph is a spanner
Computational Geometry | 2015-03-06 | Paper |
Local routing in convex subdivisions
Lecture Notes in Computer Science | 2015-02-20 | Paper |
Robust geometric spanners
Proceedings of the twenty-ninth annual symposium on Computational geometry | 2015-02-17 | Paper |
Searching on a line: a complete characterization of the optimal solution
Theoretical Computer Science | 2015-01-28 | Paper |
Optimal Data Structures for Farthest-Point Queries in Cactus Networks
Journal of Graph Algorithms and Applications | 2015-01-27 | Paper |
Succinct geometric indexes supporting point location queries
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Competitive online routing on Delaunay triangulations
Algorithm Theory – SWAT 2014 | 2014-09-02 | Paper |
Theta-3 is connected
Computational Geometry | 2014-08-13 | Paper |
Bounding the locality of distributed routing algorithms
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Optimal algorithms for constrained 1-center problems
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
Biased predecessor search
Lecture Notes in Computer Science | 2014-03-31 | Paper |
Upper bounds on the spanning ratio of constrained theta-graphs
LATIN 2014: Theoretical Informatics | 2014-03-31 | Paper |
scientific article; zbMATH DE number 6257577 (Why is no real title available?)
| 2014-02-14 | Paper |
Making triangulations 4-connected using flips
Computational Geometry | 2014-01-22 | Paper |
Triangulating and guarding realistic polygons
Computational Geometry | 2014-01-22 | Paper |
Minimum-area enclosing triangle with a fixed angle
Computational Geometry | 2014-01-08 | Paper |
The \(\theta_5\)-graph is a spanner
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
Robust geometric spanners
SIAM Journal on Computing | 2013-11-14 | Paper |
Isoperimetric triangular enclosures with a fixed angle
Journal of Geometry | 2013-10-30 | Paper |
Revisiting the problem of searching on a line
Lecture Notes in Computer Science | 2013-09-17 | Paper |
A history of distribution-sensitive data structures
Lecture Notes in Computer Science | 2013-09-13 | Paper |
On plane geometric spanners: a survey and open problems
Computational Geometry | 2013-08-22 | Paper |
De-amortizing binary search trees
Automata, Languages, and Programming | 2013-08-12 | Paper |
On the stretch factor of the theta-4 graph
Lecture Notes in Computer Science | 2013-08-12 | Paper |
On the spanning ratio of theta-graphs
Lecture Notes in Computer Science | 2013-08-12 | Paper |
A Polynomial Bound for Untangling Geometric Planar Graphs
Electronic Notes in Discrete Mathematics | 2013-06-28 | Paper |
Bounding the locality of distributed routing algorithms
Distributed Computing | 2013-06-25 | Paper |
Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
International Journal of Computational Geometry & Applications | 2013-06-24 | Paper |
Morphing of triangular meshes in shape space
International Journal of Shape Modeling | 2013-06-06 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Journal of Combinatorial Optimization | 2013-03-25 | Paper |
A history of flips in combinatorial triangulations
Lecture Notes in Computer Science | 2013-01-07 | Paper |
Fast local searches and updates in bounded universes
Computational Geometry | 2012-12-04 | Paper |
Stable roommates spanner
Computational Geometry | 2012-12-04 | Paper |
Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs
Computational Geometry | 2012-12-04 | Paper |
\(\pi /2\)-angle Xao graphs are spanners
International Journal of Computational Geometry & Applications | 2012-11-23 | Paper |
On bounded degree plane strong geometric spanners
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Skip lift: a probabilistic alternative to red-black trees
Journal of Discrete Algorithms | 2012-09-13 | Paper |
On plane constrained bounded-degree spanners
Lecture Notes in Computer Science | 2012-06-29 | Paper |
A distribution-sensitive dictionary with low space overhead
Journal of Discrete Algorithms | 2012-05-11 | Paper |
Layered working-set trees
Algorithmica | 2012-04-26 | Paper |
Every large point set contains many collinear points or an empty pentagon
Graphs and Combinatorics | 2012-01-24 | Paper |
A generalized Winternitz theorem
Journal of Geometry | 2012-01-13 | Paper |
A survey of geodesic paths on 3D surfaces
Computational Geometry | 2011-12-28 | Paper |
Common unfoldings of polyominoes and polycubes
Lecture Notes in Computer Science | 2011-11-11 | Paper |
Spanners of additively weighted point sets
Journal of Discrete Algorithms | 2011-08-23 | Paper |
Switching to directional antennas with constant increase in radius and hop distance
Lecture Notes in Computer Science | 2011-08-12 | Paper |
On a family of strong geometric spanners that admit local routing strategies
Computational Geometry | 2011-07-20 | Paper |
Computing signed permutations of polygons
International Journal of Computational Geometry & Applications | 2011-06-17 | Paper |
ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS
International Journal of Computational Geometry & Applications | 2011-06-17 | Paper |
Skip lift: a probabilistic alternative to red-black trees
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Location-oblivious distributed unit disk graph coloring
Algorithmica | 2011-05-10 | Paper |
Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\)
Computational Geometry | 2011-01-31 | Paper |
Coverage with \(k\)-transmitters in the presence of obstacles
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Should static search trees ever be unbalanced?
Algorithms and Computation | 2010-12-09 | Paper |
π/2-Angle Yao Graphs Are Spanners
Algorithms and Computation | 2010-12-09 | Paper |
A note on the perimeter of fat objects
Computational Geometry | 2010-10-15 | Paper |
Computing the greedy spanner in near-quadratic time
Algorithmica | 2010-09-27 | Paper |
Simultaneous diagonal flips in plane triangulations
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
scientific article; zbMATH DE number 5764838 (Why is no real title available?)
| 2010-08-06 | Paper |
Improved methods for generating quasi-Gray codes
Lecture Notes in Computer Science | 2010-06-22 | Paper |
An \(O(\log \log n)\)-competitive binary search tree with optimal worst-case access times
Lecture Notes in Computer Science | 2010-06-22 | Paper |
On the false-positive rate of Bloom filters
Information Processing Letters | 2010-06-09 | Paper |
Communication-efficient construction of the plane localized Delaunay graph
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Layered working-set trees
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Sigma-local graphs
Journal of Discrete Algorithms | 2010-02-26 | Paper |
On structural and graph theoretic properties of higher order Delaunay graphs
International Journal of Computational Geometry & Applications | 2010-02-12 | Paper |
Succinct data structures for approximating convex functions with applications
Lecture Notes in Computer Science | 2010-02-05 | Paper |
A polynomial bound for untangling geometric planar graphs
Discrete \& Computational Geometry | 2009-12-14 | Paper |
Spanners of Complete k-Partite Geometric Graphs
SIAM Journal on Computing | 2009-11-06 | Paper |
Clamshell casting
Algorithmica | 2009-10-23 | Paper |
Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
Lecture Notes in Computer Science | 2009-10-20 | Paper |
A Distribution-Sensitive Dictionary with Low Space Overhead
Lecture Notes in Computer Science | 2009-10-20 | Paper |
Efficient Construction of Near-Optimal Binary and Multiway Search Trees
Lecture Notes in Computer Science | 2009-10-20 | Paper |
DELAUNAY AND DIAMOND TRIANGULATIONS CONTAIN SPANNERS OF BOUNDED DEGREE
International Journal of Computational Geometry & Applications | 2009-06-30 | Paper |
Algorithms for optimal outlier removal
Journal of Discrete Algorithms | 2009-06-24 | Paper |
Rotationally monotone polygons
Computational Geometry | 2009-06-18 | Paper |
A note on the lower bound of edge guards of polyhedral terrains
International Journal of Computer Mathematics | 2009-06-02 | Paper |
Traversing a set of points with a minimum number of turns
Discrete \& Computational Geometry | 2009-05-06 | Paper |
Augmented reality on cloth with realistic illumination
Machine Vision and Applications | 2009-03-30 | Paper |
A linear-space algorithm for distance preserving graph embedding
Computational Geometry | 2009-03-09 | Paper |
On Generalized Diamond Spanners
Lecture Notes in Computer Science | 2009-02-17 | Paper |
On a Family of Strong Geometric Spanners That Admit Local Routing Strategies
Lecture Notes in Computer Science | 2009-02-17 | Paper |
Traversing a set of points with a minimum number of turns
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
POSTURE INVARIANT CORRESPONDENCE OF INCOMPLETE TRIANGULAR MANIFOLDS
International Journal of Shape Modeling | 2009-02-12 | Paper |
On the Stretch Factor of Convex Delaunay Graphs
Algorithms and Computation | 2009-01-29 | Paper |
Geometric spanners with small chromatic number
Computational Geometry | 2008-11-19 | Paper |
Flips in planar graphs
Computational Geometry | 2008-10-22 | Paper |
Data structures for halfplane proximity queries and incremental Voronoi diagrams
Lecture Notes in Computer Science | 2008-09-18 | Paper |
A characterization of the degree sequences of 2-trees
Journal of Graph Theory | 2008-09-04 | Paper |
Computing the Greedy Spanner in Near-Quadratic Time
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Spanners of Additively Weighted Point Sets
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS
International Journal of Computational Geometry & Applications | 2008-05-20 | Paper |
Diamond Triangulations Contain Spanners of Bounded Degree
Algorithms and Computation | 2008-04-24 | Paper |
Spanners of Complete k-Partite Geometric Graphs
Lecture Notes in Computer Science | 2008-04-15 | Paper |
Weighted Ham-Sandwich Cuts
Discrete and Computational Geometry | 2008-03-18 | Paper |
Geometric Spanners with Small Chromatic Number
Approximation and Online Algorithms | 2008-02-20 | Paper |
On local transformations in plane geometric graphs embedded on small grids
Computational Geometry | 2007-12-03 | Paper |
Location Oblivious Distributed Unit Disk Graph Coloring
Structural Information and Communication Complexity | 2007-11-15 | Paper |
Computational Science and Its Applications – ICCSA 2004
Lecture Notes in Computer Science | 2007-07-19 | Paper |
Space-efficient geometric divide-and-conquer algorithms
Computational Geometry | 2007-06-04 | Paper |
On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
SIAM Journal on Discrete Mathematics | 2007-05-22 | Paper |
Simultaneous diagonal flips in plane triangulations
Journal of Graph Theory | 2007-05-11 | Paper |
Reconfiguring triangulations with edge flips and point moves
Algorithmica | 2007-05-10 | Paper |
Geodesic ham-sandwich cuts
Discrete \& Computational Geometry | 2007-04-26 | Paper |
Packing two disks into a polygonal environment.
Journal of Discrete Algorithms | 2007-04-25 | Paper |
Area-preserving approximations of polygonal paths
Journal of Discrete Algorithms | 2007-02-14 | Paper |
On the stabbing number of a random Delaunay triangulation
Computational Geometry | 2006-12-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Induced subgraphs of bounded degree and bounded treewidth
| 2006-08-03 | Paper |
Partitions of complete geometric graphs into plane trees
Computational Geometry | 2006-05-16 | Paper |
Equitable subdivisions within polygonal regions
Computational Geometry | 2006-04-28 | Paper |
Constructing plane spanners of bounded degree and low weight
Algorithmica | 2006-03-21 | Paper |
GENERALIZING MONOTONICITY: ON RECOGNIZING SPECIAL CLASSES OF POLYGONS AND POLYHEDRA
International Journal of Computational Geometry & Applications | 2006-03-13 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2005-12-07 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
scientific article; zbMATH DE number 2185602 (Why is no real title available?)
| 2005-07-04 | Paper |
scientific article; zbMATH DE number 2185609 (Why is no real title available?)
| 2005-07-04 | Paper |
The Maximum Number of Edges in a Three-Dimensional Grid-Drawing
Journal of Graph Algorithms and Applications | 2005-05-25 | Paper |
Optimizing a constrained convex polygonal annulus
Journal of Discrete Algorithms | 2005-05-04 | Paper |
PROPERTIES OF ARRANGEMENT GRAPHS
International Journal of Computational Geometry & Applications | 2005-03-30 | Paper |
Online Routing in Triangulations
SIAM Journal on Computing | 2005-02-21 | Paper |
Asymmetric communication protocols via hotlink assignments
Theory of Computing Systems | 2005-02-11 | Paper |
Testing the quality of manufactured disks and balls
Algorithmica | 2004-12-02 | Paper |
Competitive online routing in geometric graphs
Theoretical Computer Science | 2004-11-23 | Paper |
Approximating geometric bottleneck shortest paths
Computational Geometry | 2004-11-18 | Paper |
ONLINE ROUTING IN CONVEX SUBDIVISIONS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
AN IMPROVED ALGORITHM FOR SUBDIVISION TRAVERSAL WITHOUT EXTRA STORAGE
International Journal of Computational Geometry & Applications | 2004-09-29 | 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 |
scientific article; zbMATH DE number 2086226 (Why is no real title available?)
| 2004-08-11 | Paper |
Light edges in degree-constrained graphs
Discrete Mathematics | 2004-08-06 | Paper |
Ordered theta graphs
Computational Geometry | 2004-08-06 | Paper |
scientific article; zbMATH DE number 2080232 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2080267 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2080234 (Why is no real title available?)
| 2004-08-04 | Paper |
On simplifying dot maps.
Computational Geometry | 2004-01-23 | Paper |
Worst-case-optimal algorithms for guarding planar graphs and polyhedral surfaces
Computational Geometry | 2003-10-14 | Paper |
scientific article; zbMATH DE number 1962800 (Why is no real title available?)
| 2003-08-11 | Paper |
scientific article; zbMATH DE number 1947396 (Why is no real title available?)
| 2003-07-08 | Paper |
Translating a regular grid over a point set
Computational Geometry | 2003-05-19 | Paper |
Fast approximations for sums of distances, clustering and the Fermat-Weber problem
Computational Geometry | 2003-04-28 | Paper |
On embedding an outer-planar graph in a point set
Computational Geometry | 2003-03-10 | Paper |
Efficient visibility queries in simple polygons
Computational Geometry | 2003-03-10 | Paper |
scientific article; zbMATH DE number 1830732 (Why is no real title available?)
| 2002-11-18 | Paper |
Cutting circles into equal area pieces
Geombinatorics | 2002-09-18 | Paper |
scientific article; zbMATH DE number 1796962 (Why is no real title available?)
| 2002-09-05 | Paper |
Experimental results on quadrangulations of sets of fixed points
Computer Aided Geometric Design | 2002-08-13 | Paper |
Computing the constrained Euclidean, geodesic and link centre of a simple polygon with applications.
Studies in Locational Analysis | 2002-02-25 | Paper |
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks | 2002-01-14 | Paper |
scientific article; zbMATH DE number 1552835 (Why is no real title available?)
| 2001-12-12 | Paper |
scientific article; zbMATH DE number 1629820 (Why is no real title available?)
| 2001-11-06 | Paper |
scientific article; zbMATH DE number 1629819 (Why is no real title available?)
| 2001-11-01 | Paper |
scientific article; zbMATH DE number 1629974 (Why is no real title available?)
| 2001-10-23 | Paper |
Efficient algorithms for Petersen's matching theorem
Journal of Algorithms | 2001-04-17 | Paper |
scientific article; zbMATH DE number 1555917 (Why is no real title available?)
| 2001-01-24 | Paper |
scientific article; zbMATH DE number 1522924 (Why is no real title available?)
| 2000-10-30 | Paper |
scientific article; zbMATH DE number 1305400 (Why is no real title available?)
| 1999-06-17 | Paper |
Intersections with random geometric objects
Computational Geometry | 1998-08-02 | Paper |
A Visibility Representation for Graphs in Three Dimensions
Journal of Graph Algorithms and Applications | 1998-07-05 | Paper |
Characterizing and efficiently computing quadrangulations of planar point sets
Computer Aided Geometric Design | 1998-06-30 | Paper |
Optimal Algorithms to Embed Trees in a Point Set
Journal of Graph Algorithms and Applications | 1998-04-01 | Paper |
Filling polyhedral molds.
CAD. Computer-Aided Design | 1998-01-01 | Paper |
The Floodlight Problem
International Journal of Computational Geometry & Applications | 1997-07-27 | Paper |
Guarding polyhedral terrains
Computational Geometry | 1997-03-18 | Paper |
All convex polyhedra can be clamped with parallel jaw grippers
Computational Geometry | 1996-10-20 | Paper |
Geometric and computational aspects of gravity casting
CAD. Computer-Aided Design | 1996-03-05 | Paper |
Growing a Tree from Its Branches
Journal of Algorithms | 1995-09-10 | Paper |
Linear versus centred chromatic numbers
| N/A | Paper |
Connected Dominating Sets in Triangulations
| N/A | Paper |
