Lower bounds for embedding edit distance into normed spaces
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On the rectilinear crossing number of complete graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
High-dimensional shape fitting in linear time
Proceedings of the nineteenth annual symposium on Computational geometry
New constructions of weak epsilon-nets
Proceedings of the nineteenth annual symposium on Computational geometry
The intrinsic dimensionality of graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On average distortion of embedding metrics into the line and into L1
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Distinct distances in three and higher dimensions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Cutting triangular cycles of lines in space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Random Structures & Algorithms
Distinct Distances in Three and Higher Dimensions
Combinatorics, Probability and Computing
Approximating metrics by tree metrics
ACM SIGACT News
Algorithms for center and Tverberg points
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Expander flows, geometric embeddings and graph partitioning
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Low distortion maps between point sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Journal of the ACM (JACM)
Euclidean distortion and the sparsest cut
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Smaller coresets for k-median and k-means clustering
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
On distance scales, embeddings, and efficient relaxations of the cut cone
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of low-distortion embeddings between point sets
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A tight threshold for metric Ramsey phenomena
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The interface between computational and combinatorial geometry
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On levels in arrangements of surfaces in three dimensions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Sparse source-wise and pair-wise distance preservers
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
How fast is the k-means method?
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Hitting sets when the VC-dimension is small
Information Processing Letters
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On some monotone path problems in line arrangements
Computational Geometry: Theory and Applications
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Robust shape fitting via peeling and grating coresets
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Improved lower and upper bounds for universal TSP in planar metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A framework for pursuit evasion games in Rn
Information Processing Letters
Applications of the regularity lemma for uniform hypergraphs
Random Structures & Algorithms
Advances in metric embedding theory
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Plane embeddings of planar graph metrics
Proceedings of the twenty-second annual symposium on Computational geometry
Volume distortion for subsets of Euclidean spaces: extended abstract
Proceedings of the twenty-second annual symposium on Computational geometry
The density of iterated crossing points and a gap result for triangulations of finite point sets
Proceedings of the twenty-second annual symposium on Computational geometry
Monotone maps, sphericity and bounded second eigenvalue
Journal of Combinatorial Theory Series B
Architecture-aware FPGA placement using metric embedding
Proceedings of the 43rd annual Design Automation Conference
Metric structures in L1: dimension, snowflakes, and average distortion
European Journal of Combinatorics
Dominating sets in k-majority tournaments
Journal of Combinatorial Theory Series B
Indexing schemes for similarity search: an illustrated paradigm
Fundamenta Informaticae
Efficient collision detection for spherical blend skinning
Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia
Approximating fluid schedules in crossbar packet-switches and Banyan networks
IEEE/ACM Transactions on Networking (TON)
Note: Geometric drawings of Kn with few crossings
Journal of Combinatorial Theory Series A
Probabilistic embeddings of bounded genus graphs into planar graphs
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Weak ε-nets have basis of size o(1/ε log (1/ε)) in any dimension
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Embeddings of surfaces, curves, and moving points in euclidean space
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Vertex cuts, random walks, and dimension reduction in series-parallel graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Nearest-neighbor-preserving embeddings
ACM Transactions on Algorithms (TALG)
Dynamic connectivity for axis-parallel rectangles
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
A simple proof for open cups and caps
European Journal of Combinatorics
Optimal distortion embeddings of distance regular graphs into Euclidean spaces
Journal of Combinatorial Theory Series B
Catching elephants with mice: sparse sampling for monitoring sensor networks
Proceedings of the 5th international conference on Embedded networked sensor systems
Approximation and inapproximability results for maximum clique of disc graphs in high dimensions
Information Processing Letters
An optimal randomized algorithm for d-variate zonoid depth
Computational Geometry: Theory and Applications
Weak ε-nets have basis of size O (1/εlog(1/ε)) in any dimension
Computational Geometry: Theory and Applications
On the bichromatic k-set problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Designing networks with good equilibria
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Weak ε-nets and interval chains
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Recursive geometry of the flow complex and topology of the flow complex filtration
Computational Geometry: Theory and Applications
Efficient data dissemination using locale covers
Pervasive and Mobile Computing
Embeddings of negative-type metrics and an improved approximation to generalized sparsest cut
ACM Transactions on Algorithms (TALG)
Proceedings of the twenty-fourth annual symposium on Computational geometry
Intersecting convex sets by rays
Proceedings of the twenty-fourth annual symposium on Computational geometry
Testing embeddability between metric spaces
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
On a question of bourgain about geometric incidences
Combinatorics, Probability and Computing
On Center Regions and Balls Containing Many Points
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Lower Bounds for Evolution Strategies Using VC-Dimension
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Algorithms for center and Tverberg points
ACM Transactions on Algorithms (TALG)
Common transversals in the plane: The fractional perspective
European Journal of Combinatorics
Weak ε-nets and interval chains
Journal of the ACM (JACM)
Topological sweep of the complete graph
Discrete Applied Mathematics
Coarse Differentiation and Multi-flows in Planar Graphs
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Topological obstructions for vertex numbers of Minkowski sums
Journal of Combinatorial Theory Series A
Note: Eppstein's bound on intersecting triangles revisited
Journal of Combinatorial Theory Series A
Graph Augmentation via Metric Embedding
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Approximating submodular functions everywhere
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Overcoming the l1 non-embeddability barrier: algorithms for product metrics
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Multi-dimensional online tracking
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Expander flows, geometric embeddings and graph partitioning
Journal of the ACM (JACM)
Tight results for clustering and summarizing data streams
Proceedings of the 12th International Conference on Database Theory
Computational Geometry: Theory and Applications
Perturbed identity matrices have high rank: Proof and applications
Combinatorics, Probability and Computing
Learning complexity vs communication complexity
Combinatorics, Probability and Computing
An optimal extension of the centerpoint theorem
Computational Geometry: Theory and Applications
Approximating edit distance in near-linear time
Proceedings of the forty-first annual ACM symposium on Theory of computing
On the geometry of graphs with a forbidden minor
Proceedings of the forty-first annual ACM symposium on Theory of computing
Small-size ε-nets for axis-parallel rectangles and boxes
Proceedings of the forty-first annual ACM symposium on Theory of computing
Explicit construction of a small epsilon-net for linear threshold functions
Proceedings of the forty-first annual ACM symposium on Theory of computing
Lower bounds for weak epsilon-nets and stair-convexity
Proceedings of the twenty-fifth annual symposium on Computational geometry
PTAS for geometric hitting set problems via local search
Proceedings of the twenty-fifth annual symposium on Computational geometry
Computing hereditary convex structures
Proceedings of the twenty-fifth annual symposium on Computational geometry
Randomly removing g handles at once
Proceedings of the twenty-fifth annual symposium on Computational geometry
Characteristics of Internet Latency and Their Impact on Distance Prediction Accuracy
CNSR '09 Proceedings of the 2009 Seventh Annual Communication Networks and Services Research Conference
New Results on Visibility in Simple Polygons
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On the Optimality of Gluing over Scales
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Combinatorics, Probability and Computing
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
On some monotone path problems in line arrangements
Computational Geometry: Theory and Applications
Counting and representing intersections among triangles in three dimensions
Computational Geometry: Theory and Applications
Characterizing isometries on the order polytope with an application to the theory of fuzzy measures
Information Sciences: an International Journal
Random projection trees for vector quantization
IEEE Transactions on Information Theory
Adjacency on the order polytope with applications to the theory of fuzzy measures
Fuzzy Sets and Systems
Improved bounds and new techniques for Davenport--Schinzel sequences and their generalizations
Journal of the ACM (JACM)
Hitting sets when the VC-dimension is small
Information Processing Letters
A framework for pursuit evasion games in Rn
Information Processing Letters
Ultra-low-dimensional embeddings for doubling metrics
Journal of the ACM (JACM)
Scalar outcomes suffice for finitary probabilistic testing
ESOP'07 Proceedings of the 16th European conference on Programming
Hard metrics from Cayley graphs of Abelian groups
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Arrangements in geometry: recent advances and challenges
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Reprint of: Weak ε-nets have basis of size O(1/εlog(1/ε) ) in any dimension
Computational Geometry: Theory and Applications
Centerpoints and Tverberg's technique
Computational Geometry: Theory and Applications
Minimax rates of convergence for high-dimensional regression under lq-ball sparsity
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Bilipschitz snowflakes and metrics of negative type
Proceedings of the forty-second ACM symposium on Theory of computing
Weighted geometric set cover via quasi-uniform sampling
Proceedings of the forty-second ACM symposium on Theory of computing
Information complexity: a tutorial
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-sixth annual symposium on Computational geometry
Planar visibility: testing and counting
Proceedings of the twenty-sixth annual symposium on Computational geometry
A geometric approach to collective motion
Proceedings of the twenty-sixth annual symposium on Computational geometry
Improving the first selection lemma in R3
Proceedings of the twenty-sixth annual symposium on Computational geometry
Approximate centerpoints with proofs
Computational Geometry: Theory and Applications
Randomly removing g handles at once
Computational Geometry: Theory and Applications
On the bichromatic k-set problem
ACM Transactions on Algorithms (TALG)
A note about weak ε-nets for axis-parallel boxes in d-space
Information Processing Letters
The Journal of Machine Learning Research
Dimension reduction for distance-based indexing
Proceedings of the Third International Conference on SImilarity Search and APplications
Lower bounds for edit distance and product metrics via Poincaré-type inequalities
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Universal ε-approximators for integrals
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Testing additive integrality gaps
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The number of extreme points of tropical polyhedra
Journal of Combinatorial Theory Series A
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Better gap-hamming lower bounds via better round elimination
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
On three parameters of invisibility graphs
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
An improved bound for k-sets in four dimensions
Combinatorics, Probability and Computing
A3MAP: architecture-aware analytic mapping for networks-on-chip
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
The union of colorful simplices spanned by a colored point set
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Low Distortion Maps Between Point Sets
SIAM Journal on Computing
Designing Network Protocols for Good Equilibria
SIAM Journal on Computing
Local Global Tradeoffs in Metric Embeddings
SIAM Journal on Computing
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
SIAM Journal on Computing
Approximating k-generalized connectivity via collapsing HSTs
Journal of Combinatorial Optimization
An algorithm for the graph crossing number problem
Proceedings of the forty-third annual ACM symposium on Theory of computing
Near-optimal distortion bounds for embedding doubling spaces into L1
Proceedings of the forty-third annual ACM symposium on Theory of computing
A center transversal theorem for hyperplanes and applications to graph drawing
Proceedings of the twenty-seventh annual symposium on Computational geometry
Beating the spread: time-optimal point meshing
Proceedings of the twenty-seventh annual symposium on Computational geometry
A new upper bound for the VC-dimension of visibility regions
Proceedings of the twenty-seventh annual symposium on Computational geometry
Low distortion metric embedding into constant dimension
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
The VC-dimension of SQL queries and selectivity estimation through sampling
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Spatial skyline queries: exact and approximation algorithms
Geoinformatica
Polychromatic coloring for half-planes
Journal of Combinatorial Theory Series A
Explicit Construction of a Small $\epsilon$-Net for Linear Threshold Functions
SIAM Journal on Computing
Computing a center-transversal line
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Towards faster linear-sized nets for axis-aligned boxes in the plane
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
On the power of random bases in fourier sampling: hidden subgroup problem in the heisenberg group
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the hardness of embeddings between two finite metrics
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Stacking and bundling two convex polygons
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
On graph crossing number and edge planarization
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Multidimensional online tracking
ACM Transactions on Algorithms (TALG)
The distortion of cardinal preferences in voting
CIA'06 Proceedings of the 10th international conference on Cooperative Information Agents
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Indexability, concentration, and VC theory
Journal of Discrete Algorithms
Pivot selection: Dimension reduction for distance-based indexing
Journal of Discrete Algorithms
Processing a large number of continuous preference top-k queries
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Computing a nonnegative matrix factorization -- provably
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Multi-way spectral partitioning and higher-order cheeger inequalities
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Beating randomized response on incoherent matrices
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Tight bounds on the maximum size of a set of permutations with bounded VC-dimension
Journal of Combinatorial Theory Series A
Higher-order Erdös: Szekeres theorems
Proceedings of the twenty-eighth annual symposium on Computational geometry
Proceedings of the twenty-eighth annual symposium on Computational geometry
Approximating Tverberg points in linear time for any fixed dimension
Proceedings of the twenty-eighth annual symposium on Computational geometry
A theorem of bárány revisited and extended
Proceedings of the twenty-eighth annual symposium on Computational geometry
Note: A note on approximation of a ball by polytopes
Discrete Optimization
Space lower bounds for low-stretch greedy embeddings
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Minimum convex partitions and maximum empty polytopes
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Indexing Schemes for Similarity Search: an Illustrated Paradigm
Fundamenta Informaticae
On multiple-instance learning of halfspaces
Information Processing Letters
Oja centers and centers of gravity
Computational Geometry: Theory and Applications
Cuttings for disks and axis-aligned rectangles
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Integer realizations of disk and segment graphs
Journal of Combinatorial Theory Series B
Fast vertex guarding for polygons with and without holes
Computational Geometry: Theory and Applications
Lower bounds for sorted geometric queries in the I/O model
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
On the semantics of Markov automata
Information and Computation
The union of colorful simplices spanned by a colored point set
Computational Geometry: Theory and Applications
Covering paths for planar point sets
GD'12 Proceedings of the 20th international conference on Graph Drawing
Density theorems for intersection graphs of t-monotone curves
GD'12 Proceedings of the 20th international conference on Graph Drawing
Densifying Distance Spaces for Shape and Image Retrieval
Journal of Mathematical Imaging and Vision
The maximum number of faces of the minkowski sum of three convex polytopes
Proceedings of the twenty-ninth annual symposium on Computational geometry
Improved bounds for incidences between points and circles
Proceedings of the twenty-ninth annual symposium on Computational geometry
A fast algorithm for well-spaced points and approximate delaunay graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry
On random generation of fuzzy measures
Fuzzy Sets and Systems
Journal of the ACM (JACM)
A new upper bound for the VC-dimension of visibility regions
Computational Geometry: Theory and Applications
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
Locally testable codes and cayley graphs
Proceedings of the 5th conference on Innovations in theoretical computer science
Homogeneous selections from hyperplanes
Journal of Combinatorial Theory Series B
Efficient active learning of halfspaces: an aggressive approach
The Journal of Machine Learning Research
A proof of the Oja depth conjecture in the plane
Computational Geometry: Theory and Applications
| Hi-index | 0.06 |
From the Publisher:Discrete geometry investigates combinatorial properties of configurations of geometric objects. To a working mathematician or computer scientist, it offers sophisticated results and techniques of great diversity and it is a foundation for fields such as computational geometry or combinatorial optimization.This book is primarily a textbook introduction to various areas of discrete geometry. In each area, it explains several key results and methods, in an accessible and concrete manner. It also contains more advanced material in separate sections and thus it can serve as a collection of surveys in several narrower subfields. The main topics include: basics on convex sets, convex polytopes, and hyperplane arrangements; combinatorial complexity of geometric configurations; intersection patterns and transversals of convex sets; geometric Ramsey-type results; polyhedral combinatorics and high-dimensional convexity; and lastly, embeddings of finite metric spaces into normed spaces. Jiri Matousek is Professor of Computer Science at Charles University in Prague. His research has contributed to several of the considered areas and to their algorithmic applications. This is his third book.