#### Filter Results:

#### Publication Year

2005

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- A R G L Castillo, C A Buchpiguel, +4 authors M R D de Oliveira Latorre
- Journal of neural transmission
- 2005

OBJECTIVE
To evaluate the patterns of regional cerebral blood flow (rCBF) in cortical and subcortical regions by Brain SPECT imaging, in children and adolescents with obsessive-compulsive disorder (OCD) before and after treatment.
METHOD
Fourteen OCD patients (6 to 17 years old) underwent brain SPECT; ten of those subjects were reexamined after successful… (More)

In this paper, we show that the k-Linkage problem is polynomial-time solvable for digraphs with circumference at most 2. We also show that the directed cycles of length at least 3 have the Erd˝ os-Pósa Property : for every n, there exists an integer t n such that for every digraph D, either D contains n disjoint directed cycles of length at least 3, or… (More)

- Jørgen Bang-Jensen, Frédéric Havet, Ana Karolinna Maia
- Theor. Comput. Sci.
- 2015

We consider the following problem for oriented graphs and digraphs: Given a directed graph D, does it contain a subdivision of a prescribed digraph F? We give a number of examples of polynomial instances, several NP-completeness proofs as well as a number of conjectures and open problems. Trouver une subdivision d'un digraphe Résumé : Nous considérons… (More)

- Frédéric Havet, Ana Karolinna Maia, Min-Li Yu
- Journal of the Brazilian Computer Society
- 2015

The Grundy index of a graph G =(V, E) is the greatest number of colours that the greedy edge-colouring algorithm can use on G. We prove that the problem of determining the Grundy index of a graph G=(V, E) is NP-hard for general graphs. We also show that this problem is polynomial-time solvable for caterpillars. More specifically, we prove that the Grundy… (More)

- Victor A. Campos, Cláudia Linhares Sales, Rudini Menezes Sampaio, Ana Karolinna Maia
- Discrete Applied Mathematics
- 2014

- Victor A. Campos, Cláudia Linhares Sales, Ana Karolinna Maia, Nícolas A. Martins, Rudini Menezes Sampaio
- Electronic Notes in Discrete Mathematics
- 2011

In this paper, we obtain polynomial time algorithms to determine the acyclic chromatic number, the star chromatic number and the harmonious chromatic number of P 4-tidy graphs and (q, q − 4)-graphs, for every fixed q. These classes include cographs, P 4-sparse and P 4-lite graphs. We also obtain a polynomial time algorithm to determine the Grundy number of… (More)

In this paper, we obtain polynomial time algorithms to determine the acyclic chromatic number, the star chromatic number, the Thue chromatic number, the harmonious chromatic number and the clique chromatic number of P4-tidy graphs and (q, q−4)-graphs, for every fixed q. These classes include cographs, P4-sparse and P4-lite graphs. All these coloring… (More)

- ‹
- 1
- ›