Even-hole-free planar graphs have bounded treewidth. - Aline Alves da Silva; Ana Silva 001; Cláudia Linhares Sales (Electron. Notes Discret. Math., 2008)

b-chromatic number of cacti. - Victor A. Campos; Cláudia Linhares Sales; Frédéric Maffray; Ana Silva 001 (Electron. Notes Discret. Math., 2009)

A bound on the treewidth of planar even-hole-free graphs. - Ana Silva 001; Aline Alves da Silva; Cláudia Linhares Sales (Discret. Appl. Math., 2010)

Two Fixed-Parameter Algorithms for the Cocoloring Problem. - Victor A. Campos; Sulamita Klein; Rudini Menezes Sampaio; Ana Silva 001 (ISAAC, 2011)

Graphs with Few P4's Under the Convexity of Paths of Order Three. - Victor A. Campos; Rudini Menezes Sampaio; Ana Silva 001; Jayme Luiz Szwarcfiter (CTW, 2012)

2k2-partition of some classes of graphs. - Simone Dantas; Frédéric Maffray; Ana Silva 001 (Discret. Appl. Math., 2012)

b-colouring outerplanar graphs with large girth. - Frédéric Maffray; Ana Silva 001 (Discret. Math., 2012)

b-Coloring graphs with large girth. - Victor A. Campos; Victor A. E. de Farias; Ana Silva 001 (J. Braz. Comput. Soc., 2012)

b-colouring the Cartesian product of trees and some other graphs. - Frédéric Maffray; Ana Silva 001 (Discret. Appl. Math., 2013)

b-chromatic index of graphs. - Carlos Vinícius G. C. Lima; Nicolas Almeida Martins; Leonardo Sampaio Rocha; Marcio Costa Santos; Ana Silva 001 (Electron. Notes Discret. Math., 2013)

Backbone colouring: Tree backbones with small diameter in planar graphs. - Victor A. Campos; Frédéric Havet; Rudini Menezes Sampaio; Ana Silva 001 (Theor. Comput. Sci., 2013)

Connected Greedy Colourings. - Fabrício Benevides; Victor A. Campos; Mitre Costa Dourado; Simon Griffiths; Robert Morris 001; Leonardo Sampaio Rocha; Ana Silva 001 (LATIN, 2014)

Fixed-parameter algorithms for the cocoloring problem. - Victor A. Campos; Sulamita Klein; Rudini Menezes Sampaio; Ana Silva 001 (Discret. Appl. Math., 2014)

Graphs with few P4's under the convexity of paths of order three. - Victor A. Campos; Rudini Menezes Sampaio; Ana Silva 001; Jayme Luiz Szwarcfiter (Discret. Appl. Math., 2015)

The b-chromatic index of graphs. - Victor A. Campos; Carlos Vinícius G. C. Lima; Nicolas Almeida Martins; Leonardo Sampaio Rocha; Marcio Costa Santos; Ana Silva 001 (Discret. Math., 2015)

The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects. - Fabrício Benevides; Victor A. Campos; Mitre Costa Dourado; Rudini Menezes Sampaio; Ana Silva 001 (Eur. J. Comb., 2015)

Graphs of girth at least 7 have high b-chromatic number. - Victor A. Campos; Carlos Vinícius G. C. Lima; Ana Silva 001 (Eur. J. Comb., 2015)

Complexity of determining the maximum infection time in the geodetic convexity. - Fabrício Benevides; Victor A. Campos; Mitre Costa Dourado; Ana Silva 001 (Electron. Notes Discret. Math., 2015)

Graphs with large girth are b-continuous. - Ana Silva 001; Cláudia Linhares Sales (Electron. Notes Discret. Math., 2016)

Proper orientation of cacti. - Júlio Araújo 001; Frédéric Havet; Cláudia Linhares Sales; Ana Silva 001 (Theor. Comput. Sci., 2016)

The maximum infection time in the geodesic and monophonic convexities. - Fabrício Benevides; Victor A. Campos; Mitre Costa Dourado; Rudini Menezes Sampaio; Ana Silva 001 (Theor. Comput. Sci., 2016)

The lexicographic product of some chordal graphs and of cographs preserves b-continuity. - Cláudia Linhares Sales; Leonardo Sampaio Rocha; Ana Silva 001 (Electron. Notes Discret. Math., 2017)

