Trees Associated with the Motzkin Numbers. - Alexander Kuznetsov; Igor Pak; Alexander Postnikov (J. Comb. Theory A, 1996)

When and how n choose k. - Igor Pak (Randomization Methods in Algorithm Design, 1997)

A direct bijective proof of the hook-length formula. - Jean-Christophe Novelli; Igor Pak; Alexander V. Stoyanovskii (Discret. Math. Theor. Comput. Sci., 1997)

A generalization of Sylvester's identity. - Igor Pak; Alexander Postnikov (Discret. Math., 1998)

Random Cayley Graphs with O(log[G]) Generators Are Expanders. - Igor Pak (ESA, 1999)

On Sampling Generating Sets of Finite Groups and Product Replacement Algorithm (extended abstract). - Igor Pak; Sergey Bratus (ISSAC, 1999)

Using Stopping Times to Bound Mixing Times. - Igor Pak (SODA, 1999)

Lifting Markov Chains to Speed up Mixing. - Fang Chen; László Lovász 001; Igor Pak (STOC, 1999)

Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ARY trees. - Igor Pak (Discret. Math., 1999)

On Tilings by Ribbon Tetrominoes. - Roman Muchnik; Igor Pak (J. Comb. Theory A, 1999)

The product replacement algorithm is polynomial. - Igor Pak (FOCS, 2000)

On the Number of Faces of Certain Transportation Polytopes. - Igor Pak (Eur. J. Comb., 2000)

Fast Constructive Recognition of a Black Box Group Isomorphic to Sn or An using Goldbach's Conjecture. - Sergey Bratus; Igor Pak (J. Symb. Comput., 2000)

On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes. - Igor Pak; Van H. Vu (Discret. Appl. Math., 2001)

On Growth of Grigorchuk Groups. - Roman Muchnik; Igor Pak (Int. J. Algebra Comput., 2001)

Mixing time and long paths in graphs. - Igor Pak (SODA, 2002)

Ribbon Tile Invariants from the Signed Area. - Cristopher Moore; Igor Pak (J. Comb. Theory A, 2002)

Tile invariants: new horizons. - Igor Pak (Theor. Comput. Sci., 2003)

The nature of partition bijections I. Involutions. - Igor Pak (Adv. Appl. Math., 2004)

Partition congruences by involutions. - Christine Bessenrodt; Igor Pak (Eur. J. Comb., 2004)

Strong bias of group generators: an obstacle to the "product replacement algorithm". - László Babai; Igor Pak (J. Algorithms, 2004)

Bijections for refined restricted permutations. - Sergi Elizalde; Igor Pak (J. Comb. Theory A, 2004)

Tilings of rectangles with T-tetrominoes. - Michael Korn; Igor Pak (Theor. Comput. Sci., 2004)

The area of cyclic polygons: Recent progress on Robbins' conjectures. - Igor Pak (Adv. Appl. Math., 2005)

Combinatorics and geometry of Littlewood-Richardson cones. - Igor Pak; Ernesto Vallejo (Eur. J. Comb., 2005)

Expansion Of Product Replacement Graphs. - Alexander Gamburd; Igor Pak (Comb., 2006)

Percolation on Finite Cayley Graphs. - Christopher Malon; Igor Pak (Comb. Probab. Comput., 2006)

A combinatorial proof of the Rogers-Ramanujan and Schur identities. - Cilanne Boulet; Igor Pak (J. Comb. Theory A, 2006)

Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings. - Ezra Miller; Igor Pak (Discret. Comput. Geom., 2008)

Inflating the Cube Without Stretching. - Igor Pak (Am. Math. Mon., 2008)

Geometry and complexity of O'Hara's algorithm. - Matjaz Konvalinka; Igor Pak (Adv. Appl. Math., 2009)

Hamiltonian paths in Cayley graphs. - Igor Pak; Rados Radoicic (Discret. Math., 2009)

Complexity of O'Hara's Algorithm. - Matjaz Konvalinka; Igor Pak (CTW, 2010)

