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:

(95.45% artigos com DOI)

Titulo DOI Ano
On the generalized Helly property of hypergraphs, cliques, and bicliques 10.1016/j.dam.2023.01.006 2023
Computational and structural aspects of the geodetic and the hull numbers of shadow graphs 10.1016/j.dam.2021.10.005 2022
Computing the zig-zag number of directed graphs 10.1016/j.dam.2021.09.013 2022
A general framework for path convexities 10.1007/s10878-020-00618-9 2022
Computing the hull number in toll convexity 10.1007/s10479-022-04694-4 2022
On the monophonic rank of a graph 10.46298/dmtcs.6835 2022
The hull number in the convexity of induced paths of order 3 10.1016/j.tcs.2022.01.004 2022
On the - -interval and the - -convexity numbers of graphs and graph products 10.1016/j.dam.2021.07.041 2021
A note on homomorphisms of Kneser hypergraphs 10.1016/j.amc.2019.124764 2020
Partial immunization of trees 10.1016/j.disopt.2020.100568 2020
Complexity aspects of -chord convexities 10.1016/j.dam.2020.04.022 2020
Global defensive alliances in the lexicographic product of paths and cycles 10.1016/j.dam.2019.12.024 2020
On the Carathéodory and exchange numbers of geodetic convexity in graphs 10.1016/j.tcs.2019.10.041 2020
Computing the hull number in --convexity 10.1016/j.tcs.2020.08.024 2020
The Geodetic Hull Number is Hard for Chordal Graphs 10.1137/17M1131726 2018
Geodetic convexity parameters for -graphs 10.1016/j.dam.2017.01.023 2017
Inapproximability results and bounds for the Helly and Radon numbers of a graph 10.1016/j.dam.2017.07.032 2017
A computational study of f -reversible processes on graphs 10.1016/j.dam.2017.07.005 2017
On the geodetic iteration number of distance-hereditary graphs 10.1016/j.disc.2015.09.025 2016
The maximum infection time in the geodesic and monophonic convexities 10.1016/j.tcs.2015.10.009 2016
Complexity aspects of the triangle path convexity 10.1016/j.dam.2016.01.015 2016
Computing role assignments of split graphs 10.1016/j.tcs.2016.05.011 2016
Near-linear-time algorithm for the geodetic Radon number of grids 10.1016/j.dam.2015.05.001 2016
Slash and burn on graphs - Firefighting with general weights 10.1016/j.dam.2014.11.019 2016
On the geodetic hull number of Pk-free graphs 10.1016/j.tcs.2016.05.047 2016
Algorithms and Properties for Positive Symmetrizable Matrices 10.5540/tema.2016.017.02.0187 2016
The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects 10.1016/j.ejc.2015.02.012 2015
Inapproximability results for graph convexity parameters 10.1016/j.tcs.2015.06.059 2015
Inapproximability results related to monophonic convexity 10.1016/j.dam.2014.09.012 2015
Robust recoverable perfect matchings 10.1002/net.21624 2015
Scheduling problem with multi-purpose parallel machines 10.1016/j.dam.2011.11.033 2014
On defensive alliances and strong global offensive alliances 10.1016/j.dam.2013.06.029 2014
On Helly hypergraphs with variable intersection sizes 2014
The Carathéodory number of the convexity of chordal graphs 10.1016/j.dam.2014.03.004 2014
Algorithmic aspects of Steiner convexity and enumeration of Steiner trees 10.1007/s10479-014-1607-5 2014
On the geodetic Radon number of grids 10.1016/j.disc.2012.09.007 2013
Algorithmic and structural aspects of the P 3-Radon number 10.1007/s10479-013-1320-9 2013
On the contour of graphs 10.1016/j.dam.2012.12.024 2013
Forbidden subgraphs and the König-Egerváry property 10.1016/j.dam.2013.04.020 2013
More fires and more fighters 10.1016/j.dam.2013.04.008 2013
On the Carathéodory number of interval and graph convexities 10.1016/j.tcs.2013.09.004 2013
The colorful Helly theorem and general hypergraphs 10.1016/j.ejc.2011.09.029 2012
On the Convexity Number of Graphs 10.1007/s00373-011-1049-7 2012
An upper bound on the -Radon number 10.1016/j.disc.2012.05.002 2012
Mixed unit interval graphs 10.1016/j.disc.2012.07.037 2012
Reversible iterative graph processes 10.1016/j.tcs.2012.05.042 2012
Characterization and recognition of Radon-independent sets in split graphs 10.1016/j.ipl.2012.08.013 2012
On the Carathéodory Number for the Convexity of Paths of Order Three 10.1137/110828678 2012
On finite convexity spaces induced by sets of paths in graphs 10.1016/j.disc.2010.12.024 2011
Partitioning a graph into convex sets 10.1016/j.disc.2011.05.023 2011
Irreversible conversion of graphs 10.1016/j.tcs.2011.03.029 2011
On the Hull Number of Triangle-Free Graphs 10.1137/090751797 2010
Some remarks on the geodetic number of a graph 10.1016/j.disc.2009.09.018 2010
Complexity results related to monophonic convexity 10.1016/j.dam.2009.11.016 2010
Convex partitions of graphs induced by paths of order three 2010
On the computation of the hull number of a graph 10.1016/j.disc.2008.04.020 2009
Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs 10.1007/s10479-008-0479-y 2009
Complexity Aspects of the Helly Property: Graphs and Hypergraphs 2009
On the strong p-Helly property 10.1016/j.dam.2007.05.047 2008
Improved Algorithms for Recognizing p-Helly and Hereditary p-Helly Hypergraphs 10.1016/j.ipl.2008.05.013 2008
Helly property, clique raphs, complementary graph classes, and sandwich problems 10.1007/BF03192558 2008
Characterization and recognition of generalized clique-Helly graphs 10.1016/j.dam.2007.06.013 2007
Complexity Aspects of Generalized Helly Hypergraphs 10.1016/j.ipl.2006.02.007 2006
Computational aspects of the Helly property: a survey 10.1007/bf03192385 2006
The Helly property on subfamilies of limited size 10.1016/j.ipl.2004.10.004 2005
On the helly defect of a graph 10.1590/S0104-65002001000200007 2001
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: