| Publication | Date of Publication | Type |
|---|
On range searching with semialgebraic sets
Mathematical Foundations of Computer Science 1992 | 2022-08-18 | Paper |
Factorization norms and hereditary discrepancy
IMRN. International Mathematics Research Notices | 2020-02-24 | Paper |
A tail estimate for Mulmuley's segment intersection algorithm
Automata, Languages and Programming | 2019-12-04 | Paper |
Computing all maps into a sphere
(available as arXiv preprint) | 2019-05-10 | Paper |
| Computing all maps into a sphere | 2019-05-10 | Paper |
| scientific article; zbMATH DE number 7051255 (Why is no real title available?) | 2019-05-06 | Paper |
The one-round Voronoi game
Proceedings of the eighteenth annual symposium on Computational geometry | 2018-11-23 | Paper |
Embeddability in the 3-sphere is decidable
Journal of the ACM | 2018-08-02 | Paper |
Curves in \(\mathbb{R}^d\) intersecting every hyperplane at most \(d+1\) times
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Embeddability in the 3-sphere is decidable
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Lower bounds on geometric Ramsey functions
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
Using Brouwer’s Fixed Point Theorem
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
ARRIVAL: a zero-player graph game in \(\text{NP}\cap \text{coNP}\)
A Journey Through Discrete Mathematics | 2018-02-26 | Paper |
Lower bounds for weak epsilon-nets and stair-convexity
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
| Combinatorial discrepancy for boxes via the \(\gamma_2\) norm | 2017-10-10 | Paper |
Simplifying Inclusion–Exclusion Formulas
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Reachability by paths of bounded curvature in convex polygons
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
New constructions of weak epsilon-nets
Proceedings of the nineteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Curves in \(\mathbb R^d\) intersecting every hyperplane at most \(d+1\) times
Journal of the European Mathematical Society (JEMS) | 2016-11-25 | Paper |
Untangling two systems of noncrossing curves
Israel Journal of Mathematics | 2016-07-22 | Paper |
Lower bounds on the length of monotone paths in arrangements
Discrete & Computational Geometry | 2016-04-26 | Paper |
String graphs and separators
Geometry, Structure and Randomness in Combinatorics | 2015-10-20 | Paper |
| Mathematics++. Selected topics beyond the basic courses | 2015-09-23 | Paper |
Multilevel polynomial partitions and simplified range searching
Discrete & Computational Geometry | 2015-07-20 | Paper |
Three-monotone interpolation
Discrete & Computational Geometry | 2015-07-20 | Paper |
A deterministic algorithm for the three-dimensional diameter problem
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Piecewise linear paths among convex obstacles
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Lower bounds on geometric Ramsey functions
SIAM Journal on Discrete Mathematics | 2015-04-17 | Paper |
Polynomial-time computation of homotopy groups and Postnikov systems in fixed dimension
SIAM Journal on Computing | 2015-02-09 | Paper |
| Zone diagrams: existence, uniqueness and algorithmic challenge | 2014-12-18 | Paper |
The distance trisector curve
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
| Online conflict-free coloring for intervals | 2014-10-13 | Paper |
Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
Duke Mathematical Journal | 2014-10-10 | Paper |
Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
Duke Mathematical Journal | 2014-10-10 | Paper |
On Gromov's method of selecting heavily covered points
Discrete & Computational Geometry | 2014-09-19 | Paper |
Computing all maps into a sphere
Journal of the ACM | 2014-09-12 | Paper |
Extending continuous maps, polynomiality and undecidability
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
| Simplifying inclusion-exclusion formulas | 2014-06-11 | Paper |
| Intersection graphs of segments and $\exists\mathbb{R}$ | 2014-06-10 | Paper |
Near-optimal separators in string graphs
Combinatorics, Probability and Computing | 2014-05-02 | Paper |
On range searching with semialgebraic sets. II.
SIAM Journal on Computing | 2014-04-11 | Paper |
Zone diagrams in Euclidean spaces and in other normed spaces
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Distance \(k\)-sectors exist
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Extendability of continuous maps is undecidable
Discrete & Computational Geometry | 2014-03-25 | Paper |
Polynomial-time homology for simplicial Eilenberg-MacLane spaces
Foundations of Computational Mathematics | 2014-03-24 | Paper |
Higher-order Erdős-Szekeres theorems
Advances in Mathematics | 2014-03-03 | Paper |
Untangling two systems of noncrossing curves
Lecture Notes in Computer Science | 2013-12-20 | Paper |
| A doubly exponentially crumbled cake | 2013-11-01 | Paper |
The determinant bound for discrepancy is almost tight
Proceedings of the American Mathematical Society | 2013-03-05 | Paper |
Zone diagrams in Euclidean spaces and in other normed spaces
Mathematische Annalen | 2012-12-20 | Paper |
Zone diagrams in Euclidean spaces and in other normed spaces
Mathematische Annalen | 2012-12-20 | Paper |
Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
Discrete & Computational Geometry | 2012-10-15 | Paper |
Vectors in a box
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
Unit distances in three dimensions
Combinatorics, Probability and Computing | 2012-09-04 | Paper |
Reachability by paths of bounded curvature in a convex polygon
Computational Geometry | 2012-06-08 | Paper |
A geometric proof of the colored Tverberg theorem
Discrete & Computational Geometry | 2012-03-01 | Paper |
On the nonexistence of \(k\)-reptile tetrahedra
Discrete & Computational Geometry | 2011-11-07 | Paper |
| Approximation algorithms and semidefinite programming. | 2011-10-26 | Paper |
scientific article; zbMATH DE number 5899260 (Why is no real title available?)
Theory of Computing | 2011-05-24 | Paper |
Lower bounds for weak epsilon-nets and stair-convexity
Israel Journal of Mathematics | 2011-05-05 | Paper |
The number of unit distances is almost linear for most norms
Advances in Mathematics | 2011-02-09 | Paper |
Hardness of embedding simplicial complexes in \(\mathbb R^d\)
Journal of the European Mathematical Society (JEMS) | 2011-01-28 | Paper |
Inapproximability for metric embeddings into $\mathbb{R}^{d}$
Transactions of the American Mathematical Society | 2011-01-06 | Paper |
Distance \(k\)-sectors exist
Computational Geometry | 2010-09-02 | Paper |
Towards asymptotic optimality in probabilistic packet marking
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| Thirty-three miniatures. Mathematical and algorithmic applications of linear algebra | 2010-06-24 | Paper |
| scientific article; zbMATH DE number 5704228 (Why is no real title available?) | 2010-05-05 | Paper |
Stabbing simplices by points and flats
Discrete & Computational Geometry | 2010-03-04 | Paper |
Removing degeneracy in LP-type problems revisited
Discrete & Computational Geometry | 2009-12-14 | Paper |
Dimension gaps between representability and collapsibility
Discrete & Computational Geometry | 2009-12-14 | Paper |
How Many Points Can Be Reconstructed from k Projections?
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Geometric discrepancy. An illustrated guide
Algorithms and Combinatorics | 2009-10-29 | Paper |
Blocking visibility for points in general position
Discrete & Computational Geometry | 2009-07-24 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Induced trees in triangle-free graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Induced trees in triangle-free graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Induced trees in triangle-free graphs
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Large Monochromatic Components in Two-Colored Grids
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
| Invitation to discrete mathematics | 2008-11-19 | Paper |
Computing \(D\)-convex hulls in the plane
Computational Geometry | 2008-10-22 | Paper |
Graph colouring with no large monochronomatic components
Combinatorics, Probability and Computing | 2008-09-29 | Paper |
Violator spaces: Structure and algorithms
Discrete Applied Mathematics | 2008-09-10 | Paper |
Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
Universitext | 2008-09-10 | Paper |
On variants of the Johnson–Lindenstrauss lemma
Random Structures & Algorithms | 2008-09-04 | Paper |
Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge
SIAM Journal on Computing | 2008-08-14 | Paper |
Removing degeneracy may require unbounded dimension increase
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Large Monochromatic Components in Two-colored Grids
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
How many points can be reconstructed from k projections?
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Graph coloring with no large monochromatic components
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Induced trees in triangle-free graphs
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Quadratically Many Colorful Simplices
SIAM Journal on Discrete Mathematics | 2008-03-28 | Paper |
Nonexistence of 2-Reptile Simplices
Discrete and Computational Geometry | 2008-03-18 | Paper |
Violator Spaces: Structure and Algorithms
Lecture Notes in Computer Science | 2008-03-11 | Paper |
Packing cones and their negatives in space
Discrete & Computational Geometry | 2007-12-19 | Paper |
Online Conflict‐Free Coloring for Intervals
SIAM Journal on Computing | 2007-10-22 | Paper |
Transversals of hypergraphs with geometric flavor
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
The distance trisector curve
Advances in Mathematics | 2007-05-23 | Paper |
The number of unique-sink orientations of the hypercube
Combinatorica | 2007-01-02 | Paper |
Understanding and using linear programming
Universitext | 2006-11-28 | Paper |
Berge's theorem, fractional Helly, and art galleries
Discrete Mathematics | 2006-10-30 | Paper |
Random edge can be exponential on abstract cubes
Advances in Mathematics | 2006-07-20 | Paper |
The Minimum Independence Number of a Hasse Diagram
Combinatorics, Probability and Computing | 2006-07-06 | Paper |
Discrepancy after adding a single set
Combinatorica | 2006-06-27 | Paper |
\(k\)-sets in four dimensions
Discrete & Computational Geometry | 2006-03-21 | Paper |
Bounded-degree graphs have arbitrarily large geometric thickness
The Electronic Journal of Combinatorics | 2006-01-17 | Paper |
Bounded-degree graphs have arbitrarily large geometric thickness
The Electronic Journal of Combinatorics | 2006-01-17 | Paper |
Expected length of the longest common subsequence for large alphabets
Advances in Mathematics | 2005-11-22 | Paper |
| scientific article; zbMATH DE number 2209715 (Why is no real title available?) | 2005-09-28 | Paper |
Low-Distortion Embeddings of Trees
Journal of Graph Algorithms and Applications | 2005-05-25 | Paper |
Topological lower bounds for the chromatic number: a hierarchy
Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) | 2005-03-08 | Paper |
The randomized integer convex hull
Discrete & Computational Geometry | 2005-02-23 | Paper |
Triangles in random graphs
Discrete Mathematics | 2005-02-22 | Paper |
New constructions of weak \(\varepsilon\)-nets
Discrete & Computational Geometry | 2005-02-11 | Paper |
| scientific article; zbMATH DE number 2128363 (Why is no real title available?) | 2005-01-17 | Paper |
No Helly theorem for stabbing translates by lines in \(\mathbb{R}^3\)
Discrete & Computational Geometry | 2004-12-16 | Paper |
A combinatorical proof of Kneser's conjecture
Combinatorica | 2004-10-19 | Paper |
Crossing number, pair-crossing number, and expansion
Journal of Combinatorial Theory. Series B | 2004-10-01 | Paper |
Bounded VC-dimension implies a fractional Helly theorem
Discrete & Computational Geometry | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2084288 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2066196 (Why is no real title available?) | 2004-05-18 | Paper |
The one-round Voronoi game
Discrete & Computational Geometry | 2004-03-11 | Paper |
On restricted min‐wise independence of permutations
Random Structures & Algorithms | 2004-02-03 | Paper |
A lower bound for weak \(\varepsilon\)-nets in high dimension
Discrete & Computational Geometry | 2003-07-15 | Paper |
Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
Universitext | 2003-05-20 | Paper |
A fractional Helly theorem for convex lattice sets
Advances in Mathematics | 2003-05-04 | Paper |
Transversal numbers for hypergraphs arising in geometry
Advances in Applied Mathematics | 2003-03-26 | Paper |
Random lifts of graphs: Independence and chromatic number
Random Structures & Algorithms | 2002-09-20 | Paper |
Lower bound on the minus-domination number
Discrete Mathematics | 2002-06-06 | Paper |
| scientific article; zbMATH DE number 1749054 (Why is no real title available?) | 2002-06-04 | Paper |
| Random lifts of graphs | 2002-06-03 | Paper |
Equipartition of two measures by a 4-fan
Discrete & Computational Geometry | 2002-05-30 | Paper |
On the chromatic number of Kneser hypergraphs
Proceedings of the American Mathematical Society | 2002-05-13 | Paper |
Simultaneous partitions of measures by \(k\)-fans
Discrete & Computational Geometry | 2002-04-03 | Paper |
Invitiation to discrete mathematics
Springer-Lehrbuch | 2002-03-17 | Paper |
On directional convexity
Discrete & Computational Geometry | 2002-01-23 | Paper |
| scientific article; zbMATH DE number 1256643 (Why is no real title available?) | 2002-01-21 | Paper |
Lower bounds on the transversal numbers of \(d\)-intervals
Discrete & Computational Geometry | 2002-01-14 | Paper |
On dominated \(\ell_1\) metrics
Israel Journal of Mathematics | 2001-10-28 | Paper |
A lower bound for families of Natarajan dimension \(d\)
Journal of Combinatorial Theory. Series A | 2001-10-21 | Paper |
Discrepancy of point sequences on fractal sets
Publicationes Mathematicae Debrecen | 2001-04-01 | Paper |
Almost-tiling the plane by ellipses
Discrete & Computational Geometry | 2001-01-03 | Paper |
On the Discrepancy for Cartesian Products
Journal of the London Mathematical Society | 2000-12-13 | Paper |
On embedding trees into uniformly convex Banach spaces
Israel Journal of Mathematics | 2000-11-19 | Paper |
On the signed domination in graphs
Combinatorica | 2000-11-13 | Paper |
On embedding expanders into \(\ell_p\) spaces
Israel Journal of Mathematics | 2000-11-06 | Paper |
On the linear and hereditary discrepancies
European Journal of Combinatorics | 2000-08-28 | Paper |
On approximate geometric \(k\)-clustering
Discrete & Computational Geometry | 2000-08-24 | Paper |
On the \(L_2\)-discrepancy for anchored boxes
Journal of Complexity | 2000-08-02 | Paper |
| scientific article; zbMATH DE number 1424301 (Why is no real title available?) | 2000-03-23 | Paper |
A highly non-smooth norm on Hilbert space
Israel Journal of Mathematics | 2000-02-09 | Paper |
On visibility and covering by convex sets
Israel Journal of Mathematics | 2000-01-17 | Paper |
Product Range Spaces, Sensitive Sampling, and Derandomization
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1195522 (Why is no real title available?) | 1999-08-23 | Paper |
The exponent of discrepancy is at least 1. 0669
Journal of Complexity | 1999-08-23 | Paper |
Geometric discrepancy. An illustrated guide
Algorithms and Combinatorics | 1999-07-05 | Paper |
An \(L_p\) version of the Beck-Fiala conjecture
European Journal of Combinatorics | 1999-07-01 | Paper |
On the discrepancy for boxes and polytopes
Monatshefte für Mathematik | 1999-06-28 | Paper |
On constants for cuttings in the plane
Discrete & Computational Geometry | 1999-01-13 | Paper |
Mathematical snapshots from the computational geometry landscape
Documenta Mathematica | 1998-08-05 | Paper |
Mathematical snapshots from the computational geometry landscape
Documenta Mathematica | 1998-08-05 | Paper |
Efficient randomized algorithms for the repeated median line estimator
Algorithmica | 1998-05-24 | Paper |
| scientific article; zbMATH DE number 1151379 (Why is no real title available?) | 1998-05-13 | Paper |
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
SIAM Journal on Computing | 1998-05-10 | Paper |
Computing Many Faces in Arrangements of Lines and Segments
SIAM Journal on Computing | 1998-05-10 | Paper |
Guarding galleries where every point sees a large area
Israel Journal of Mathematics | 1998-03-04 | Paper |
On discrepancy bounds via dual shatter function
Mathematika | 1997-11-11 | Paper |
Improved upper bounds for approximation by zonotopes
Acta Mathematica | 1997-11-05 | Paper |
| scientific article; zbMATH DE number 1054787 (Why is no real title available?) | 1997-08-28 | Paper |
A Helly-type theorem for unions of convex sets
Discrete & Computational Geometry | 1997-07-28 | Paper |
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
Journal of Algorithms | 1997-07-08 | Paper |
| scientific article; zbMATH DE number 970813 (Why is no real title available?) | 1997-03-11 | Paper |
On enclosing k points by a circle
Information Processing Letters | 1997-02-28 | Paper |
A subexponential bound for linear programming
Algorithmica | 1997-02-18 | Paper |
Discrepancy in arithmetic progressions
Journal of the American Mathematical Society | 1997-01-28 | Paper |
On the distortion required for embedding finite metric spaces into normed spaces
Israel Journal of Mathematics | 1996-11-21 | Paper |
On geometric optimization with few violated constraints
Discrete & Computational Geometry | 1996-09-02 | Paper |
Note on the colored Tverberg theorem
Journal of Combinatorial Theory. Series B | 1996-08-18 | Paper |
A deterministic algorithm for the three-dimensional diameter problem
Computational Geometry | 1996-07-14 | Paper |
Derandomization in Computational Geometry
Journal of Algorithms | 1996-06-09 | Paper |
Dynamic half-space range reporting and its applications
Algorithmica | 1995-12-13 | Paper |
Vertical decomposition of arrangements of hyperplanes in four dimensions
Discrete & Computational Geometry | 1995-08-13 | Paper |
Piecewise linear paths among convex obstacles
Discrete & Computational Geometry | 1995-08-01 | Paper |
An elementary approach to lower bounds in geometric discrepancy
Discrete & Computational Geometry | 1995-07-02 | Paper |
Tight upper bounds for the discrepancy of half-spaces
Discrete & Computational Geometry | 1995-07-02 | Paper |
| scientific article; zbMATH DE number 763368 (Why is no real title available?) | 1995-06-22 | Paper |
| scientific article; zbMATH DE number 742948 (Why is no real title available?) | 1995-04-11 | Paper |
Complexity of projected images of convex subdivisions
Computational Geometry | 1995-04-09 | Paper |
On Ramsey sets in spheres
Journal of Combinatorial Theory. Series A | 1995-04-04 | Paper |
| scientific article; zbMATH DE number 437553 (Why is no real title available?) | 1995-03-27 | Paper |
Derandomizing an output-sensitive convex hull algorithm in three dimensions
Computational Geometry | 1995-03-22 | Paper |
Intersection graphs of segments
Journal of Combinatorial Theory. Series B | 1995-01-05 | Paper |
A Ramsey-Type Result for Convex Sets
Bulletin of the London Mathematical Society | 1994-12-14 | Paper |
| scientific article; zbMATH DE number 431986 (Why is no real title available?) | 1994-11-29 | Paper |
Lower bounds for a subexponential optimization algorithm
Random Structures & Algorithms | 1994-11-08 | Paper |
Discrepancy and approximations for bounded VC-dimension
Combinatorica | 1994-09-11 | Paper |
Algorithms for ham-sandwich cuts
Discrete & Computational Geometry | 1994-06-29 | Paper |
On range searching with semialgebraic sets
Discrete & Computational Geometry | 1994-06-29 | Paper |
On the sum of squares of cell complexities in hyperplane arrangements
Journal of Combinatorial Theory. Series A | 1994-06-06 | Paper |
Fat Triangles Determine Linearly Many Holes
SIAM Journal on Computing | 1994-04-27 | Paper |
| scientific article; zbMATH DE number 437531 (Why is no real title available?) | 1993-12-21 | Paper |
Ray Shooting and Parametric Search
SIAM Journal on Computing | 1993-10-10 | Paper |
On ray shooting in convex polytopes
Discrete & Computational Geometry | 1993-09-30 | Paper |
Range searching with efficient hierarchical cuttings
Discrete & Computational Geometry | 1993-09-30 | Paper |
| scientific article; zbMATH DE number 219640 (Why is no real title available?) | 1993-06-29 | Paper |
Linear Optimization Queries
Journal of Algorithms | 1993-06-29 | Paper |
On vertical ray shooting in arrangements
Computational Geometry | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 177542 (Why is no real title available?) | 1993-05-18 | Paper |
On the complexity of finding iso- and other morphisms for partial \(k\)- trees
Discrete Mathematics | 1993-01-17 | Paper |
Efficient partition trees
Discrete & Computational Geometry | 1993-01-16 | Paper |
Relative neighborhood graphs in three dimensions
Computational Geometry | 1993-01-16 | Paper |
Reporting points in halfspaces
Computational Geometry | 1992-12-16 | Paper |
Farthest neighbors, maximum spanning trees and related problems in higher dimensions
Computational Geometry | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 64771 (Why is no real title available?) | 1992-09-27 | Paper |
Good splitters for counting points in triangles
Journal of Algorithms | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 35094 (Why is no real title available?) | 1992-06-28 | Paper |
Randomized optimal algorithm for slope selection
Information Processing Letters | 1992-06-27 | Paper |
Computing dominances in \(E^ n\)
Information Processing Letters | 1992-06-26 | Paper |
Cutting hyperplane arrangements
Discrete & Computational Geometry | 1992-06-25 | Paper |
Spanning trees with low crossing number
RAIRO - Theoretical Informatics and Applications | 1991-01-01 | Paper |
String graphs requiring exponential representations
Journal of Combinatorial Theory. Series B | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4205374 (Why is no real title available?) | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4213496 (Why is no real title available?) | 1991-01-01 | Paper |
Algorithms finding tree-decompositions of graphs
Journal of Algorithms | 1991-01-01 | Paper |
Approximate Levels in Line Arrangements
SIAM Journal on Computing | 1991-01-01 | Paper |
| scientific article; zbMATH DE number 4138748 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4169644 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4210053 (Why is no real title available?) | 1990-01-01 | Paper |
Construction of \(\epsilon\)-nets
Discrete & Computational Geometry | 1990-01-01 | Paper |
A typical property of the symmetric differential quotient
Colloquium Mathematicum | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4142090 (Why is no real title available?) | 1989-01-01 | Paper |
On-line computation of convolutions
Information Processing Letters | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4075110 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4094810 (Why is no real title available?) | 1988-01-01 | Paper |
Line arrangements and range search
Information Processing Letters | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4031661 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 3939614 (Why is no real title available?) | 1986-01-01 | Paper |
