Ioannis Panagiotas

Orcid: 0000-0002-1081-2411

According to our database1, Ioannis Panagiotas authored at least 9 papers between 2018 and 2023.

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

2023
Engineering Fast Algorithms for the Bottleneck Matching Problem.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

2022
Scaling matrices and counting the perfect matchings in graphs.
Discret. Appl. Math., 2022

Compressing bipartite graphs with a dual reordering scheme.
CoRR, 2022

2021
Shared-memory implementation of the Karp-Sipser kernelization process.
Proceedings of the 28th IEEE International Conference on High Performance Computing, 2021

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).
PhD thesis, 2020

Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Karp-Sipser based kernels for bipartite graph matching.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2020

2019
Effective Heuristics for Matchings in Hypergraphs.
Proceedings of the Analysis of Experimental Algorithms - Special Event, 2019

2018
Approximation algorithms for maximum matchings in undirected graphs.
Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, 2018


  Loading...