| Publication | Date of Publication | Type |
|---|
| The two-squirrel problem and its relatives | 2026-01-28 | Paper |
| On solving simple curved nonograms | 2026-01-13 | Paper |
| Grid peeling of parabolas | 2025-11-24 | Paper |
Removing popular faces in curve arrangements
Journal of Graph Algorithms and Applications | 2024-11-12 | Paper |
An improved upper bound on the growth constant of polyiamonds
Acta Mathematica Universitatis Comenianae. New Series | 2024-10-18 | Paper |
| Removing popular faces in curve arrangements | 2024-10-14 | Paper |
Optimal strategies in fractional games: vertex cover and domination
Ars Mathematica Contemporanea | 2024-10-10 | Paper |
| On the number of compositions of two polycubes | 2024-09-13 | Paper |
On the number of compositions of two polycubes
CGT. Computing in Geometry and Topology | 2024-09-10 | Paper |
| Isotonic regression by dynamic programming | 2024-08-26 | Paper |
| On primal-dual circle representations | 2024-08-26 | Paper |
| An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. | 2023-11-02 | Paper |
| The Generalized Combinatorial Lason-Alon-Zippel-Schwartz Nullstellensatz Lemma | 2023-05-18 | Paper |
PL Morse theory in low dimensions
advg | 2023-02-17 | Paper |
An almost optimal bound on the number of intersections of two simple polygons
Discrete & Computational Geometry | 2022-12-08 | Paper |
scientific article; zbMATH DE number 7561380 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| scientific article; zbMATH DE number 7561502 (Why is no real title available?) | 2022-07-21 | Paper |
| Towards a Geometric Understanding of the 4-Dimensional Point Groups | 2022-05-10 | Paper |
Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
Algorithmica | 2022-03-22 | Paper |
| Optimal strategies in fractional games: vertex cover and domination | 2021-05-09 | Paper |
Every collinear set in a planar graph is free
Discrete & Computational Geometry | 2021-04-29 | Paper |
Area difference bounds for dissections of a square into an odd number of triangles
Experimental Mathematics | 2021-04-01 | Paper |
Characterization of the response maps of alternating-current networks
(available as arXiv preprint) | 2020-12-09 | Paper |
| Characterization of the response maps of alternating-current networks | 2020-12-09 | Paper |
Random polytopes and the wet part for arbitrary probability distributions
Annales Henri Lebesgue | 2020-11-11 | Paper |
Geometric multicut: shortest fences for separating groups of objects in the plane
Discrete & Computational Geometry | 2020-10-23 | Paper |
| The geometric dilation of three points | 2020-01-31 | Paper |
PL Morse theory in low dimensions
(available as arXiv preprint) | 2019-12-10 | Paper |
A new metric between polygons, and how to compute it
Automata, Languages and Programming | 2019-12-04 | Paper |
Ordered level planarity and its relationship to geodesic planarity, bi-monotonicity, and variations of level planarity
ACM Transactions on Algorithms | 2019-12-02 | Paper |
Packing plane spanning graphs with short edges in complete geometric graphs
Computational Geometry | 2019-10-25 | Paper |
The maximum number of minimal dominating sets in a tree
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Every collinear set in a planar graph is free
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Windrose planarity: embedding graphs with direction-constrained edges
ACM Transactions on Algorithms | 2019-03-28 | Paper |
| The Number of Convex Polyominoes with Given Height and Width | 2019-03-04 | Paper |
Ordered level planarity, geodesic planarity and bi-monotonicity
Lecture Notes in Computer Science | 2019-02-20 | Paper |
Convex equipartitions of colored point sets
Discrete & Computational Geometry | 2019-01-29 | Paper |
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
A dynamic programming algorithm for constructing optimal prefix-free codes for unequal letter costs
Automata, Languages and Programming | 2019-01-10 | Paper |
Loopless Gray code enumeration and the Tower of Bucharest
Theoretical Computer Science | 2018-11-23 | Paper |
Pseudotriangulations, polytopes, and how to expand linkages
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Windrose planarity: embedding graphs with direction-constrained edges
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Packing short plane spanning trees in complete geometric graphs
(available as arXiv preprint) | 2018-04-19 | Paper |
Approximation and hardness of token swapping
(available as arXiv preprint) | 2018-03-02 | Paper |
Optimal triangulation of saddle surfaces
Beiträge zur Algebra und Geometrie | 2018-02-28 | Paper |
Point sets with many non-crossing perfect matchings
Computational Geometry | 2018-02-19 | Paper |
| Congruence testing of point sets in 4-space | 2018-01-30 | Paper |
Saturated simple and 2-simple topological graphs with few edges
Journal of Graph Algorithms and Applications | 2018-01-12 | Paper |
Matching convex shapes with respect to the symmetric difference
Algorithms — ESA '96 | 2017-12-05 | Paper |
| Shortest path to a segment and quickest visibility queries | 2017-10-10 | Paper |
The complexity of (un)folding
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Planar minimally rigid graphs and pseudo-triangulations
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Incremental constructions con BRIO
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
| Collapse | 2017-09-29 | Paper |
Search for the end of a path in the \(\cdot\)-dimensional grid and in other graphs
Ars Mathematica Contemporanea | 2017-09-14 | Paper |
Loopless Gray code enumeration and the Tower of Bucharest
(available as arXiv preprint) | 2017-07-17 | Paper |
Quasi-parallel segments and characterization of unique bichromatic matchings
(available as arXiv preprint) | 2017-03-30 | Paper |
| Shortest path to a segment and quickest visibility queries | 2017-03-30 | Paper |
Recursively-regular subdivisions and applications
(available as arXiv preprint) | 2017-03-30 | Paper |
| Constant-work-space algorithms for geometric problems | 2017-03-09 | Paper |
Saturated Simple and 2-simple Topological Graphs with Few Edges
Graph-Theoretic Concepts in Computer Science | 2016-10-21 | Paper |
Congruence testing of point sets in three and four dimensions. Results and techniques
Mathematical Aspects of Computer and Information Sciences | 2016-05-25 | Paper |
\(\lambda > 4\)
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Finitely many smooth \(d\)-polytopes with \(n\) lattice points
Israel Journal of Mathematics | 2015-06-26 | Paper |
The infimum of the volumes of convex polytopes of any given facet areas is \(0\)
Studia Scientiarum Mathematicarum Hungarica | 2015-05-07 | Paper |
Triangulations with Circular Arcs
Journal of Graph Algorithms and Applications | 2015-01-27 | Paper |
| Matrix scaling by network flow | 2014-12-18 | Paper |
| Obnoxious centers in graphs | 2014-12-18 | Paper |
Advantage in the discrete Voronoi game
Journal of Graph Algorithms and Applications | 2014-11-13 | Paper |
| Strictly convex drawings of planar graphs | 2014-10-13 | Paper |
Geometric clustering, fixed-parameter tractability and lower bounds with respect to the dimension
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
| scientific article; zbMATH DE number 6272352 (Why is no real title available?) | 2014-03-24 | Paper |
Flip graphs of bounded degree triangulations
Graphs and Combinatorics | 2014-02-14 | Paper |
Reprint of: Memory-constrained algorithms for simple polygons
Computational Geometry | 2014-01-22 | Paper |
Reprint of: Optimally solving a transportation problem using Voronoi diagrams
Computational Geometry | 2014-01-22 | Paper |
There is no triangulation of the torus with vertex degrees \(5, 6, \dots , 6, 7\) and related results: geometric proofs for combinatorial theorems
Geometriae Dedicata | 2013-11-04 | Paper |
Flip graphs of bounded-degree triangulations
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Formulae and growth rates of high-dimensional polycubes
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Topological hypergraphs
Thirty Essays on Geometric Graph Theory | 2013-09-25 | Paper |
Monotone paths in planar convex subdivisions and polytopes
Discrete Geometry and Optimization | 2013-09-13 | Paper |
Fixed-parameter tractability and lower bounds for stabbing problems
Computational Geometry | 2013-08-22 | Paper |
Fixed-parameter tractability and lower bounds for stabbing problems
Computational Geometry | 2013-08-22 | Paper |
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Add isotropic Gaussian kernels at own risk: more and more resilient modes in higher dimensions
Discrete & Computational Geometry | 2013-08-05 | Paper |
Memory-constrained algorithms for simple polygons
Computational Geometry | 2013-07-31 | Paper |
Memory-constrained algorithms for simple polygons
Computational Geometry | 2013-07-31 | Paper |
Optimally solving a transportation problem using Voronoi diagrams
Computational Geometry | 2013-07-31 | Paper |
Monotone paths in planar convex subdivisions
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Pointed drawings of planar graphs
Computational Geometry | 2012-09-21 | Paper |
Realizing planar graphs as convex polytopes
Graph Drawing | 2012-03-09 | Paper |
Triangulations with Circular Arcs
Graph Drawing | 2012-03-09 | Paper |
Proper \(n\)-cell polycubes in \(n - 3\) dimensions
Lecture Notes in Computer Science | 2011-08-17 | Paper |
Formulae and growth rates of high-dimensional polycubes
Combinatorica | 2011-07-22 | Paper |
Obnoxious Centers in Graphs
SIAM Journal on Discrete Mathematics | 2011-07-18 | Paper |
On constrained minimum pseudotriangulations
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Lines pinning lines
Discrete & Computational Geometry | 2011-03-10 | Paper |
Small grid embeddings of 3-polytopes
Discrete & Computational Geometry | 2011-03-10 | Paper |
Finding the most relevant fragments in networks
Journal of Graph Algorithms and Applications | 2011-02-16 | Paper |
Acyclic orientation of drawings
Journal of Graph Algorithms and Applications | 2011-02-16 | Paper |
Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?
Computational Geometry | 2011-01-31 | Paper |
| scientific article; zbMATH DE number 5823866 (Why is no real title available?) | 2010-12-08 | Paper |
Locked and unlocked chains of planar shapes
Discrete & Computational Geometry | 2010-09-22 | Paper |
| scientific article; zbMATH DE number 5764822 (Why is no real title available?) | 2010-08-06 | Paper |
| Counting polyominoes on twisted cylinders | 2010-07-30 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2010-04-20 | Paper |
The parameterized complexity of some geometric problems in unbounded dimension
Parameterized and Exact Computation | 2010-01-14 | Paper |
Resolving Loads with Positive Interior Stresses
Lecture Notes in Computer Science | 2009-10-20 | Paper |
On the maximum size of an anti-chain of linearly separable sets and convex pseudo-discs
Israel Journal of Mathematics | 2009-10-02 | Paper |
| scientific article; zbMATH DE number 5604072 (Why is no real title available?) | 2009-09-15 | Paper |
Graph Drawing
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Wooden geometric puzzles: Design and hardness proofs
Theory of Computing Systems | 2009-08-06 | Paper |
Bounds on the quality of the PCA bounding boxes
Computational Geometry | 2009-06-30 | Paper |
| scientific article; zbMATH DE number 5542483 (Why is no real title available?) | 2009-04-14 | Paper |
Embedding 3-polytopes on a small grid
Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5507813 (Why is no real title available?) | 2009-02-12 | Paper |
| scientific article; zbMATH DE number 5507829 (Why is no real title available?) | 2009-02-12 | Paper |
| Minimum weight triangulation is NP-hard | 2009-02-10 | Paper |
| scientific article; zbMATH DE number 5506193 (Why is no real title available?) | 2009-02-10 | Paper |
Planar Embeddings of Graphs with Specified Edge Lengths
Journal of Graph Algorithms and Applications | 2009-01-19 | Paper |
Minimum-weight triangulation is NP-hard
Journal of the ACM | 2008-12-21 | Paper |
Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs
Computational Geometry | 2008-07-29 | Paper |
Pseudo-triangulations -- a survey
(available as arXiv preprint) | 2008-07-21 | Paper |
Three-clustering of points in the plane.
Computational Geometry | 2008-04-25 | Paper |
There are not too many magic configurations
Discrete & Computational Geometry | 2008-04-16 | Paper |
Matching point sets with respect to the earth mover's distance
Computational Geometry | 2007-12-03 | Paper |
Wooden Geometric Puzzles: Design and Hardness Proofs
Lecture Notes in Computer Science | 2007-11-15 | Paper |
Acyclic Orientation of Drawings
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
| Meshing of surfaces | 2007-06-19 | Paper |
| Computational Topology | 2007-06-19 | Paper |
Computing the Fréchet distance between piecewise smooth curves
Computational Geometry | 2007-06-04 | Paper |
On the geometric dilation of closed curves, graphs, and point sets
Computational Geometry | 2007-03-12 | Paper |
Strictly convex drawings of planar graphs
Documenta Mathematica | 2007-02-05 | Paper |
Strictly convex drawings of planar graphs
Documenta Mathematica | 2007-02-05 | Paper |
| Counting polyominoes on twisted cylinders | 2007-01-12 | Paper |
| Counting polyominoes on twisted cylinders | 2007-01-12 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Threshold arrangements and the knapsack problem
Applied Mathematics Letters | 2006-01-24 | Paper |
scientific article; zbMATH DE number 2209740 (Why is no real title available?)
(available as arXiv preprint) | 2005-09-28 | Paper |
Planar minimally rigid graphs and pseudo-triangulations
Computational Geometry | 2005-05-04 | Paper |
| scientific article; zbMATH DE number 2145225 (Why is no real title available?) | 2005-03-14 | Paper |
Non-crossing frameworks with non-crossing reciprocals
Discrete & Computational Geometry | 2005-02-23 | Paper |
Simple and optimal output-sensitive construction of contour trees using monotone paths
Computational Geometry | 2005-01-31 | Paper |
Covering with ellipses
Algorithmica | 2004-12-02 | Paper |
| scientific article; zbMATH DE number 2119696 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2079407 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2079389 (Why is no real title available?) | 2004-07-28 | Paper |
Matching planar maps
Journal of Algorithms | 2004-03-14 | Paper |
Straightening polygonal arcs and convexifying polygonal cycles
Discrete & Computational Geometry | 2004-03-07 | Paper |
| scientific article; zbMATH DE number 1877249 (Why is no real title available?) | 2003-05-14 | Paper |
| scientific article; zbMATH DE number 1852135 (Why is no real title available?) | 2003-01-09 | Paper |
| scientific article; zbMATH DE number 1775055 (Why is no real title available?) | 2002-08-04 | Paper |
| scientific article; zbMATH DE number 1757949 (Why is no real title available?) | 2002-06-20 | Paper |
Triangles of extremal area or perimeter in a finite planar point set
Discrete & Computational Geometry | 2002-04-01 | Paper |
The obnoxious center problem on a tree
SIAM Journal on Discrete Mathematics | 2001-11-11 | Paper |
Constant-level greedy triangulations approximate the MWT well
Journal of Combinatorial Optimization | 2001-11-06 | Paper |
Generalized self-approaching curves
Discrete Applied Mathematics | 2001-04-04 | Paper |
Upper bounds on the maximal number of facets of 0/1-polytopes
European Journal of Combinatorics | 2000-12-13 | Paper |
A central limit theorem for convex chains in the square
Discrete & Computational Geometry | 2000-10-03 | Paper |
| scientific article; zbMATH DE number 1508990 (Why is no real title available?) | 2000-09-18 | Paper |
| scientific article; zbMATH DE number 1397985 (Why is no real title available?) | 2000-02-03 | Paper |
A dynamic programming algorithm for constructing optimal prefix-free codes with unequal letter costs
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
| scientific article; zbMATH DE number 1355185 (Why is no real title available?) | 1999-10-31 | Paper |
The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
Mathematical Programming. Series A. Series B | 1999-06-28 | Paper |
| scientific article; zbMATH DE number 1341909 (Why is no real title available?) | 1999-01-01 | Paper |
Time complexity and linear-time approximation of the ancient two-machine flow shop
Journal of Scheduling | 1998-11-01 | Paper |
Finding a shortest vector in a two-dimensional lattice modulo m
Theoretical Computer Science | 1998-07-23 | Paper |
A Visibility Representation for Graphs in Three Dimensions
Journal of Graph Algorithms and Applications | 1998-07-05 | Paper |
Approximation of convex figures by pairs of rectangles
Computational Geometry | 1998-06-08 | Paper |
Matching convex shapes with respect to the symmetric difference
Algorithmica | 1998-05-24 | Paper |
Matching Shapes with a Reference Point
International Journal of Computational Geometry & Applications | 1998-03-16 | Paper |
Binary trees having a given number of nodes with 0, 1, and 2 children
Séminaire Lotharingien de Combinatoire | 1998-03-12 | Paper |
Counting convex polygons in planar point sets
Information Processing Letters | 1997-02-27 | Paper |
Triangulations intersect nicely
Discrete & Computational Geometry | 1997-02-18 | Paper |
Quasi-Monte-Carlo methods and the dispersion of point sequences
Mathematical and Computer Modelling | 1997-02-16 | Paper |
| scientific article; zbMATH DE number 937598 (Why is no real title available?) | 1996-12-12 | Paper |
Webs, iteration groups, and equivalent changes in probabilities
Quarterly of Applied Mathematics | 1996-12-03 | Paper |
On-line \(q\)-adic covering by the method of the \(n\)-th segment and its application to on-line covering by cubes
Beiträge zur Algebra und Geometrie | 1996-09-18 | Paper |
On-line \(q\)-adic covering by the method of the \(n\)-th segment and its application to on-line covering by cubes
Beiträge zur Algebra und Geometrie | 1996-09-18 | Paper |
Vehicle routing in an automated warehouse: Analysis and optimization
Annals of Operations Research | 1996-02-18 | Paper |
| scientific article; zbMATH DE number 740987 (Why is no real title available?) | 1995-04-05 | Paper |
Sequences with subword complexity \(2n\)
Journal of Number Theory | 1995-01-22 | Paper |
Curves with increasing chords
Mathematical Proceedings of the Cambridge Philosophical Society | 1994-12-12 | Paper |
On the union of fat wedges and separating a collection of segments by a line
Computational Geometry | 1994-11-29 | Paper |
The convex-hull-and-line traveling salesman problem: A solvable case
Information Processing Letters | 1994-09-05 | Paper |
A heuristic for decomposing traffic matrices in TDMA satellite communication
ZOR Zeitschrift f� Operations Research Methods and Models of Operations Research | 1994-04-13 | Paper |
Shortest paths for line segments
Algorithmica | 1993-10-13 | Paper |
Simultaneous inner and outer approximation of shapes
Algorithmica | 1993-01-17 | Paper |
Minimum-link paths among obstacles in the plane
Algorithmica | 1993-01-17 | Paper |
The convergence rate of the sandwich algorithm for approximating convex functions
Computing | 1993-01-11 | Paper |
Counting convex \(k\)-gons in planar point sets
Information Processing Letters | 1992-09-26 | Paper |
Finding minimum area \(k\)-gons
Discrete & Computational Geometry | 1992-06-28 | Paper |
Sandwich approximation of univariate convex functions with an application to separable convex programming
Naval Research Logistics | 1992-06-28 | Paper |
The n-line traveling salesman problem
Networks | 1992-06-28 | Paper |
Counting \(k\)-subsets and convex \(k\)-gons in the plane
Information Processing Letters | 1992-06-26 | Paper |
Computing the minimum Hausdorff distance between two point sets on a line under translation
Information Processing Letters | 1992-06-26 | Paper |
Geometric clusterings
Journal of Algorithms | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4213470 (Why is no real title available?) | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4147534 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4206040 (Why is no real title available?) | 1990-01-01 | Paper |
Computing the geodesic center of a simple polygon
Discrete & Computational Geometry | 1989-01-01 | Paper |
Testing the necklace condition for shortest tours and optimal factors in the plane
Theoretical Computer Science | 1989-01-01 | Paper |
Approximation of convex curves with application to the bicriterial minimum cost flow problem
European Journal of Operational Research | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4160443 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4037195 (Why is no real title available?) | 1987-01-01 | Paper |
Minimizing the density of terminal assignments in layout design
Operations Research Letters | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 4043236 (Why is no real title available?) | 1986-01-01 | Paper |
A systolic array algorithm for the algebraic path problem (shortest paths; matrix inversion)
Computing | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3870611 (Why is no real title available?) | 1985-01-01 | Paper |
