Tamás Schwarcz

Orcid: 0000-0003-0373-7414

According to our database1, Tamás Schwarcz authored at least 19 papers between 2019 and 2026.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Monotonic Decompositions of Submodular Set Functions.
SIAM J. Discret. Math., 2026

Interaction Between Skew-representability, Tensor Products, Extension Properties, and Rank Inequalities.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
Fixed-parameter tractability and hardness for Steiner rooted and locally connected orientations.
CoRR, November, 2025

Code for finding a non-SIBO matroid.
Dataset, June, 2025

Matroid Products via Submodular Coupling.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Towards the Proximity Conjecture on Group-Labeled Matroids.
Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024
Exchange Distance of Basis Pairs in Split Matroids.
SIAM J. Discret. Math., March, 2024

Partitioning into common independent sets via relaxing strongly base orderability.
J. Comb. Theory A, February, 2024

Weighted exchange distance of basis pairs.
Discret. Appl. Math., 2024

Reconfiguration of Basis Pairs in Regular Matroids.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Problems on Group-Labeled Matroid Bases.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Approximating Maximum-Size Properly Colored Forests.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2023
Hypergraph characterization of split matroids.
J. Comb. Theory A, 2023

Reconfiguration of the Union of Arborescences.
Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

2022
Rainbow and monochromatic circuits and cocircuits in binary matroids.
Discret. Math., 2022

2021
List Coloring of Two Matroids through Reduction to Partition Matroids.
SIAM J. Discret. Math., 2021

Complexity of packing common bases in matroids.
Math. Program., 2021

2020
Rainbow and monochromatic circuits and cuts in binary matroids.
CoRR, 2020

2019
List colouring of two matroids through reduction to partition matroids.
CoRR, 2019


  Loading...