Result 1 to 20 of 57 total
On the light side of geometric graphs. (English)
Discrete Math. 312, No. 6, 1213-1217 (2012).
1
On graphs and algebraic graphs that do not contain cycles of length 4. (English)
J. Graph Theory 68, No. 2, 91-102 (2011).
2
Ice-creams and wedge graphs. (English)
Comput. Res. Repos. 2011, Article No. 1106.0855 (2011).
3
Regular matchstick graphs. (English)
Am. Math. Mon. 118, No. 3, 264-267 (2011).
4
Every simple arrangement of $n$ lines contains an inducing simple $n$-gon. (English)
Am. Math. Mon. 118, No. 2, 164-167 (2011).
5
Points with large quadrant depth (English)
JoCG 2, No. 1, 128-143 (2011).
6
On graphs and algebraic graphs that do not contain cycles of length 4 (English)
Journal of Graph Theory 68, No. 2, 91-102 (2011).
7
Crossings between curves with many tangencies. (English)
Bárány, Imre (ed.) et al., An irregular mind. Szmerédi is 70. Dedicated to Endre Szemerédi on the occasion of his seventieth birthday. Berlin: Springer (ISBN 978-3-642-14443-1/pbk). Bolyai Society Mathematical Studies 21, 251-260 (2010).
8
Crossings between curves with many tangencies. (English)
Rahman, Md. Saidur (ed.) et al., WALCOM: Algorithms and computation. 4th international workshop, WALCOM 2010, Dhaka, Bangladesh, February 10‒12, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-11439-7/pbk). Lecture Notes in Computer Science 5942, 1-8 (2010).
9
Points with large quadrant-depth (English)
Symposium on Computational Geometry, 358-364 (2010).
10
Crossings between curves with many tangencies (English)
WALCOM, 1-8 (2010).
11
On inducing polygons and related problems. (English)
Fiat, Amos (ed.) et al., Algorithms ‒ ESA 2009. 17th annual European symposium, Copenhagen, Denmark, September 7‒9, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-04127-3/pbk). Lecture Notes in Computer Science 5757, 47-58 (2009).
12
Points with large alpha-depth (English)
J. Comb. Theory, Ser. A 116, No. 3, 747-755 (2009).
13
On inducing polygons and related problems (English)
ESA, 47-58 (2009).
14
Halving lines and measure concentration in the plane (English)
Symposium on Computational Geometry, 141-147 (2009).
15
Generalized thrackles and geometric graphs in ${\mathbb{R}}^3$ with no pair of strongly avoiding edges. (English)
Graphs Comb. 24, No. 4, 373-389 (2008).
16
Geometric graphs with no two parallel edges. (English)
Combinatorica 28, No. 1, 127-130 (2008).
17
Projecting difference sets on the positive orthant. (English)
Comb. Probab. Comput. 17, No. 5, 681-688 (2008).
18
Projecting difference sets on the positive orthant (English)
Combinatorics, Probability & Computing 17, No. 5, 681-688 (2008).
19
Generalized thrackles and geometric graphs in \mathbb$R^{3}${\mathbb{R}}^3 with no pair of strongly avoiding edges (English)
Graphs and Combinatorics 24, No. 4, 373-389 (2008).
20
Result 1 to 20 of 57 total
Start
Contact
Print
General Help
