Tomás Nagy

Orcid: 0000-0003-4307-8556

Affiliations:
  • Jagiellonian University, Krakow, Theoretical Computer Science Departmen, Poland
  • TU Wien, Institute of Discrete Mathematics and Geometry, Vienna, Austria (PhD 2023)


According to our database1, Tomás Nagy authored at least 7 papers between 2021 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
New Sufficient Algebraic Conditions for Local Consistency over Homogeneous Structures of Finite Duality.
CoRR, February, 2025

The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems.
Proceedings of the 40th Annual ACM/IEEE Symposium on Logic in Computer Science, 2025

2024
Collapsing the Bounded Width Hierarchy for Infinite-Domain Constraint Satisfaction Problems: When Symmetries Are Enough.
SIAM J. Comput., 2024

Strict width for Constraint Satisfaction Problems over homogeneous strucures of finite duality.
CoRR, 2024

An Order out of Nowhere: A New Algorithm for Infinite-Domain {CSP}s.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2023
An order out of nowhere: a new algorithm for infinite-domain CSPs.
CoRR, 2023

2021
Smooth Approximations and Relational Width Collapses.
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021


  Loading...