Mateusz Wasylkiewicz

According to our database, Mateusz Wasylkiewicz authored at least 4 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2026

Clique-Free t-Matchings in Degree-Bounded Graphs.

Katarzyna E. Paluch, Mateusz Wasylkiewicz

Proceedings of the SOFSEM 2026: Theory and Practice of Computer Science, 2026

2024

Finding Perfect Matchings in Bridgeless Cubic Multigraphs Without Dynamic (2-)connectivity.

Pawel Gawrychowski, Mateusz Wasylkiewicz

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.

Katarzyna Paluch, Mateusz Wasylkiewicz

Inf. Process. Lett., 2021

Restricted t-Matchings via Half-Edges.

Katarzyna Paluch, Mateusz Wasylkiewicz

Proceedings of the 29th Annual European Symposium on Algorithms, 2021