Acute triangulations of polyhedra and the Euclidean space. - Eryk Kopczynski; Igor Pak; Piotr Przytycki (SCG, 2010)

Reductions of Young Tableau Bijections. - Igor Pak; Ernesto Vallejo (SIAM J. Discret. Math., 2010)

The weighted hook length formula. - Ionut Ciocan-Fontanine; Matjaz Konvalinka; Igor Pak (J. Comb. Theory A, 2011)

Acute triangulations of polyhedra and ℝ N. - Eryk Kopczynski; Igor Pak; Piotr Przytycki (Comb., 2012)

Testing commutativity of a group and the power of randomization. - Igor Pak (LMS J. Comput. Math., 2012)

Collapsing Walls Theorem. - Igor Pak; Rom Pinchasi (Am. Math. Mon., 2012)

The Complexity of Generalized Domino Tilings. - Igor Pak; Jed Yang (Electron. J. Comb., 2013)

A Quantitative Steinitz Theorem for Plane Triangulations. - Igor Pak; Stedman Wilson (CoRR, 2013)

Constructing Uniquely Realizable Graphs. - Igor Pak; Dan Vilenchik (Discret. Comput. Geom., 2013)

Tiling simply connected regions with rectangles. - Igor Pak; Jed Yang (J. Comb. Theory A, 2013)

The shape of random pattern-avoiding permutations. - Sam Miner; Igor Pak (Adv. Appl. Math., 2014)

Cayley compositions, partitions, polytopes, and geometric bijections. - Matjaz Konvalinka; Igor Pak (J. Comb. Theory A, 2014)

Generalized loop-erased random walks and approximate reachability. - Igor Gorodezky; Igor Pak (Random Struct. Algorithms, 2014)

On the Longest $k$-Alternating Subsequence. - Igor Pak; Robin Pemantle (Electron. J. Comb., 2015)

Pattern avoidance is not P-recursive. - Scott Garrabrant; Igor Pak (CoRR, 2015)

Permutation patterns are hard to count. - Scott Garrabrant; Igor Pak (SODA, 2016)

On the Odd Area of Planar Sets. - Assaf Oren; Igor Pak; Rom Pinchasi (Discret. Comput. Geom., 2016)

Fast Domino Tileability. - Igor Pak; Adam Sheffer; Martin Tassy (Discret. Comput. Geom., 2016)

Enumeration of Integer Points in Projections of Unbounded Polyhedra. - Danny Nguyen; Igor Pak (IPCO, 2017)

Complexity of short Presburger arithmetic. - Danny Nguyen; Igor Pak (STOC, 2017)

On the complexity of computing Kronecker coefficients. - Igor Pak; Greta Panova (Comput. Complex., 2017)

Lifts, derandomization, and diameters of Schreier graphs of Mealy automata. - Anton Malyshev; Igor Pak (Comb., 2017)

Complexity of short generating functions. - Danny Nguyen; Igor Pak (CoRR, 2017)

VC-dimension of short Presburger formulas. - Danny Nguyen; Igor Pak (CoRR, 2017)

Bounds on certain classes of Kronecker and q-binomial coefficients. - Igor Pak; Greta Panova (J. Comb. Theory A, 2017)

Skyscraper polytopes and realizations of plane triangulations. - Igor Pak; Stedman Wilson (J. Comb. Theory B, 2017)

Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications. - Alejandro H. Morales; Igor Pak; Greta Panova (SIAM J. Discret. Math., 2017)

Complexity problems in enumerative combinatorics. - Igor Pak (CoRR, 2018)

Asymptotics of the number of standard Young tableaux of skew shape. - Alejandro H. Morales; Igor Pak; Greta Panova (Eur. J. Comb., 2018)

Hook formulas for skew shapes I. q-analogues and bijections. - Alejandro H. Morales; Igor Pak; Greta Panova (J. Comb. Theory A, 2018)

Enumerating Projections of Integer Points in Unbounded Polyhedra. - Danny Nguyen; Igor Pak (SIAM J. Discret. Math., 2018)

