| 437 | -- | 444 | I. Wayan Sudarsana, Hilda Assiyatun, Adiwijaya, Selvy Musdalifah. The Ramsey Number for a Linear Forest versus Two identical Copies of Complete Graphs |
| 445 | -- | 456 | Antonio Fernández Anta, Miguel A. Mosteiro. Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks |
| 457 | -- | 468 | Ricky Rosen. A k-Provers Parallel Repetition Theorem for a Version of no-Signaling Model |
| 469 | -- | 482 | Michal Kolarz. Directed Figure Codes: Decidability Frontier |
| 483 | -- | 492 | Xue Chen, Guangda Hu, Xiaoming Sun. The Complexity of Word Circuits |
| 493 | -- | 504 | Amr Elmasry. The Violation Heap: a Relaxed Fibonacci-like Heap |
| 505 | -- | 514 | Michael Hartwig. On the Density of Regular and Context-Free Languages |
| 515 | -- | 526 | Chi-Jen Lu, Hsin-Lung Wu. On the Hardness against Constant-Depth Linear-Size Circuits |
| 527 | -- | 538 | Shinya Anzai, Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama. Effect of Corner Information in Simultaneous Placement of k Rectangles and Tableaux |
| 539 | -- | 552 | Oleksiy Busaryev, Tamal K. Dey, Yusu Wang. Tracking a Generator by Persistence |
| 553 | -- | 566 | John Augustine, David Eppstein, Kevin A. Wortman. Approximate Weighted Farthest Neighbors and Minimum Dilation Stars |
| 567 | -- | 590 | Sylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang. A Succinct 3D Visibility Skeleton |
| 591 | -- | 606 | Giorgio Ausiello, Andrea Ribichini, Paolo Giulio Franciosa, Giuseppe F. Italiano. Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming |
| 607 | -- | 624 | Muhammad Nur Yanhaona, Md. Shamsuzzoha Bayzid, Md. Saidur Rahman 0001. Discovering Pairwise Compatibility Graphs |
| 625 | -- | 642 | Eric Bach, Shuchi Chawla, Seeun Umboh. Threshold Rules for Online Sample Selection |
| 643 | -- | 654 | Maxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn. Triangle-Free 2-Matchings Revisited |