Mitre Costa Dourado

Instituição:

Universidade Federal do Rio de Janeiro

Centro:

Centro de Ciências Matemáticas e da Natureza

Unidade:

Instituto de Matemática

Departamento:

Departamento de Ciência da Computação/I Mat

ORCID:

não disponível no Lattes


Formação:

  • Université Paris 13 (Paris-Nord) - Campus de Villetaneuse

    | Pós-Doutorado | 2014 - 2015

  • Universidade Federal do Rio de Janeiro

    Engenharia de Sistemas e Computação | Doutorado | 2001 - 2005

  • Universidade Federal do Rio de Janeiro

    Informática | Mestrado | 2000 - 2001

  • Universidade Federal da Bahia

    Bacharelado em Ciência da Computação | Graduação | 1995 - 1999
Laboratórios:
Nuvens de Palavras:
Artigos:
Nenhum artigo cadastrado
Eventos:

(12.82% eventos com DOI)

Titulo DOI Ano
Tempo de Iteração e Número de Posição Geral em Convexidade de Grafos 2023
Hardness of Relating Dissociation, Independence, and Matchings 2022
A General Framework for Path Convexities 2019
The Hull Number in the Convexity of Induced Paths of Order 3 2019
On the Computational Complexity of the Helly Number in the P3 and Related Convexities 2019
On the Helly number in the P3 and related convexities for (q, q − 4) graphs 2019
The Geodetic Hull Number is Hard for Chordal Graphs 2017
On the In-Neighbor Convexity 2017
On the Helly Number in P3-Convexity in Graphs 2017
Sobre o Número de Helly Geodético em Grafos 2016
On f-Reversible Processes on Graphs 2015
On the hereditary (p, q)-Helly property of hypergraphs, cliques, and bicliques 2015
Complexity of determining the maximum infection time in the geodetic convexity 2015
O Número de Helly Geodético em Convexidades 2015
On the l-neighborhood convexity 2015
Conexão de Terminais com Número Restrito de Roteadores e Elos 2014
O número de Helly na convexidade geodética 2014
On Connected Identifying Codes for Infinite Lattices 2014
Design of connection networks with bounded number of non-terminal vertices 2014
Polynomial time algorithm for the Radon number of grids in the geodetic convexity 2013
The Carathéodory Number of the P_3-Convexity of Chordal Graphs 2013
Inapproximability results for graph convexity parameters 2013
The maximum time of 2-neighbour bootstrap percolation: algorithmic aspects 2013
Geodetic Sets and Periphery 2013
The monophonic convexity in bipartite graphs 2013
Some results on the Radon number of graphs 2012
On the Radon Number for P3-Convexity 2012
Complexity aspects of graph convexity 2012
The Radon number of graphs 2012
Forbidden subgraphs and the K¿nig property 10.1016/j.endm.2011.05.057 2011
On the Carathéodory Number for the Convexity of Paths of Order Three 2011
The south zone: Distributed Algorithms for Alliances 2011
O teorema de Helly colorido e hipergrafos gerais 2011
Quadratic Algorithm for Minimizing the Weighted Tardiness in Scheduling Problems with Equal-time Jobs and Parallel Machines 2010
Graphs in Scheduling Problems with Parallel Machines and Unit-time Jobs 2010
Scheduling on parallel machines considering job-machine dependency constraints 10.1016/j.endm.2010.05.055 2010
New Results on the Contour of a Graph 2010
Alliances and Convexity in Graphs 2010
Alliances and Graph Convexity 2010
Algorithmic aspects of Steiner convexity and enumaration of Steiner trees 2010
Finding the p3 hull number of chordal graphs 2010
The Carathéodory number for the p3 convexity 2010
Graph colorings and scheduling problems 2010
Escalonamento em máquinas paralelas para minimizar a atraso ponderado de tarefas de tempos iguais 2010
On reversible and irreversible conversions 2010
Convex covers of graphs 2010
On the Convexity of Paths of Length Two in Undirected Graphs 10.1016/j.endm.2009.02.003 2009
Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals? 10.1016/j.endm.2009.11.053 2009
Sobre escalonamento em máquinas paralelas com capacidades distintas 2009
The Colorful Helly Property for Hypergraphs? 10.1016/j.endm.2009.07.109 2009
Algorithmic Aspects of Monophonic Convexity 10.1016/j.endm.2008.01.031 2008
On Helly Classes of Graphs 2008
Convex partitions of powers of cycles 2008
Minimizing the number of tardy jobs in a classical scheduling problem 2008
Algoritmos para Minimização do Número de Tarefas Tardias em um Problema Clássico de Escalonamento 2008
Clique decomposition and the monophonic hull number of a graph 2008
The Convex Partition Number of a Graph 2007
Convex partition of graphs 2007
Convex partitions of graphs 10.1016/j.endm.2007.07.024 2007
Um algoritmo para um problema de escalonamento com tarefas de tempos unitários 2007
Sobre partições convexas de grafos 2007
Complexity Aspects of Generalized Helly Hypergraphs 2006
On the complexity of the Geodetic and Convexity Numbers of a Graph 2006
Scheduling UET jobs with release dates in parallel machines to minimize the weighted number of tardy jobs 2006
On the (2,q)-Helly property 2006
The Helly Property on Subhypergraphs 10.1016/j.endm.2005.05.011 2005
Helly property and sandwich graphs 10.1016/j.endm.2005.06.093 2005
Characterization and Recognition of Generalized Clique-Helly Graphs 10.1007/b104584 2004
Characterization and Recognition of Generalized Clique-Helly Graphs 2004
Complexity Aspects of the Helly Property on Hypergraphs 2003
On the Helly Property for Families of Sets 2003
On (p,q,s)-Helly Hypergraphs 2003
On the Helly Property for Families of Sets 2003
The (p,q)-Helly property and its application to the family of cliques of a graph 2003
The Helly Property and the Cliques of a Graph 2002
A Generalization of Clique-Helly Graphs 2002
A Generalization of the Helly Property 2002
Grafos Clique-Helly de Cardinalidade q 2001
Publicações:
Minha Rede: