- Cycles in dense digraphs Maria Chudnovsky1
- Threecolourable perfect graphs without even pairs Maria Chudnovsky 1
- The edge-density for K2,t minors Maria Chudnovsky1
- Single Machine Scheduling: The Problem of Minimizing the Total
- Claw-free Graphs. III. Circular interval graphs Maria Chudnovsky1
- The structure of bull-free graphs I --three-edge-paths with centers and anticenters
- Claw-free Graphs. IV. Decomposition theorem Maria Chudnovsky1
- Partial characterizations of clique-perfect graphs II: diamond-free and Helly circular-arc
- Tournaments and colouring Eli Berger1
- Making perfect graphs Abstract: A graph is perfect if for every induced subgraph, its chromatic
- Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement
- A well-quasi-order for tournaments Maria Chudnovsky1
- The structure of bull-free graphs II and III --a Maria Chudnovsky
- The Erdos-Hajnal Conjecture for Bull-free Graphs Maria Chudnovsky
- Noise Sensitivity of Boolean Functions and Percolation
- The structure of bull-free graphs III--global Maria Chudnovsky
- Simplicial cliques in claw-free graphs Maria Chudnovsky 1
- The Strong Perfect Graph Theorem Maria Chudnovsky
- Publications and Preprints Maria Chudnovsky
- Recognizing Berge Graphs Maria Chudnovsky, Princeton University, Princeton, NJ
- Three-colourable perfect graphs without even pairs Maria Chudnovsky1
- The structure of claw-free graphs Maria Chudnovsky and Paul Seymour
- The Roots of the Independence Polynomial of a Clawfree Graph Maria Chudnovsky1
- Hadwiger's conjecture for quasi-line graphs Maria Chudnovsky1
- An approximate version of Hadwiger's conjecture for claw-free graphs
- The structure of bull-free graphs II --elementary Maria Chudnovsky
- The Structure of Bull-Free Perfect Graphs Maria Chudnovsky
- K4-free graphs with no odd holes Maria Chudnovsky1
- Excluding induced subgraphs Maria Chudnovsky and Paul Seymour
- Bisimplicial vertices in even-hole-free graphs Louigi Addario-Berry
- Solution of three problems of Cornuejols Maria Chudnovsky1
- Detecting even holes Maria Chudnovsky1
- Detecting a Theta or a Prism Maria Chudnovsky 1
- Perfect Matchings in Planar Cubic Graphs Maria Chudnovsky1
- AN ALGORITHM FOR PACKING NON-ZERO A-PATHS IN GROUP-LABELLED GRAPHS
- Edge Intersection Graphs of Single Bend Paths in a Grid
- Disjoint paths in tournaments Date Tuesday, September 21
- Fast First-Order Methods for Semidefinite Programming
- MAP Estimation with Perfect Date Tuesday, November 24
- The cube and octahedron recurrences
- Maximizing the number of Date Wedensday, March 25
- On Erdos conjecture on square-free sets
- Binary matroids with no M(K3,3)-minors.
- Hadwiger's conjecture for quasi-line graphs
- A new technique for solving polynomial systems of equations
- Claw-free Graphs. II. Non-orientable prismatic graphs Maria Chudnovsky1
- The three-in-a-tree problem Maria Chudnovsky1
- Berge Trigraphs Maria Chudnovsky1
- Even Pairs In Berge Graphs Maria Chudnovsky1
- DISCRETE MATH SEMINAR, COLUMBIA UNIVERSITY Graph-Theoretic Problems in Sampling and Compression
- Fractionally and integrally co-strongly perfect claw-free
- Optimization Problems in Internet Advertising
- Packing seagulls Maria Chudnovsky1
- Claw-free Graphs VI. Colouring Claw-free Graphs Maria Chudnovsky
- Claw-free Graphs. V. Global structure Maria Chudnovsky1
- Combinatorial allocation and submodular maximization over
- Analyzing the Performance of Greedy Maximal Scheduling via Local Pooling and Graph Theory
- Disjoint paths in tournaments Maria Chudnovsky1
- Colorings, Crossings, and Cliques Date Tuesday, October 21
- Algorithmic metatheorems for sparse classes of combinatorial
- Claw-free Graphs. VII. Quasi-line graphs Maria Chudnovsky1
- Vertex decompositions of simplicial complexes from algebraic geometry
- Finding minimum clique capacity Maria Chudnovsky1
- Kt minors in large t-connected Date Tuesday, March 10
- Claw-free Graphs. I. Orientable prismatic graphs Maria Chudnovsky1
- Tournament immersion and cutwidth Maria Chudnovsky1
- Excluding Induced Subdivisions of the Bull and Related Graphs
- Spectral Algorithms for Unique Date Tuesday, April 27
- A Polynomial Time Approximation Scheme for k-Consensus Clustering
- Coloring Quasi-line Graphs Maria Chudnovsky
- The Balanced Minimum Evolution Date Tuesday, April 26
- Partial characterizations of clique-perfect graphs I: subclasses of claw-free graphs
- Substitution and -Boundedness Maria Chudnovsky
- Rao's degree sequence conjecture Maria Chudnovsky1
- Coloring Bull-Free Perfect Graphs Irena Penev
- Cops and robbers in random Date Tuesday, October 5
- Optimal antithickenings of claw-free trigraphs Maria Chudnovsky
- Lines in hypergraphs Laurent Beaudou (Universite Blaise Pascal, Clermont-Ferrand)1
- Detecting an induced net subdivision Maria Chudnovsky1
- The Structure of Claw-Free Perfect Graphs Maria Chudnovsky
- A counterexample to a conjecture of Schwartz Felix Brandt1
- A local strengthening of Reed's , , conjecture for quasi-line graphs
- Vertex Sparsification Date Tuesday, November 29
- A De BruijnErdos theorem for chordal graphs
- A counterexample to a conjecture of Schwartz Felix Brandt1
