Follow
Ioannis Panagiotas
Ioannis Panagiotas
Neo4j
Verified email at neotechnology.com
Title
Cited by
Cited by
Year
Further notes on Birkhoff–von Neumann decomposition of doubly stochastic matrices
F Dufossé, K Kaya, I Panagiotas, B Uçar
Linear Algebra and its Applications 554, 68-78, 2018
262018
Approximation algorithms for maximum matchings in undirected graphs
F Dufossé, K Kaya, I Panagiotas, B Uçar
2018 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific …, 2018
122018
Karp-Sipser based kernels for bipartite graph matching
K Kaya, J Langguth, I Panagiotas, B Uçar
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and …, 2020
92020
Effective heuristics for matchings in hypergraphs
F Dufossé, K Kaya, I Panagiotas, B Uçar
International Symposium on Experimental Algorithms, 248-264, 2019
82019
Scaling matrices and counting the perfect matchings in graphs
F Dufossé, K Kaya, I Panagiotas, B Uçar
Discrete Applied Mathematics 308, 130-146, 2022
42022
Engineering fast almost optimal algorithms for bipartite graph matching
I Panagiotas, B Uçar
ESA 2020-European Symposium on Algorithms, 2020
3*2020
Engineering fast algorithms for the bottleneck matching problem
I Panagiotas, G Pichon, S Singh, B Uçar
ESA 2023-The 31st Annual European Symposium on Algorithms, 2023
22023
Compressing bipartite graphs with a dual reordering scheme
M Danisch, I Panagiotas, L Tabourier
arXiv preprint arXiv:2209.12062, 2022
12022
Shared-memory implementation of the Karp-Sipser kernelization process
J Langguth, I Panagiotas, B Uçar
2021 IEEE 28th International Conference on High Performance Computing, Data …, 2021
12021
On matchings and related problems in graphs, hypergraphs, and doubly stochastic matrices
I Panagiotas
Université de Lyon, 2020
2020
On matchings and related problems in graphs, hypergraphs, and doubly stochastic matrices| Theses. fr
I Panagiotas
Lyon, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–11