The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Yueping Li: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yueping Li, Dingjun Lou
    Finding the ( n , k , 0)-Extendability in Bipartite Graphs and Its Application. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (3), 2007, pp:401-409 [Conf]
  2. Yunting Lu, Yueping Li
    The Minimum All-Ones Problem for Graphs with Small Treewidth. [Citation Graph (0, 0)][DBLP]
    COCOA, 2007, pp:335-342 [Conf]
  3. Yueping Li
    Constrained Cycle Covers in Halin Graphs. [Citation Graph (0, 0)][DBLP]
    ESCAPE, 2007, pp:186-197 [Conf]

  4. A New Algorithm for Determinating 1-extendable Graphs: Design and Implementation. [Citation Graph (, )][DBLP]


  5. A Linear Algorithm to Find the Maximum-weighted Matching in Halin Graphs. [Citation Graph (, )][DBLP]


  6. Matching Extendability Augmentation in Bipartite Graphs. [Citation Graph (, )][DBLP]


  7. A Note on Root Choice for Parallel Processing of Tree Decompositions. [Citation Graph (, )][DBLP]


  8. A Note on n-Critical Bipartite Graphs and Its Application. [Citation Graph (, )][DBLP]


  9. Optimal Path Cover for Graphs of Small Treewidth. [Citation Graph (, )][DBLP]


  10. Finding the Optimal Shortest Path Tree with Respect to Single Link Failure Recovery. [Citation Graph (, )][DBLP]


  11. Algorithms For The Optimal Hamiltonian Path In Halin Graphs. [Citation Graph (, )][DBLP]


  12. M-alternating Hamilton paths and M-alternating Hamilton cycles. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002