László Szegö

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
Balancing congestion for unsplittable routing on a bidirected ring
CoRR, 2010

2007
Matchings of cycles and paths in directed graphs.
Comb., 2007

2006
An integer programming approach to routing in daisy networks.
Networks, 2006

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

2004
A Gallai-Edmonds-type structure theorem for path-matchings.
J. Graph Theory, 2004

On the maximum even factor in weakly symmetric graphs.
J. Comb. Theory B, 2004

The Path-Packing Structure of Graphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2003
Constructive characterizations for packing and covering with trees.
Discret. Appl. Math., 2003

2002
Note on the path-matching formula.
J. Graph Theory, 2002

2001
On covering intersecting set-systems by digraphs.
Discret. Math., 2001

An Extension of a Theorem of Henneberg and Laman.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001


  Loading...