Csaba Király
Csaba Király
research fellow, MTA-ELTE Egerváry Research Group, ELTE Eötvös Loránd University Budapest
Verified email at cs.elte.hu
Title
Cited by
Cited by
Year
On maximal independent arborescence packing
C Király
SIAM Journal on Discrete Mathematics 30 (4), 2107-2114, 2016
272016
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
262016
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
18*2018
On minimally highly vertex-redundantly rigid graphs
VE Kaszanitzky, C Király
Graphs and Combinatorics 32 (1), 224-240, 2016
112016
Packing of arborescences with matroid constraints via matroid intersection.
C Király, Z Szigeti, S Tanigawa
Math. Program. 181 (1), 85-117, 2020
62020
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
62017
Algorithms for finding a rooted (k, 1)-edge-connected orientation
C Király
Discrete Applied Mathematics 166, 263-268, 2014
5*2014
Reachability-based matroid-restricted packing of arborescences
C Király, Z Szigeti
10th Japanese-Hungarian Symposium on Discrete Mathematics and Its …, 2016
42016
Rigid graphs and an augmentation problem
C Király
Tech. report 2015-03, Egerváry Research Group, Budapest, 2015
42015
Sparse graphs and an augmentation problem
C Király, A Mihálykó
Mathematical Programming, 1-30, 2021
32021
Strongly rigid tensegrity graphs on the line
B Jackson, T Jordán, C Király
Discrete Applied Mathematics 161 (7-8), 1147-1149, 2013
22013
Tree-compositions and orientations
A Frank, C Király
Operations Research Letters 41 (4), 336-342, 2013
2*2013
Balanced generic circuits without long paths
C Király, F Péterfalvi
Discrete Mathematics 312 (15), 2262-2271, 2012
22012
On the vertex splitting operation in globally rigid body-hinge graphs
T Jordán, C Király, SI Tanigawa
preprint, 2019
12019
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
12019
Rigid realizations of graphs with few locations in the plane
C Király
European Journal of Combinatorics 94, 103304, 2021
2021
Globally Rigid Augmentation of Minimally Rigid Graphs in
C Király, A Mihálykó
Algorithms and Complexity: 12th International Conference, CIAC 2021, Virtual …, 2021
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
2020
Rigidity of Body-Bar-Hinge Frameworks
C Kiraly, S Tanigawa
Handbook of Geometric Constraint Systems Principles, 435, 2018
2018
Sufficient conditions for the global rigidity of periodic graphs
VE Kaszanitzky, C Király, B Schulze
arXiv preprint arXiv:1804.08008, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–20