| Publication | Date of Publication | Type |
|---|
Uniqueness for 2-intersecting families of permutations and perfect matchings
Algebraic Combinatorics | 2026-05-08 | Paper |
| Complexity measures on the symmetric group and beyond (extended abstract) | 2026-04-15 | Paper |
On connections between association schemes and analyses of polyhedral and positive semidefinite lift-and-project relaxations
Discrete Mathematics | 2025-12-15 | Paper |
| Characterizing the extremal families in Erdős-Ko-Rado theorems | 2025-08-01 | Paper |
A note on “Largest independent sets of certain regular subgraphs of the derangement graph”
Journal of Algebraic Combinatorics | 2024-04-24 | Paper |
Harmonic polynomials on perfect matchings
Séminaire Lotharingien de Combinatoire | 2023-06-05 | Paper |
| Jack Derangements | 2023-04-13 | Paper |
scientific article; zbMATH DE number 7650407 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| Uniqueness for 2-Intersecting Families of Permutations and Perfect Matchings | 2022-10-01 | Paper |
| Simple Algebraic Proofs of Uniqueness for Erd\H{o}s-Ko-Rado Theorems | 2022-01-08 | Paper |
On the Algebraic Combinatorics of Injections and its Applications to Injection Codes
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
| Complexity Measures on the Symmetric Group and Beyond | 2020-10-14 | Paper |
On the algebraic combinatorics of injections
Séminaire Lotharingien de Combinatoire | 2020-09-14 | Paper |
On the algebraic combinatorics of injections
Séminaire Lotharingien de Combinatoire | 2020-09-14 | Paper |
Stability for 1-intersecting families of perfect matchings
European Journal of Combinatorics | 2020-04-09 | Paper |
A Tight Lower Bound for Non-coherent Index Erasure
(available as arXiv preprint) | 2019-02-19 | Paper |
| Intersecting Families of Perfect Matchings | 2018-11-14 | Paper |
| A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank | 2018-03-15 | Paper |
A Tight Lower Bound for Counting Hamiltonian Cycles via Matrix Rank
(available as arXiv preprint) | 2018-03-15 | Paper |
Erdős-Ko-Rado for perfect matchings
European Journal of Combinatorics | 2017-08-31 | Paper |
On recognition of threshold tolerance graphs and their complements
Discrete Applied Mathematics | 2016-11-24 | Paper |
Simple DFS on the complement of a graph and on partially complemented digraphs
Information Processing Letters | 2016-10-06 | Paper |
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker--Boland Subgraphs
SIAM Journal on Discrete Mathematics | 2016-01-15 | Paper |
Speeding up Graph Algorithms via Switching Classes
Lecture Notes in Computer Science | 2015-09-15 | Paper |
Recognizing threshold tolerance graphs in O(n^2) time
Graph-Theoretic Concepts in Computer Science | 2015-09-09 | Paper |
On finding Tucker submatrices and Lekkerkerker-Boland subgraphs
Graph-Theoretic Concepts in Computer Science | 2013-12-06 | Paper |
