0 | -- | 0 | Robert A. Proctor, Matthew J. Willis. Parabolic Catalan numbers count flagged Schur functions and their appearances as type A Demazure characters (key polynomials) |
0 | -- | 0 | Matthieu Josuat-Vergès. Stammering tableaux |
0 | -- | 0 | Silvio Capobianco, Jarkko Kari, Siamak Taati. Post-surjectivity and balancedness of cellular automata over groups |
0 | -- | 0 | Hao Lin, Xiumei Wang. Three matching intersection property for matching covered graphs |
0 | -- | 0 | Zbigniew Lonc, Pawel Naroski, Pawel Rzazewski. Tight Euler tours in uniform hypergraphs - computational aspects |
0 | -- | 0 | Arpitha P. Bharathi, Minati De, Abhiruk Lahiri. Circular Separation Dimension of a Subclass of Planar Graphs |
0 | -- | 0 | Lingjuan Shi, Heping Zhang. Tight upper bound on the maximum anti-forcing numbers of graphs |
0 | -- | 0 | Alexis Cornet, Christian Laforest. Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts |
0 | -- | 0 | Ugur Küçük, A. C. Cem Say, Abuzer Yakaryilmaz. Inkdots as advice for finite automata |
0 | -- | 0 | Ruixia Wang. A sufficient condition for a balanced bipartite digraph to be hamiltonian |
0 | -- | 0 | Dmitry N. Kozlov. Witness structures and immediate snapshot complexes |
0 | -- | 0 | Andrea Jiménez, Yoshiko Wakabayashi. On path-cycle decompositions of triangle-free graphs |
0 | -- | 0 | Colin Defant. Binary Codes and Period-2 Orbits of Sequential Dynamical Systems |
0 | -- | 0 | Jonathan Chappelon. Periodic balanced binary triangles |
0 | -- | 0 | Stéphane Devismes, David Ilcinkas, Colette Johnen. Self-Stabilizing Disconnected Components Detection and Rooted Shortest-Path Tree Maintenance in Polynomial Steps |
0 | -- | 0 | Sherry H. F. Yan, Robin D. P. Zhou. Refined Enumeration of Corners in Tree-like Tableaux |
0 | -- | 0 | Jan Kyncl, Bernard Lidický, Tomás Vyskocil. Irreversible 2-conversion set in graphs of bounded degree |