657 | -- | 661 | Tao Xiang, Kwok-Wo Wong, Xiaofeng Liao. Cryptanalysis of a password authentication scheme over insecure networks |
662 | -- | 670 | Guy Kortsarz, Zeev Nutov. Tight approximation algorithm for connectivity augmentation problems |
671 | -- | 696 | . On the Approximation of Correlation Clustering and Consensus Clustering |
697 | -- | 720 | Tova Milo, Assaf Sagi, Elad Verbin. Compact samples for data dissemination |
721 | -- | 743 | David A. Cohen, Peter Jeavons, Marc Gyssens. A unified theory of structural tractability for constraint satisfaction problems |
744 | -- | 774 | Michael A. Bender, Dongdong Ge, Simai He, Haodong Hu, Ron Y. Pinter, Steven Skiena, Firas Swidan. Improved bounds on sorting by length-weighted reversals |
775 | -- | 795 | . Compact roundtrip routing with topology-independent node names |
796 | -- | 807 | Maxime Crochemore, Lucian Ilie. Maximal repetitions in strings |
808 | -- | 822 | Leszek Gasieniec, Ralf Klasing, Russell A. Martin, Alfredo Navarra, Xiaohui Zhang. Fast periodic graph exploration with constant memory |
823 | -- | 830 | Rachid Guerraoui, Petr Kuznetsov. The gap in circumventing the impossibility of consensus |
831 | -- | 849 | François Nicolas, Eric Rivals. Hardness of optimal spaced seed design |
850 | -- | 869 | Shlomo Moran, Sagi Snir. Convex recolorings of strings and trees: Definitions, hardness results and algorithms |
870 | -- | 874 | Qiang Li, Huimin Xie. Finite automata for testing composition-based reconstructibility of sequences |
875 | -- | 883 | Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten. Approximation of satisfactory bisection problems |
884 | -- | 897 | Martin Kutz, Khaled M. Elbassioni, Irit Katriel, Meena Mahajan. Simultaneous matchings: Hardness and approximation |
898 | -- | 909 | Peter Jonsson, Andrei A. Krokhin. Computational complexity of auditing finite attributes in statistical databases |
910 | -- | 918 | Mark McCann, Nicholas Pippenger. Fault tolerance in cellular automata at high fault rates |
919 | -- | 937 | Josep Díaz, Maria J. Serna, Dimitrios M. Thilikos. Efficient algorithms for counting parameterized list H-colorings |