Publications of Alexandru Popa

BACK TO COATI PUBLICATION INDEX

Publications of Alexandru Popa

Articles in journal or book's chapters
  1. David Coudert, Guillaume Ducoffe, and Alexandru Popa. P-FPT algorithms for bounded clique-width graphs. ACM Transactions on Algorithms, 15(3):1-57, June 2019. [WWW ] [PDF ] [bibtex-entry]
     
Conference's articles
  1. David Coudert, Guillaume Ducoffe, and Alexandru Popa. Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. In ACM-SIAM Symposium on Discrete Algorithms, New Orleans, United States, pages 20, January 2018. SIAM. [WWW ] [PDF ] [bibtex-entry]
     
Internal reports
  1. David Coudert, Guillaume Ducoffe, and Alexandru Popa. Fully polynomial FPT algorithms for some classes of bounded clique-width graphs. Research Report, Inria - Sophia antipolis ; Universite Cote d'Azur ; University of Bucharest, Faculty of Mathematics and Computer Science ; National Institute for Research and Development in Informatics, Romania, July 2017. [WWW ] [PDF ]
    Keywords: Fully polynomial FPT, Graph algorithms, Hardness in P, Split decomposition, Neighbourhood diversity, Primeval decomposition, Clique-width, Modular decomposition. [bibtex-entry]
     
  2. Guillaume Ducoffe, Ruxandra Marinescu-Ghemeci, and Alexandru Popa. On the (di)graphs with (directed) proper connection number two. Research Report, Université Côte d’Azur, Inria, CNRS, I3S, France ; University of Bucharest, Faculty of Mathematics and Computer Science ; National Institute for Research and Development in Informatics, Romania ; The Research Institute of the University of Bucharest ICUB, Romania, March 2017. [WWW ] [PDF ] [bibtex-entry]
     

BACK TO COATI PUBLICATION INDEX



Last modified: Sat Jan 29 19:00:46 2022