Mateusz Wasylkiewicz

Orcid: 0000-0002-4198-5569

According to our database1, Mateusz Wasylkiewicz authored at least 4 papers between 2021 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Clique-free t-matchings in degree-bounded graphs.
CoRR, 2024

Finding Perfect Matchings in Bridgeless Cubic Multigraphs Without Dynamic (2-)connectivity.
Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

2021
A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs - via half-edges.
Inf. Process. Lett., 2021

Restricted t-Matchings via Half-Edges.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021


  Loading...