( en | de | ru )

 

Disambiguation of "Maia, Ana Karolinna"

Author of the publication

copydeleteadd this publication to your clipboard
Complexity of greedy edge-colouring.

, , and . J. Braz. Comp. Soc., 21 (1): 18:1-18:7 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Luís F Maia

Maia Gurushidze

Maia Dimitrova

Marta Ferreira Maia

Muriel Wanessa Torres Maia

 

Other publications of authors with the same name

Adapting the Directed Grid Theorem into an FPT Algorithm., , , and . SIAM J. Discret. Math., 36 (3): 1887-1917 (September 2022)On Finding the Best and Worst Orientations for the Metric Dimension., , , , , , and . Algorithmica, 85 (10): 2962-3002 (October 2023)Maximization coloring problems on graphs with few P4., , , and . Discret. Appl. Math., (2014)Target set selection with maximum activation time., , , , and . CoRR, (2020)On the hull and interval numbers of oriented graphs (Brief Announcement)., , , and . LAGOS, volume 223 of Procedia Computer Science, page 397-399. Elsevier, (2023)On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths., , , , and . Algorithmica, 82 (6): 1616-1639 (2020)Target set selection with maximum activation time., , , , and . Discret. Appl. Math., (October 2023)Fixed parameter algorithms for restricted coloring problems: acyclic, star, nonrepetitive, harmonious and clique colorings, , , , and . CoRR, (2011)Restricted coloring problems on graphs with few P'4s., , , , and . Electron. Notes Discret. Math., (2011)Restricted coloring problems on Graphs with few P 4's., , , and . Ann. Oper. Res., 217 (1): 385-397 (2014)