Csaba Király

Orcid: 0000-0001-8081-9056

Affiliations:
  • Eötvös Loránd University, Budapest, Hungary


According to our database1, Csaba Király authored at least 17 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Count and cofactor matroids of highly connected graphs.
J. Comb. Theory B, 2024

Shortest odd paths in undirected graphs with conservative weight functions.
Discret. Appl. Math., 2024

2022
Globally Rigid Augmentation of Rigid Graphs.
SIAM J. Discret. Math., 2022

Sparse graphs and an augmentation problem.
Math. Program., 2022

Sufficient Conditions for the Global Rigidity of Periodic Graphs.
Discret. Comput. Geom., 2022

2021
Rigid realizations of graphs with few locations in the plane.
Eur. J. Comb., 2021

Globally Rigid Augmentation of Minimally Rigid Graphs in R<sup>2</sup>.
Proceedings of the Algorithms and Complexity - 12th International Conference, 2021

2020
Packing of arborescences with matroid constraints via matroid intersection.
Math. Program., 2020

On packing spanning arborescences with matroid constraint.
J. Graph Theory, 2020

2018
Old and new results on packing arborescences in directed hypergraphs.
Discret. Appl. Math., 2018

2016
On Maximal Independent Arborescence Packing.
SIAM J. Discret. Math., 2016

Generic global rigidity of body-hinge frameworks.
J. Comb. Theory B, 2016

On Minimally Highly Vertex-Redundantly Rigid Graphs.
Graphs Comb., 2016

2014
Algorithms for finding a rooted (k, 1)-edge-connected orientation.
Discret. Appl. Math., 2014

2013
Tree-compositions and orientations.
Oper. Res. Lett., 2013

Strongly rigid tensegrity graphs on the line.
Discret. Appl. Math., 2013

2012
Balanced generic circuits without long paths.
Discret. Math., 2012


  Loading...