Direkt zum Inhalt | Direkt zur Navigation



Szigeti, Zoltán; Király, Z.: Simultaneous well-balanced orientations of graphs. In: Journal of Combinatorial Theory, Series B, 96, 2006, S. 684-692

Szigeti, Zoltán: Edge-connectivity augmentation of graphs over symmetric parity families. In: Discrete Mathematics, 308, 2008, S. 6527-6532

Szigeti, Zoltán: On edge-connectivity augmentation of graphs and hypergraphs. In: Research Trends in Combinatorial Optimization. Hrsg. von William J. Cook. Berlin: Springer Verlag 2009, S. 483-521

Szigeti, Zoltán; Bernáth, A.; Grappe, R.: Partition constrained covering of symmetric crossing supermodular functions. In: Proceedings of Annual ACM-SIAM Symposium on Discrete Algorithms SODA 2010. Philadelphia: SIAM 2010, S. 1512-1520

Szigeti, Zoltán; Ageev, A.; Benchetrit, Y.; Sebő, A.: An excluded minor characterization of Seymour graphs. In: Proceedings of the 15th International IPCO Conference on Integer Programming and Combinatorial Optimization. Berlin: Springer Verlag 2011, S. 1-13