William R. Pulleyblank

According to our database1, William R. Pulleyblank authored at least 60 papers between 1973 and 2019.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Condorcet Optimal Clustering with Delaunay Triangulation: Climate Zones and World Happiness Insights.
Proceedings of the Social, Cultural, and Behavioral Modeling, 2019

2014
Reducing gang violence through network influence based targeting of social programs.
Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2014

2013
Realignment in the NHL, MLB, the NFL, and the NBA
CoRR, 2013

2010
Traces of the XII Aussois Workshop on Combinatorial Optimization.
Math. Program., 2010

2008
Facet Generating Techniques.
Proceedings of the Research Trends in Combinatorial Optimization, 2008

2003
On the capacitated vehicle routing problem.
Math. Program., 2003

Integer programming.
Math. Program., 2003

Mathematical sciences in the nineties.
IBM J. Res. Dev., 2003

Terascale Computing and BlueGene.
Proceedings of the 21st International Conference on Computer Design (ICCD 2003), 2003

2002
On the submodular matrix representation of a digraph.
Theor. Comput. Sci., 2002

2001
Preface.
Ann. Oper. Res., 2001

1998
Traveling the Boundary of Minkowski Sums.
Inf. Process. Lett., 1998

Foreword.
Discret. Appl. Math., 1998

Preface: Mathematics of Industrial Systems III.
Ann. Oper. Res., 1998

1996
The Airline Crew Pairing Optimization Problem.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1995
The precedence-constrained asymmetric traveling salesman polytope.
Math. Program., 1995

Right angle free subsets in the plane.
Graphs Comb., 1995

New Primal and Dual Matching Heuristics.
Algorithmica, 1995

Two Steiner tree packing problems (Extended Abstract).
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

1994
Outer-Facial Graphs and the Traveling Salesman Problem.
SIAM J. Optim., 1994

A nonlinear allocation problem.
IBM J. Res. Dev., 1994

The minimum latency problem.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1993
Formulations for the stable set polytope of a claw-free graph.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

Area Optimization of Simple Polygons.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

1992
Boolean-Combinatorial Bounding of Maximum 2-Satisfiability.
Proceedings of the Computer Science and Operations Research, 1992

1991
A network penalty method.
Math. Program., 1991

Optimizing over the subtour polytope of the travelling salesman problem.
Math. Program., 1991

1990
Minimum-Weight Two-Connected Spanning Networks.
Math. Program., 1990

1989
Forest covers and a polyhedral intersection theorem.
Math. Program., 1989

Matroid Steiner problems, the Tutte polynomial and network reliability.
J. Comb. Theory, Ser. B, 1989

Hybrid triple systems and cubic feedback sets.
Graphs Comb., 1989

Odd Path Packings.
Eur. J. Comb., 1989

The Maximum Size of a Convex Polygon in a Restricted Set in the Plane.
Discret. Comput. Geom., 1989

Cutting Disjoint Disks by Straight Lines.
Discret. Comput. Geom., 1989

König-Egerváry graphs, 2-bicritical graphs and fractional matchings.
Discret. Appl. Math., 1989

The perfectly matchable subgraph polytope of an arbitrary graph.
Comb., 1989

1988
Editorial.
Math. Program., 1988

1987
Corrigenda: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem.
Math. Oper. Res., 1987

Linear Systems for Constrained Matching Problems.
Math. Oper. Res., 1987

Fractional matchings and the Edmonds-Gallai theorem.
Discret. Appl. Math., 1987

Exact arborescences, matchings and cycles.
Discret. Appl. Math., 1987

1986
Clique Tree Inequalities and the Symmetric Travelling Salesman Problem.
Math. Oper. Res., 1986

1985
The Traveling Salesman Problem in Graphs with 3-Edge Cutsets
J. ACM, April, 1985

Steiner trees, connected domination and strongly chordal graphs.
Networks, 1985

On partitioning the edges of graphs into connected subgraphs.
J. Graph Theory, 1985

1984
Hamiltonicity in (0-1)-polyhedra.
J. Comb. Theory, Ser. B, 1984

1983
The perfectly matchable subgraph polytope of a bipartite graph.
Networks, 1983

Halin graphs and the travelling salesman problem.
Math. Program., 1983

Critical graphs, matching and tours or a hierarchy of relaxations for the traveling salesman problem.
Comb., 1983

1982
Packing subgraphs in a graph.
Oper. Res. Lett., 1982

Brick decompositions and the matching rank of graphs.
Comb., 1982

Polyhedral Combinatorics.
Proceedings of the Mathematical Programming The State of the Art, 1982

1981
Total dual integrality and b-matchings.
Oper. Res. Lett., 1981

Weakly bipartite graphs and the Max-cut problem.
Oper. Res. Lett., 1981

Hamiltonicity and combinatorial polyhedra.
J. Comb. Theory, Ser. B, 1981

Matchings in regular graphs.
Discret. Math., 1981

1980
A matching problem with side conditions.
Discret. Math., 1980

1979
Minimum node covers and 2-bicritical graphs.
Math. Program., 1979

A note on graphs spanned by Eulerian graphs.
J. Graph Theory, 1979

1973
Min-max relations and combinatorial algorithms.
Proceedings of the American Federation of Information Processing Societies: 1973 National Computer Conference, 1973


  Loading...