フォロー
Zoltán Szigeti
Zoltán Szigeti
Laboratoire G-SCOP
確認したメール アドレス: grenoble-inp.fr
タイトル
引用先
引用先
Improving on the 1.5-approximation of a smallest 2-edge connected spanning subgraph
J Cheriyan, A Sebo, Z Szigeti
SIAM Journal on Discrete Mathematics 14 (2), 170-180, 2001
93*2001
Edge-connectivity augmentation with partition constraints
J Bang-Jensen, HN Gabow, T Jordán, Z Szigeti
SIAM Journal on Discrete Mathematics 12 (2), 160-207, 1999
701999
Simultaneous well-balanced orientations of graphs
Z Király, Z Szigeti
Journal of Combinatorial Theory, Series B 96 (5), 684-692, 2006
422006
Matroid-based Packing of Arborescences
OD de Gevigney, VH Nguyen, Z Szigeti
372012
Hypergraph connectivity augmentation
Z Szigeti
Mathematical programming 84, 519-527, 1999
321999
An orientation theorem with parity conditions
A Frank, T Jordán, Z Szigeti
Discrete Applied Mathematics 115 (1), 37-47, 2001
262001
Packing of rigid spanning subgraphs and spanning trees
J Cheriyan, OD De Gevigney, Z Szigeti
Journal of Combinatorial Theory, Series B 105, 17-25, 2014
212014
Edge-connectivity augmentations of graphs and hypergraphs
Z Szigeti
Research Trends in Combinatorial Optimization: Bonn 2008, 483-521, 2009
212009
Detachments preserving local edge-connectivity of graphs
T Jordán, Z Szigeti
SIAM Journal on Discrete Mathematics 17 (1), 72-87, 2003
212003
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
182018
Perfect matchings versus odd cuts
Z Szigeti
Combinatorica 22 (4), 575-589, 2002
182002
On a matroid defined by ear-decompositions of graphs
Z Szigeti
Combinatorica 16 (2), 233-241, 1996
161996
Recent results on well-balanced orientations
A Bernáth, S Iwata, T Király, Z Király, Z Szigeti
Discrete Optimization 5 (4), 663-676, 2008
152008
Packing of arborescences with matroid constraints via matroid intersection
C Király, Z Szigeti, S Tanigawa
Mathematical Programming 181, 85-117, 2020
132020
The two ear theorem on matching-covered graphs
Z Szigeti
Journal of combinatorial theory. Series B 74 (1), 104-109, 1998
131998
A characterization of Seymour graphs
AA Ageev, AV Kostochka, Z Szigeti
Journal of Graph Theory 24 (4), 357-364, 1997
131997
On the graphic matroid parity problem
Z Szigeti
Journal of Combinatorial Theory, Series B 88 (2), 247-260, 2003
122003
A note on packing paths in planar graphs
A Frank, Z Szigeti
Mathematical programming 70 (1), 201-209, 1995
111995
On packing T-cuts
A Frank, Z Szigeti
Journal of Combinatorial Theory, Series B 61 (2), 263-271, 1994
111994
Edge-connectivity of permutation hypergraphs
N Jami, Z Szigeti
Discrete Mathematics 312 (17), 2536-2539, 2012
92012
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20