Ji{ří} Matoušek

From MaRDI portal
Revision as of 19:16, 8 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Ji{ří} Matoušek to Ji{ří} Matoušek: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:818688

Available identifiers

zbMath Open matousek.jiriDBLPm/JiriMatousekWikidataQ472657 ScholiaQ472657MaRDI QIDQ818688

List of research outcomes





PublicationDate of PublicationType
On range searching with semialgebraic sets2022-08-18Paper
Factorization Norms and Hereditary Discrepancy2020-02-24Paper
A tail estimate for Mulmuley's segment intersection algorithm2019-12-04Paper
Computing all maps into a sphere2019-05-10Paper
https://portal.mardi4nfdi.de/entity/Q46338982019-05-06Paper
The one-round Voronoi game2018-11-23Paper
Embeddability in the 3-Sphere Is Decidable2018-08-02Paper
Embeddability in the 3-Sphere Is Decidable2018-04-23Paper
Lower bounds on geometric Ramsey functions2018-04-23Paper
Curves in Rd intersecting every hyperplane at most d + 1 times2018-04-23Paper
Using Brouwer’s Fixed Point Theorem2018-02-26Paper
ARRIVAL: A Zero-Player Graph Game in NP ∩ coNP2018-02-26Paper
Lower bounds for weak epsilon-nets and stair-convexity2017-10-20Paper
Combinatorial Discrepancy for Boxes via the gamma_2 Norm.2017-10-10Paper
Simplifying Inclusion–Exclusion Formulas2017-10-04Paper
Reachability by paths of bounded curvature in convex polygons2017-09-29Paper
New constructions of weak epsilon-nets2017-09-29Paper
Curves in \(\mathbb R^d\) intersecting every hyperplane at most \(d+1\) times2016-11-25Paper
Untangling two systems of noncrossing curves2016-07-22Paper
Lower bounds on the length of monotone paths in arrangements2016-04-26Paper
String graphs and separators2015-10-20Paper
https://portal.mardi4nfdi.de/entity/Q29474012015-09-23Paper
Three-monotone interpolation2015-07-20Paper
Multilevel polynomial partitions and simplified range searching2015-07-20Paper
A deterministic algorithm for the three-dimensional diameter problem2015-05-07Paper
Piecewise linear paths among convex obstacles2015-05-07Paper
Lower bounds on geometric Ramsey functions2015-04-17Paper
Polynomial-Time Computation of Homotopy Groups and Postnikov Systems in Fixed Dimension2015-02-09Paper
https://portal.mardi4nfdi.de/entity/Q29346622014-12-18Paper
The distance trisector curve2014-11-25Paper
https://portal.mardi4nfdi.de/entity/Q29217112014-10-13Paper
Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 12014-10-10Paper
On Gromov's method of selecting heavily covered points2014-09-19Paper
Computing All Maps into a Sphere2014-09-12Paper
Extending continuous maps2014-08-07Paper
https://portal.mardi4nfdi.de/entity/Q54200212014-06-11Paper
Intersection graphs of segments and $\exists\mathbb{R}$2014-06-10Paper
Near-Optimal Separators in String Graphs2014-05-02Paper
On Range Searching with Semialgebraic Sets. II2014-04-11Paper
Distance k -sectors exist2014-04-03Paper
Zone diagrams in Euclidean spaces and in other normed spaces2014-04-03Paper
Extendability of continuous maps is undecidable2014-03-25Paper
Polynomial-time homology for simplicial Eilenberg-MacLane spaces2014-03-24Paper
Higher-order Erdős-Szekeres theorems2014-03-03Paper
Untangling two systems of noncrossing curves2013-12-20Paper
https://portal.mardi4nfdi.de/entity/Q28573572013-11-01Paper
The determinant bound for discrepancy is almost tight2013-03-05Paper
Zone diagrams in Euclidean spaces and in other normed spaces2012-12-20Paper
Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique2012-10-15Paper
Vectors in a box2012-10-15Paper
Unit Distances in Three Dimensions2012-09-04Paper
Reachability by paths of bounded curvature in a convex polygon2012-06-08Paper
A geometric proof of the colored Tverberg theorem2012-03-01Paper
On the nonexistence of \(k\)-reptile tetrahedra2011-11-07Paper
Approximation Algorithms and Semidefinite Programming2011-10-26Paper
https://portal.mardi4nfdi.de/entity/Q30027842011-05-24Paper
Lower bounds for weak epsilon-nets and stair-convexity2011-05-05Paper
The number of unit distances is almost linear for most norms2011-02-09Paper
Hardness of embedding simplicial complexes in \(\mathbb R^d\)2011-01-28Paper
Inapproximability for metric embeddings into $\mathbb{R}^{d}$2011-01-06Paper
Distance \(k\)-sectors exist2010-09-02Paper
Towards asymptotic optimality in probabilistic packet marking2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35700782010-06-24Paper
https://portal.mardi4nfdi.de/entity/Q35586302010-05-05Paper
Stabbing simplices by points and flats2010-03-04Paper
Removing degeneracy in LP-type problems revisited2009-12-14Paper
Dimension gaps between representability and collapsibility2009-12-14Paper
How Many Points Can Be Reconstructed from k Projections?2009-11-27Paper
Geometric discrepancy. An illustrated guide2009-10-29Paper
Blocking visibility for points in general position2009-07-24Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
Induced trees in triangle-free graphs2009-04-07Paper
Large Monochromatic Components in Two-Colored Grids2009-03-16Paper
https://portal.mardi4nfdi.de/entity/Q35398542008-11-19Paper
Computing \(D\)-convex hulls in the plane2008-10-22Paper
Graph coloring with no large monochromatic components2008-09-29Paper
Violator spaces: Structure and algorithms2008-09-10Paper
Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler2008-09-10Paper
On variants of the Johnson–Lindenstrauss lemma2008-09-04Paper
Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge2008-08-14Paper
Induced trees in triangle-free graphs2008-06-05Paper
Large Monochromatic Components in Two-colored Grids2008-06-05Paper
Removing degeneracy may require unbounded dimension increase2008-06-05Paper
Graph coloring with no large monochromatic components2008-06-05Paper
How many points can be reconstructed from k projections?2008-06-05Paper
Quadratically Many Colorful Simplices2008-03-28Paper
Nonexistence of 2-Reptile Simplices2008-03-18Paper
Violator Spaces: Structure and Algorithms2008-03-11Paper
Packing cones and their negatives in space2007-12-19Paper
Online Conflict‐Free Coloring for Intervals2007-10-22Paper
Transversals of hypergraphs with geometric flavor2007-05-29Paper
The distance trisector curve2007-05-23Paper
The number of unique-sink orientations of the hypercube2007-01-02Paper
Understanding and using linear programming2006-11-28Paper
Berge's theorem, fractional Helly, and art galleries2006-10-30Paper
Random edge can be exponential on abstract cubes2006-07-20Paper
The Minimum Independence Number of a Hasse Diagram2006-07-06Paper
Discrepancy after adding a single set2006-06-27Paper
\(k\)-sets in four dimensions2006-03-21Paper
Bounded-degree graphs have arbitrarily large geometric thickness2006-01-17Paper
Expected length of the longest common subsequence for large alphabets2005-11-22Paper
https://portal.mardi4nfdi.de/entity/Q56926972005-09-28Paper
Low-Distortion Embeddings of Trees2005-05-25Paper
Topological lower bounds for the chromatic number: a hierarchy2005-03-08Paper
The randomized integer convex hull2005-02-23Paper
Triangles in random graphs2005-02-22Paper
New constructions of weak \(\varepsilon\)-nets2005-02-11Paper
https://portal.mardi4nfdi.de/entity/Q31554202005-01-17Paper
No Helly theorem for stabbing translates by lines in \(\mathbb{R}^3\)2004-12-16Paper
A combinatorical proof of Kneser's conjecture2004-10-19Paper
Crossing number, pair-crossing number, and expansion2004-10-01Paper
Bounded VC-dimension implies a fractional Helly theorem2004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q30437352004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44626392004-05-18Paper
The one-round Voronoi game2004-03-11Paper
On restricted min‐wise independence of permutations2004-02-03Paper
A lower bound for weak \(\varepsilon\)-nets in high dimension2003-07-15Paper
Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler2003-05-20Paper
A fractional Helly theorem for convex lattice sets2003-05-04Paper
Transversal numbers for hypergraphs arising in geometry2003-03-26Paper
Random lifts of graphs: Independence and chromatic number2002-09-20Paper
Lower bound on the minus-domination number2002-06-06Paper
https://portal.mardi4nfdi.de/entity/Q45306262002-06-04Paper
https://portal.mardi4nfdi.de/entity/Q27683942002-06-03Paper
Equipartition of two measures by a 4-fan2002-05-30Paper
On the chromatic number of Kneser hypergraphs2002-05-13Paper
Simultaneous partitions of measures by \(k\)-fans2002-04-03Paper
Invitiation to discrete mathematics2002-03-17Paper
On directional convexity2002-01-23Paper
https://portal.mardi4nfdi.de/entity/Q42303292002-01-21Paper
Lower bounds on the transversal numbers of \(d\)-intervals2002-01-14Paper
On dominated \(\ell_1\) metrics2001-10-28Paper
A lower bound for families of Natarajan dimension \(d\)2001-10-21Paper
https://portal.mardi4nfdi.de/entity/Q27072642001-04-01Paper
Almost-tiling the plane by ellipses2001-01-03Paper
On the Discrepancy for Cartesian Products2000-12-13Paper
On embedding trees into uniformly convex Banach spaces2000-11-19Paper
On the signed domination in graphs2000-11-13Paper
On embedding expanders into \(\ell_p\) spaces2000-11-06Paper
On the linear and hereditary discrepancies2000-08-28Paper
On approximate geometric \(k\)-clustering2000-08-24Paper
On the \(L_2\)-discrepancy for anchored boxes2000-08-02Paper
https://portal.mardi4nfdi.de/entity/Q49455142000-03-23Paper
A highly non-smooth norm on Hilbert space2000-02-09Paper
On visibility and covering by convex sets2000-01-17Paper
Product Range Spaces, Sensitive Sampling, and Derandomization1999-10-28Paper
The exponent of discrepancy is at least 1. 06691999-08-23Paper
https://portal.mardi4nfdi.de/entity/Q42082351999-08-23Paper
Geometric discrepancy. An illustrated guide1999-07-05Paper
An \(L_p\) version of the Beck-Fiala conjecture1999-07-01Paper
On the discrepancy for boxes and polytopes1999-06-28Paper
On constants for cuttings in the plane1999-01-13Paper
Mathematical snapshots from the computational geometry landscape1998-08-05Paper
Efficient randomized algorithms for the repeated median line estimator1998-05-24Paper
https://portal.mardi4nfdi.de/entity/Q43893321998-05-13Paper
Computing Many Faces in Arrangements of Lines and Segments1998-05-10Paper
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams1998-05-10Paper
Guarding galleries where every point sees a large area1998-03-04Paper
On discrepancy bounds via dual shatter function1997-11-11Paper
Improved upper bounds for approximation by zonotopes1997-11-05Paper
https://portal.mardi4nfdi.de/entity/Q43523351997-08-28Paper
A Helly-type theorem for unions of convex sets1997-07-28Paper
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension1997-07-08Paper
https://portal.mardi4nfdi.de/entity/Q56890181997-03-11Paper
On enclosing k points by a circle1997-02-28Paper
A subexponential bound for linear programming1997-02-18Paper
Discrepancy in arithmetic progressions1997-01-28Paper
On the distortion required for embedding finite metric spaces into normed spaces1996-11-21Paper
On geometric optimization with few violated constraints1996-09-02Paper
Note on the colored Tverberg theorem1996-08-18Paper
A deterministic algorithm for the three-dimensional diameter problem1996-07-14Paper
Derandomization in Computational Geometry1996-06-09Paper
Dynamic half-space range reporting and its applications1995-12-13Paper
Vertical decomposition of arrangements of hyperplanes in four dimensions1995-08-13Paper
Piecewise linear paths among convex obstacles1995-08-01Paper
An elementary approach to lower bounds in geometric discrepancy1995-07-02Paper
Tight upper bounds for the discrepancy of half-spaces1995-07-02Paper
https://portal.mardi4nfdi.de/entity/Q48349951995-06-22Paper
https://portal.mardi4nfdi.de/entity/Q47633891995-04-11Paper
Complexity of projected images of convex subdivisions1995-04-09Paper
On Ramsey sets in spheres1995-04-04Paper
https://portal.mardi4nfdi.de/entity/Q31404301995-03-27Paper
Derandomizing an output-sensitive convex hull algorithm in three dimensions1995-03-22Paper
Intersection graphs of segments1995-01-05Paper
A Ramsey-Type Result for Convex Sets1994-12-14Paper
https://portal.mardi4nfdi.de/entity/Q31387441994-11-29Paper
Lower bounds for a subexponential optimization algorithm1994-11-08Paper
Discrepancy and approximations for bounded VC-dimension1994-09-11Paper
On range searching with semialgebraic sets1994-06-29Paper
Algorithms for ham-sandwich cuts1994-06-29Paper
On the sum of squares of cell complexities in hyperplane arrangements1994-06-06Paper
Fat Triangles Determine Linearly Many Holes1994-04-27Paper
https://portal.mardi4nfdi.de/entity/Q31404031993-12-21Paper
Ray Shooting and Parametric Search1993-10-10Paper
Range searching with efficient hierarchical cuttings1993-09-30Paper
On ray shooting in convex polytopes1993-09-30Paper
On vertical ray shooting in arrangements1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q46956581993-06-29Paper
Linear Optimization Queries1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40374111993-05-18Paper
On the complexity of finding iso- and other morphisms for partial \(k\)- trees1993-01-17Paper
Efficient partition trees1993-01-16Paper
Relative neighborhood graphs in three dimensions1993-01-16Paper
Reporting points in halfspaces1992-12-16Paper
Farthest neighbors, maximum spanning trees and related problems in higher dimensions1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40124891992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q39897101992-06-28Paper
Good splitters for counting points in triangles1992-06-28Paper
Randomized optimal algorithm for slope selection1992-06-27Paper
Computing dominances in \(E^ n\)1992-06-26Paper
Cutting hyperplane arrangements1992-06-25Paper
String graphs requiring exponential representations1991-01-01Paper
Algorithms finding tree-decompositions of graphs1991-01-01Paper
Approximate Levels in Line Arrangements1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33537901991-01-01Paper
Spanning trees with low crossing number1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33597981991-01-01Paper
Construction of \(\epsilon\)-nets1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33586521990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34711931990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34969121990-01-01Paper
On-line computation of convolutions1989-01-01Paper
A typical property of the symmetric differential quotient1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34746851989-01-01Paper
Line arrangements and range search1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38072441988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38215801988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37722001987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37125091986-01-01Paper

Research outcomes over time

This page was built for person: Ji{ří} Matoušek