The following pages link to Jácint Szabó (Q301118):
Displayed 24 items.
- Algorithms for multiplayer multicommodity flow problems (Q301120) (← links)
- Upgrading edge-disjoint paths in a ring (Q429680) (← links)
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems (Q444382) (← links)
- Induced graph packing problems (Q604669) (← links)
- Equitable partitions to spanning trees in a graph (Q665739) (← links)
- Elementary graphs with respect to \(f\)-parity factors (Q968209) (← links)
- The parity problem of polymatroids without double circuits (Q987548) (← links)
- A note on parity constrained orientations (Q987565) (← links)
- Good characterizations for some degree constrained subgraphs (Q1003846) (← links)
- Packing trees with constraints on the leaf degree (Q1014830) (← links)
- Arrival time dependent routing policies in public transport (Q1627847) (← links)
- The Edmonds-Gallai decomposition for the \(k\)-piece packing problem (Q1773199) (← links)
- The superstar packing problem (Q2149487) (← links)
- An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem (Q2288180) (← links)
- Generalized matroid matching (Q2309561) (← links)
- A note on degree-constrained subgraphs (Q2427532) (← links)
- Matroid Parity and Jump Systems: A Solution to a Conjecture of Recski (Q3393421) (← links)
- (Q3424791) (← links)
- (Q3615433) (← links)
- (Q3617659) (← links)
- (Q3617663) (← links)
- Matching Problems in Polymatroids Without Double Circuits (Q5429266) (← links)
- An integer programming approach to routing in daisy networks (Q5469130) (← links)
- The <i>k</i>‐piece packing problem (Q5486279) (← links)