Travelled to:1 × Canada
4 × USA
Collaborated with:R.Thomas N.Robertson N.Alon F.R.K.Chung D.J.Hajela W.McCuaig D.P.Sanders E.Dahlhaus D.S.Johnson C.H.Papadimitriou M.Yannakakis
Talks about:graph (2) sequenti (1) pfaffian (1) multiway (1) theorem (1) hilbert (1) complex (1) circuit (1) search (1) planar (1)
Person: Paul D. Seymour
DBLP: Seymour:Paul_D=
Contributed to:
19971996199219901985Wrote 5 papers:
- STOC-1997-McCuaigRST
- Permanents, Pfaffian Orientations, and Even Directed Circuits (WM, NR, PDS, RT), pp. 402–405.
- STOC-1996-RobertsonSST #graph
- Efficiently Four-Coloring Planar Graphs (NR, DPS, PDS, RT), pp. 571–575.
- STOC-1992-DahlhausJPSY #complexity #multi
- The Complexity of Multiway Cuts (ED, DSJ, CHP, PDS, MY), pp. 241–251.
- STOC-1990-AlonST #graph #theorem
- A Separator Theorem for Graphs with an Excluded Minor and its Applications (NA, PDS, RT), pp. 293–299.
- STOC-1985-ChungHS #self
- Self-Organizing Sequential Search and Hilbert’s Inequalities (FRKC, DJH, PDS), pp. 217–223.