| 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 | 12 | 2018 |
| 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 | 9 | 2018 |
| 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 | 3 | 2020 |
| Scaling matrices and counting the perfect matchings in graphs F Dufossé, K Kaya, I Panagiotas, B Uçar Discrete Applied Mathematics, 2020 | 2 | 2020 |
| Effective heuristics for matchings in hypergraphs F Dufossé, K Kaya, I Panagiotas, B Uçar International Symposium on Experimental Algorithms, 248-264, 2019 | 2 | 2019 |
| Engineering fast almost optimal algorithms for bipartite graph matching I Panagiotas, B Uçar 28th Annual European Symposium on Algorithms (ESA 2020), 2020 | 1* | 2020 |
| On matchings and related problems in graphs, hypergraphs, and doubly stochastic matrices I Panagiotas Université de Lyon, 2020 | | 2020 |
Bora UçarCNRS and ENS LyonVerified email at ens-lyon.fr
