Recognizing Balanced 0, +/- Matrices. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (SODA, 1994)

A Mickey-Mouse Decomposition Theorem. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (IPCO, 1995)

Perfect Matchings in Balanced Hypergraphs. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (Comb., 1996)

Finding an Even Hole in a Graph. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (FOCS, 1997)

Universally Signable Graphs. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (Comb., 1997)

Balanced cycles and holes in bipartite graphs. - Michele Conforti; Gérard Cornuéjols; Kristina Vuskovic (Discret. Math., 1999)

Even and odd holes in cap-free graphs. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Graph Theory, 1999)

A class of ?-perfect graphs. - Celina M. H. de Figueiredo; Kristina Vuskovic (Discret. Math., 2000)

Triangle-free graphs that are signable without even holes. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Graph Theory, 2000)

Recognition of quasi-Meyniel graphs. - Celina M. H. de Figueiredo; Kristina Vuskovic (Discret. Appl. Math., 2001)

Perfect, ideal and balanced matrices. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (Eur. J. Oper. Res., 2001)

Balanced 0-1 Matrices I. Decomposition. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Comb. Theory B, 2001)

Balanced 0-1 Matrices II. Recognition Algorithm. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Comb. Theory B, 2001)

Perfect Graphs, Partitionable Graphs and Cutsets. - Michele Conforti; Gérard Cornuéjols; Grigor Gasparyan; Kristina Vuskovic (Comb., 2002)

The graph sandwich problem for 1-join composition is NP-complete. - Celina M. H. de Figueiredo; Sulamita Klein; Kristina Vuskovic (Discret. Appl. Math., 2002)

Even-hole-free graphs part II: Recognition algorithm. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Graph Theory, 2002)

Even-hole-free graphs part I: Decomposition theorem. - Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vuskovic (J. Graph Theory, 2002)

A Polynomial Algorithm for Recognizing Perfect Graphs. - Gérard Cornuéjols; Xinming Liu; Kristina Vuskovic (FOCS, 2003)

Decomposition of odd-hole-free graphs by double star cutsets and 2-joins. - Michele Conforti; Gérard Cornuéjols; Kristina Vuskovic (Discret. Appl. Math., 2004)

Square-free perfect graphs. - Michele Conforti; Gérard Cornuéjols; Kristina Vuskovic (J. Comb. Theory B, 2004)

Recognizing Berge Graphs. - Maria Chudnovsky; Gérard Cornuéjols; Xinming Liu; Paul D. Seymour; Kristina Vuskovic (Comb., 2005)

Algorithms for 3PC(., .)-free Berge graphs. - Frédéric Maffray; Nicolas Trotignon; Kristina Vuskovic (Electron. Notes Discret. Math., 2005)

Balanced matrices. - Michele Conforti; Gérard Cornuéjols; Kristina Vuskovic (Discret. Math., 2006)

Odd Hole Recognition in Graphs of Bounded Clique Size. - Michele Conforti; Gérard Cornuéjols; Xinming Liu; Kristina Vuskovic; Giacomo Zambelli (SIAM J. Discret. Math., 2006)

Triangulated neighborhoods in even-hole-free graphs. - Murilo Vicente Gonçalves da Silva; Kristina Vuskovic (Discret. Math., 2007)

Algorithms for Square-3PC(., .)-Free Berge Graphs. - Frédéric Maffray; Nicolas Trotignon; Kristina Vuskovic (SIAM J. Discret. Math., 2008)

Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences. - Ton Kloks; Haiko Müller; Kristina Vuskovic (J. Comb. Theory B, 2009)

A structure theorem for graphs with no cycle with a unique chord and its consequences. - Nicolas Trotignon; Kristina Vuskovic (J. Graph Theory, 2010)

Chromatic index of graphs with no cycle with a unique chord. - Raphael C. S. Machado; Celina M. H. de Figueiredo; Kristina Vuskovic (Theor. Comput. Sci., 2010)

On Roussel-Rubio-type lemmas and their consequences. - Nicolas Trotignon; Kristina Vuskovic (Discret. Math., 2011)

LexBFS, structure and algorithms - Pierre Aboulker; Pierre Charbit; Maria Chudnovsky; Nicolas Trotignon; Kristina Vuskovic (CoRR, 2012)

Combinatorial optimization with 2-joins. - Nicolas Trotignon; Kristina Vuskovic (J. Comb. Theory B, 2012)

Detecting 2-joins faster. - Pierre Charbit; Michel Habib; Nicolas Trotignon; Kristina Vuskovic (J. Discrete Algorithms, 2012)

Graphs That Do Not Contain a Cycle with a Node That Has at Least Two Neighbors on It. - Pierre Aboulker; Marko Radovanovic; Nicolas Trotignon; Kristina Vuskovic (SIAM J. Discret. Math., 2012)

The world of hereditary graph classes viewed through Truemper configurations. - Kristina Vuskovic (Surveys in Combinatorics, 2013)

Algorithms for square-$3PC( cdot, cdot)$-free Berge graphs. - Frédéric Maffray; Nicolas Trotignon; Kristina Vuskovic (CoRR, 2013)

Parameterized algorithm for weighted independent set problem in bull-free graphs. - Stéphan Thomassé; Nicolas Trotignon; Kristina Vuskovic (CoRR, 2013)

Decomposition of even-hole-free graphs with star cutsets and 2-joins. - Murilo Vicente Gonçalves da Silva; Kristina Vuskovic (J. Comb. Theory B, 2013)

A Class of Three-Colorable Triangle-Free Graphs. - Marko Radovanovic; Kristina Vuskovic (J. Graph Theory, 2013)

