Please enable JavaScript.

Coggle requires JavaScript to display documents.

sources dossier ANRT - Coggle Diagram

- - - - [15] J. Edmonds. Paths, trees, and flowers. Canadian Journal of Mathematics, 17:449–467, 1965.
      - [27] M. Mucha and P. Sankowski. Maximum matchings via Gaussian elimination. In 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS ’04, pages 248–255, 2004.
      - [11] M. Cygan, H. N. Gabow, and P. Sankowski. Algorithmic applications of Baur-Strassen’s theorem: Shortest cycles, diameter, and matchings. Journal of the ACM, 62(4):28:1–28:30, 2015.
    - - [13] F. Dufossé, K. Kaya, I. Panagiotas, and B. Uçar. Approximation algorithms for maximum matchings in undirected graphs. In SIAM Workshop on Combinatorial Scientific Computing, 2018. https://hal.archives-ouvertes.fr/hal-01740403.
    - - [31] S. Wøhlk and G. Laporte. Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs. Computers and Operations Research, 87(C):107–113, 2017.
    - - [14] C. Dürr, C. Konrad, and M. P. Renault. On the Power of Advice and Randomization for Online Bipartite Matching. In 24th Annual European Symposium on Algorithms, volume 57 of LIPIcs, pages 37:1–37:16, 2016.
      - [26] S. Miyazaki. On the advice complexity of online bipartite matching and online stable marriage. Information Processing Letters, 114(12):714–717, 2014.
      - [30] Y. Wang and S. C.-W. Wong. Two-sided Online Bipartite Matching and Vertex Cover: Beating the Greedy Algorithm. In 42nd International Colloquium on Automata, Languages, and Programming, volume 9134 of LNCS, pages 1070–1081, 2015.
    - - [12] R.G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
      - reducing the dependance in n to a linear complexity
        
        [16] F. V. Fomin, D. Lokshtanov, S. Saurabh, M. Pilipczuk, and M. Wrochna. Fully polynomial-time parameterized computations for graphs and matrices of low treewidth. ACM Transactions on Algorithms, 14(3):34:1–34:45, 2018.
        
        [23] G. B. Mertzios, A. Nichterlein, and R. Niedermeier. The power of linear-time data reduction for maximum matching. In 42nd International Symposium on Mathematical Foundations of Computer Science, volume 83 of LIPIcs, pages 46:1–46:14, 2017.
  - - - [24] G.B. Mertzios, H. Molter, R. Niedermeier, V. Zamaraev, and P. Zschoche. Computing Maximum Matchings in Temporal Graphs. In 37th International Symposium on Theoretical Aspects of Computer Science, volume 154 of LIPIcs, pages 27:1–27:14, 2020.
      - [3] J. Baste and B.-M. Bui-Xuan. Temporal matching in link stream: kernel and approximation. In 16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2018.
    - - [2] E.C. Akrida, G.B. Mertzios, P.G. Spirakis, and V. Zamaraev. Temporal vertex cover with a sliding time window. Journal of Computer and System Sciences, 107:108–123, 2020.
      - [25] G.B. Mertzios and P.G. Spirakis. Strong bounds for evolution in networks. Journal of Computer and System Sciences, 97:60–82, 2018.
  - - - [10] T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, 1989.