Personale

Recapiti

Italiano

Pubblicazioni

Insegnamenti

Ana Shirley FERREIRA DA SILVA

Ruolo attuale:: Professore Associato
SSD:: INFO-01/A - Informatica
Afferenza organizzativa:: Dipartimento di Statistica, Informatica, Applicazioni 'G. Parenti' (DiSIA)

Recapiti

anashirley.ferreiradasilva(AT)unifi.it

Avvisi

FIDS - Esame 8 gennaio

Scrivo per informarvi che ho cambiato il luogo dell'esame di domani: aula 202, Morgagni. Avrete 3:30 per completare l'esame. Coloro che non hanno svolto il progetto di metà corso dovranno risolvere un compito aggiuntivo e avranno mezz'ora in più.

Ana Shirley FERREIRA DA SILVA

Pubblicazioni

Legenda

Contributo su rivista |

Articolo su libro |

Libro |

Contributo in atti di convegno (proceeding) |

Brevetto |

Curatela | Altro

Altro |

Tesi di Dottorato

Christodoulou, Filippos; Crescenzi, Pierluigi; Marino, Andrea; Silva, Ana; Thilikos, Dimitrios M. (2024). Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional. In: IWOCA, SPRINGER INTERNATIONAL PUBLISHING AG, vol. 14764, pp. 247-258, ISBN:9783031630200 DOI

Costa I.L.; Silva A.S. (2024). Acyclic coloring of products of digraphs. DISCRETE APPLIED MATHEMATICS, vol. 349, pp. 59-69, ISSN:0166-218X DOI

Costa Isnard; Lopes Raul; Marino Andrea; Silva Ferreira Ana Shirley (2024). On computing large temporal (unilateral) connected components. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 144, pp. 1-20, ISSN:0022-0000 DOI

Araujo J.; Campos V.; Girao D.; Nogueira J.; Salgueiro A.; Ana Shirley Ferreira da Silva (2024). On the hull number on cycle convexity of graphs. INFORMATION PROCESSING LETTERS, vol. 183, pp. 0-0, ISSN:0020-0190 DOI

Costa I.L.; Lopes R.; Marino A.; Silva Ana Shirley (2024). On computing large temporal (unilateral) connected components. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 144, pp. 103548-103568, ISSN:0022-0000 DOI

Ibiapina A.; Silva Ana Shirley (2024). Mengerian graphs: Characterization and recognition. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 139, pp. 0-0, ISSN:0022-0000 DOI

de Figueiredo C.M.H.; de Melo A.A.; Oliveira F.S.; Silva Ana Shirley (2024). Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete. DISCRETE & COMPUTATIONAL GEOMETRY, vol. 71, pp. 893-917, ISSN:0179-5376 DOI

Bubboloni, Daniela; Catalano, Costanza; Marino, Andrea; Silva, Ana (2024). On Computing Optimal Temporal Branchings and Spanning Subgraphs. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 148, pp. 1-36, ISSN:0022-0000 DOI Accesso ONLINE all'editore

de Figueiredo C.M.H.; de Melo A.A.; Oliveira F.S.; Silva Ana Shirley (2023). MaxC ut on permutation graphs is NP-complete. JOURNAL OF GRAPH THEORY, vol. 104, pp. 5-16, ISSN:0364-9024 DOI

Costa I.L.; Lopes R.; Marino A.; Silva A. (2023). On Computing Large Temporal (Unilateral) Connected Components. In: 34th International Workshop on Combinatorial Algorithms, IWOCA 2023, twn, 2023, Springer Science and Business Media Deutschland GmbH, vol. 13889, pp. 282-293. DOI

Araujo J.; Bensmail J.; Campos V.; Havet F.; Maia A.K.; Nisse N.; Silva Ana Shirley (2023). On Finding the Best and Worst Orientations for the Metric Dimension. ALGORITHMICA, vol. 85, pp. 2962-3002, ISSN:0178-4617 DOI

Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Silva (2023). On Computing Optimal Temporal Branchings. In: International Symposium on Fundamentals of Computation Theory FCT 2023, Trier (Germany), 18-21 settembre 2023, Springer, pp. 103-117. DOI Accesso ONLINE all'editore

Celina M.H.de Figueiredo; Alexsander A.de Melo; Diana Sasaki; FERREIRA DA SILVA A (2022). Revising Johnson's Table for the 21st century. DISCRETE APPLIED MATHEMATICS, vol. 323, pp. 184-200, ISSN:0166-218X DOI

Marino A.; Silva A. (2022). Eulerian Walks in Temporal Graphs. ALGORITHMICA, pp. 0-0, ISSN:0178-4617 DOI

Araujo C.S.; Araujo J.; Silva Ana Shirley; Cezar A.A. (2022). Backbone coloring of graphs with galaxy backbones. DISCRETE APPLIED MATHEMATICS, vol. 323, pp. 2-13, ISSN:0166-218X DOI

Marino A.; Silva A. (2022). Coloring temporal graphs. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, vol. 123, pp. 171-185, ISSN:0022-0000 DOI

CELINA M. H. de Figueiredo; Alexsander A. de Melo; Fabiano S. Oliveira; FERREIRA DA SILVA A (2021). Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete. . DOI Accesso ONLINE all'editore

J.Araujoa; A. Cezar; C.V.G.C. Lima; V.F.dos Santos; FERREIRA DA SILVA A (2021). On the proper orientation number of chordal graphs. THEORETICAL COMPUTER SCIENCE, vol. 888, pp. 117-132, ISSN:0304-3975 DOI

ALLEN IBIAPINA; FERREIRA DA SILVA A (2021). Mengerian Graphs Revisited. . DOI

Marino A.; Silva A. (2021). Königsberg Sightseeing: Eulerian Walks in Temporal Graphs. In: 32nd International Workshop on Combinatorial Algorithms, IWOCA 2021, 2021, Springer Science and Business Media Deutschland GmbH, vol. 12757, pp. 485-500, ISBN:978-3-030-79986-1 DOI

Campos V.; Lopes R.; Marino A.; Silva A. (2021). Edge-disjoint branchings in temporal digraphs. ELECTRONIC JOURNAL OF COMBINATORICS, vol. 28, pp. 1-23, ISSN:1077-8926 DOI

Victor A. Campos; Guilherme C.M. Gomes; Allen Ibiapina; Raul Lopes; Ignasi Sau; FERREIRA DA SILVA A (2021). Coloring Problems on Bipartite Graphs of Small Diameter. ELECTRONIC JOURNAL OF COMBINATORICS, vol. 28, pp. -, ISSN:1077-8926 DOI

LUIZ VIANA; MANOEL CAMPELO; IGNASI SAU; FERREIRA DA SILVA A (2021). A unifying model for locally constrained spanning tree problems. JOURNAL OF COMBINATORIAL OPTIMIZATION, vol. 42, pp. 125-150, ISSN:1382-6905 DOI

ARAÚJO; JÚLIO; CAMPOS; VICTOR A.; MAIA; ANA KAROLINNA; SAU; IGNASI; Ferreira da Silva A (2020). On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. ALGORITHMICA, vol. 82, pp. 1616-1639, ISSN:0178-4617 DOI Accesso ONLINE all'editore

Allen Ibiapina; FERREIRA DA SILVA A (2020). b-continuity and partial Grundy coloring of graphs with large girth. DISCRETE MATHEMATICS, vol. 343, pp. -, ISSN:0012-365X DOI Accesso ONLINE all'editore

Manoel Campêlo; Tatiane Figueiredo; Ferreira da Silva A (2020). The sociotechnical teams formation problem: a mathematical optimization approach. ANNALS OF OPERATIONS RESEARCH, vol. 286, pp. 201-216, ISSN:1572-9338 DOI Accesso ONLINE all'editore

Júlio Araújo; Victor Campos; Carlos Vinícius GC Lima; Vinícius Fernandes dos Santos; Ignasi Sau; Ferreira da Silva A (2020). Dual parameterization of weighted coloring. ALGORITHMICA, vol. 82, pp. 2316-2336, ISSN:0178-4617 DOI Accesso ONLINE all'editore

Campos V.; Lopes R.; Marino A.; Silva A. (2020). Edge-Disjoint Branchings in Temporal Graphs. In: 31st International Workshop on Combinatorial Algorithms, IWOCA 2020, fra, 2020, Springer, vol. 12126, pp. 112-125, ISBN:978-3-030-48965-6 DOI

Esdras Mota; Leonardo Rocha; FERREIRA DA SILVA A (2020). Connected greedy coloring of H-free graphs. DISCRETE APPLIED MATHEMATICS, vol. 284, pp. 572-584, ISSN:0166-218X DOI Accesso ONLINE all'editore

Júlio Araújo; Cláudia Linhares Sales; Ignasi Sau; FERREIRA DA SILVA A (2019). Weighted proper orientations of trees and graphs of bounded treewidth. THEORETICAL COMPUTER SCIENCE, vol. 771, pp. 39-48, ISSN:0304-3975 DOI Accesso ONLINE all'editore

Camila Araújo; Júlio Araújo; FERREIRA DA SILVA A; Alexandre Cezar (2019). Backbone Coloring of Graphs with Galaxy Backbones. , vol. 346, pp. 53-64. DOI Accesso ONLINE all'editore

Ferreira da Silva A (2019). Graphs with small fall-spectrum. DISCRETE APPLIED MATHEMATICS, vol. 254, pp. 183-188, ISSN:0166-218X DOI Accesso ONLINE all'editore

Allen Ibiapina; FERREIRA DA SILVA A (2019). Graphs with Girth at Least 8 are b-continuous. , vol. 346, pp. 677-684. DOI Accesso ONLINE all'editore

Júlio Araújo; Fabrício Benevides; Alexandre Cezar; FERREIRA DA SILVA A (2018). Circular backbone colorings: On matching and tree backbones of planar graphs. DISCRETE APPLIED MATHEMATICS, vol. 251, pp. 69-82, ISSN:0166-218X DOI Accesso ONLINE all'editore

Araújo Júlio; Campos Victor A.; Lima Carlos Vinícius G. C.; Fernandes dos Santos Vinícius; Sau Ignasi; FERREIRA DA SILVA A (2018). Dual Parameterization of Weighted Coloring. . DOI Accesso ONLINE all'editore

Júlio Araújo; Victor A. Campos; Ana Karolinna Maia; Ignasi Sau; FERREIRA DA SILVA A (2018). On the complexity of finding internally vertex-disjoint long directed paths. , vol. 10807, pp. 66-79. DOI Accesso ONLINE all'editore

Victor Campos; FERREIRA DA SILVA A (2018). Edge-b-Coloring Trees. ALGORITHMICA, vol. 383, pp. 104-115, ISSN:0178-4617 DOI Accesso ONLINE all'editore

Júlio Araújo; Alexandre Cezar; FERREIRA DA SILVA A (2017). On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring. JOURNAL OF GRAPH THEORY, vol. 85, pp. 808-813, ISSN:0364-9024 DOI Accesso ONLINE all'editore

Cláudia Linhares Sales; Leonardo Sampaio; FERREIRA DA SILVA A (2017). The lexicographic product of some chordal graphs and of cographs preserves b-continuity. . DOI Accesso ONLINE all'editore

Cláudia Linhares Sales; FERREIRA DA SILVA A (2017). The b-Continuity of Graphs with Large Girth. GRAPHS AND COMBINATORICS, vol. 33, pp. 1139-1146, ISSN:0911-0119 DOI Accesso ONLINE all'editore

Cláudia Linhares Sales; Leonardo Sampaio; FERREIRA DA SILVA A (2017). On the b-Continuity of the Lexicographic Product of Graphs. GRAPHS AND COMBINATORICS, vol. 33, pp. 1165-1180, ISSN:0911-0119 DOI Accesso ONLINE all'editore

Júlio Araújo; Frédéric Havet; Cláudia Linhares Sales; FERREIRA DA SILVA A (2016). Proper orientation of cacti. THEORETICAL COMPUTER SCIENCE, vol. 639, pp. 14-25, ISSN:0304-3975 DOI Accesso ONLINE all'editore

FERREIRA DA SILVA A; Cláudia Linhares Sales (2016). Graphs with large girth are b-continuous. . DOI Accesso ONLINE all'editore

Fabrício Benevides; Victor Campos; Mitre Dourado; FERREIRA DA SILVA A (2015). Complexity of determining the maximum infection time in the geodetic convexity. . DOI Accesso ONLINE all'editore

Campos; Victor; LIMA; Carlos; MARTINS; Nicolas A.; SAMPAIO; LEONARDO; SANTOS; Márcio; FERREIRA DA SILVA A (2015). The b-chromatic index of graphs. DISCRETE MATHEMATICS, vol. 338, pp. 2072-2079, ISSN:0012-365X DOI Accesso ONLINE all'editore

BENEVIDES; FABRÍCIO; Campos; Victor; DOURADO; MITRE C.; SAMPAIO; RUDINI M.; FERREIRA DA SILVA A (2015). The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects. EUROPEAN JOURNAL OF COMBINATORICS, vol. 48, pp. 88-99, ISSN:0195-6698 DOI Accesso ONLINE all'editore

BENEVIDES; FABRÍCIO; Campos; Victor; DOURADO; MITRE C.; SAMPAIO; RUDINI M; FERREIRA DA SILVA A (2015). The maximum infection time in the geodesic and monophonic convexities. THEORETICAL COMPUTER SCIENCE, vol. 609, pp. 287-295, ISSN:0304-3975 DOI Accesso ONLINE all'editore

Victor Campos; Carlos Lima; FERREIRA DA SILVA A (2015). Graphs of girth at least 7 have high b-chromatic number. EUROPEAN JOURNAL OF COMBINATORICS, vol. 48, pp. 114-164, ISSN:0195-6698 DOI Accesso ONLINE all'editore

Victor Campos; Rudini SAMPAIO; Ferreira da Silva A; JAYME SZWARCFITER (2015). Graphs with few P4's under the convexity of paths of order three. DISCRETE APPLIED MATHEMATICS, vol. 192, pp. 28-39, ISSN:0166-218X DOI Accesso ONLINE all'editore

Victor Campos; Sulamita Klein; Rudini Sampaio; FERREIRA DA SILVA A (2014). Fixed-parameter algorithms for the cocoloring problem. DISCRETE APPLIED MATHEMATICS, vol. 167, pp. 52-60, ISSN:0166-218X DOI Accesso ONLINE all'editore

Fabrício Benevides; Victor Campos; Mitre Dourado; Simon Griffiths; Robert Morris; Leonardo Sampaio; FERREIRA DA SILVA A (2014). Connected Greedy Colourings. . DOI Accesso ONLINE all'editore

Victor Campos; Carlos Lima; FERREIRA DA SILVA A (2013). B-Coloring Graphs with Girth at Least 8. . DOI Accesso ONLINE all'editore

Fabrício Benevides; Victor Campos; Mitre C. Dourado; Rudini M. Sampaio; FERREIRA DA SILVA A (2013). The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects. . DOI Accesso ONLINE all'editore

Frédéric Maffray; FERREIRA DA SILVA A (2013). b-colouring the Cartesian product of trees and some other graphs. DISCRETE APPLIED MATHEMATICS, vol. 161, pp. 650-669, ISSN:0166-218X DOI Accesso ONLINE all'editore

Carlos Vinícius G.C.Lima; Nicolas A. Martins; Leonardo Sampaio; Marcio C.Santos; FERREIRA DA SILVA A (2013). b-chromatic index of graphs. . DOI Accesso ONLINE all'editore

Victor Campos; Frédéric Havet; Rudini Sampaio; FERREIRA DA SILVA A (2013). Backbone colouring: Tree backbones with small diameter in planar graphs. THEORETICAL COMPUTER SCIENCE, vol. 487, pp. 50-64, ISSN:0304-3975 DOI Accesso ONLINE all'editore

Victor Campos; Victor Farias; FERREIRA DA SILVA A (2012). b-Coloring graphs with large girth. JOURNAL OF THE BRAZILIAN COMPUTER SOCIETY, vol. 18, pp. 375-378, ISSN:0104-6500 DOI Accesso ONLINE all'editore

Frédéric Maffray; FERREIRA DA SILVA A (2012). b-colouring outerplanar graphs with large girth. DISCRETE MATHEMATICS, vol. 312, pp. 1796-1803, ISSN:0012-365X DOI Accesso ONLINE all'editore

Simone Dantas; Frédéric Maffray; FERREIRA DA SILVA A (2012). 2K2-partition of some classes of graphs. DISCRETE APPLIED MATHEMATICS, vol. 160, pp. 2662-2668, ISSN:0166-218X DOI Accesso ONLINE all'editore

Victor Campos; Sulamita Klein; Rudini Sampaio; FERREIRA DA SILVA A (2011). Two Fixed-Parameter Algorithms for the Cocoloring Problem. . DOI Accesso ONLINE all'editore

FERREIRA DA SILVA A; Aline Alves da Silva; Cláudia Linhares Sales (2010). A bound on the treewidth of planar even-hole-free graphs. DISCRETE APPLIED MATHEMATICS, vol. 158, pp. 1229-1239, ISSN:0166-218X DOI Accesso ONLINE all'editore

Victor Campos; Cláudia Linhares Sales; Frédéric Maffray; FERREIRA DA SILVA A (2009). b-chromatic number of cacti. . DOI

Aline Alves da Silva; FERREIRA DA SILVA A; Cláudia Linhares Sales (2007). Even-hole-free planar graphs have bounded treewidth. . DOI Accesso ONLINE all'editore