Csaba Király

research assistant, member

Address:	Department of Operations Research
	Eötvös Loránd University
	1117 Budapest
	Pázmány Péter sétány, 1/C, 3-516
Tel:
Email:	csabi_at_cs.elte.hu
Home page:
Publication list:

List of EGRES technical reports

Highly connected orientations from edge-disjoint rigid subgraphs (Dániel Garamvölgyi, Tibor Jordán, Csaba Király, Soma Villányi)
Count and cofactor matroids of highly connected graphs (Dániel Garamvölgyi, Tibor Jordán, Csaba Király)
Fast algorithms for sparsity matroids and the global rigidity augmentation problem (Csaba Király, András Mihálykó)
Globally rigid augmentation of rigid graphs (Csaba Király, András Mihálykó)
Globally rigid augmentation of minimally rigid graphs in R^2 (Csaba Király, András Mihálykó)
Sparse graphs and an augmentation problem (Csaba Király, András Mihálykó)
On the vertex splitting operation in globally rigid body-hinge graphs (Tibor Jordán, Csaba Király, Shin-ichi Tanigawa)
Sparse graphs and an augmentation problem (A revised version is available as TR-2020-06) (Csaba Király, András Mihálykó)
Rigid realizations of graphs with few locations in the plane (Csaba Király)
Packing of arborescences with matroid constraints via matroid intersection (Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa)
Sufficient conditions for the global rigidity of periodic graphs (Viktória Kaszanitzky, Csaba Király, Bernd Schulze)
Reachability-based matroid-restricted packing of arborescences (Csaba Király, Zoltán Szigeti)
On packing spanning arborescences with matroid constraint (Quentin Fortier, Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa)
Old and new results on packing arborescences (Quentin Fortier, Csaba Király, Marion Léonard, Zoltán Szigeti, Alexandre Talon)
Rigid graphs and an augmentation problem (Csaba Király)
On minimally highly vertex-redundantly rigid graphs (Viktória Kaszanitzky, Csaba Király)
Generic global rigidity of body-hinge frameworks (Tibor Jordán, Csaba Király, Shin-ichi Tanigawa)
On maximal independent arborescence-packing (Csaba Király)
On minimally k-rigid graphs (Viktória Kaszanitzky, Csaba Király)
Strongly Rigid Tensegrity Graphs on the Line (Bill Jackson, Tibor Jordán, Csaba Király)
Balanced generic circuits without long paths (Csaba Király, Ferenc Péterfalvi)
Tree-compositions and submodular flows (András Frank, Csaba Király)

List of EGRES quick proofs

An efficient algorithm for testing $(k,\ell)$-sparsity when $\ell<0$ (Csaba Király)
Simple algorithm for (k,1)-arc-connected orientation of a graph (Csaba Király)

Last modification: 9.5.2024. Please email your comments to Tamás Király!