| Publication | Date of Publication | Type |
|---|
Reconstruction from smaller cards
Israel Journal of Mathematics | 2026-08-18 | Paper |
Short reachability networks
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2026-06-04 | Paper |
| A polynomial time algorithm for Steiner tree when terminals avoid a rooted K₄-minor | 2026-05-29 | Paper |
| Quasi-linear distance query reconstruction for graphs of bounded treelength | 2026-05-29 | Paper |
Parameterized complexities of dominating and independent set reconfiguration
Algorithmica | 2026-05-08 | Paper |
| Towards tight bounds for the graph homomorphism problem parameterized by cutwidth via asymptotic matrix parameters | 2026-01-14 | Paper |
Trade-off between spread and width for tree decompositions
(available as arXiv preprint) | 2026-01-01 | Paper |
Faster 3-colouring algorithm for graphs of diameter 3
(available as arXiv preprint) | 2026-01-01 | Paper |
Poset dimension and maximum comparability degree
(available as arXiv preprint) | 2026-01-01 | Paper |
Faithful universal graphs for minor-closed classes
SIAM Journal on Discrete Mathematics | 2026-01-01 | Paper |
Longest cycles in vertex-transitive and highly connected graphs
Bulletin of the London Mathematical Society | 2025-10-30 | Paper |
Tight distance query reconstruction for trees and graphs without long induced cycles
Random Structures & Algorithms | 2025-08-26 | Paper |
| Parameterized problems complete for nondeterministic FPT time and logarithmic space | 2025-08-13 | Paper |
A polynomial upper bound for poset saturation
European Journal of Combinatorics | 2025-08-08 | Paper |
| XNLP-completeness for parameterized problems on graphs with a linear structure | 2025-06-23 | Paper |
| On the parameterized complexity of computing tree-partitions | 2025-06-23 | Paper |
| On the complexity of problems on tree-structured graphs | 2025-06-23 | Paper |
| List colouring trees in logarithmic space | 2025-06-19 | Paper |
Counting graphic sequences via integrated random walks
Transactions of the American Mathematical Society | 2025-06-17 | Paper |
On the parameterized complexity of computing tree-partitions
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2025-05-07 | Paper |
| Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron (extended abstract) | 2025-04-08 | Paper |
XNLP-completeness for parameterized problems on graphs with a linear structure
Algorithmica | 2025-03-28 | Paper |
Short reachability networks
(available as arXiv preprint) | 2025-01-01 | Paper |
Faithful universal graphs for minor-closed classes
(available as arXiv preprint) | 2025-01-01 | Paper |
Infinite induced-saturated graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
Note on extremal problems about connected subgraph sums
(available as arXiv preprint) | 2025-01-01 | Paper |
Smaller universal posets
(available as arXiv preprint) | 2025-01-01 | Paper |
Circular sorting, strong complete mappings and wreath product constructions
(available as arXiv preprint) | 2025-01-01 | Paper |
Improved exploration of temporal graphs
(available as arXiv preprint) | 2025-01-01 | Paper |
| Parameterized complexity of binary CSP: vertex cover, treedepth, and related parameters | 2024-11-14 | Paper |
Parameterized problems complete for nondeterministic FPT time and logarithmic space
Information and Computation | 2024-10-08 | Paper |
Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron
Combinatorial Theory | 2024-10-08 | Paper |
Asymptotic dimension of minor-closed families and Assouad-Nagata dimension of surfaces
Journal of the European Mathematical Society (JEMS) | 2024-08-02 | Paper |
| Tight bounds for counting colorings and connected edge sets parameterized by cutwidth | 2024-04-23 | Paper |
scientific article; zbMATH DE number 7803587 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-12 | Paper |
| scientific article; zbMATH DE number 7788455 (Why is no real title available?) | 2024-01-15 | Paper |
Longest cycles in vertex-transitive and highly connected graphs
(available as arXiv preprint) | 2024-01-01 | Paper |
Quasi-linear distance query reconstruction for graphs of bounded treelength
(available as arXiv preprint) | 2024-01-01 | Paper |
scientific article; zbMATH DE number 7774264 (Why is no real title available?)
(available as arXiv preprint) | 2023-12-08 | Paper |
Optimal labelling schemes for adjacency, comparability, and reachability
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Approximating Pathwidth for Graphs of Small Treewidth
ACM Transactions on Algorithms | 2023-10-23 | Paper |
Graphs of low average degree without independent transversals
Journal of Graph Theory | 2023-10-06 | Paper |
| A Polynomial Upper Bound for Poset Saturation | 2023-10-06 | Paper |
Size reconstructibility of graphs
Journal of Graph Theory | 2023-09-29 | Paper |
Decomposing Random Permutations into Order-Isomorphic Subpermutations
SIAM Journal on Discrete Mathematics | 2023-06-27 | Paper |
The lengths for which bicrucial square-free permutations exist
Enumerative Combinatorics and Applications | 2023-06-09 | Paper |
| Optimal distance query reconstruction for graphs without long induced cycles | 2023-06-09 | Paper |
| Reconstructing Graphs from Connected Triples | 2023-03-12 | Paper |
| Counting graphic sequences via integrated random walks | 2023-01-17 | Paper |
Optimal distance query reconstruction for graphs without long induced cycles
(available as arXiv preprint) | 2023-01-01 | Paper |
Reconstructing the degree sequence of a sparse graph from a partial deck
Journal of Combinatorial Theory. Series B | 2022-09-23 | Paper |
| Perfect shuffling with fewer lazy transpositions | 2022-08-13 | Paper |
| Short reachability networks | 2022-08-13 | Paper |
| Exact antichain saturation numbers via a generalisation of a result of Lehman-Ron | 2022-07-15 | Paper |
Perfect shuffling with fewer lazy transpositions
(available as arXiv preprint) | 2022-01-01 | Paper |
A note on connected greedy edge colouring
Discrete Applied Mathematics | 2021-09-30 | Paper |
Exact hyperplane covers for subsets of the hypercube
Discrete Mathematics | 2021-07-08 | Paper |
Isometric universal graphs
SIAM Journal on Discrete Mathematics | 2021-06-10 | Paper |
Cyclically covering subspaces in \(\mathbb{F}_2^n\)
Journal of Combinatorial Theory. Series A | 2021-04-21 | Paper |
| Reconstruction from smaller cards | 2021-03-24 | Paper |
Exceptional graphs for the random walk
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2021-02-15 | Paper |
Exceptional graphs for the random walk
Annales de l'Institut Henri Poincaré. Probabilités et Statistiques | 2021-02-15 | Paper |
Reconstruction from smaller cards
(available as arXiv preprint) | 2021-01-01 | Paper |
Stimulated Raman adiabatic passage-like protocols for amplitude transfer generalize to many bipartite graphs
Journal of Mathematical Physics | 2020-12-17 | Paper |
| Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces | 2020-12-04 | Paper |
| Surfaces have (asymptotic) dimension 2 | 2020-07-07 | Paper |
Surfaces have (asymptotic) dimension 2
(available as arXiv preprint) | 2020-01-01 | Paper |
Intersection sizes of linear subspaces with the hypercube
Journal of Combinatorial Theory. Series A | 2019-11-27 | Paper |
\(H\)-colouring \(P_t\)-free graphs in subexponential time
Discrete Applied Mathematics | 2019-09-05 | Paper |
| Size reconstructibility of graphs | 2018-07-31 | Paper |
