Search results for "Rom Pinchasi"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Eyal Ackerman, Rom Pinchasi	On the light side of geometric graphs.	Discrete Mathematics	2012	DBLP DOI BibTeX RDF
1	Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Tillmann Miltzow, Rom Pinchasi, Torsten Ueckerdt, Ran Ziv	Points with Large Quadrant Depth.	JoCG	2011	DBLP BibTeX RDF
1	Eyal Ackerman, Tsachik Gelander, Rom Pinchasi	Ice-Creams and Wedge Graphs	CoRR	2011	DBLP BibTeX RDF
1	Noga Alon, H. Tracy Hall, Christian Knauer, Rom Pinchasi, Raphael Yuster	On graphs and algebraic graphs that do not contain cycles of length 4.	Journal of Graph Theory	2011	DBLP DOI BibTeX RDF
1	Rom Pinchasi, Allan Pinkus	Dominating Subsets under Projections.	SIAM J. Discrete Math.	2010	DBLP DOI BibTeX RDF
1	Itay Ben-Dan, Rom Pinchasi, Ran Ziv	On a problem about quadrant-depth.	Comput. Geom.	2010	DBLP DOI BibTeX RDF
1	Roel Apfelbaum, Itay Ben-Dan, Stefan Felsner, Rom Pinchasi, Tillmann Miltzow	Points with large quadrant-depth.	Symposium on Computational Geometry	2010	DBLP DOI BibTeX RDF	depth, point set, plane
1	Jacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi	Crossings between Curves with Many Tangencies.	WALCOM	2010	DBLP DOI BibTeX RDF
1	Itay Ben-Dan, Rom Pinchasi, Ran Ziv	Points with large alpha-depth.	J. Comb. Theory, Ser. A	2009	DBLP DOI BibTeX RDF
1	Eyal Ackerman, Rom Pinchasi, Ludmila Scharf, Marc Scherfenberg	On Inducing Polygons and Related Problems.	ESA	2009	DBLP DOI BibTeX RDF
1	Rom Pinchasi	Halving lines and measure concentration in the plane.	Symposium on Computational Geometry	2009	DBLP DOI BibTeX RDF	halving lines, measure, points, lines
1	Noga Alon, Adi Pinchasi, Rom Pinchasi	An isoperimetric inequality in the universal cover of the punctured plane.	Discrete Mathematics	2008	DBLP DOI BibTeX RDF
1	Ron Holzman, Vsevolod F. Lev, Rom Pinchasi	Projecting Difference Sets on the Positive Orthant.	Combinatorics, Probability & Computing	2008	DBLP DOI BibTeX RDF
1	Amitai Perlstein, Rom Pinchasi	Generalized Thrackles and Geometric Graphs in \mathbbR3{\mathbb{R}}^3 with No Pair of Strongly Avoiding Edges.	Graphs and Combinatorics	2008	DBLP DOI BibTeX RDF
1	Rom Pinchasi	Geometric graphs with no two parallel edges.	Combinatorica	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C10
1	Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote	There Are Not Too Many Magic Configurations.	Discrete & Computational Geometry	2008	DBLP DOI BibTeX RDF	Magic configuration, Euler’s formula, Discharging method, Murty’s conjecture, Points, Lines, Euclidean plane
1	Rom Pinchasi	The Minimum Number of Distinct Areas of Triangles Determined by a Set of n Points in the Plane.	SIAM J. Discrete Math.	2008	DBLP DOI BibTeX RDF
1	Sarit Buzaglo, Ron Holzman, Rom Pinchasi	On s-intersecting curves and related problems.	Symposium on Computational Geometry	2008	DBLP DOI BibTeX RDF	$k$-sets, points, curves, vc-dimension, plane
1	Rom Pinchasi	Linear algebra approach to geometric graphs.	J. Comb. Theory, Ser. A	2007	DBLP DOI BibTeX RDF
1	János Pach, Rom Pinchasi, Micha Sharir	Solution of Scott's Problem on the Number of Directions Determined by a Point Set in 3-Space.	Discrete & Computational Geometry	2007	DBLP DOI BibTeX RDF
1	Hagit Last, Rom Pinchasi	At Least n - 1 Intersection Points in a Connected Family of n Unit Circles in the Plane.	Discrete & Computational Geometry	2007	DBLP DOI BibTeX RDF
1	Micha A. Perles, Rom Pinchasi	Forbidden k-Sets in the Plane.	SIAM J. Discrete Math.	2007	DBLP DOI BibTeX RDF
1	Eyal Ackerman, Kevin Buchin, Christian Knauer, Rom Pinchasi, Günter Rote	There are not too many magic configurations.	Symposium on Computational Geometry	2007	DBLP DOI BibTeX RDF	discharging method, magic configurations
1	Rom Pinchasi, Rados Radoicic, Micha Sharir	On empty convex polygons in a planar point set.	J. Comb. Theory, Ser. A	2006	DBLP DOI BibTeX RDF
1	Noga Alon, János Pach, Rom Pinchasi, Rados Radoicic, Micha Sharir	Crossing patterns of semi-algebraic sets.	J. Comb. Theory, Ser. A	2005	DBLP DOI BibTeX RDF
1	János Pach, Rom Pinchasi, Micha Sharir, Géza Tóth	Topological Graphs with No Large Grids.	Graphs and Combinatorics	2005	DBLP DOI BibTeX RDF	Crossing edges, Topological graphs
1	Rom Pinchasi, Micha Sharir	On Graphs That Do Not Contain The Cube And Related Problems.	Combinatorica	2005	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C35
1	Daniel J. Kleitman, Rom Pinchasi	A Note on Caterpillar-Embeddings with No Two Parallel Edges.	Discrete & Computational Geometry	2005	DBLP DOI BibTeX RDF
1	János Pach, Rom Pinchasi, Micha Sharir	On the number of directions determined by a three-dimensional points set.	J. Comb. Theory, Ser. A	2004	DBLP DOI BibTeX RDF
1	Shmuel Onn, Rom Pinchasi	A note on the minimum number of edge-directions of a convex polytope.	J. Comb. Theory, Ser. A	2004	DBLP DOI BibTeX RDF
1	János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth	Geometric graphs with no self-intersecting path of length three.	Eur. J. Comb.	2004	DBLP DOI BibTeX RDF
1	Pankaj K. Agarwal, Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky	Lenses in arrangements of pseudo-circles and their applications.	J. ACM	2004	DBLP DOI BibTeX RDF	incidence problems, pseudo-circles, Arrangements
1	János Pach, Rom Pinchasi, Micha Sharir	Solution of Scott's problem on the number of directions determined by a point set in 3-space.	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF	Scott's Conjecture, Ungar's Theorem, slope problem, directions, three dimensions
1	Rom Pinchasi, Rados Radoicic, Micha Sharir	On empty convex polygons in a planar point set.	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF	continuous motion, empty ?-gon, empty hexagon
1	Rom Pinchasi, Shakhar Smorodinsky	On locally Delaunay geometric graphs.	Symposium on Computational Geometry	2004	DBLP DOI BibTeX RDF	extremal graph theory, sensor networks, geometric graphs, Delaunay
1	Rom Pinchasi	Lines With Many Points On Both Sides.	Discrete & Computational Geometry	2003	DBLP DOI BibTeX RDF
1	Rom Pinchasi, Rados Radoicic	Topological graphs with no self-intersecting cycle of lenth 4.	Symposium on Computational Geometry	2003	DBLP DOI BibTeX RDF	extremal graph theory, self-intersecting cycle, topological graphs
1	János Pach, Rom Pinchasi, Micha Sharir	A tight bound for the number of different directions in three dimensions.	Symposium on Computational Geometry	2003	DBLP DOI BibTeX RDF	Ungar's theorem, slope problem, directions
1	Rom Pinchasi	Gallai - Sylvester Theorem for Pairwise Intersecting Unit Circles.	Discrete & Computational Geometry	2002	DBLP DOI BibTeX RDF
1	Eran Nevo, János Pach, Rom Pinchasi, Micha Sharir, Shakhar Smorodinsky	Lenses in arrangements of pseudo-circles and their applications.	Symposium on Computational Geometry	2002	DBLP DOI BibTeX RDF	distinct distances, pseudo-circles, arrangements, lenses, incidences, levels
1	János Pach, Rom Pinchasi, Gábor Tardos, Géza Tóth	Geometric Graphs with No Self-intersecting Path of Length Three.	Graph Drawing	2002	DBLP DOI BibTeX RDF
1	Rom Pinchasi	On the Size of a Radial Set.	JCDCG	2002	DBLP DOI BibTeX RDF
1	János Pach, Rom Pinchasi	On the Number of Balanced Lines.	Discrete & Computational Geometry	2001	DBLP DOI BibTeX RDF
1	Noga Alon, Hagit Last, Rom Pinchasi, Micha Sharir	On the Complexity of Arrangements of Circles in the Plane.	Discrete & Computational Geometry	2001	DBLP DOI BibTeX RDF
1	János Pach, Rom Pinchasi	Bichromatic Lines with Few Points.	J. Comb. Theory, Ser. A	2000	DBLP DOI BibTeX RDF

Publications of "Rom Pinchasi" ( http://dblp.L3S.de/Authors/Rom_Pinchasi )