Generic global rigidity of body-hinge frameworks T Jordán, C Király, S Tanigawa Journal of Combinatorial Theory, Series B 117, 59-76, 2016 | 40 | 2016 |
On maximal independent arborescence packing C Király SIAM Journal on Discrete Mathematics 30 (4), 2107-2114, 2016 | 32 | 2016 |
Old and new results on packing arborescences in directed hypergraphs Q Fortier, C Király, M Léonard, Z Szigeti, A Talon Discrete Applied Mathematics 242, 26-33, 2018 | 24* | 2018 |
Packing of arborescences with matroid constraints via matroid intersection C Király, Z Szigeti, S Tanigawa Mathematical Programming 181, 85-117, 2020 | 13 | 2020 |
On minimally highly vertex-redundantly rigid graphs VE Kaszanitzky, C Király Graphs and Combinatorics 32 (1), 224-240, 2016 | 11 | 2016 |
Sparse graphs and an augmentation problem C Király, A Mihálykó International Conference on Integer Programming and Combinatorial …, 2020 | 8 | 2020 |
On packing spanning arborescences with matroid constraint Q Fortier, C Király, Z Szigeti, S Tanigawa Electronic Notes in Discrete Mathematics 61, 451-457, 2017 | 6 | 2017 |
Rigid graphs and an augmentation problem C Király Tech. report 2015-03, Egerváry Research Group, Budapest, 2015 | 6 | 2015 |
Algorithms for finding a rooted (k, 1)-edge-connected orientation C Király Discrete Applied Mathematics 166, 263-268, 2014 | 6* | 2014 |
Globally rigid augmentation of rigid graphs C Király, A Mihálykó SIAM Journal on Discrete Mathematics 36 (4), 2473-2496, 2022 | 5 | 2022 |
Count and cofactor matroids of highly connected graphs D Garamvölgyi, T Jordán, C Király Journal of Combinatorial Theory, Series B 166, 1-29, 2024 | 4 | 2024 |
Rigidity of body-bar-hinge frameworks C Király, S Tanigawa Handbook of Geometric Constraint Systems Principles, 435-460, 2018 | 4 | 2018 |
Reachability-based matroid-restricted packing of arborescences C Király, Z Szigeti 10th Japanese-Hungarian Symposium on Discrete Mathematics and Its …, 2016 | 4 | 2016 |
Strongly rigid tensegrity graphs on the line B Jackson, T Jordán, C Király Discrete Applied Mathematics 161 (7-8), 1147-1149, 2013 | 4 | 2013 |
Fast algorithms for sparsity matroids and the global rigidity augmentation problem C Király, A Mihálykó Egerváry Research Group, Budapest, 2022 | 3 | 2022 |
An efficient algorithm for testing (k, l)-sparsity when l< 0 C Király Technical Report (Quick Proof) QP-2019-04, Egerváry Research Group, Budapest …, 2019 | 3 | 2019 |
Balanced generic circuits without long paths C Király, F Péterfalvi Discrete Mathematics 312 (15), 2262-2271, 2012 | 3 | 2012 |
Globally Rigid Augmentation of Minimally Rigid Graphs in C Király, A Mihálykó Algorithms and Complexity: 12th International Conference, CIAC 2021, Virtual …, 2021 | 2 | 2021 |
On packing spanning arborescences with matroid constraint Q Fortier, C Király, Z Szigeti, S Tanigawa Journal of Graph Theory 93 (2), 230-252, 2020 | 2 | 2020 |
Tree-compositions and orientations A Frank, C Király Operations Research Letters 41 (4), 336-342, 2013 | 2* | 2013 |