Why Is Pi Less Than Twice Phi? - Alejandro H. Morales; Igor Pak; Greta Panova (Am. Math. Mon., 2018)

VC-Dimensions of Short Presburger Formulas. - Danny Nguyen; Igor Pak (Comb., 2019)

Combinatorial inequalities. - Igor Pak (CoRR, 2019)

Limit Shapes via Bijections. - Stephen Desalvo; Igor Pak (Comb. Probab. Comput., 2019)

Kirszbraun-type theorems for graphs. - Nishant Chandgotia; Igor Pak; Martin Tassy (J. Comb. Theory B, 2019)

On the largest Kronecker and Littlewood-Richardson coefficients. - Igor Pak; Greta Panova; Damir Yeliussizov (J. Comb. Theory A, 2019)

Counting Linear Extensions of Restricted Posets. - Samuel J. Dittmer; Igor Pak (Electron. J. Comb., 2020)

Hidden Symmetries of Weighted Lozenge Tilings. - Igor Pak; Fedor Petrov 001 (Electron. J. Comb., 2020)

The Computational Complexity of Integer Programming with Alternations. - Danny Nguyen; Igor Pak (Math. Oper. Res., 2020)

Sorting probability of Catalan posets. - Swee Hong Chan; Igor Pak; Greta Panova (Adv. Appl. Math., 2021)

Log-concave poset inequalities. - Swee Hong Chan; Igor Pak (CoRR, 2021)

On the Number of Integer Points in Translated and Expanded Polyhedra. - Danny Nguyen; Igor Pak (Discret. Comput. Geom., 2021)

Presburger Arithmetic with algebraic scalar multiplications. - Philipp Hieronymi; Danny Nguyen; Igor Pak (Log. Methods Comput. Sci., 2021)

What is in #P and what is not? - Christian Ikenmeyer; Igor Pak (FOCS, 2022)

What is a combinatorial interpretation? - Igor Pak (CoRR, 2022)

Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings. - Alejandro H. Morales; Igor Pak; Martin Tassy (Comb. Probab. Comput., 2022)

Short Presburger Arithmetic Is Hard. - Danny Nguyen; Igor Pak (SIAM J. Comput., 2022)

Log-Concavity in Planar Random Walks. - Swee Hong Chan; Igor Pak; Greta Panova (Comb., 2022)

Positivity of the symmetric group characters is as hard as the polynomial time hierarchy. - Christian Ikenmeyer; Igor Pak; Greta Panova (SODA, 2023)

Extensions of the Kahn-Saks inequality for posets of width two. - Swee Hong Chan; Igor Pak; Greta Panova (Comb. Theory, 2023)

Linear extensions of finite posets. - Swee Hong Chan; Igor Pak (CoRR, 2023)

Effective Poset Inequalities. - Swee Hong Chan; Igor Pak; Greta Panova (SIAM J. Discret. Math., 2023)

Equality Cases of the Alexandrov-Fenchel Inequality Are Not in the Polynomial Hierarchy. - Swee Hong Chan; Igor Pak (STOC, 2024)

Signed combinatorial interpretations in algebraic combinatorics. - Igor Pak; Colleen Robichaux (CoRR, 2024)

Equality cases of the Stanley-Yan log-concave matroid inequality. - Swee Hong Chan; Igor Pak (CoRR, 2024)

The bunkbed conjecture is false. - Nikita Gladkov; Igor Pak; Aleksandr Zimin (CoRR, 2024)

Positivity of Schubert Coefficients. - Igor Pak; Colleen Robichaux (CoRR, 2024)

Linear extensions and continued fractions. - Swee Hong Chan; Igor Pak (Eur. J. Comb., 2024)

Computational complexity of counting coincidences. - Swee Hong Chan; Igor Pak (Theor. Comput. Sci., 2024)

Vanishing of Schubert Coefficients. - Igor Pak; Colleen Robichaux (STOC, 2025)

Vanishing of Schubert coefficients is in AM ∩ coAM assuming the GRH. - Igor Pak; Colleen Robichaux (CoRR, 2025)