default search action
Ana Silva 0001
Ana Shirley Ferreira da Silva
Person information
- affiliation: Federal University of Ceará, Department of Mathematics, Fortaleza, Brazil
- affiliation (former): Université Joseph Fourier, Grenoble, France
Other persons with the same name
- Ana Silva — disambiguation page
- Ana Silva 0002
— University of Minho, Department of Informatics Engineering, Braga, Portugal
- Ana Silva 0003
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
- [j48]Daniela Bubboloni, Costanza Catalano
On computing optimal temporal branchings and spanning subgraphs. J. Comput. Syst. Sci. 148: 103596 (2025) - 2024
- [j47]Isnard Lopes Costa
Acyclic coloring of products of digraphs. Discret. Appl. Math. 349: 59-69 (2024) - [j46]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva
Maximum Cut on Interval Graphs of Interval Count Four is NP-Complete. Discret. Comput. Geom. 71(3): 893-917 (2024) - [j45]Júlio Araújo
On the hull number on cycle convexity of graphs. Inf. Process. Lett. 183: 106420 (2024) - [j44]Allen Ibiapina
Mengerian graphs: Characterization and recognition. J. Comput. Syst. Sci. 139: 103467 (2024) - [j43]Isnard Lopes Costa, Raul Lopes, Andrea Marino, Ana Silva:
On computing large temporal (unilateral) connected components. J. Comput. Syst. Sci. 144: 103548 (2024) - [j42]Allen Ibiapina, Ana Silva:
Snapshot disjointness in temporal graphs. Theor. Comput. Sci. 1009: 114690 (2024) - [c17]Filippos Christodoulou, Pierluigi Crescenzi, Andrea Marino, Ana Silva, Dimitrios M. Thilikos:
Making the Interval Membership Width of Temporal Graphs Connected and Bidirectional. IWOCA 2024: 247-258 - [i25]Davi de Andrade, Júlio Araújo, Laure Morelle, Ignasi Sau, Ana Silva:
On the parameterized complexity of computing good edge-labelings. CoRR abs/2408.15181 (2024) - 2023
- [j41]Andrea Marino
Eulerian Walks in Temporal Graphs. Algorithmica 85(3): 805-830 (2023) - [j40]Júlio Araújo
On Finding the Best and Worst Orientations for the Metric Dimension. Algorithmica 85(10): 2962-3002 (2023) - [j39]Celina M. H. de Figueiredo, Alexsander Andrade de Melo
MaxCut on permutation graphs is NP-complete. J. Graph Theory 104(1): 5-16 (2023) - [c16]Daniela Bubboloni, Costanza Catalano
On Computing Optimal Temporal Branchings. FCT 2023: 103-117 - [c15]Isnard Lopes Costa, Raul Lopes, Andrea Marino, Ana Silva:
On Computing Large Temporal (Unilateral) Connected Components. IWOCA 2023: 282-293 - [c14]Allen Ibiapina, Ana Silva:
Snapshot Disjointness in Temporal Graphs. SAND 2023: 1:1-1:20 - [c13]Julien Bensmail, Victor A. Campos, Ana Karolinna Maia, Nicolas Nisse, Ana Silva:
Deciding the Erdős-Pósa Property in 3-Connected Digraphs. WG 2023: 59-71 - [i24]Allen Ibiapina, Ana Silva:
Snapshot disjointness in temporal graphs. CoRR abs/2302.06653 (2023) - [i23]Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Silva:
On Computing Optimal Temporal Branchings and Spanning Subgraphs. CoRR abs/2312.11390 (2023) - 2022
- [j38]Camila S. Araújo
Backbone coloring of graphs with galaxy backbones. Discret. Appl. Math. 323: 2-13 (2022) - [j37]Celina M. H. de Figueiredo, Alexsander Andrade de Melo
Revising Johnson's table for the 21st century. Discret. Appl. Math. 323: 184-200 (2022) - [j36]Andrea Marino, Ana Silva
Coloring temporal graphs. J. Comput. Syst. Sci. 123: 171-185 (2022) - [c12]Celina M. H. de Figueiredo, Raul Lopes, Alexsander Andrade de Melo, Ana Silva
Parameterized Algorithms for Steiner Tree and Dominating Set: Bounding the Leafage by the Vertex Leafage. WALCOM 2022: 251-262 - [i22]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva:
MaxCut on Permutation Graphs is NP-complete. CoRR abs/2202.13955 (2022) - [i21]Allen Ibiapina, Raul Lopes, Andrea Marino, Ana Silva
Menger's Theorem for Temporal Paths (Not Walks). CoRR abs/2206.15251 (2022) - [i20]Allen Ibiapina, Ana Silva:
Mengerian graphs: characterization and recognition. CoRR abs/2208.06517 (2022) - 2021
- [j35]Victor A. Campos, Guilherme de C. M. Gomes, Allen Ibiapina, Raul Lopes, Ignasi Sau
Coloring Problems on Bipartite Graphs of Small Diameter. Electron. J. Comb. 28(2): 2 (2021) - [j34]Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva
Edge-Disjoint Branchings in Temporal Digraphs. Electron. J. Comb. 28(4) (2021) - [j33]Luiz Alberto do Carmo Viana
A unifying model for locally constrained spanning tree problems. J. Comb. Optim. 42(1): 125-150 (2021) - [j32]Júlio Araújo
On the proper orientation number of chordal graphs. Theor. Comput. Sci. 888: 117-132 (2021) - [c11]Allen Ibiapina
Mengerian Temporal Graphs Revisited. FCT 2021: 301-313 - [c10]Andrea Marino, Ana Silva
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs. IWOCA 2021: 485-500 - [c9]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva
Maximum Cut on Interval Graphs of Interval Count Four Is NP-Complete. MFCS 2021: 38:1-38:15 - [i19]Andrea Marino, Ana Silva:
Königsberg Sightseeing: Eulerian Walks in Temporal Graphs. CoRR abs/2103.07522 (2021) - [i18]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Diana Sasaki, Ana Silva:
Revising Johnson's table for the 21st century. CoRR abs/2104.14395 (2021) - 2020
- [j31]Júlio Araújo
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. Algorithmica 82(6): 1616-1639 (2020) - [j30]Júlio Araújo
Dual Parameterization of Weighted Coloring. Algorithmica 82(8): 2316-2336 (2020) - [j29]Manoel B. Campêlo
The sociotechnical teams formation problem: a mathematical optimization approach. Ann. Oper. Res. 286(1): 201-216 (2020) - [j28]Esdras Mota, Leonardo S. Rocha, Ana Silva
Connected greedy coloring of H-free graphs. Discret. Appl. Math. 284: 572-584 (2020) - [j27]Allen Ibiapina, Ana Silva
b-continuity and partial Grundy coloring of graphs with large girth. Discret. Math. 343(8): 111920 (2020) - [c8]Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva
Edge-Disjoint Branchings in Temporal Graphs. IWOCA 2020: 112-125 - [i17]Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva:
Edge-Disjoint Branchings in Temporal Graphs. CoRR abs/2002.12694 (2020) - [i16]Victor A. Campos, Guilherme de C. M. Gomes, Allen Ibiapina, Raul Lopes, Ignasi Sau, Ana Silva:
Coloring Problems on Bipartite Graphs of Small Diameter. CoRR abs/2004.11173 (2020) - [i15]Luiz Alberto do Carmo Viana, Manoel B. Campêlo, Ignasi Sau, Ana Silva:
A Unifying Model for Locally Constrained Spanning Tree Problems. CoRR abs/2005.10328 (2020) - [i14]Júlio Araújo, Alexandre A. Cezar, Carlos V. G. C. Lima, Vinícius Fernandes dos Santos, Ana Silva:
On the proper orientation number of chordal graphs. CoRR abs/2011.14719 (2020) - [i13]Júlio Araújo, Victor A. Campos, Darlan Girão, João Nogueira, António Salgueiro, Ana Silva:
Cycle convexity and the tunnel number of links. CoRR abs/2012.05656 (2020) - [i12]Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva:
Maximum cut on interval graphs of interval count five is NP-complete. CoRR abs/2012.09804 (2020)
2010 – 2019
- 2019
- [j26]Ana Silva
Graphs with small fall-spectrum. Discret. Appl. Math. 254: 183-188 (2019) - [j25]Júlio Araújo
Weighted proper orientations of trees and graphs of bounded treewidth. Theor. Comput. Sci. 771: 39-48 (2019) - [c7]Camila Araujo, Júlio Araújo
Backbone Coloring of Graphs with Galaxy Backbones. LAGOS 2019: 53-64 - [c6]Allen Ibiapina, Ana Silva
Graphs with Girth at Least 8 are b-continuous. LAGOS 2019: 677-684 - [i11]Allen Ibiapina, Ana Silva:
b-continuity and Partial Grundy Coloring of graphs with large girth. CoRR abs/1908.00674 (2019) - [i10]Ana Silva, Allen Ibiapina:
On Orthogonal Vector Edge Coloring. CoRR abs/1909.01918 (2019) - 2018
- [j24]Victor A. Campos, Ana Silva
Edge-b-Coloring Trees. Algorithmica 80(1): 104-115 (2018) - [j23]Júlio Araújo
Circular backbone colorings: On matching and tree backbones of planar graphs. Discret. Appl. Math. 251: 69-82 (2018) - [c5]Júlio Araújo
Dual Parameterization of Weighted Coloring. IPEC 2018: 12:1-12:14 - [c4]Júlio Araújo
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. LATIN 2018: 66-79 - [i9]Júlio Araújo, Cláudia Linhares Sales, Ignasi Sau, Ana Silva:
Weighted proper orientations of trees and graphs of bounded treewidth. CoRR abs/1804.03884 (2018) - [i8]Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau
Dual parameterization of Weighted Coloring. CoRR abs/1805.06699 (2018) - [i7]Esdras Mota, Ana Silva, Leonardo Sampaio Rocha:
Connected greedy coloring H-free graphs. CoRR abs/1807.09034 (2018) - 2017
- [j22]Cláudia Linhares Sales
The lexicographic product of some chordal graphs and of cographs preserves b-continuity. Electron. Notes Discret. Math. 62: 261-266 (2017) - [j21]Cláudia Linhares Sales
The b-Continuity of Graphs with Large Girth. Graphs Comb. 33(5): 1139-1146 (2017) - [j20]Cláudia Linhares Sales
On the b-Continuity of the Lexicographic Product of Graphs. Graphs Comb. 33(5): 1165-1180 (2017) - [j19]Júlio César Silva Araújo
On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring. J. Graph Theory 85(4): 808-813 (2017) - [i6]Júlio Araújo, Victor A. Campos, Ana Karolinna Maia, Ignasi Sau, Ana Silva:
On the complexity of finding internally vertex-disjoint long directed paths. CoRR abs/1706.09066 (2017) - 2016
- [j18]Ana Silva
Graphs with large girth are b-continuous. Electron. Notes Discret. Math. 55: 101-104 (2016) - [j17]Fabrício Benevides
The maximum infection time in the geodesic and monophonic convexities. Theor. Comput. Sci. 609: 287-295 (2016) - [j16]Júlio Araújo
Proper orientation of cacti. Theor. Comput. Sci. 639: 14-25 (2016) - [i5]Ana Silva, Cláudia Linhares Sales:
Graphs with Large Girth are b-continuous. CoRR abs/1602.01298 (2016) - [i4]Júlio Araújo, Fabrício Benevides, Alexandre A. Cezar, Ana Silva:
Circular Backbone Colorings: on matching and tree backbones of planar graphs. CoRR abs/1604.05958 (2016) - [i3]Cláudia Linhares Sales, Leonardo Sampaio Rocha, Ana Silva:
On the b-continuity of the lexicographic product of graphs. CoRR abs/1610.03084 (2016) - 2015
- [j15]Victor A. Campos, Rudini Menezes Sampaio
Graphs with few P4's under the convexity of paths of order three. Discret. Appl. Math. 192: 28-39 (2015) - [j14]Victor A. Campos, Carlos Vinícius G. C. Lima
The b-chromatic index of graphs. Discret. Math. 338(11): 2072-2079 (2015) - [j13]Fabrício Benevides, Victor A. Campos, Mitre Costa Dourado, Rudini Menezes Sampaio
The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects. Eur. J. Comb. 48: 88-99 (2015) - [j12]Victor A. Campos, Carlos Vinícius G. C. Lima
Graphs of girth at least 7 have high b-chromatic number. Eur. J. Comb. 48: 154-164 (2015) - [j11]Fabrício Benevides
Complexity of determining the maximum infection time in the geodetic convexity. Electron. Notes Discret. Math. 50: 403-408 (2015) - [i2]Júlio Araújo, Alexandre A. Cezar, Ana Silva:
On the Existence of Tree Backbones that Realize the Chromatic Number on a Backbone Coloring. CoRR abs/1511.05398 (2015) - [i1]Victor A. Campos, Ana Silva:
Edge-b-coloring Trees. CoRR abs/1511.05422 (2015) - 2014
- [j10]Victor A. Campos, Sulamita Klein, Rudini Menezes Sampaio
Fixed-parameter algorithms for the cocoloring problem. Discret. Appl. Math. 167: 52-60 (2014) - [c3]Fabrício Benevides
Connected Greedy Colourings. LATIN 2014: 433-441 - 2013
- [j9]Frédéric Maffray, Ana Silva
b-colouring the Cartesian product of trees and some other graphs. Discret. Appl. Math. 161(4-5): 650-669 (2013) - [j8]Carlos Vinícius G. C. Lima
b-chromatic index of graphs. Electron. Notes Discret. Math. 44: 9-14 (2013) - [j7]Victor A. Campos, Frédéric Havet, Rudini Menezes Sampaio
Backbone colouring: Tree backbones with small diameter in planar graphs. Theor. Comput. Sci. 487: 50-64 (2013) - 2012
- [j6]Simone Dantas, Frédéric Maffray, Ana Silva
2k2-partition of some classes of graphs. Discret. Appl. Math. 160(18): 2662-2668 (2012) - [j5]Frédéric Maffray, Ana Silva
b-colouring outerplanar graphs with large girth. Discret. Math. 312(10): 1796-1803 (2012) - [j4]Victor A. Campos, Victor A. E. de Farias, Ana Silva
b-Coloring graphs with large girth. J. Braz. Comput. Soc. 18(4): 375-378 (2012) - [c2]Victor A. Campos, Rudini Menezes Sampaio, Ana Silva, Jayme Luiz Szwarcfiter:
Graphs with Few P4's Under the Convexity of Paths of Order Three. CTW 2012: 60-63 - 2011
- [c1]Victor A. Campos, Sulamita Klein, Rudini Menezes Sampaio
Two Fixed-Parameter Algorithms for the Cocoloring Problem. ISAAC 2011: 634-642 - 2010
- [j3]Ana Silva
A bound on the treewidth of planar even-hole-free graphs. Discret. Appl. Math. 158(12): 1229-1239 (2010)
2000 – 2009
- 2009
- [j2]Victor A. Campos, Cláudia Linhares Sales
b-chromatic number of cacti. Electron. Notes Discret. Math. 35: 281-286 (2009) - 2008
- [j1]Aline Alves da Silva, Ana Silva
Even-hole-free planar graphs have bounded treewidth. Electron. Notes Discret. Math. 30: 129-134 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: