![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Carlos V. G. C. Lima
Person information
- affiliation: Federal University of Rio de Janeiro, Brazil
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i8]Carlos V. G. C. Lima, Thiago Marcilon, Pedro Paulo de Medeiros:
The complexity of convexity number and percolation time in the cycle convexity. CoRR abs/2404.09236 (2024) - 2023
- [j16]Lucas Keiler
, Carlos Vinícius G. C. Lima
, Ana Karolinna Maia
, Rudini M. Sampaio
, Ignasi Sau
:
Target set selection with maximum activation time. Discret. Appl. Math. 338: 199-217 (2023) - [j15]Carlos V. G. C. Lima, Thiago Marcilon
, Nicolas Almeida Martins, Rudini Menezes Sampaio
:
The connected greedy coloring game. Theor. Comput. Sci. 940(Part): 1-13 (2023) - [c4]Isac Costa, Carlos V. G. C. Lima, Thiago Marcilon:
The Conversion Set Problem on Graphs. LAGOS 2023: 175-183 - 2022
- [j14]Carlos V. G. C. Lima
, Dieter Rautenbach
, Uéverton S. Souza
, Jayme Luiz Szwarcfiter
:
On the computational complexity of the bipartizing matching problem. Ann. Oper. Res. 316(2): 1235-1256 (2022) - [j13]Carlos V. G. C. Lima
, Thiago Marcilon
, Nicolas Almeida Martins, Rudini M. Sampaio
:
PSPACE-hardness of variants of the graph coloring game. Theor. Comput. Sci. 909: 87-96 (2022) - [i7]Carlos V. G. C. Lima, Vinícius Fernandes dos Santos, João H. G. Sousa, Sebastián Alberto Urrutia:
On the Computational Complexity of the Strong Geodetic Recognition Problem. CoRR abs/2208.01796 (2022) - 2021
- [j12]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. Theor. Comput. Sci. 888: 117-132 (2021) - [c3]Lucas Keiler, Carlos V. G. C. Lima, Ana Karolinna Maia, Rudini Menezes Sampaio, Ignasi Sau
:
Target set selection with maximum activation time. LAGOS 2021: 86-96 - 2020
- [j11]Júlio Araújo
, Victor A. Campos
, Carlos Vinícius G. C. Lima
, Vinícius Fernandes dos Santos
, Ignasi Sau
, Ana Silva
:
Dual Parameterization of Weighted Coloring. Algorithmica 82(8): 2316-2336 (2020) - [j10]Guilherme de C. M. Gomes
, Marina Groshaus, Carlos V. G. C. Lima
, Vinícius Fernandes dos Santos
:
Intersection graph of maximal stars. Discret. Appl. Math. 285: 567-580 (2020) - [i6]Lucas Keiler, Carlos Vinícius G. C. Lima, Ana Karolinna Maia, Rudini M. Sampaio, Ignasi Sau:
Target set selection with maximum activation time. CoRR abs/2007.05246 (2020) - [i5]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)
2010 – 2019
- 2019
- [j9]Guilherme de C. M. Gomes, Carlos V. G. C. Lima, Vinícius Fernandes dos Santos:
Parameterized Complexity of Equitable Coloring. Discret. Math. Theor. Comput. Sci. 21(1) (2019) - [i4]Guilherme de C. M. Gomes, Marina Groshaus, Carlos V. G. C. Lima, Vinícius Fernandes dos Santos:
Intersection graph of maximal stars. CoRR abs/1911.10515 (2019) - 2018
- [j8]Carlos Vinícius G. C. Lima
, Fábio Protti, Dieter Rautenbach, Uéverton S. Souza
, Jayme Luiz Szwarcfiter:
And/or-convexity: a graph convexity based on processes and deadlock models. Ann. Oper. Res. 264(1-2): 267-286 (2018) - [j7]Carlos Vinícius G. C. Lima
, Leonardo I. L. Oliveira, Valmir C. Barbosa
, Mitre Costa Dourado, Fábio Protti, Jayme Luiz Szwarcfiter:
A computational study of f-reversible processes on graphs. Discret. Appl. Math. 245: 77-93 (2018) - [c2]Carlos V. G. C. Lima
, Dieter Rautenbach
, Uéverton S. Souza
, Jayme Luiz Szwarcfiter:
Bipartizing with a Matching. COCOA 2018: 198-213 - [c1]Júlio Araújo
, Victor A. Campos, Carlos Vinícius G. C. Lima
, Vinícius Fernandes dos Santos, Ignasi Sau
, Ana Silva
:
Dual Parameterization of Weighted Coloring. IPEC 2018: 12:1-12:14 - [i3]Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau
, Ana Silva:
Dual parameterization of Weighted Coloring. CoRR abs/1805.06699 (2018) - [i2]Guilherme de C. M. Gomes, Carlos V. G. C. Lima, Vinícius Fernandes dos Santos:
Parameterized Complexity of Equitable Coloring. CoRR abs/1810.13036 (2018) - 2017
- [j6]Carlos Vinícius G. C. Lima
, Dieter Rautenbach, Uéverton S. Souza
, Jayme Luiz Szwarcfiter:
Decycling with a matching. Inf. Process. Lett. 124: 26-29 (2017) - [j5]Carlos Vinícius G. C. Lima
, Dieter Rautenbach, Uéverton S. Souza
, Jayme Luiz Szwarcfiter:
Generalized threshold processes on graphs. Theor. Comput. Sci. 689: 27-35 (2017) - [i1]Carlos Vinícius G. C. Lima, Dieter Rautenbach, Uéverton S. Souza, Jayme Luiz Szwarcfiter:
Eliminating Odd Cycles by Removing a Matching. CoRR abs/1710.07741 (2017) - 2015
- [j4]Victor A. Campos, Carlos Vinícius G. C. Lima
, Nicolas Almeida Martins, Leonardo Sampaio Rocha
, Marcio Costa Santos, Ana Silva
:
The b-chromatic index of graphs. Discret. Math. 338(11): 2072-2079 (2015) - [j3]Victor A. Campos, Carlos Vinícius G. C. Lima
, Ana Silva
:
Graphs of girth at least 7 have high b-chromatic number. Eur. J. Comb. 48: 154-164 (2015) - [j2]Mitre Costa Dourado, Carlos Vinícius G. C. Lima
, Jayme Luiz Szwarcfiter:
On f-Reversible Processes on Graphs. Electron. Notes Discret. Math. 50: 231-236 (2015) - 2013
- [j1]Carlos Vinícius G. C. Lima
, Nicolas Almeida Martins, Leonardo Sampaio Rocha
, Marcio Costa Santos, Ana Silva
:
b-chromatic index of graphs. Electron. Notes Discret. Math. 44: 9-14 (2013)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-06-10 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint