2023
Effective Poset Inequalities.
SIAM J. Discret. Math., September, 2023
Linear extensions of finite posets.
CoRR, 2023
Equality cases of the Alexandrov-Fenchel inequality are not in the polynomial hierarchy.
CoRR, 2023
Computational complexity of counting coincidences.
CoRR, 2023
Positivity of the symmetric group characters is as hard as the polynomial time hierarchy.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
2022
Log-Concavity in Planar Random Walks.
Comb., December, 2022
Short Presburger Arithmetic Is Hard.
SIAM J. Comput., 2022
Asymptotics for the number of standard tableaux of skew shape and for weighted lozenge tilings.
Comb. Probab. Comput., 2022
What is a combinatorial interpretation?
CoRR, 2022
What is in #P and what is not?
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
2021
Presburger Arithmetic with algebraic scalar multiplications.
Log. Methods Comput. Sci., 2021
On the Number of Integer Points in Translated and Expanded Polyhedra.
Discret. Comput. Geom., 2021
Log-concave poset inequalities.
CoRR, 2021
Sorting probability of Catalan posets.
Adv. Appl. Math., 2021
2020
The Computational Complexity of Integer Programming with Alternations.
Math. Oper. Res., 2020
Hidden Symmetries of Weighted Lozenge Tilings.
Electron. J. Comb., 2020
Counting Linear Extensions of Restricted Posets.
Electron. J. Comb., 2020
2019
On the largest Kronecker and Littlewood-Richardson coefficients.
J. Comb. Theory, Ser. A, 2019
Kirszbraun-type theorems for graphs.
J. Comb. Theory, Ser. B, 2019
Limit Shapes via Bijections.
Comb. Probab. Comput., 2019
Combinatorial inequalities.
CoRR, 2019
VC-Dimensions of Short Presburger Formulas.
Comb., 2019
2018
Why Is Pi Less Than Twice Phi?
Am. Math. Mon., 2018
Enumerating Projections of Integer Points in Unbounded Polyhedra.
SIAM J. Discret. Math., 2018
Hook formulas for skew shapes I. <i>q</i>-analogues and bijections.
J. Comb. Theory, Ser. A, 2018
Asymptotics of the number of standard Young tableaux of skew shape.
Eur. J. Comb., 2018
Complexity problems in enumerative combinatorics.
CoRR, 2018
2017
Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications.
SIAM J. Discret. Math., 2017
Skyscraper polytopes and realizations of plane triangulations.
J. Comb. Theory, Ser. B, 2017
Bounds on certain classes of Kronecker and q-binomial coefficients.
J. Comb. Theory, Ser. A, 2017
VC-dimension of short Presburger formulas.
CoRR, 2017
Complexity of short generating functions.
CoRR, 2017
Lifts, derandomization, and diameters of Schreier graphs of Mealy automata.
Comb., 2017
On the complexity of computing Kronecker coefficients.
Comput. Complex., 2017
Complexity of short Presburger arithmetic.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017
Enumeration of Integer Points in Projections of Unbounded Polyhedra.
Proceedings of the Integer Programming and Combinatorial Optimization, 2017
2016
Discret. Comput. Geom., 2016
On the Odd Area of Planar Sets.
Discret. Comput. Geom., 2016
Permutation patterns are hard to count.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016
2015
Pattern avoidance is not P-recursive.
CoRR, 2015
On the Longest $k$-Alternating Subsequence.
Electron. J. Comb., 2015
2014
Generalized loop-erased random walks and approximate reachability.
Random Struct. Algorithms, 2014
Cayley compositions, partitions, polytopes, and geometric bijections.
J. Comb. Theory, Ser. A, 2014
The shape of random pattern-avoiding permutations.
Adv. Appl. Math., 2014
2013
Tiling simply connected regions with rectangles.
J. Comb. Theory, Ser. A, 2013
Constructing Uniquely Realizable Graphs.
Discret. Comput. Geom., 2013
A Quantitative Steinitz Theorem for Plane Triangulations.
CoRR, 2013
The Complexity of Generalized Domino Tilings.
Electron. J. Comb., 2013
2012
Collapsing Walls Theorem.
Am. Math. Mon., 2012
Testing commutativity of a group and the power of randomization.
LMS J. Comput. Math., 2012
Acute triangulations of polyhedra and ℝ N.
Comb., 2012
2011
The weighted hook length formula.
J. Comb. Theory, Ser. A, 2011
2010
Reductions of Young Tableau Bijections.
SIAM J. Discret. Math., 2010
Acute triangulations of polyhedra and the Euclidean space.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010
Complexity of O'Hara's Algorithm.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010
2009
Hamiltonian paths in Cayley graphs.
Discret. Math., 2009
Geometry and complexity of O'Hara's algorithm.
Adv. Appl. Math., 2009
2008
Inflating the Cube Without Stretching.
Am. Math. Mon., 2008
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings.
Discret. Comput. Geom., 2008
2006
A combinatorial proof of the Rogers-Ramanujan and Schur identities.
J. Comb. Theory, Ser. A, 2006
Percolation on Finite Cayley Graphs.
Comb. Probab. Comput., 2006
Expansion Of Product Replacement Graphs.
Comb., 2006
2005
Combinatorics and geometry of Littlewood-Richardson cones.
Eur. J. Comb., 2005
The area of cyclic polygons: Recent progress on Robbins' conjectures.
Adv. Appl. Math., 2005
2004
Tilings of rectangles with T-tetrominoes.
Theor. Comput. Sci., 2004
Bijections for refined restricted permutations.
J. Comb. Theory, Ser. A, 2004
Strong bias of group generators: an obstacle to the "product replacement algorithm".
J. Algorithms, 2004
Partition congruences by involutions.
Eur. J. Comb., 2004
The nature of partition bijections I. Involutions.
Adv. Appl. Math., 2004
2003
Tile invariants: new horizons.
Theor. Comput. Sci., 2003
2002
Ribbon Tile Invariants from the Signed Area.
J. Comb. Theory, Ser. A, 2002
Mixing time and long paths in graphs.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
2001
On Growth of Grigorchuk Groups.
Int. J. Algebra Comput., 2001
On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes.
Discret. Appl. Math., 2001
2000
Fast Constructive Recognition of a Black Box Group Isomorphic to Sn or An using Goldbach's Conjecture.
J. Symb. Comput., 2000
On the Number of Faces of Certain Transportation Polytopes.
Eur. J. Comb., 2000
The product replacement algorithm is polynomial.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000
1999
On Tilings by Ribbon Tetrominoes.
J. Comb. Theory, Ser. A, 1999
Reduced decompositions of permutations in terms of star transpositions, generalized Catalan numbers and k-ARY trees.
Discret. Math., 1999
Lifting Markov Chains to Speed up Mixing.
Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999
Using Stopping Times to Bound Mixing Times.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999
On Sampling Generating Sets of Finite Groups and Product Replacement Algorithm (extended abstract).
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999
Random Cayley Graphs with O(log[G]) Generators Are Expanders.
Proceedings of the Algorithms, 1999
1998
A generalization of Sylvester's identity.
Discret. Math., 1998
1997
A direct bijective proof of the hook-length formula.
Discret. Math. Theor. Comput. Sci., 1997
When and how <i>n</i> choose <i>k</i>.
Proceedings of the Randomization Methods in Algorithm Design, 1997
1996
Trees Associated with the Motzkin Numbers.
J. Comb. Theory, Ser. A, 1996
