default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOrlando Lee
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j32]Caroline Aparecida de Paula Silva
, Cândida Nunes da Silva, Orlando Lee:
BE-Diperfect Digraphs with Stability Number Two. Electron. J. Comb. 31(2) (2024)- 2023
- [j31]Carlos Eduardo Ferreira, Flavio Keidi Miyazawa, Orlando Lee:
Preface: LAGOS'21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil. Discret. Appl. Math. 341: 393 (2023) - [j30]Caroline Aparecida de Paula Silva, Cândida Nunes da Silva, Orlando Lee:
A family of counterexamples for a conjecture of Berge on α-diperfect digraphs. Discret. Math. 346(8): 113458 (2023) - [c10]Caroline Aparecida de Paula Silva, Cândida Nunes da Silva, Orlando Lee:
Obstructions for χ-diperfectness. LAGOS 2023: 201-208 - [c9]Alonso Ali, Orlando Lee:
Five edge-independent spanning trees. LAGOS 2023: 223-230 - 2022
- [j29]Maycon Sambinelli, Cândida Nunes da Silva, Orlando Lee:
α-Diperfect digraphs. Discret. Math. 345(5): 112759 (2022) - [j28]Caroline Aparecida de Paula Silva, Cândida Nunes da Silva, Orlando Lee:
χ-Diperfect digraphs. Discret. Math. 345(9): 112941 (2022) - [j27]Lucas Ismaily Bezerra Freitas, Orlando Lee:
Some Results on Berge's Conjecture and Begin-End Conjecture. Graphs Comb. 38(4): 107 (2022) - [c8]Caroline Aparecida de Paula Silva, Cândida Nunes da Silva, Orlando Lee:
On χ-Diperfect Digraphs with Stability Number Two. LATIN 2022: 460-475 - [i5]Caroline Aparecida de Paula Silva, Cândida Nunes da Silva, Orlando Lee:
A family of counterexamples for a conjecture of Berge on α-diperfect digraphs. CoRR abs/2207.08007 (2022) - 2021
- [j26]R. Bruce Richter, André C. Silva, Orlando Lee:
Bounding the Number of Non-duplicates of the q-Side in Simple Drawings of Kp, q. Graphs Comb. 37(6): 2697-2701 (2021) - [e1]Carlos E. Ferreira, Orlando Lee, Flávio Keidi Miyazawa:
Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, LAGOS 2021, Online Event / São Paulo, Brazil, May 2021. Procedia Computer Science 195, Elsevier 2021 [contents] - 2020
- [j25]Murilo Santos de Lima, Mário César San Felice, Orlando Lee:
Group parking permit problems. Discret. Appl. Math. 281: 172-194 (2020) - [j24]Fábio Botler, Maycon Sambinelli, Rafael S. Coelho, Orlando Lee:
Gallai's path decomposition conjecture for graphs with treewidth at most 3. J. Graph Theory 93(3): 328-349 (2020)
2010 – 2019
- 2019
- [j23]André C. Silva, Alan Arroyo, R. Bruce Richter, Orlando Lee:
Graphs with at most one crossing. Discret. Math. 342(11): 3201-3207 (2019) - [j22]Maycon Sambinelli, Carla Negri Lintzmayer, Cândida Nunes da Silva, Orlando Lee:
Berge's Conjecture and Aharoni-Hartman-Hoffman's Conjecture for Locally In-Semicomplete Digraphs. Graphs Comb. 35(4): 921-931 (2019) - [c7]Márcia R. Cerioli, Cristina G. Fernandes, Orlando Lee, Carla Negri Lintzmayer, Guilherme Oliveira Mota, Cândida Nunes da Silva:
On Edge-magic Labelings of Forests. LAGOS 2019: 299-307 - [c6]Lucas R. Yoshimura, Maycon Sambinelli, Cândida Nunes da Silva, Orlando Lee:
Linial's Conjecture for Arc-spine Digraphs. LAGOS 2019: 735-746 - [i4]Alonso Ali, Orlando Lee:
Two novel results on the existence of 3-kernels in digraphs. CoRR abs/1912.10467 (2019) - 2017
- [j21]Maycon Sambinelli, Cândida Nunes da Silva, Orlando Lee:
On Linial's conjecture for spine digraphs. Discret. Math. 340(5): 851-854 (2017) - [j20]Maycon Sambinelli, Cândida Nunes da Silva, Orlando Lee:
Advances in Aharoni-Hartman-Hoffman's Conjecture for Split digraphs. Electron. Notes Discret. Math. 62: 111-116 (2017) - [j19]Marcio Felix Reis, Mário César San Felice, Orlando Lee, Fábio Luiz Usberti:
A 3-approximation algorithm for the maximum leaf k-forest problem. Electron. Notes Discret. Math. 62: 201-206 (2017) - [j18]Murilo Santos de Lima, Mário César San Felice, Orlando Lee:
On Generalizations of the Parking Permit Problem and Network Leasing Problems. Electron. Notes Discret. Math. 62: 225-230 (2017) - [c5]Murilo Santos de Lima, Mário César San Felice, Orlando Lee:
Connected Facility Leasing Problems. ICTCS/CILC 2017: 162-173 - [i3]Fábio Botler, Maycon Sambinelli, Rafael S. Coelho, Orlando Lee:
On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3. CoRR abs/1706.04334 (2017) - 2016
- [j17]Mário César San Felice, David P. Williamson, Orlando Lee:
A Randomized O(log n)-Competitive Algorithm for the Online Connected Facility Location Problem. Algorithmica 76(4): 1139-1157 (2016) - [j16]Cristina G. Fernandes, César Hernández-Vélez, Orlando Lee, José Coelho de Pina:
Spanning trees with nonseparating paths. Discret. Math. 339(1): 365-374 (2016) - [j15]Mario Leston Rey, Orlando Lee:
Stronger bounds and faster algorithms for packing in generalized kernel systems. Math. Program. 159(1-2): 31-80 (2016) - [i2]Murilo Santos de Lima, Mário César San Felice, Orlando Lee:
Facility Leasing with Penalties. CoRR abs/1610.00575 (2016) - 2015
- [j14]Gustavo Rodrigues Galvão, Orlando Lee, Zanoni Dias:
Sorting signed permutations by short operations. Algorithms Mol. Biol. 10: 12 (2015) - [j13]Orlando Lee, Mario Leston Rey:
A faster algorithm for packing branchings in digraphs. Discret. Appl. Math. 194: 121-131 (2015) - [j12]Mário César San Felice, Sin-Shuen Cheung, Orlando Lee, David P. Williamson:
The Online Prize-Collecting Facility Location Problem. Electron. Notes Discret. Math. 50: 151-156 (2015) - [j11]Marcio Felix Reis, Orlando Lee, Fábio Luiz Usberti:
Flow-based formulation for the maximum leaf spanning tree problem. Electron. Notes Discret. Math. 50: 205-210 (2015) - [j10]Andrei Braga, Cid C. de Souza, Orlando Lee:
The Eternal Dominating Set problem for proper interval graphs. Inf. Process. Lett. 115(6-8): 582-587 (2015) - [i1]Andrei Braga, Cid C. de Souza, Orlando Lee:
Computing Bounds for Eternal Domination. CTW 2015: 177-180 - 2014
- [j9]Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed:
Removable paths and cycles with parity constraints. J. Comb. Theory B 106: 115-133 (2014) - [c4]Mário César San Felice, David P. Williamson, Orlando Lee:
The Online Connected Facility Location Problem. LATIN 2014: 574-585
2000 – 2009
- 2009
- [j8]Cristina G. Fernandes, Orlando Lee, Yoshiko Wakabayashi:
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width. Discret. Appl. Math. 157(2): 272-279 (2009) - [j7]Ken-ichi Kawarabayashi, Bruce A. Reed, Orlando Lee:
Removable cycles in non-bipartite graphs. J. Comb. Theory B 99(1): 30-38 (2009) - 2008
- [j6]Ken-ichi Kawarabayashi, Orlando Lee, Bruce A. Reed, Paul Wollan:
A weaker version of Lovász' path removal conjecture. J. Comb. Theory B 98(5): 972-979 (2008) - 2006
- [j5]Sean Curran, Orlando Lee, Xingxing Yu:
Finding Four Independent Trees . SIAM J. Comput. 35(5): 1023-1058 (2006) - [c3]Orlando Lee, Aaron Williams:
Packing Dicycle Covers in Planar Graphs with No K5-e Minor. LATIN 2006: 677-688 - 2005
- [j4]Sean Curran, Orlando Lee, Xingxing Yu:
Nonseparating Planar Chains in 4-Connected Graphs. SIAM J. Discret. Math. 19(2): 399-419 (2005) - [j3]Sean Curran, Orlando Lee, Xingxing Yu:
Chain Decompositions of 4-Connected Graphs. SIAM J. Discret. Math. 19(4): 848-880 (2005) - 2003
- [c2]Sean Curran, Orlando Lee, Xingxing Yu:
Chain decompositions and independent trees in 4-connected graphs. SODA 2003: 186-191 - 2002
- [j2]Orlando Lee, Yoshiko Wakabayashi:
On The Circuit Cover Problemfor Mixed Graphs. Comb. Probab. Comput. 11(1): 43-59 (2002) - 2001
- [j1]Orlando Lee, Yoshiko Wakabayashi:
Note on a min-max conjecture of Woodall. J. Graph Theory 38(1): 36-41 (2001)
1990 – 1999
- 1998
- [c1]Orlando Lee, Yoshiko Wakabayashi:
Circuit Covers in Series-Parallel Mixed Graphs. LATIN 1998: 226-238
Coauthor Index
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-08-05 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
