Advanced search
Start date
Betweenand

Orlando Lee

CV Lattes GoogleMyCitations ORCID


Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC)  (Institutional affiliation for the last research proposal)
Birthplace: Portugal

Orlando Lee in research grants and scholarships supported by FAPESP.

News published in Agência FAPESP Newsletter about the researcher
Research grants
Scholarships in Brazil
Scholarships abroad
FAPESP support in numbers * Updated July 24, 2021
Total / Available in English
Most frequent collaborators in research granted by FAPESP
Contact researcher

Use this Research Supported by FAPESP (BV/FAPESP) channel only to send messages referring to FAPESP-funded scientific projects.


 

 

 

 

Keywords used by the researcher
Scientific publications resulting from Research Grants and Scholarships under the grantee's responsibility (6)

(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)

Publications6
Citations0
Cit./Article0.0
Data from Web of Science

SILVA, ANDRE C.; ARROYO, ALAN; RICHTER, R. BRUCE; LEE, ORLANDO. Graphs with at most one crossing. DISCRETE MATHEMATICS, v. 342, n. 11, p. 3201-3207, . Web of Science Citations: 0. (14/14375-9, 15/04385-0, 15/11937-9)

DE LIMA, MURILO SANTOS; SAN FELICE, MARIO CESAR; LEE, ORLANDO. Group parking permit problems. DISCRETE APPLIED MATHEMATICS, v. 281, n. SI, p. 172-194, . Web of Science Citations: 0. (14/18781-1, 15/11937-9, 17/11382-2)

LU, FULIANG; KOTHARI, NISHAD; FENG, XING; ZHANG, LIANZHU. Equivalence classes in matching covered graphs. DISCRETE MATHEMATICS, v. 343, n. 8, . Web of Science Citations: 0. (18/04679-1)

KOTHARI, NISHAD; DE CARVALHO, MARCELO H.; LUCCHESI, CLAUDIO L.; LITTLE, CHARLES H. C.. On essentially 4-edge-connected cubic bricks. ELECTRONIC JOURNAL OF COMBINATORICS, v. 27, n. 1, . Web of Science Citations: 0. (18/04679-1)

SAN FELICE, MARIO CESAR; WILLIAMSON, DAVID P.; LEE, ORLANDO. A Randomized -Competitive Algorithm for the Online Connected Facility Location Problem. ALGORITHMICA, v. 76, n. 4, p. 1139-1157, . Web of Science Citations: 0. (09/15535-1)

FABRES, PHELIPE A.; KOTHARI, NISHAD; DE CARVALHO, MARCELO H.. Minimal braces. JOURNAL OF GRAPH THEORY, v. 96, n. 4, p. 490-509, . Web of Science Citations: 0. (18/04679-1)

Academic Publications

(References retrieved automatically from State of São Paulo Research Institutions)

LIMA, Murilo Santos de. Parking permit and network leasing problems = Problemas de bilhetes de estacionamento e projeto de redes com arrendamento. Tese (Doutorado) -  Universidade Estadual de Campinas, Instituto de Computação.  (14/18781-1

SILVA, André Carvalho. Graphs with few crossings and the crossing number of Kp,q in topological surfaces : Grafos com poucos cruzamentos e o número de cruzamentos do Kp,q em superfícies topológicas. Tese (Doutorado) -  Universidade Estadual de Campinas, Instituto de Computação.  (14/14375-9

SAMBINELLI, Maycon. Problemas de emparelhamentos estáveis. Dissertação (Mestrado) -  Instituto de Computação.  Universidade Estadual de Campinas.  (12/16625-7

FELICE, Mário César San. O problema do k-Servidor. Dissertação (Mestrado) -  Instituto de Computação.  Universidade Estadual de Campinas (UNICAMP).  (07/57997-6

Please report errors in researcher information by writing to: cdi@fapesp.br.
X

Report errors in this page


Error details: