The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Francisco Barahona: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Francisco Barahona, Ali Ridha Mahjoub
    On 2-Connected Subgraph Polytopes. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:30-43 [Conf]
  2. Francisco Barahona, Ranga Anbil
    On some difficult linear programs coming from set partitioning. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:118, n:1-2, pp:3-11 [Journal]
  3. Laura Bahiense, Francisco Barahona, Oscar Porto
    Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2003, v:7, n:3, pp:259-282 [Journal]
  4. Francisco Barahona, Martin Grötschel
    On the cycle polytope of a binary matroid. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1986, v:40, n:1, pp:40-62 [Journal]
  5. Mourad Baïou, Francisco Barahona, Ali Ridha Mahjoub
    Separation of Partition Inequalities. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2000, v:25, n:2, pp:243-254 [Journal]
  6. Francisco Barahona
    On cuts and matchings in planar graphs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1993, v:60, n:, pp:53-68 [Journal]
  7. Francisco Barahona
    Network reinforcement. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2006, v:105, n:2-3, pp:181-200 [Journal]
  8. Francisco Barahona, David Jensen
    Plant location with minimum inventory. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:83, n:, pp:101-111 [Journal]
  9. Francisco Barahona
    On the k-cut problem. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2000, v:26, n:3, pp:99-105 [Journal]
  10. Francisco Barahona, Éva Tardos
    Note on Weintraub's Minimum-Cost Circulation Algorithm. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:3, pp:579-583 [Journal]
  11. Francisco Barahona, Ali Ridha Mahjoub
    Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:372-389 [Journal]
  12. Francisco Barahona
    Fractional Packing of T-Joins. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:17, n:4, pp:661-669 [Journal]
  13. Francisco Barahona, Jean Fonlupt, Ali Ridha Mahjoub
    Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:390-402 [Journal]
  14. Francisco Barahona, Ali Ridha Mahjoub
    Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:344-358 [Journal]
  15. Francisco Barahona, Ali Ridha Mahjoub
    Compositions of Graphs and Polyhedra II: Stable Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:3, pp:359-371 [Journal]
  16. Francisco Barahona, Michele Conforti
    A construction for binary matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:213-218 [Journal]
  17. Francisco Barahona, Ali Ridha Mahjoub
    On two-connected subgraph polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:147, n:1-3, pp:19-34 [Journal]

Search in 0.045secs, Finished in 0.046secs
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