László Szegö

According to our database, László Szegö authored at least 11 papers between 2001 and 2010.

Collaborative distances:

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

2010

Balancing congestion for unsplittable routing on a bidirected ring

Johanna Becker, Zsolt Csizmadia, Alexandre Laugier, Jácint Szabó, László Szegö

CoRR, 2010

2007

Matchings of cycles and paths in directed graphs.

Gyula Pap, László Szegö

Comb., 2007

2006

An integer programming approach to routing in daisy networks.

Johanna Becker, Zsolt Csizmadia, Jérôme Galtier, Alexandre Laugier, Jácint Szabó, László Szegö

Networks, 2006

On constructive characterizations of (<i>k</i>, <i>l</i>)-sparse graphs.

László Szegö

Eur. J. Comb., 2006

2004

A Gallai-Edmonds-type structure theorem for path-matchings.

Bianca Spille, László Szegö

J. Graph Theory, 2004

On the maximum even factor in weakly symmetric graphs.

Gyula Pap, László Szegö

J. Comb. Theory, Ser. B, 2004

The Path-Packing Structure of Graphs.

András Sebö, László Szegö

Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003

Constructive characterizations for packing and covering with trees.

András Frank, László Szegö

Discret. Appl. Math., 2003

2002

Note on the path-matching formula.

András Frank, László Szegö

J. Graph Theory, 2002

2001

On covering intersecting set-systems by digraphs.

László Szegö

Discret. Math., 2001

An Extension of a Theorem of Henneberg and Laman.

András Frank, László Szegö

Proceedings of the Integer Programming and Combinatorial Optimization, 2001