We stand with Ukraine

We stand with Ukraine

Orlando Lee

Orcid: 0000-0003-4462-3325

According to our database¹, Orlando Lee authored at least 47 papers between 1998 and 2024.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

On csauthors.net:

Bibliography

2024

BE-Diperfect Digraphs with Stability Number Two.

[BibT_eX]

[DOI]

Caroline Aparecida de Paula Silva

,

Cândida Nunes da Silva

,

Electron. J. Comb., 2024

2023

Preface: LAGOS'21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil.

[BibT_eX]

[DOI]

Carlos Eduardo Ferreira

,

Flavio Keidi Miyazawa

,

Discret. Appl. Math., December, 2023

A family of counterexamples for a conjecture of Berge on <i>α</i>-diperfect digraphs.

[BibT_eX]

[DOI]

Caroline Aparecida de Paula Silva

,

Cândida Nunes da Silva

,

Discret. Math., August, 2023

Obstructions for χ-diperfectness.

[BibT_eX]

[DOI]

Caroline Aparecida de Paula Silva

,

Cândida Nunes da Silva

,

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

Five edge-independent spanning trees.

[BibT_eX]

[DOI]

,

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Some Results on Berge's Conjecture and Begin-End Conjecture.

[BibT_eX]

[DOI]

Lucas Ismaily Bezerra Freitas

,

Graphs Comb., 2022

<i>χ</i>-Diperfect digraphs.

[BibT_eX]

[DOI]

Caroline Aparecida de Paula Silva

,

Cândida Nunes da Silva

,

Discret. Math., 2022

<i>α</i>-Diperfect digraphs.

[BibT_eX]

[DOI]

Maycon Sambinelli

,

Cândida Nunes da Silva

,

Discret. Math., 2022

A family of counterexamples for a conjecture of Berge on α-diperfect digraphs.

[BibT_eX]

[DOI]

Caroline Aparecida de Paula Silva

,

Cândida Nunes da Silva

,

CoRR, 2022

On χ-Diperfect Digraphs with Stability Number Two.

[BibT_eX]

[DOI]

Caroline Aparecida de Paula Silva

,

Cândida Nunes da Silva

,

Proceedings of the LATIN 2022: Theoretical Informatics, 2022

2021

Bounding the Number of Non-duplicates of the q-Side in Simple Drawings of K<sub>p, q</sub>.

[BibT_eX]

[DOI]

R. Bruce Richter

,

André C. Silva

,

Graphs Comb., 2021

2020

Gallai's path decomposition conjecture for graphs with treewidth at most 3.

[BibT_eX]

[DOI]

,

Maycon Sambinelli

,

Rafael S. Coelho

,

J. Graph Theory, 2020

Group parking permit problems.

[BibT_eX]

[DOI]

Murilo Santos de Lima

,

Mário César San Felice

,

Discret. Appl. Math., 2020

2019

Berge's Conjecture and Aharoni-Hartman-Hoffman's Conjecture for Locally In-Semicomplete Digraphs.

[BibT_eX]

[DOI]

Maycon Sambinelli

,

Carla Negri Lintzmayer

,

Cândida Nunes da Silva

,

Graphs Comb., 2019

Linial's Conjecture for Arc-spine Digraphs.

[BibT_eX]

[DOI]

Lucas R. Yoshimura

,

Maycon Sambinelli

,

Cândida Nunes da Silva

,

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Edge-magic Labelings of Forests.

[BibT_eX]

[DOI]

Márcia R. Cerioli

,

Cristina G. Fernandes

,

,

Carla Negri Lintzmayer

,

Guilherme Oliveira Mota

,

Cândida Nunes da Silva

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Graphs with at most one crossing.

[BibT_eX]

[DOI]

André C. Silva

,

,

R. Bruce Richter

,

Discret. Math., 2019

Two novel results on the existence of 3-kernels in digraphs.

[BibT_eX]

[DOI]

,

CoRR, 2019

2017

Advances in Aharoni-Hartman-Hoffman's Conjecture for Split digraphs.

[BibT_eX]

[DOI]

Maycon Sambinelli

,

Cândida Nunes da Silva

,

Electron. Notes Discret. Math., 2017

A 3-approximation algorithm for the maximum leaf <i>k</i>-forest problem.

[BibT_eX]

[DOI]

Marcio Felix Reis

,

Mário César San Felice

,

,

Fábio Luiz Usberti

Electron. Notes Discret. Math., 2017

On Generalizations of the Parking Permit Problem and Network Leasing Problems.

[BibT_eX]

[DOI]

Murilo Santos de Lima

,

Mário César San Felice

,

Electron. Notes Discret. Math., 2017

On Linial's conjecture for spine digraphs.

[BibT_eX]

[DOI]

Maycon Sambinelli

,

Cândida Nunes da Silva

,

Discret. Math., 2017

On Gallai's and Hajós' Conjectures for graphs with treewidth at most 3.

[BibT_eX]

[DOI]

,

Maycon Sambinelli

,

Rafael S. Coelho

,

CoRR, 2017

Connected Facility Leasing Problems.

[BibT_eX]

[DOI]

Murilo Santos de Lima

,

Mário César San Felice

,

Proceedings of the Joint Proceedings of the 18th Italian Conference on Theoretical Computer Science and the 32nd Italian Conference on Computational Logic co-located with the 2017 IEEE International Workshop on Measurements and Networking (2017 IEEE M&N), 2017

2016

Stronger bounds and faster algorithms for packing in generalized kernel systems.

[BibT_eX]

[DOI]

Mario Leston Rey

,

Math. Program., 2016

Spanning trees with nonseparating paths.

[BibT_eX]

[DOI]

Cristina G. Fernandes

,

César Hernández-Vélez

,

,

José Coelho de Pina

Discret. Math., 2016

Facility Leasing with Penalties.

[BibT_eX]

[DOI]

Murilo Santos de Lima

,

Mário César San Felice

,

CoRR, 2016

A Randomized O(log n)-Competitive Algorithm for the Online Connected Facility Location Problem.

[BibT_eX]

[DOI]

Mário César San Felice

,

David P. Williamson

,

Algorithmica, 2016

2015

The Eternal Dominating Set problem for proper interval graphs.

[BibT_eX]

[DOI]

,

Cid C. de Souza

,

Inf. Process. Lett., 2015

Flow-based formulation for the maximum leaf spanning tree problem.

[BibT_eX]

[DOI]

Marcio Felix Reis

,

,

Fábio Luiz Usberti

Electron. Notes Discret. Math., 2015

The Online Prize-Collecting Facility Location Problem.

[BibT_eX]

[DOI]

Mário César San Felice

,

Sin-Shuen Cheung

,

,

David P. Williamson

Electron. Notes Discret. Math., 2015

A faster algorithm for packing branchings in digraphs.

[BibT_eX]

[DOI]

,

Mario Leston Rey

Discret. Appl. Math., 2015

Sorting signed permutations by short operations.

[BibT_eX]

[DOI]

Gustavo Rodrigues Galvão

,

,

Algorithms Mol. Biol., 2015

Computing Bounds for Eternal Domination.

[BibT_eX]

,

Cid C. de Souza

,

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Removable paths and cycles with parity constraints.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

,

,

J. Comb. Theory B, 2014

The Online Connected Facility Location Problem.

[BibT_eX]

[DOI]

Mário César San Felice

,

David P. Williamson

,

Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2009

Removable cycles in non-bipartite graphs.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

,

,

J. Comb. Theory B, 2009

Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width.

[BibT_eX]

[DOI]

Cristina G. Fernandes

,

,

Yoshiko Wakabayashi

Discret. Appl. Math., 2009

2008

A weaker version of Lovász' path removal conjecture.

[BibT_eX]

[DOI]

Ken-ichi Kawarabayashi

,

,

,

J. Comb. Theory B, 2008

2006

Finding Four Independent Trees .

[BibT_eX]

[DOI]

,

,

SIAM J. Comput., 2006

Packing Dicycle Covers in Planar Graphs with No <i>K</i><sub>5</sub>-<i>e</i> Minor.

[BibT_eX]

[DOI]

,

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Chain Decompositions of 4-Connected Graphs.

[BibT_eX]

[DOI]

,

,

SIAM J. Discret. Math., 2005

Nonseparating Planar Chains in 4-Connected Graphs.

[BibT_eX]

[DOI]

,

,

SIAM J. Discret. Math., 2005

2003

Chain decompositions and independent trees in 4-connected graphs.

[BibT_eX]

[DOI]

,

,

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

On The Circuit Cover Problemfor Mixed Graphs.

[BibT_eX]

[DOI]

,

Yoshiko Wakabayashi

Comb. Probab. Comput., 2002

2001

Note on a min-max conjecture of Woodall.

[BibT_eX]

[DOI]

,

Yoshiko Wakabayashi

J. Graph Theory, 2001

1998

Circuit Covers in Series-Parallel Mixed Graphs.

[BibT_eX]

[DOI]

,

Yoshiko Wakabayashi

Proceedings of the LATIN '98: Theoretical Informatics, 1998

Loading...