The b-Continuity of Graphs with Large Girth. - Cláudia Linhares Sales; Ana Silva 001 (Graphs Comb., 2017)

On the b-Continuity of the Lexicographic Product of Graphs. - Cláudia Linhares Sales; Leonardo Sampaio Rocha; Ana Silva 001 (Graphs Comb., 2017)

On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring. - Júlio César Silva Araújo; Alexandre A. Cezar; Ana Silva 001 (J. Graph Theory, 2017)

Edge-b-Coloring Trees. - Victor A. Campos; Ana Silva 001 (Algorithmica, 2018)

Circular backbone colorings: On matching and tree backbones of planar graphs. - Júlio Araújo 001; Fabrício Benevides; Alexandre A. Cezar; Ana Silva 001 (Discret. Appl. Math., 2018)

On Orthogonal Vector Edge Coloring. - Ana Silva 001; Allen Ibiapina (CoRR, 2019)

Graphs with small fall-spectrum. - Ana Silva 001 (Discret. Appl. Math., 2019)

Backbone Coloring of Graphs with Galaxy Backbones. - Camila Araujo; Júlio Araújo 001; Ana Silva 001; Alexandre A. Cezar (LAGOS, 2019)

Graphs with Girth at Least 8 are b-continuous. - Allen Ibiapina; Ana Silva 001 (LAGOS, 2019)

Weighted proper orientations of trees and graphs of bounded treewidth. - Júlio Araújo 001; Cláudia Linhares Sales; Ignasi Sau; Ana Silva 001 (Theor. Comput. Sci., 2019)

Edge-Disjoint Branchings in Temporal Graphs. - Victor A. Campos; Raul Lopes 001; Andrea Marino 001; Ana Silva 001 (IWOCA, 2020)

Dual Parameterization of Weighted Coloring. - Júlio Araújo 001; Victor A. Campos; Carlos Vinícius G. C. Lima; Vinícius Fernandes dos Santos; Ignasi Sau; Ana Silva 001 (Algorithmica, 2020)

On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. - Júlio Araújo 001; Victor A. Campos; Ana Karolinna Maia; Ignasi Sau; Ana Silva 001 (Algorithmica, 2020)

The sociotechnical teams formation problem: a mathematical optimization approach. - Manoel B. Campêlo; Tatiane Fernandes Figueiredo; Ana Silva 001 (Ann. Oper. Res., 2020)

Cycle convexity and the tunnel number of links. - Júlio Araújo 001; Victor A. Campos; Darlan Girão; João Nogueira; António Salgueiro; Ana Silva 001 (CoRR, 2020)

Maximum cut on interval graphs of interval count five is NP-complete. - Celina M. H. de Figueiredo; Alexsander Andrade de Melo; Fabiano de S. Oliveira; Ana Silva 001 (CoRR, 2020)

Connected greedy coloring of H-free graphs. - Esdras Mota; Leonardo S. Rocha 001; Ana Silva 001 (Discret. Appl. Math., 2020)

b-continuity and partial Grundy coloring of graphs with large girth. - Allen Ibiapina; Ana Silva 001 (Discret. Math., 2020)

Mengerian Temporal Graphs Revisited. - Allen Ibiapina; Ana Silva 001 (FCT, 2021)

Königsberg Sightseeing: Eulerian Walks in Temporal Graphs. - Andrea Marino 001; Ana Silva 001 (IWOCA, 2021)

Coloring Problems on Bipartite Graphs of Small Diameter. - Victor A. Campos; Guilherme de C. M. Gomes; Allen Ibiapina; Raul Lopes 001; Ignasi Sau; Ana Silva 001 (Electron. J. Comb., 2021)

Edge-Disjoint Branchings in Temporal Digraphs. - Victor A. Campos; Raul Lopes 001; Andrea Marino 001; Ana Silva 001 (Electron. J. Comb., 2021)

A unifying model for locally constrained spanning tree problems. - Luiz Alberto do Carmo Viana; Manoel B. Campêlo; Ignasi Sau; Ana Silva 001 (J. Comb. Optim., 2021)

On the proper orientation number of chordal graphs. - Júlio Araújo 001; Alexandre A. Cezar; Carlos V. G. C. Lima; Vinícius Fernandes dos Santos; Ana Silva 001 (Theor. Comput. Sci., 2021)

Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage. - Celina M. H. de Figueiredo; Raul Lopes 001; Alexsander Andrade de Melo; Ana Silva 001 (WALCOM, 2022)

Menger's Theorem for Temporal Paths (Not Walks). - Allen Ibiapina; Raul Lopes 001; Andrea Marino 001; Ana Silva 001 (CoRR, 2022)

Backbone coloring of graphs with galaxy backbones. - Camila S. Araújo; Júlio Araújo 001; Ana Silva 001; Alexandre A. Cezar (Discret. Appl. Math., 2022)

Revising Johnson's table for the 21st century. - Celina M. H. de Figueiredo; Alexsander Andrade de Melo; Diana Sasaki; Ana Silva 001 (Discret. Appl. Math., 2022)

Coloring temporal graphs. - Andrea Marino 001; Ana Silva 001 (J. Comput. Syst. Sci., 2022)

On Computing Optimal Temporal Branchings. - Daniela Bubboloni; Costanza Catalano; Andrea Marino 001; Ana Silva 001 (FCT, 2023)

Deciding the Erdős-Pósa Property in 3-Connected Digraphs. - Julien Bensmail; Victor A. Campos; Ana Karolinna Maia; Nicolas Nisse; Ana Silva 001 (WG, 2023)

Eulerian Walks in Temporal Graphs. - Andrea Marino 001; Ana Silva 001 (Algorithmica, 2023)

MaxCut on permutation graphs is NP-complete. - Celina M. H. de Figueiredo; Alexsander Andrade de Melo; Fabiano de S. Oliveira; Ana Silva 001 (J. Graph Theory, 2023)

On Finding the Best and Worst Orientations for the Metric Dimension. - Júlio Araújo 001; Julien Bensmail; Victor A. Campos; Frédéric Havet; Ana Karolinna Maia; Nicolas Nisse; Ana Silva 001 (Algorithmica, 2023)

On the parameterized complexity of computing good edge-labelings. - Davi de Andrade; Júlio Araújo 001; Laure Morelle; Ignasi Sau; Ana Silva 001 (CoRR, 2024)

Acyclic coloring of products of digraphs. - Isnard Lopes Costa; Ana Silva 001 (Discret. Appl. Math., 2024)

On computing large temporal (unilateral) connected components. - Isnard Lopes Costa; Raul Lopes 001; Andrea Marino 001; Ana Silva 001 (J. Comput. Syst. Sci., 2024)

Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs. - Celina M. H. de Figueiredo; Raul Lopes 001; Alexsander Andrade de Melo; Ana Silva 001 (Networks, 2024)

Snapshot disjointness in temporal graphs. - Allen Ibiapina; Ana Silva 001 (Theor. Comput. Sci., 2024)

On the hull number on cycle convexity of graphs. - Júlio Araújo 001; Victor A. Campos; Darlan Girão; João Nogueira; António Salgueiro; Ana Silva 001 (Inf. Process. Lett., 2024)

Mengerian graphs: Characterization and recognition. - Allen Ibiapina; Ana Silva 001 (J. Comput. Syst. Sci., 2024)

Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete. - Celina M. H. de Figueiredo; Alexsander Andrade de Melo; Fabiano de S. Oliveira; Ana Silva 001 (Discret. Comput. Geom., 2024)

Disjoint Temporal Walks Under Waiting Time Constraints. - Allen Ibiapina; Raul Lopes 001; Andrea Marino 001; Ana Silva 001 (CIAC (2), 2025)

Matching and Edge Cover in Temporal Graphs. - Lapo Cioni; Riccardo Dondi; Andrea Marino 001; Jason Schoeters; Ana Silva 001 (SAND, 2025)

On computing optimal temporal branchings and spanning subgraphs. - Daniela Bubboloni; Costanza Catalano; Andrea Marino 001; Ana Silva 001 (J. Comput. Syst. Sci., 2025)

Temporal Cycle Detection and Acyclic Temporization. - Davi de Andrade; Júlio Araújo 001; Allen Ibiapina; Andrea Marino 001; Jason Schoeters; Ana Silva 001 (CoRR, 2025)

Making the interval membership width of temporal graphs connected and bidirectional. - Filippos Christodoulou; Pierluigi Crescenzi; Andrea Marino 001; Ana Silva 001; Dimitrios M. Thilikos (J. Comput. Syst. Sci., 2026)