871 | -- | 895 | Rémy Belmonte, Tesshu Hanaka, Masaaki Kanzaki, Masashi Kiyomi, Yasuaki Kobayashi, Yusuke Kobayashi 0001, Michael Lampis, Hirotaka Ono, Yota Otachi. Parameterized Complexity of (A, ℓ )-Path Packing |
896 | -- | 916 | Pawel Gawrychowski, Tatiana Starikovskaya. Streaming Dictionary Matching with Mismatches |
917 | -- | 960 | Leo van Iersel, Remie Janssen, Mark Jones 0001, Yukihiro Murakami, Norbert Zeh. A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees |
961 | -- | 981 | Akanksha Agrawal, Sudeshna Kolay, Meirav Zehavi. Parameter Analysis for Guarding Terrains |
982 | -- | 1006 | Wenjun Li 0001, Chao Xu 0010, Yongjie Yang 0001, Jianer Chen, Jianxin Wang 0001. A Refined Branching Algorithm for the Maximum Satisfiability Problem |
1007 | -- | 1029 | Dan Alistarh, Giorgi Nadiradze, Amirmojtaba Sabour. Dynamic Averaging Load Balancing on Cycles |
1030 | -- | 1063 | Julien Bensmail, Foivos Fioravantes, Nicolas Nisse. On Proper Labellings of Graphs with Minimum Label Sum |
1064 | -- | 1080 | Boris Klemz, Günter Rote. Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs |
1081 | -- | 1106 | Pawel Gawrychowski, Florin Manea, Radoslaw Serafin. Fast and Longest Rollercoasters |
1107 | -- | 1131 | Magnús M. Halldórsson, Toshimasa Ishii, Kazuhisa Makino, Kenjiro Takazawa. Posimodular Function Optimization |
1132 | -- | 1162 | Swapnam Bajpai, Vaibhav Krishan, Deepanshu Kush, Nutan Limaye, Srikanth Srinivasan 0001. A #SAT Algorithm for Small Constant-Depth Circuits with PTF gates |
1163 | -- | 1181 | Yusuke Kobayashi 0001, Yoshio Okamoto, Yota Otachi, Yushi Uno. Linear-Time Recognition of Double-Threshold Graphs |