1 | -- | 12 | Charlotte A. C. Brennan, Arnold Knopfmacher. Descent variation of samples of geometric variables |
13 | -- | 32 | Adrien Boussicault. Operations on partially ordered sets and rational identities of type A |
33 | -- | 48 | Mathilde Bouvel, Luca Ferrari. On the enumeration of d-minimal permutations |
49 | -- | 58 | L. Sunil Chandran, Rogers Mathew. Bipartite Powers of k-chordal Graphs |
59 | -- | 70 | Pablo Barenbaum, Verónica Becher, Alejandro Deymonnaz, Melisa Halsband, Pablo Ariel Heiber. Efficient repeat finding in sets of strings via suffix arrays |
71 | -- | 86 | Luc Devroye, Linda Farczadi. Connectivity for line-of-sight networks in higher dimensions |
87 | -- | 94 | Paul D. Manuel, Bharati Rajan, Indra Rajasingh, P. Vasanthi Beulah. Improved Bounds on the Crossing Number of Butterfly Network |
95 | -- | 120 | Jean-Marc Champarnaud, Hadrien Jeanne, Ludovic Mignot. Derivatives of Approximate Regular Expressions |
121 | -- | 138 | Edyta Szymanska. The Complexity of 2-Coloring and Strong Coloring in Uniform Hypergraphs with High Degrees |
139 | -- | 156 | Marcella Anselmo, Maria Madonia. A Stronger Recognizability Condition for Two-dimensional Languages |
157 | -- | 164 | Xiumei Wang, Cheng He, Yixun Lin. Removable Edges in Near-bricks |
165 | -- | 176 | Josef Slapal. Topological structuring of the digital plane |
177 | -- | 194 | Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín Darío Safe. Probe interval graphs and probe unit interval graphs on superclasses of cographs |
195 | -- | 214 | Piotr Borowiecki, Dariusz Dereniowski. On-line ranking of split graphs |
215 | -- | 222 | Shonda Gosselin, Artur Szymanski, Adam Pawel Wojda. Cyclic partitions of complete nonuniform hypergraphs and complete multipartite hypergraphs |
223 | -- | 232 | Jirí Fiala, Marcin Kaminski, Daniël Paulusma. A note on contracting claw-free graphs |
233 | -- | 242 | Tinaz Ekim, Marc Demange. A note on the NP-hardness of two matching problems in induced subgrids |
243 | -- | 258 | Shuchao Li, HuiHui Zhang, Xiaoyan Zhang. Maximal independent sets in bipartite graphs with at least one cycle |
259 | -- | 270 | Marcel Wild, Svante Janson, Stephan G. Wagner, Dirk Laurie. Coupon collecting and transversals of hypergraphs |