Jácint Szabó

From MaRDI portal
(Redirected from Jácint Szabó)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The superstar packing problem
Combinatorica
2022-06-29Paper
Generalized matroid matching
Discrete Applied Mathematics
2020-04-01Paper
An Edmonds-Gallai-type decomposition for the \(j\)-restricted \(k\)-matching problem
The Electronic Journal of Combinatorics
2020-01-17Paper
Arrival time dependent routing policies in public transport
Discrete Applied Mathematics
2018-12-03Paper
Algorithms for multiplayer multicommodity flow problems
CEJOR. Central European Journal of Operations Research
2016-06-29Paper
A proof of Cunningham's conjecture on restricted subgraphs and jump systems
Journal of Combinatorial Theory. Series B
2012-08-14Paper
Upgrading edge-disjoint paths in a ring
Discrete Optimization
2012-06-20Paper
Equitable partitions to spanning trees in a graph
The Electronic Journal of Combinatorics
2012-03-06Paper
Induced graph packing problems
Graphs and Combinatorics
2010-11-12Paper
The parity problem of polymatroids without double circuits
Combinatorica
2010-08-13Paper
A note on parity constrained orientations
Combinatorica
2010-08-13Paper
Elementary graphs with respect to \(f\)-parity factors
Graphs and Combinatorics
2010-05-05Paper
Matroid Parity and Jump Systems: A Solution to a Conjecture of Recski
SIAM Journal on Discrete Mathematics
2009-08-20Paper
Packing trees with constraints on the leaf degree
Graphs and Combinatorics
2009-04-29Paper
Uniform coloring of trees2009-03-30Paper
scientific article; zbMATH DE number 5535214 (Why is no real title available?)2009-03-30Paper
scientific article; zbMATH DE number 5530160 (Why is no real title available?)2009-03-19Paper
Good characterizations for some degree constrained subgraphs
Journal of Combinatorial Theory. Series B
2009-03-04Paper
A note on degree-constrained subgraphs
Discrete Mathematics
2008-05-13Paper
Matching Problems in Polymatroids Without Double Circuits
Integer Programming and Combinatorial Optimization
2007-11-29Paper
On the generalization of the matroid parity problem2007-03-05Paper
The <i>k</i>‐piece packing problem
Journal of Graph Theory
2006-09-06Paper
An integer programming approach to routing in daisy networks
Networks
2006-05-16Paper
The Edmonds-Gallai decomposition for the \(k\)-piece packing problem
The Electronic Journal of Combinatorics
2005-04-25Paper
The Edmonds-Gallai decomposition for the \(k\)-piece packing problem
The Electronic Journal of Combinatorics
2005-04-25Paper


Research outcomes over time


This page was built for person: Jácint Szabó