Peter Varsa

According to our database¹, Peter Varsa authored at least 2 papers between 2022 and 2024.

Collaborative distances:

Timeline

Book

In proceedings

Article

PhD thesis

Dataset

Other

2024

Deciding whether four perfect matchings can cover the edges of a snark is NP-complete.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2024

2022

NP-Completeness of Perfect Matching Index of Cubic Graphs.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022