Peter Varsa

dblp:315/4349 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 since 2021
YearPublicationVenuePosition
2024 Deciding whether four perfect matchings can cover the edges of a snark is NP-complete
Martin Skoviera, Peter Varsa
Theor. Comput. Sci.2
2022 NP-Completeness of Perfect Matching Index of Cubic Graphs
Martin Skoviera, Peter Varsa
STACS2