László Szegö

11 papers B 2Journal 9
YearRankTypeTitle / Venue / Authors
2010 J jnl
Balancing congestion for unsplittable routing on a bidirected ring
CoRR
Johanna Becker, Zsolt Csizmadia, Alexandre Laugier, Jácint Szabó, László Szegö
2007 J jnl
Matchings of cycles and paths in directed graphs.
Comb.
Gyula Pap, László Szegö
2006 J jnl
An integer programming approach to routing in daisy networks.
Networks
Johanna Becker, Zsolt Csizmadia, Jérôme Galtier, Alexandre Laugier, Jácint Szabó, László Szegö
2006 J jnl
On constructive characterizations of (
Eur. J. Comb.
László Szegö
2004 J jnl
A Gallai-Edmonds-type structure theorem for path-matchings.
J. Graph Theory
Bianca Spille, László Szegö
2004 J jnl
On the maximum even factor in weakly symmetric graphs.
J. Comb. Theory B
Gyula Pap, László Szegö
2004 B conf
The Path-Packing Structure of Graphs.
IPCO
András Sebö, László Szegö
2003 J jnl
Constructive characterizations for packing and covering with trees.
Discret. Appl. Math.
András Frank, László Szegö
2002 J jnl
Note on the path-matching formula.
J. Graph Theory
András Frank, László Szegö
2001 B conf
An Extension of a Theorem of Henneberg and Laman.
IPCO
András Frank, László Szegö
2001 J jnl
On covering intersecting set-systems by digraphs.
Discret. Math.
László Szegö