Linear Balanceable and Subcubic Balanceable Graphs. - Pierre Aboulker; Marko Radovanovic; Nicolas Trotignon; Théophile Trunck; Kristina Vuskovic (J. Graph Theory, 2014)

Vertex elimination orderings for hereditary graph classes. - Pierre Aboulker; Pierre Charbit; Nicolas Trotignon; Kristina Vuskovic (Discret. Math., 2015)

Coloring perfect graphs with no balanced skew-partitions. - Maria Chudnovsky; Nicolas Trotignon; Théophile Trunck; Kristina Vuskovic (J. Comb. Theory B, 2015)

A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs. - Stéphan Thomassé; Nicolas Trotignon; Kristina Vuskovic (Algorithmica, 2017)

On rank-width of even-hole-free graphs. - Isolde Adler; Ngoc-Khang Le; Haiko Müller; Marko Radovanovic; Nicolas Trotignon; Kristina Vuskovic (Discret. Math. Theor. Comput. Sci., 2017)

On Triangle-Free Graphs That Do Not Contain a Subdivision of the Complete Graph on Four Vertices as an Induced Subgraph. - Nicolas Trotignon; Kristina Vuskovic (J. Graph Theory, 2017)

Structure and algorithms for (cap, even hole)-free graphs. - Kathie Cameron; Murilo V. G. da Silva; Shenwei Huang; Kristina Vuskovic (Discret. Math., 2018)

Maximum independent sets in (pyramid, even hole)-free graphs. - Maria Chudnovsky; Stéphan Thomassé; Nicolas Trotignon; Kristina Vuskovic (CoRR, 2019)

Coloring square-free Berge graphs. - Maria Chudnovsky; Irene Lo; Frédéric Maffray; Nicolas Trotignon; Kristina Vuskovic (J. Comb. Theory B, 2019)

Clique-cutsets beyond chordal graphs. - Valerio Boncompagni; Irena Penev; Kristina Vuskovic (J. Graph Theory, 2019)

The structure of (theta, pyramid, 1-wheel, 3-wheel)-free graphs. - Valerio Boncompagni; Marko Radovanovic; Kristina Vuskovic (J. Graph Theory, 2019)

Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. - Maria Chudnovsky; Chun-Hung Liu; Oliver Schaudt; Sophie Spirkl; Nicolas Trotignon; Kristina Vuskovic (J. Graph Theory, 2019)

Hadwiger's Conjecture for some hereditary classes of graphs: a survey. - Kathie Cameron; Kristina Vuskovic (Bull. EATCS, 2020)

The (theta, wheel)-free graphs Part I: Only-prism and only-pyramid graphs. - Emilie Diot; Marko Radovanovic; Nicolas Trotignon; Kristina Vuskovic (J. Comb. Theory B, 2020)

The (theta, wheel)-free graphs Part II: Structure theorem. - Marko Radovanovic; Nicolas Trotignon; Kristina Vuskovic (J. Comb. Theory B, 2020)

The (theta, wheel)-free graphs Part III: Cliques, stable sets and coloring. - Marko Radovanovic; Nicolas Trotignon; Kristina Vuskovic (J. Comb. Theory B, 2020)

Two classes of β-perfect graphs that do not necessarily have simplicial extremes. - Jake Horsfield; Kristina Vuskovic (Discret. Math., 2021)

The (theta, wheel)-free graphs Part IV: Induced paths and cycles. - Marko Radovanovic; Nicolas Trotignon; Kristina Vuskovic (J. Comb. Theory B, 2021)

Coloring rings. - Frédéric Maffray; Irena Penev; Kristina Vuskovic (J. Graph Theory, 2021)

Counting Weighted Independent Sets beyond the Permanent. - Martin E. Dyer; Mark Jerrum; Haiko Müller; Kristina Vuskovic (SIAM J. Discret. Math., 2021)

Graphs with polynomially many minimal separators. - Tara Abrishami; Maria Chudnovsky; Cemil Dibek; Stéphan Thomassé; Nicolas Trotignon; Kristina Vuskovic (J. Comb. Theory B, 2022)

Induced subgraphs and tree decompositions I. Even-hole-free graphs of bounded degree. - Tara Abrishami; Maria Chudnovsky; Kristina Vuskovic (J. Comb. Theory B, 2022)

Graphs with all holes the same length. - Linda Cook; Jake Horsfield; Myriam Preissmann; Cléophée Robin; Paul D. Seymour; Ni Luh Dewi Sintiari; Nicolas Trotignon; Kristina Vuskovic (J. Comb. Theory B, 2024)

Tree independence number I. (Even hole, diamond, pyramid)-free graphs. - Tara Abrishami; Bogdan Alecu; Maria Chudnovsky; Sepehr Hajebi; Sophie Spirkl; Kristina Vuskovic (J. Graph Theory, 2024)

Bisimplicial separators. - Martin Milanic; Irena Penev; Nevena Pivac; Kristina Vuskovic (J. Graph Theory, 2024)

Induced subgraphs and tree decompositions II. Toward walls and their line graphs in graphs of bounded degree. - Tara Abrishami; Maria Chudnovsky; Cemil Dibek; Sepehr Hajebi; Pawel Rzazewski; Sophie Spirkl; Kristina Vuskovic (J. Comb. Theory B, 2024)

Induced subgraphs and tree decompositions V. one neighbor in a hole. - Tara Abrishami; Bogdan Alecu; Maria Chudnovsky; Sepehr Hajebi; Sophie Spirkl; Kristina Vuskovic (J. Graph Theory, 2024)

Submodular Functions and Perfect Graphs. - Tara Abrishami; Maria Chudnovsky; Cemil Dibek; Kristina Vuskovic (Math. Oper. Res., 2025)