-
1
-
-
0038522854
-
A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid
-
Berg A.R., and Jordán T. A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid. J. Combin. Theory Ser. B 88 (2003) 77-97
-
(2003)
J. Combin. Theory Ser. B
, vol.88
, pp. 77-97
-
-
Berg, A.R.1
Jordán, T.2
-
2
-
-
0142152746
-
Algorithms for graph rigidity and scene analysis
-
Proc. 11th Annual European Symposium on Algorithms (ESA) 2003. Di Battista G., and Zwick U. (Eds), Springer
-
Berg A.R., and Jordán T. Algorithms for graph rigidity and scene analysis. In: Di Battista G., and Zwick U. (Eds). Proc. 11th Annual European Symposium on Algorithms (ESA) 2003. Lecture Notes in Comput. Sci. vol. 2832 (2003), Springer 78-89
-
(2003)
Lecture Notes in Comput. Sci.
, vol.2832
, pp. 78-89
-
-
Berg, A.R.1
Jordán, T.2
-
3
-
-
4243199684
-
On generic global rigidity
-
Applied Geometry and Discrete Mathematics, Amer. Math. Soc., Providence, RI
-
Connelly R. On generic global rigidity. Applied Geometry and Discrete Mathematics. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. vol. 4 (1991), Amer. Math. Soc., Providence, RI 147-155
-
(1991)
DIMACS Ser. Discrete Math. Theoret. Comput. Sci.
, vol.4
, pp. 147-155
-
-
Connelly, R.1
-
4
-
-
17444406687
-
Generic global rigidity
-
Connelly R. Generic global rigidity. Discrete Comput. Geom. 33 4 (2005) 549-563
-
(2005)
Discrete Comput. Geom.
, vol.33
, Issue.4
, pp. 549-563
-
-
Connelly, R.1
-
5
-
-
1542348640
-
Sensor and network topologies of formations with direction, bearing and angle information between agents
-
T. Eren, W. Whiteley, A.S. Morse, P.N. Belhumeur, B.D.O. Anderson, Sensor and network topologies of formations with direction, bearing and angle information between agents, in: Proc. of the 42nd IEEE Conference on Decision and Control, 2003, pp. 3064-3069
-
(2003)
Proc. of the 42nd IEEE Conference on Decision and Control
, pp. 3064-3069
-
-
Eren, T.1
Whiteley, W.2
Morse, A.S.3
Belhumeur, P.N.4
Anderson, B.D.O.5
-
6
-
-
0001931206
-
Algorithms for graphic polymatroids and parametric over(s, -)-sets
-
Gabow H.N. Algorithms for graphic polymatroids and parametric over(s, -)-sets. J. Algorithms 26 1 (1998) 48-86
-
(1998)
J. Algorithms
, vol.26
, Issue.1
, pp. 48-86
-
-
Gabow, H.N.1
-
9
-
-
0026821495
-
Conditions for unique graph realizations
-
Hendrickson B. Conditions for unique graph realizations. SIAM J. Comput. 21 1 (1992) 65-84
-
(1992)
SIAM J. Comput.
, vol.21
, Issue.1
, pp. 65-84
-
-
Hendrickson, B.1
-
10
-
-
0013558430
-
The molecule problem: Exploiting structure in global optimization
-
Hendrickson B. The molecule problem: Exploiting structure in global optimization. SIAM J. Optim. 5 4 (1995) 835-857
-
(1995)
SIAM J. Optim.
, vol.5
, Issue.4
, pp. 835-857
-
-
Hendrickson, B.1
-
11
-
-
0001243769
-
Dividing a graph into triconnected components
-
Hopcroft J.E., and Tarjan R.E. Dividing a graph into triconnected components. SIAM J. Comput. 2 (1973) 135-158
-
(1973)
SIAM J. Comput.
, vol.2
, pp. 135-158
-
-
Hopcroft, J.E.1
Tarjan, R.E.2
-
12
-
-
15444370051
-
Connected rigidity matroids and unique realizations of graphs
-
Jackson B., and Jordán T. Connected rigidity matroids and unique realizations of graphs. J. Combin. Theory Ser. B 94 (2005) 1-29
-
(2005)
J. Combin. Theory Ser. B
, vol.94
, pp. 1-29
-
-
Jackson, B.1
Jordán, T.2
-
13
-
-
71549135454
-
-
B. Jackson, T. Jordán, Operations preserving global rigidity of generic direction-length frameworks, submitted for publication; see also Egerváry Research Group TR-2008-08 at www.cs.elte.hu/egres/
-
B. Jackson, T. Jordán, Operations preserving global rigidity of generic direction-length frameworks, submitted for publication; see also Egerváry Research Group TR-2008-08 at www.cs.elte.hu/egres/
-
-
-
-
14
-
-
32344449818
-
Globally linked pairs of vertices in equivalent realizations of graphs
-
Jackson B., Jordán T., and Szabadka Z. Globally linked pairs of vertices in equivalent realizations of graphs. Discrete Comput. Geom. 35 (2006) 493-512
-
(2006)
Discrete Comput. Geom.
, vol.35
, pp. 493-512
-
-
Jackson, B.1
Jordán, T.2
Szabadka, Z.3
-
15
-
-
0014856102
-
On graphs and rigidity of plane skeletal structures
-
Laman G. On graphs and rigidity of plane skeletal structures. J. Engrg. Math. 4 (1970) 331-340
-
(1970)
J. Engrg. Math.
, vol.4
, pp. 331-340
-
-
Laman, G.1
-
17
-
-
15444368801
-
Embeddability of weighted graphs in k-space is strongly NP-hard
-
Tech. Report, Computer Science Department, Carnegie-Mellon University, Pittsburgh, PA
-
J.B. Saxe, Embeddability of weighted graphs in k-space is strongly NP-hard, Tech. Report, Computer Science Department, Carnegie-Mellon University, Pittsburgh, PA, 1979
-
(1979)
-
-
Saxe, J.B.1
-
18
-
-
0038457531
-
Constraining plane configurations in CAD: Combinatorics of directions and lengths
-
Servatius B., and Whiteley W. Constraining plane configurations in CAD: Combinatorics of directions and lengths. SIAM J. Discrete Math. 12 (1999) 136-153
-
(1999)
SIAM J. Discrete Math.
, vol.12
, pp. 136-153
-
-
Servatius, B.1
Whiteley, W.2
-
19
-
-
0002856165
-
Some matroids from discrete applied geometry
-
Matroid Theory. Seattle, WA, 1995, Amer. Math. Soc., Providence, RI
-
Whiteley W. Some matroids from discrete applied geometry. Matroid Theory. Seattle, WA, 1995. Contemp. Math. vol. 197 (1996), Amer. Math. Soc., Providence, RI 171-311
-
(1996)
Contemp. Math.
, vol.197
, pp. 171-311
-
-
Whiteley, W.1
|