| 0 | -- | 0 | Kevin Durant, Stephan G. Wagner. On the centroid of increasing trees |
| 0 | -- | 0 | Ferhat Alkan, Türker Bíyíkoglu, Marc Demange, Cesim Erten. Structure of conflict graphs in constraint alignment problems and algorithms |
| 0 | -- | 0 | Frédéric Havet, Nicolas Nisse. Constrained ear decompositions in graphs and digraphs |
| 0 | -- | 0 | Michal Tuczynski, Przemyslaw Wenus, Krzysztof Wesek. On cordial labeling of hypertrees |
| 0 | -- | 0 | Paul Dorbec, Antonio González, Claire Pennarun. Power domination in maximal planar graphs |
| 0 | -- | 0 | Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento. A note on the convexity number for complementary prisms |
| 0 | -- | 0 | Huazhong Lü, Tingzeng Wu. Super edge-connectivity and matching preclusion of data center networks |
| 0 | -- | 0 | Colin Defant. Proofs of Conjectures about Pattern-Avoiding Linear Extensions |
| 0 | -- | 0 | Arash Ahadi, Ali Dehghan 0001. $(2/2/3)$-SAT problem and its applications in dominating set problems |
| 0 | -- | 0 | Matjaz Krnc, Tomaz Pisanski. Generalized Petersen graphs and Kronecker covers |
| 0 | -- | 0 | Audace A. V. Dossou-Olory, Stephan Wagner 0003. On the inducibility of small trees |
| 0 | -- | 0 | Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns. Symmetry Properties of Nested Canalyzing Functions |
| 0 | -- | 0 | Jan Goedgebeur, Carol T. Zamfirescu. On almost hypohamiltonian graphs |
| 0 | -- | 0 | Zongwen Bai, Jianhua Tu, Yongtang Shi. An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth |
| 0 | -- | 0 | Tianlong Ma, Yaping Mao, Eddie Cheng, Christopher Melekian. Fractional matching preclusion for generalized augmented cubes |
| 0 | -- | 0 | Masaki Nakanishi, Abuzer Yakaryilmaz, Aida Gainutdinova. New results on classical and quantum counter automata |
| 0 | -- | 0 | Andrzej Dudek, Andrzej Rucinski 0001. Monochromatic loose paths in multicolored k-uniform cliques |
| 0 | -- | 0 | Kitty Meeks, Dominik K. Vu. Extremal properties of flood-filling games |
| 0 | -- | 0 | Kengo Enami. Embeddings of 3-connected 3-regular planar graphs on surfaces of non-negative Euler characteristic |