Result 1 to 20 of 28 total
Visibility-preserving convexifications using single-vertex moves. (English)
Inf. Process. Lett. 112, No. 5, 161-163 (2012).
1
On the maximum number of isosceles right triangles in a finite point set. (English)
Involve 4, No. 1, 27-42 (2011).
2
An inequality for Macaulay functions. (English)
J. Integer Seq. 14, No. 7, Article 11.7.4, 11 p., electronic only (2011).
3
Visibility-preserving convexifications using single-vertex moves. (English)
Comput. Res. Repos. 2011, Article No. 1105.3435 (2011).
4
On $(\le k)$-edges, crossings, and halving lines of geometric drawings of $K_{n}$. (English)
Comput. Res. Repos. 2011, Article No. 1102.5065 (2011).
5
On crossing numbers of geometric proximity graphs. (English)
Comput. Geom. 44, No. 4, 216-233 (2011).
6
3-symmetric and 3-decomposable geometric drawings of $K_n$. (English)
Discrete Appl. Math. 158, No. 12, 1240-1258 (2010).
7
On the maximum number of translates in a point set. (English)
Discrete Comput. Geom. 43, No. 1, 1-20 (2010).
8
On the maximum number of translates in a point set (English)
Discrete & Computational Geometry 43, No. 1, 1-20 (2010).
9
Sum of squares of degrees in a graph. (English)
JIPAM, J. Inequal. Pure Appl. Math. 10, No. 3, Paper No. 64, 34 p., electronic only (2009).
10
Matching points with squares. (English)
Discrete Comput. Geom. 41, No. 1, 77-95 (2009).
11
Matching points with squares (English)
Discrete & Computational Geometry 41, No. 1, 77-95 (2009).
12
An extended lower bound on the number of($\leqslant k$)-edges to generalized configurations of points and the pseudolinear crossing number of $K_n$. (English)
J. Comb. Theory, Ser. A 115, No. 7, 1257-1264 (2008).
13
An extended lower bound on the number of (k)-edges to generalized configurations of points and the pseudolinear crossing number of $K_{n}$ (English)
J. Comb. Theory, Ser. A 115, No. 7, 1257-1264 (2008).
14
The maximum number of halving lines and the rectilinear crossing number of $K_{n}$ for n (English)
Electronic Notes in Discrete Mathematics 30, 261-266 (2008).
15
A central approach to bound the number of crossings in a generalized configuration (English)
Electronic Notes in Discrete Mathematics 30, 273-278 (2008).
16
Geometric drawings of $K_{n}$ with few crossings. (English)
J. Comb. Theory, Ser. A 114, No. 2, 373-379 (2007).
17
Geometric drawings of $K_{n}$ with few crossings (English)
J. Comb. Theory, Ser. A 114, No. 2, 373-379 (2007).
18
Trace-minimal graphs and D-optimal weighing designs. (English)
Linear Algebra Appl. 412, No. 2-3, 161-221 (2006).
19
Matching points with circles and squares. (English)
Akiyama, Jin (ed.) et al., Discrete and computational geometry. Japanese conference, JCDCG 2004, Tokyo, Japan, October 8‒11, 2004. Berlin: Springer (ISBN 978-3-540-30467-8/pbk). Lecture Notes in Computer Science 3742, 1-15 (2005).
20
Result 1 to 20 of 28 total
Start
Contact
Print
General Help
