Balanced generic circuits without long paths. - Csaba Király 001; Ferenc Péterfalvi (Discret. Math., 2012)

Strongly rigid tensegrity graphs on the line. - Bill Jackson; Tibor Jordán; Csaba Király 001 (Discret. Appl. Math., 2013)

Tree-compositions and orientations. - András Frank; Csaba Király 001 (Oper. Res. Lett., 2013)

Algorithms for finding a rooted (k, 1)-edge-connected orientation. - Csaba Király 001 (Discret. Appl. Math., 2014)

On Minimally Highly Vertex-Redundantly Rigid Graphs. - Viktória E. Kaszanitzky; Csaba Király 001 (Graphs Comb., 2016)

Generic global rigidity of body-hinge frameworks. - Tibor Jordán; Csaba Király 001; Shin-ichi Tanigawa (J. Comb. Theory B, 2016)

On Maximal Independent Arborescence Packing. - Csaba Király 001 (SIAM J. Discret. Math., 2016)

Old and new results on packing arborescences in directed hypergraphs. - Quentin Fortier; Csaba Király 001; Marion Léonard; Zoltán Szigeti; Alexandre Talon (Discret. Appl. Math., 2018)

On packing spanning arborescences with matroid constraint. - Quentin Fortier; Csaba Király 001; Zoltán Szigeti; Shin-ichi Tanigawa (J. Graph Theory, 2020)

Packing of arborescences with matroid constraints via matroid intersection. - Csaba Király 001; Zoltán Szigeti; Shin-ichi Tanigawa (Math. Program., 2020)

Globally Rigid Augmentation of Minimally Rigid Graphs in R2. - Csaba Király 001; András Mihálykó (CIAC, 2021)

Rigid realizations of graphs with few locations in the plane. - Csaba Király 001 (Eur. J. Comb., 2021)

Sufficient Conditions for the Global Rigidity of Periodic Graphs. - Viktória E. Kaszanitzky; Csaba Király 001; Bernd Schulze (Discret. Comput. Geom., 2022)

Sparse graphs and an augmentation problem. - Csaba Király 001; András Mihálykó (Math. Program., 2022)

Globally Rigid Augmentation of Rigid Graphs. - Csaba Király 001; András Mihálykó (SIAM J. Discret. Math., 2022)

Shortest odd paths in undirected graphs with conservative weight functions. - Alpár Jüttner; Csaba Király 001; Lydia Mirabel Mendoza Cadena; Gyula Pap; Ildikó Schlotter; Yutaro Yamaguchi 001 (Discret. Appl. Math., 2024)

Count and cofactor matroids of highly connected graphs. - Dániel Garamvölgyi; Tibor Jordán; Csaba Király 001 (J. Comb. Theory B, 2024)