default search action
Victor A. Campos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j31]Júlio Araújo
, Victor A. Campos, Darlan Girão, João Nogueira, António Salgueiro
On the hull number on cycle convexity of graphs. Inf. Process. Lett. 183: 106420 (2024) - 2023
- [j30]Júlio Araújo
Parameterized Complexity of Computing Maximum Minimal Blocking and Hitting Sets. Algorithmica 85(2): 444-491 (2023) - [j29]Júlio Araújo
On Finding the Best and Worst Orientations for the Metric Dimension. Algorithmica 85(10): 2962-3002 (2023) - [c10]Victor A. Campos, Jonas Costa, Raul Lopes, Ignasi Sau:
New Menger-Like Dualities in Digraphs and Applications to Half-Integral Linkages. ESA 2023: 30:1-30:18 - [c9]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 - [i12]Victor A. Campos, Jonas Costa, Raul Lopes, Ignasi Sau:
New Menger-like dualities in digraphs and applications to half-integral linkages. CoRR abs/2306.16134 (2023) - 2022
- [j28]Júlio Araújo
Introducing lop-Kernels: A Framework for Kernelization Lower Bounds. Algorithmica 84(11): 3365-3406 (2022) - [j27]Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau
Adapting the Directed Grid Theorem into an FPT Algorithm. SIAM J. Discret. Math. 36(3): 1887-1917 (2022) - 2021
- [j26]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) - [j25]Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva
Edge-Disjoint Branchings in Temporal Digraphs. Electron. J. Comb. 28(4) (2021) - [c8]Júlio Araújo
A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover. IPEC 2021: 4:1-4:19 - [i11]Júlio Araújo, Marin Bougeret
Introducing lop-kernels: a framework for kernelization lower bounds. CoRR abs/2102.02484 (2021) - [i10]Júlio Araújo, Marin Bougeret, Victor A. Campos, Ignasi Sau
Parameterized complexity of computing maximum minimal blocking and hitting sets. CoRR abs/2102.03404 (2021) - 2020
- [j24]Júlio Araújo
On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths. Algorithmica 82(6): 1616-1639 (2020) - [j23]Júlio Araújo
Dual Parameterization of Weighted Coloring. Algorithmica 82(8): 2316-2336 (2020) - [c7]Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva
Edge-Disjoint Branchings in Temporal Graphs. IWOCA 2020: 112-125 - [i9]Victor A. Campos, Raul Lopes, Andrea Marino, Ana Silva:
Edge-Disjoint Branchings in Temporal Graphs. CoRR abs/2002.12694 (2020) - [i8]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) - [i7]Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau:
Adapting the Directed Grid Theorem into an FPT Algorithm. CoRR abs/2007.07738 (2020) - [i6]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)
2010 – 2019
- 2019
- [c6]Victor A. Campos, Raul Lopes, Ana Karolinna Maia, Ignasi Sau
Adapting The Directed Grid Theorem into an FPT Algorithm. LAGOS 2019: 229-240 - 2018
- [j22]Victor A. Campos, Ana Silva
Edge-b-Coloring Trees. Algorithmica 80(1): 104-115 (2018) - [j21]Victor A. Campos, Raul Lopes:
A proof for a conjecture of Gorgol. Discret. Appl. Math. 245: 202-207 (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 - [i5]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) - 2017
- [i4]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
- [j20]Manoel B. Campêlo
A polyhedral study of the maximum stable set problem with weights on vertex-subsets. Discret. Appl. Math. 210: 223-234 (2016) - [j19]Fabrício Benevides
The maximum infection time in the geodesic and monophonic convexities. Theor. Comput. Sci. 609: 287-295 (2016) - 2015
- [j18]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) - [j17]Victor A. Campos, Carlos Vinícius G. C. Lima
The b-chromatic index of graphs. Discret. Math. 338(11): 2072-2079 (2015) - [j16]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) - [j15]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) - [j14]Victor A. Campos, Raul Lopes:
A Proof for a Conjecture of Gorgol. Electron. Notes Discret. Math. 50: 367-372 (2015) - [j13]Fabrício Benevides
Complexity of determining the maximum infection time in the geodetic convexity. Electron. Notes Discret. Math. 50: 403-408 (2015) - [i3]Victor A. Campos, Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco, Annegret Wagler:
Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation. CoRR abs/1509.02485 (2015) - [i2]Victor A. Campos, Ana Silva:
Edge-b-coloring Trees. CoRR abs/1511.05422 (2015) - 2014
- [j12]Victor A. Campos, Cláudia Linhares Sales
Maximization coloring problems on graphs with few P4. Discret. Appl. Math. 164: 539-546 (2014) - [j11]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
- [j10]Victor A. Campos, Vasek Chvátal, Luc Devroye, Perouz Taslakian:
Transversals in Trees. J. Graph Theory 73(1): 32-43 (2013) - [j9]Júlio Araújo
On the hull number of some graph classes. Theor. Comput. Sci. 475: 1-12 (2013) - [j8]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
- [j7]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) - [j6]Victor A. Campos, András Gyárfás, Frédéric Havet, Cláudia Linhares Sales
New Bounds on the Grundy Number of Products of Graphs. J. Graph Theory 71(1): 78-88 (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
- [j5]Victor A. Campos, Cláudia Linhares Sales
Restricted coloring problems on graphs with few P'4s. Electron. Notes Discret. Math. 37: 57-62 (2011) - [j4]Júlio Araújo
On the hull number of some graph classes. Electron. Notes Discret. Math. 38: 49-55 (2011) - [c1]Victor A. Campos, Sulamita Klein, Rudini Menezes Sampaio
Two Fixed-Parameter Algorithms for the Cocoloring Problem. ISAAC 2011: 634-642 - [i1]Victor A. Campos, Cláudia Linhares Sales, Ana Karolinna Maia, Nicolas Almeida Martins, Rudini Menezes Sampaio:
Fixed parameter algorithms for restricted coloring problems: acyclic, star, nonrepetitive, harmonious and clique colorings. CoRR abs/1107.0056 (2011)
2000 – 2009
- 2009
- [j3]Victor A. Campos, Cláudia Linhares Sales
b-chromatic number of cacti. Electron. Notes Discret. Math. 35: 281-286 (2009) - 2008
- [j2]Manoel B. Campêlo
On the asymmetric representatives formulation for the vertex coloring problem. Discret. Appl. Math. 156(7): 1097-1111 (2008) - 2005
- [j1]Manoel B. Campêlo
On the asymmetric representatives formulation for the vertex coloring problem. Electron. Notes Discret. Math. 19: 337-343 (2005)
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-10-07 21:18 CEST 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: