![](img/space.gif) |
Combinatorial rigidity and its applications
|
Help
Print
|
Here you can view and search the projects funded by NKFI since 2004
Back »![](img/space.gif)
![](img/space.gif)
![](img/space.gif)
![](img/space.gif)
|
![](img/print_ver.gif) |
List of publications |
|
|
Tibor Jordán: Minimum size highly redundantly rigid graphs in the plane, Egeráry Research Group, Technical Report TR-2020-21, 2020 | Tibor Jordán, Christopher Poston, Ryan Roach,: Extremal families of redundantly rigid graphs in three dimensions, Egeráry Research Group, Technical Report TR-2020-22, 2020 | Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa: Unique low rank completability of partially filled matrices, J. Combinatorial Theory, Ser. B., 2016 | Tibor Jordán, Walter Whiteley: Global rigidity, Handbook of Discrete and Computational Geometry, 2017 | Tibor Jordán, Shin-ichi Tanigawa: Globally rigid braced spherical polyhedra, kézirat, 2016 | Tibor Jordán, Shin-ichi Tanigawa: Global rigidity of triangulations with braces, Proc. 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, 2017, 2017 | Tibor Jordán: Extremal problems and results in combinatorial rigidity, Proc. 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, 2017 | Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa: Global rigidity of two-dimensional frameworks, Handbook of Geometric Constraint Systems Principles, 2018 | Tibor Jordán, András Mihálykó: Minimum cost localizable networks, kézirat, 2017 | Tibor Jordán, Walter Whiteley: Global rigidity, Handbook of Discrete and Computational Geometry, 3rd edition, (J.E. Goodman, J. O'Rourke, C.D. Tóth eds.), pp. 1661-1694, 2018 | Tibor Jordán, Shin-ichi Tanigawa: Global rigidity of triangulations with braces, Proc. 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its Applications, 2017 | Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa: Global rigidity of two-dimensional frameworks, Handbook of Geometric Constraint Systems Principles, (M. Sitharam, A. St. John, J. Sidman eds.), 2018 | Tibor Jordán, András Mihálykó: Minimum cost globally rigid subgraphs, Building Bridges II., Bolyai Society Mathematical Studies, (I. Bárány, G.O.H. Katona, A. Sali eds), submitted, 2018 | Dániel Garamvölgyi, Tibor Jordán: Global rigidity of unit ball graphs, Technical Report, Egerváry Research Group on Combinatorial Optimization, submitted., 2018 | Tibor Jordán, Jialin Zhang: Compressed frameworks and compressible graphs, Technical Report, Egerváry Research Group on Combinatorial Optimization, submitted., 2018 | Dániel Garamvölgyi, Tibor Jordán, András Mona: The minimum power globally rigid subgraph problem, Technical Report, Egerváry Research Group on Combinatorial Optimization, 2018 | Dániel Garamvölgyi, Tibor Jordán: Graph reconstruction from unlabeled edge lengths, Technical Report, Egerváry Research Group on Combinatorial Optimization, submitted., 2019 | Tibor Jordán, Shin-ichi Tanigawa: On the global rigidity of powers of graphs, kézirat, 2019 | Tibor Jordán, András Mihálykó: Minimum cost globally rigid subgraphs, Building Bridges II., Bolyai Society Mathematical Studies, (I. Bárány, G.O.H. Katona, A. Sali eds), Springer, 2019 | Tibor Jordán, Jialin Zhang: Compressed frameworks and compressible graphs, Proc. 11th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications, Tokyo, May, 2019 | Bill Jackson, Tibor Jordán, Shin-ichi Tanigawa: Global rigidity of two-dimensional frameworks, Handbook of geometric constraint systems principles, (Eds: M. Sitharam, A. St. Johns, J. Sidman)CRC Press, pp. 461-486, 2019 | Tibor Jordán, Shin-ichi Tanigawa: Global rigidity of triangulations with braces, J. Combin Theory, Ser. B, Vol. 136, May 2019, Pages 249-288, 2019 | Tibor Jordán: A note on rigid and globally rigid graphs on n vertices, when n-d is small, kézirat, 2019 | Tibor Jordán, Shin-ichi Tanigawa: Globally rigid powers of graphs, kézirat, 2020 | Dániel Garamvölgyi, Tibor Jordán: Global rigidity of unit ball graphs, SIAM J. Discrete Mathematics, 34 (1), pp. 212-229., 2020 | Tibor Jordán: A note on generic rigidity of graphs in higher dimension, Technical Report, Egerváry Research Group on Combinatorial Optimization, submitted., 2020 | Tibor Jordán, Yusuke Kobayashi, Ryoga Mahara, Kazuhisa Makino: The Steiner problem for count matroids, Proc. IWOCA 2020, Combinatorial algorithms, Springer Lecture Notes in Computer Science, vol. 12126, pp.330-342., 2020 | Dániel Garamvölgyi, Tibor Jordán: Graph reconstruction from unlabeled edge lengths, Discrete and Computational Geometry, to appear., 2021 | Tibor Jordán: A note on generic rigidity of graphs in higher dimension, Discrete Applied Mathematics, to appear., 2021 |
![](img/space.gif)
|
|
|
![](img/shadow_right_up.gif)
|
![](img/shadow_left_bottom.gif)
|
![](img/shadow_right_bottom.gif)
|
![](img/space.gif) Back »
|
![](img/space.gif) |
|