Csaba Király

According to our database, Csaba Király authored at least 18 papers between 2012 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Odd and Even Harder Problems on Cycle-Factors.

Florian Hörsch, Csaba Király, Lydia Mirabel Mendoza-Cadena, Gyula Pap, Eszter Szabó, Yutaro Yamaguchi

CoRR, October, 2025

2024

Count and cofactor matroids of highly connected graphs.

Dániel Garamvölgyi, Tibor Jordán, Csaba Király

J. Comb. Theory B, 2024

Shortest odd paths in undirected graphs with conservative weight functions.

Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza-Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi

Discret. Appl. Math., 2024

2022

Globally Rigid Augmentation of Rigid Graphs.

Csaba Király, András Mihálykó

SIAM J. Discret. Math., 2022

Sufficient Conditions for the Global Rigidity of Periodic Graphs.

Viktória E. Kaszanitzky, Csaba Király, Bernd Schulze

Discret. Comput. Geom., 2022

2021

Rigid realizations of graphs with few locations in the plane.

Csaba Király

Eur. J. Comb., 2021

Globally Rigid Augmentation of Minimally Rigid Graphs in R².

Csaba Király, András Mihálykó

Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020

Packing of arborescences with matroid constraints via matroid intersection.

Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa

Math. Program., 2020

Sparse Graphs and an Augmentation Problem.

Csaba Király, András Mihálykó

Proceedings of the Integer Programming and Combinatorial Optimization, 2020

2018

Old and new results on packing arborescences in directed hypergraphs.

Quentin Fortier, Csaba Király, Marion Léonard, Zoltán Szigeti, Alexandre Talon

Discret. Appl. Math., 2018

2017

On packing spanning arborescences with matroid constraint.

Quentin Fortier, Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa

Electron. Notes Discret. Math., 2017

2016

On Maximal Independent Arborescence Packing.

Csaba Király

SIAM J. Discret. Math., 2016

Generic global rigidity of body-hinge frameworks.

Tibor Jordán, Csaba Király, Shin-ichi Tanigawa

J. Comb. Theory B, 2016

On Minimally Highly Vertex-Redundantly Rigid Graphs.

Viktória E. Kaszanitzky, Csaba Király

Graphs Comb., 2016

2014

Algorithms for finding a rooted (k, 1)-edge-connected orientation.

Csaba Király

Discret. Appl. Math., 2014

2013

Tree-compositions and orientations.

András Frank, Csaba Király

Oper. Res. Lett., 2013

Strongly rigid tensegrity graphs on the line.

Bill Jackson, Tibor Jordán, Csaba Király

Discret. Appl. Math., 2013

2012

Balanced generic circuits without long paths.

Csaba Király, Ferenc Péterfalvi

Discret. Math., 2012