Approximation algorithms for maximum matchings in undirected graphs. - Fanny Dufossé; Kamer Kaya; Ioannis Panagiotas; Bora Uçar (CSC, 2018)

Effective Heuristics for Matchings in Hypergraphs. - Fanny Dufossé; Kamer Kaya; Ioannis Panagiotas; Bora Uçar (SEA², 2019)

Karp-Sipser based kernels for bipartite graph matching. - Kamer Kaya; Johannes Langguth; Ioannis Panagiotas; Bora Uçar (ALENEX, 2020)

Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching. - Ioannis Panagiotas; Bora Uçar (ESA, 2020)

On matchings and related problems in graphs, hypergraphs, and doubly stochastic matrices. (Sur les couplages et les problèmes liés dans les graphes, les hypergraphes et les matrices doublement stochastiques). - Ioannis Panagiotas (2020)

Shared-memory implementation of the Karp-Sipser kernelization process. - Johannes Langguth; Ioannis Panagiotas; Bora Uçar (HiPC, 2021)

Compressing bipartite graphs with a dual reordering scheme. - Maximilien Danisch; Ioannis Panagiotas; Lionel Tabourier (CoRR, 2022)

Scaling matrices and counting the perfect matchings in graphs. - Fanny Dufossé; Kamer Kaya; Ioannis Panagiotas; Bora Uçar (Discret. Appl. Math., 2022)

Engineering Fast Algorithms for the Bottleneck Matching Problem. - Ioannis Panagiotas; Grégoire Pichon; Somesh Singh 001; Bora Uçar (ESA, 2023)