Orlando Lee

According to our database1, Orlando Lee authored at least 36 papers between 1998 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Gallai's path decomposition conjecture for graphs with treewidth at most 3.
J. Graph Theory, 2020

Group parking permit problems.
Discret. Appl. Math., 2020

2019
Berge's Conjecture and Aharoni-Hartman-Hoffman's Conjecture for Locally In-Semicomplete Digraphs.
Graphs Comb., 2019

Linial's Conjecture for Arc-spine Digraphs.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

On Edge-magic Labelings of Forests.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

Graphs with at most one crossing.
Discret. Math., 2019

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

2017
Advances in Aharoni-Hartman-Hoffman's Conjecture for Split digraphs.
Electron. Notes Discret. Math., 2017

A 3-approximation algorithm for the maximum leaf <i>k</i>-forest problem.
Electron. Notes Discret. Math., 2017

On Generalizations of the Parking Permit Problem and Network Leasing Problems.
Electron. Notes Discret. Math., 2017

On Linial's conjecture for spine digraphs.
Discret. Math., 2017

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

Connected Facility Leasing Problems.
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.
Math. Program., 2016

Spanning trees with nonseparating paths.
Discret. Math., 2016

Facility Leasing with Penalties.
CoRR, 2016

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

2015
The Eternal Dominating Set problem for proper interval graphs.
Inf. Process. Lett., 2015

Flow-based formulation for the maximum leaf spanning tree problem.
Electron. Notes Discret. Math., 2015

The Online Prize-Collecting Facility Location Problem.
Electron. Notes Discret. Math., 2015

A faster algorithm for packing branchings in digraphs.
Discret. Appl. Math., 2015

Sorting signed permutations by short operations.
Algorithms Mol. Biol., 2015

Computing Bounds for Eternal Domination.
Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014
Removable paths and cycles with parity constraints.
J. Comb. Theory, Ser. B, 2014

The Online Connected Facility Location Problem.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

2009
Removable cycles in non-bipartite graphs.
J. Comb. Theory, Ser. B, 2009

Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width.
Discret. Appl. Math., 2009

2008
A weaker version of Lovász' path removal conjecture.
J. Comb. Theory, Ser. B, 2008

2006
Finding Four Independent Trees .
SIAM J. Comput., 2006

Packing Dicycle Covers in Planar Graphs with No <i>K</i><sub>5</sub>-<i>e</i> Minor.
Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005
Chain Decompositions of 4-Connected Graphs.
SIAM J. Discret. Math., 2005

Nonseparating Planar Chains in 4-Connected Graphs.
SIAM J. Discret. Math., 2005

2003
Chain decompositions and independent trees in 4-connected graphs.
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002
On The Circuit Cover Problemfor Mixed Graphs.
Comb. Probab. Comput., 2002

2001
Note on a min-max conjecture of Woodall.
J. Graph Theory, 2001

1998
Circuit Covers in Series-Parallel Mixed Graphs.
Proceedings of the LATIN '98: Theoretical Informatics, 1998


  Loading...