The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

William R. Pulleyblank: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sándor P. Fekete, William R. Pulleyblank
    Area Optimization of Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:173-182 [Conf]
  2. William R. Pulleyblank
    Terascale Computing and BlueGene. [Citation Graph (0, 0)][DBLP]
    ICCD, 2003, pp:- [Conf]
  3. William R. Pulleyblank, F. Bruce Shepherd
    Formulations for the stable set polytope of a claw-free graph. [Citation Graph (0, 0)][DBLP]
    IPCO, 1993, pp:267-279 [Conf]
  4. William R. Pulleyblank
    The Airline Crew Pairing Optimization Problem. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1996, pp:189- [Conf]
  5. Avrim Blum, Prasad Chalasani, Don Coppersmith, William R. Pulleyblank, Prabhakar Raghavan, Madhu Sudan
    The minimum latency problem. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:163-171 [Conf]
  6. William R. Pulleyblank
    Two Steiner tree packing problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:383-387 [Conf]
  7. Michael Jünger, William R. Pulleyblank
    New Primal and Dual Matching Heuristics. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:13, n:4, pp:357-386 [Journal]
  8. Egon Balas, William R. Pulleyblank
    The perfectly matchable subgraph polytope of an arbitrary graph. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1989, v:9, n:4, pp:321-337 [Journal]
  9. Gérard Cornuéjols, William R. Pulleyblank
    Critical graphs, matching and tours or a hierarchy of relaxations for the traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:1, pp:35-52 [Journal]
  10. J. Edmonds, László Lovász, William R. Pulleyblank
    Brick decompositions and the matching rank of graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:3, pp:247-274 [Journal]
  11. Gérard Cornuéjols, William R. Pulleyblank
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:89, n:1-3, pp:1-2 [Journal]
  12. Noga Alon, Meir Katchalski, William R. Pulleyblank
    Cutting Disjoint Disks by Straight Lines. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:239-243 [Journal]
  13. Noga Alon, Meir Katchalski, William R. Pulleyblank
    The Maximum Size of a Convex Polygon in a Restricted Set in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:245-251 [Journal]
  14. William R. Pulleyblank
    Mathematical sciences in the nineties. [Citation Graph (0, 0)][DBLP]
    IBM Journal of Research and Development, 2003, v:47, n:1, pp:89-96 [Journal]
  15. Sándor P. Fekete, William R. Pulleyblank
    Traveling the Boundary of Minkowski Sums. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:4, pp:171-174 [Journal]
  16. Gérard Cornuéjols, Denis Naddef, William R. Pulleyblank
    The Traveling Salesman Problem in Graphs with 3-Edge Cutsets [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:2, pp:383-410 [Journal]
  17. Charles J. Colbourn, William R. Pulleyblank
    Matroid Steiner problems, the Tutte polynomial and network reliability. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1989, v:47, n:1, pp:20-31 [Journal]
  18. Denis Naddef, William R. Pulleyblank
    Hamiltonicity and combinatorial polyhedra. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1981, v:31, n:3, pp:297-312 [Journal]
  19. Denis Naddef, William R. Pulleyblank
    Hamiltonicity in (0-1)-polyhedra. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:1, pp:41-52 [Journal]
  20. S. C. Boyd, William R. Pulleyblank
    Optimizing over the subtour polytope of the travelling salesman problem. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:49, n:, pp:163-187 [Journal]
  21. Egon Balas, Matteo Fischetti, William R. Pulleyblank
    The precedence-constrained asymmetric traveling salesman polytope. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1995, v:68, n:, pp:241-265 [Journal]
  22. A. B. Gamble, Andrew R. Conn, William R. Pulleyblank
    A network penalty method. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1991, v:50, n:, pp:53-73 [Journal]
  23. Clyde L. Monma, Beth Spellman Munson, William R. Pulleyblank
    Minimum-Weight Two-Connected Spanning Networks. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1990, v:46, n:, pp:153-171 [Journal]
  24. Arlette Gaillard, Heinz Gröflin, Alan J. Hoffman, William R. Pulleyblank
    On the submodular matrix representation of a digraph. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:563-570 [Journal]
  25. Denis Naddef, William R. Pulleyblank
    Matchings in regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:3, pp:283-291 [Journal]

  26. König-Egerváry graphs, 2-bicritical graphs and fractional matchings. [Citation Graph (, )][DBLP]


Search in 0.074secs, Finished in 0.075secs
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