  |
Items where Author is "Schwarcz, Tamás"
Group by: Item Type | No Grouping Jump to: Article | Book Section Number of items: 5. ArticleBai, Yuhang and Bérczi, Kristóf and Csáji, Gergely Kál and Schwarcz, Tamás (2026) Approximating maximum-size properly colored forests. EUROPEAN JOURNAL OF COMBINATORICS, 132. No. 104269. ISSN 0195-6698 Bérczi, Kristóf and Gehér, Boglárka and Imolay, András and Lovász, László and Schwarcz, Tamás (2026) Monotonic Decompositions of Submodular Set Functions. SIAM JOURNAL ON DISCRETE MATHEMATICS, 40 (1). pp. 308-335. ISSN 0895-4801 Bérczi, Kristóf and Schwarcz, Tamás and Yamaguchi, Yutaro (2021) List colouring of two matroids through reduction to partition matroids. SIAM JOURNAL ON DISCRETE MATHEMATICS. ISSN 0895-4801 (In Press) Bérczi, Kristóf and Schwarcz, Tamás (2020) Complexity of packing common bases in matroids. MATHEMATICAL PROGRAMMING. ISSN 0025-5610 Book SectionBérczi, Kristóf and Gehér, Boglárka and Imolay, András and Lovász, László and Padró, Carles and Schwarcz, Tamás (2026) Interaction Between Skew-representability, Tensor Products, Extension Properties, and Rank Inequalities. In: Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Society for Industrial and Applied Mathematics (SIAM), Philadelphia, pp. 328-354. ISBN 9781611978971 |
