Menu_Home Home   Menu_Latest Latest   Menu_Search Advanced Search   Menu_Browse_by_Year By Year   Menu_Browse_by_Division By Division
  
Screen decoration graphicsLogo

Divisions: Algorithm Design Group

Number of items at this level: 243.

Peleg, David and Radzik, Tomasz (2010) Time-Efficient Broadcast in Radio Networks. In: Graphs and Algorithms in Communication Networks. Texts in Theoretical Computer Science (An EATCS Series) . Springer Berlin Heidelberg, pp. 311-334.

Coja-Oghlan, Amin and Cooper, Colin and Frieze, Alan M. (2009) An efficient sparse regularity concept. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on.

Radzik, Tomasz (2009) Fractional Combinatorial Optimization. In: Encyclopedia of Optimization, Second Edition. Springer, pp. 1077-1080. (In Press)

Chlebus, Bogdan S. and Kowalski, Dariusz R. and Radzik, Tomasz (2009) Many-to-Many Communication in Radio Networks. Algorithmica, 54 (1). pp. 118-139.

Cooper, Colin and Frieze, Alan M. and Radzik, Tomasz (2009) Multiple Random Walks and Interacting Particle Systems. In: Automata, Languages and Programming, 36th Internatilonal Collogquium, ICALP 2009, Rhodes, greece, July 5-12, 2009, Proceedings, Part II.

Cooper, Colin and Frieze, Alan and Radzik, Tomasz (2009) Multiple Random Walks in Random Regular Graphs. SIAM J. Discrete Math., 23 (4). pp. 1738-1761.

Cooper, Colin and Frieze, Alan M. (2009) The cover time of random geometric graphs. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on.

Chan, Joseph Wun-Tat and Lam, Tak Wah and Wong, Prudence W. H. (2008) Dynamic bin packing of unit fractions items. Theoretical Computer Science, 409 (3). pp. 521-529.

Zheng, Feifeng and Fung, Stanley P. Y. and Chan, Wun-Tat and Chin, Francis Y. L. and Poon, Chung Keung and Wong, Prudence W. H. (2008) Improved on-line broadcast scheduling with deadlines. Journal of Scheduling, 11 (4). pp. 299-308.

Chan, Joseph Wun-Tat and Crochemore, Maxime (2008) Mathematics in Computer Science, special issue on Combinatorial Algorithms. Springer Berlin / Heidelberg, Springer Berlin / Heidelberg, pp. 541-542. ISBN 978-3-540-93979-5

Chan, Wun-Tat and Chin, Francis Y. L. and Ye, Deshi and Zhang, Guochuan and Zhang, Yong (2008) On-line scheduling of parallel jobs on two machines. Journal of Discrete Algorithms, 6 (1). pp. 3-10.

Cooper, Colin and Klasing, Ralf and Radzik, Tomasz (2008) A randomized algorithm for the joining protocol in dynamic distributed networks. Theor. Comput. Sci., 406 (3). pp. 248-262.

Crochemore, Maxime and Ilie, Lucian and Smyth, William F. (2008) A simple algorithm for computing the Lempel-Ziv factorization. In: 18th Data Compression Conference, 25-27 March 2008, Snowbird, UT, USA.

Crochemore, Maxime and Hermelin, Danny and Landau, Gad M. and Rawitz, Dror and Vialette, Stéphane (2008) Approximating the 2-Interval Pattern Problem. Theoretical Computer Science, 395 (2-3). pp. 283-297.

Klasing, Ralf and Markou, Euripides and Radzik, Tomasz and Sarracco, Fabiano (2008) Approximation bounds for Black Hole Search problems. Networks, 52 (4). pp. 216-226.

Crochemore, Maxime and Fazekas, Szil'ard Zsolt and Iliopoulos, Costas and Jayasekera, Inuka (2008) Bounds on powers in strings. In: Developments in Language Theory, 16-19 September 2008, Kyoto, Japan.

Chan, Joseph Wun-Tat and Crochemore, Maxime, eds. (2008) Combinatorial Algorithms. Birkhäuser Basel, Switzerland.

Crochemore, Maxime and Porat, Ely (2008) Computing a longest increasing subsequence of length k in time O(nloglog k). In: Visions of computer science, 22-24 September 2008, Imperial College, London, UK.

Steiner, Sarah and Radzik, Tomasz (2008) Computing all efficient solutions of the biobjective minimum spanning tree problem. Computers & OR, 35 (1). pp. 198-211.

Crochemore, Maxime and Ilie, Lucian (2008) Computing Longest Previous Factors in linear time and applications. Information Processing Letters, 106 (2). pp. 75-80.

Chan, Joseph Wun-Tat and Chin, Francis Y. L. and Hong, Xiangyu and Ting, Hing-Fung (2008) Dynamic Offline Conflict-Free Coloring for Unit Disks. In: 6th Workshop of Approximation and Online Algorithms (WAOA 2008), 18-19 Sep 2008, Universität Karlsruhe, Germany.

Albrecht, Andreas A. and Steinhöfel, Kathleen (2008) Estimating the number of local maxima for k-SAT Instances. In: 10th International Symposium on Artificial Intelligence and Mathematics, (ISAIM 2008), 2-4 January 2008, Fort Lauderdale Florida, USA.

Roh, Kangho and Crochemore, Maxime and Iliopoulos, Costas S. and Park, Kunsoo (2008) External memory algorithms for string problems. Fundamenta Informaticae, 84 (1). pp. 17-32.

Zahrani, M.S. and Loomes, M.J. and Malcolm, J.A. and Ullah, A.Z.M. Dayem and Steinhofel, K. and Albrecht, A.A. (2008) Genetic Local Search for Multicast Routing with Pre-processing by Logarithmic Simulated Annealing. Computers & Operations Research, 35 (6). pp. 2049-2070.

Crochemore, Maxime and Iliopoulos, Costas and Kubica, Marcin and Rahman, Mohammad Sohel and Wale'n, Tomasz (2008) Improved algorithms for the range next value problem and applications. In: Symposium on Theoretical Aspects of Computer Science, 21-23 February 2008, Bordeaux, France.

Cooper, Colin and Klasing, Ralf and Radzik, Tomasz (2008) Locating and Repairing Faults in a Network with Mobile Agents. In: Structural Information and Communication Complexity, 15th International Colloquium, SIROCCO 2008, Villars-sur-Ollon, Switzerland, June 17-20, 2008, Proceedings.

Crochemore, Maxime and Ilie, Lucian (2008) Maximal repetitions in strings. Journal of Computer and System Sciences, 74 . pp. 796-807.

Gasieniec, Leszek and Radzik, Tomasz (2008) Memory Efficient Anonymous Graph Exploration. In: Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers.

Béal, Marie-Pierre and Crochemore, Maxime (2008) Minimizing incomplete automata. In: Finite-State Methods and Natural Language Processing, 11-12 September 2008, Ispra, Italy.

Crochemore, Maxime and Gabriele, Alessandra and Mignosi, Filippo and Pesaresi, Mauriana (2008) On the longest common factor problem. In: 5th IFIP International Conference on Theoretical Computer Science, 7-10 September 2008, Milano, Italy.

Crochemore, Maxime and Lecroq, Thierry (2008) Sequential multiple string matching. In: Encyclopedia of Algorithms. Springer, Berlin, pp. 826-829.

Cooper, Colin and Frieze, Alan M. (2008) The cover time of the giant component of a random graph. Random Struct. Algorithms, 32 (4). pp. 401-439.

Crochemore, Maxime and Ilie, Lucian and Tinta, Liviu (2008) Towards a solution to the ``runs'' conjecture. In: Combinatorial Pattern Matching, June 18-20, 2008, Pisa, Italy.

Crochemore, Maxime and Ilie, Lucian (2008) Understanding maximal repetitions in strings. In: Symposium on Theoretical Aspects of Computer Science, 21-23 February 2008, Bordeaux, France.

Iliopoulos, Costas S. and Rahman, M. Sohel and Rytter, Wojciech (2007) Algorithms for Two Versions of LCS Problem for Indeterminate Strings. In: International Workshop on Combinatorial Algorithms (IWOCA).

Chan, Wun-Tat and Chin, Francis Y. L. and Ye, Deshi and Zhang, Guochuan and Zhang, Yong (2007) Online bin packing of fragile objects with application in cellular networks. Journal of Combinatorial Optimization, 14 (4). pp. 427-435.

Allali, J. and Ferraro, P. and Hanna, P. and Iliopoulos, Costas S. (2007) Local Transpositions in Alignment of Polyphonic Musical Sequences. In: Proceedings of the 14th International Symposium on String Processing and Information Retrieval.

Iliopoulos, Costas S. and Rahman, M. Sohel and Voracek, M. and Vagner, L. (2007) Computing Constrained Longest Common Subsequence for Degenerate Strings using Finite Automata. In: Proceedings of the 3rd Algorithms and Complexity in Durham Workshop. (Unpublished)

Iliopoulos, Costas S. and Rahman, M. Sohel (2007) New Efficient Algorithms for LCS and Constrained LCS Problem. In: Proceedings of the 3rd Algorithms and Complexity in Durham Workshop. (Unpublished)

Iliopoulos, Costas S. and Kubica, M. and Rahman, M. Sohel and Walen, T. (2007) Algorithms for Computing the Longest Parameterized Common Subsequence. In: Proceedings of the 18th Annual Symposium on Combinatorial Pattern Matching.

Chen, A. L. P. and Iliopoulos, Costas S. and Michalakopoulos, S. and Rahman, M. Sohel (2007) Implementation of Algorithms to Classify Musical Texts According to Rhythms. In: Proceedings of the 4th Sound and Music Computing Conference.

Iliopoulos, Costas S. and Rahman, M. Sohel and Voracek, M. and Vagner, L. (2007) The Constrained Longest Common Subsequence Problem for Degenerate Strings. In: Proceedings of the 12th International Conference on Implementation and Application of Automata.

Rahman, M. Sohel and Iliopoulos, Costas S. (2007) A New Efficient Algorithm for computing the Longest Common Subsequence. In: Proceedings of the 3rd International Conference on Algorithmic Aspects in Information and Management.

Crochemore, Maxime and Iliopoulos, Costas S. and Rahman, M. Sohel (2007) Optimal Prefix and Suffix Queries on Texts. In: Proceedings of the International Conference on Analysis of Algorithms.

Iliopoulos, Costas S. and Jayasekera, I. and Melichar, B. and Supol, J. (2007) Weighted degenerated approximate pattern matching. In: Proceedings of the 1st International Conference on Language and Automata Theory and Applications. (Unpublished)

Rahman, M. Sohel and Iliopoulos, Costas S. and Mouchard, Laurent (2007) Pattern Matching in Degenerate DNA/RNA Sequences. In: Proceedings of the Workshop on Algorithms and Computation.

Rahman, M. Sohel and Iliopoulos, Costas S. (2007) Indexing Factors with Gaps. In: Proceedings of the 32nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM).

Albrecht, A. A. and Chashkin, A. V. and Iliopoulos, Costas S. and Kasim-Zade, O. M. and Lappas, G. and Steinhofel, K. (2007) A Priori Estimation of Classification Circut Complexity. London Algorithmics and Stringology 2006 . pp. 97-114.

Crochemore, Maxime and Hancart, Christophe and Lecroq, Thierry (2007) Algorithms on Strings. Cambridge University Press.

Cambouropoulos, Emilios and Crochemore, Maxime and Iliopoulos, Costas S. and Mohamed, Manal and Sagot, Marie-France (2007) All Maximal Pairs in Step-Leap Representation of Melodic Sequences. Information Sciences, 177 (9). pp. 1954-1962.

Cambouropoulos, Emilios and Crochemore, Maxime and Iliopoulos, Costas S. and Mohamed, Manal and Sagot, Marie-France (2007) All maximal-pairs in step-leap representation of melodic sequence. Information Sciences, 177 (9). pp. 1954-1962.

Crochemore, Maxime and Ilie, Lucian (2007) Analysis of maximal repetitions in strings. In: Mathematical Foundations of Computer Science.

Antoniou, Pavlos and Crochemore, Maxime and Iliopoulos, Costas and Peterlongo, Pierre (2007) Application of suffix trees for the acquisition of common motifs with gaps in a set of strings. In: Proceedings of the 1st International Conference on Language and Automata Theory and Applications, March 2007, Tarragona, Spain.

Gasieniec, Leszek and Pagourtzis, Aris and Potapov, Igor and Radzik, Tomasz (2007) Deterministic Communication in Radio Networks with Large Labels. Algorithmica, 47 (1). pp. 97-117.

Ardila, Yoan Jose Pinzon and Christodoulakis, Manolis and Iliopoulos, Costas S. and Mohamed, Manal (2007) Efficient (delta, gamma)-Pattern-Matching with Don't Cares. Journal of Combinatorial Mathematics and Combinatorial Computing . (In Press)

Chan, Wun-Tat and Zhang, Yong and Fung, Stanley P. Y. and Ye, Deshi and Zhu, Hong (2007) Efficient algorithms for finding a longest common increasing subsequence. Journal of Combinatorial Optimization, 13 (3). pp. 277-288.

Bockenhauer, Hans-Joachim and Hromkovic, Juraj and Kralovic, Richard and Momke, Tobias and Steinhofel, Kathleen (2007) Efficient Algorithms for the Spoonerism Problem. In: Fun with Algorithms, 4th International Conference, FUN 2007, Castiglioncello, Italy, June 3-5, 2007, Proceedings.

Chan, Ho-Leung and Chan, Wun-Tat and Lam, Tak Wah and Lee, Lap-Kei and Mak, Kin-Sum and Wong, Prudence W. H. (2007) Energy efficient online deadline scheduling. In: The Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, January 7-9, 2007, New Orleans, Louisiana, USA.

Berenbrink, Petra and Cooper, Colin and Hu, Zengjian (2007) Energy efficient randomised communication in unknown AdHoc networks. In: SPAA 2007: Proceedings of the 19th Annual ACM Symposium.

Crochemore, Maxime and Iliopoulos, Costas and Rahman, Mohammad Sohel (2007) Finding Patterns in Given Intervals. In: Mathematical Foundations of Computer Science.

Chan, Joseph Wun-Tat and Chin, Francis Y. L. and Ye, Deshi and Zhang, Yong and Zhu, Hong (2007) Greedy online frequency allocation in cellular networks. Information Processing Letters, 102 (2-3). pp. 55-61.

Klasing, Ralf and Markou, Euripides and Radzik, Tomasz and Sarracco, Fabiano (2007) Hardness and approximation results for Black Hole Search in arbitrary networks. Theor. Comput. Sci., 384 (2-3). pp. 201-221.

Hromkovic, Juraj and Momke, Tobias and Steinhofel, Kathleen and Widmayer, Peter (2007) Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. Algorithmic Operations Research, 2 (1).

Lee, Inbok and Iliopoulos, Costas S. and Park, Kunsoo (2007) Linear time algorithm for the longest common repeat problem. Journal of Discrete Algorithms, 5 (2). pp. 243-249.

Bakalis, A. and Iliopoulos, Costas S. and Makris, C. and Sioutas, S. and Theodoridis, E. and Tsakalidis, A. and Tsichlas, K. (2007) Locating Maximal Multirepeats in Multiple Strings Under Various Constraints. The Computer Journal, 50 (2). pp. 178-185.

J.W. Daykin, M. Mohamed and Steinhofel, K., eds. (2007) London Algorithmics and Stringology. Texts in Algorithmics, 8 . College Publications.

Béal, Marie-Pierre and Crochemore, Maxime (2007) Minimizing local automata. In: IEEE International Symposium on Information Theory.

Crochemore, Maxime and Epifanio, Chiara and Gabriele, Alessandra and Mignosi, Filippo (2007) On the suffix automaton with mismatches. In: Implementation and Application of Automata, 12th International.

Chan, Joseph Wun-Tat and Lam, Tak Wah and Mak, Kin-Sum and Wong, Prudence W. H. (2007) Online Deadline Scheduling with Bounded Energy Efficiency. In: The 4th International Conference on Theory and Applications of Models of Computation, May 22-25, 2007, Shanghai, China.

Chan, Joseph Wun-Tat and Chin, Francis Y. L. and Ye, Deshi and Zhang, Yong (2007) Online frequency allocation in cellular networks. In: The 19th Annual ACM Symposium on Parallel Algorithms and Architectures, June 9-11, 2007, San Diego, California, USA.

Cooper, Colin and Frieze, Alan M. and Sorkin, Gregory B. (2007) Random 2-SAT with Prescribed Literal Degrees. Algorithmica, 48 (3). pp. 249-265.

Cooper, Colin and Zito, Michele (2007) Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases. In: Knowledge Discovery in Databases: PKDD 2007, 11th European.

Cooper, Colin and Dyer, Martin E. and Greenhill, Catherine S. (2007) Sampling Regular Graphs and a Peer-to-Peer Network. Combinatorics, Probability & Computing, 16 (4). pp. 557-593.

Cooper, Colin and Frieze, Alan M. (2007) The Cover Time of Random Digraphs. In: Approximation, Randomization, and Combinatorial Optimization..

Cooper, Colin and Frieze, Alan M. (2007) The cover time of sparse random graphs. Random Struct. Algorithms, 30 (1-2). pp. 1-16.

Cooper, Colin and Frieze, Alan M. (2007) The cover time of the preferential attachment graph. J. Comb. Theory, Ser. B, 97 (2). pp. 269-290.

Crochemore, Maxime and Ilie, Lucian and Seid-Hilmi, Emine (2007) The structure of Factor Oracles. International Journal of Foundations of Computer Science, 18 (4). pp. 781-797.

Gasieniec, Leszek and Pelc, Andrzej and Radzik, Tomasz and Zhang, Xiaohui (2007) Tree exploration with logarithmic memory. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium, January 7-9, 2007, New Orleans, Louisiana, USA.

Iliopoulos, Costas S. and Rahman, M. Sohel (2006) Algorithms for Computing Variants of the Longest Common Subsequence Problem. In: Proceedings of the 17th International Symposium on Algorithms and Computation.

Antoniou, P. and Holub, Jan and Iliopoulos, C. S. and Melichar, B. and Peterlongo, P. (2006) Finding Common Motifs with Gaps using Finite Automata. In: Proceedings of the 11th International Conference on Implementation and Application of Automata (CIAA'06).

Christodoulakis, M. and Iliopoulos, Costas S. and Rahman, M. Sohel and Smyth, W. F. (2006) Song Classifications for Dancing. In: Proceedings of the 11th Prague Stringology Conference.

Iliopoulos, Costas S. and Jayasekara, I. and Mouchard, Laurent (2006) Fast practical exact and approximate pattern matching in protein sequences. In: Proceedings of the 17th Australasian Workshop on Combinatorial Algorithms. (Unpublished)

Chan, Wun-Tat and Chin, Francis Y. L. and Zhang, Yong and Zhu, Hong and Shen, Hong and Wong, Prudence W. H. (2006) A dynamic programming approach of finding an optimal broadcast schedule in minimizing total flow time. Journal of Combinatorial Optimization, 11 (2). pp. 177-187.

Klasing, Ralf and Markou, Euripides and Radzik, Tomasz and Sarracco, Fabiano (2006) Approximation Bounds for Black Hole Search Problems. In: Principles of Distributed Systems, 9th International Conference,.

Guo, Qiang and Iliopoulos, Costas S. and Zhang, H. (2006) Computing the minimum approximate ? -cover of a string. In: Proceedings of the 13th International Conference on String Processing and Information Retrieval.

Crochemore, Maxime and Iliopoulos, Costas S. and Park, Kunsoo and Roh, Kangho (2006) External memory algorithms for string problems. In: Proceedings of the Seventeenth Australasian Workshop on Combinatorial Algorithms.

Crochemore, Maxime and Ilie, Lucian and Seid-Hilmi, Emine (2006) Factor Oracles. In: Implementation and Application of Automata.

Rahman, M. Sohel and Iliopoulos, Costas S. and Lee, Inbok and Mohamed, Manal and Smyth, William F. (2006) Finding Patterns with Variable Length Gaps or Don't Cares. In: Proceedings of the 12th Annual International Computing and Combinatorics Conference (COCOON'06).

Crochemore, Maxime and Diaz, Gaël Harry and deSouza, Simão Melo, eds. (2006) Fouille de données textuelles : complexité, algorithmique et passage à l'échelle. Lavoisier, Paris.

Chan, Joseph Wun-Tat and Chin, Francis Y. L. and Ye, Deshi and Zhang, Yong and Zhu, Hong (2006) Frequency Allocation Problems for Linear Cellular Networks. In: The 17th International Symposium on Algorithms and Computation, December 18-20, 2006, Kolkata, India.

Steiner, Sarah and Radzik, Tomasz (2006) Heuristic Enhancements to the k-best Method for Solving Biobjective Combinatorial Optimisation Problems. In: Operations Research Proceedings 2005, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Bremen, September 7-9, 2005.

Zheng, Feifeng and Fung, Stanley P. Y. and Chan, Wun-Tat and Chin, Francis Y. L. and Poon, Chung Keung and Wong, Prudence W. H. (2006) Improved On-Line Broadcast Scheduling with Deadlines. In: The 12th Annual International Computing and Combinatorics Conference, August 15-18, 2006, Taipei, Taiwan.

Chan, Man-Yee and Chan, Joseph Wun-Tat and Chin, Francis Y. L. and Fung, Stanley P. Y. and Kao, Ming-Yang (2006) Linear-Time Haplotype Inference on Pedigrees Without Recombinations. In: The 6th International Workshop on Algorithms in Bioinformatics, September 11-13, 2006, Zurich, Switzerland.

Crochemore, Maxime and Iliopoulos, Costas S. and Mohamed, Manal and Sagot, Marie-France (2006) Longest repeats with a block of k don't cares. Theoretical Computer Science, 362 (1-3). pp. 248-254.

Crochemore, Maxime and Iliopoulos, Costas S. and Mohamed, Manal and Sagot, Marie-France (2006) Longest Repeats with a Block of k Don't Cares. Theoretical Computer Science, 362 (1-3). pp. 248-254.

Chan, Wun-Tat and Lam, Tak Wah and Liu, Kin-Shing and Wong, Prudence W. H. (2006) New resource augmentation analysis of the total stretch of SRPT and SJF in multiprocessor scheduling. Theoretical Computer Science, 359 (1-3). pp. 430-439.

Chan, Wun-Tat and Wong, Prudence W. H. and Yung, Fencol C. C. (2006) On Dynamic Bin Packing: An Improved Lower Bound and Resource Augmentation Analysis. In: The 12th Annual International Computing and Combinatorics Conference , August 15-18, 2006, Taipei, Taiwan.

Chlebus, Bogdan S. and Kowalski, Dariusz R. and Radzik, Tomasz (2006) On Many-to-Many Communication in Packet Radio Networks. In: Principles of Distributed Systems, 10th International Conference,.

Sathiaseelan, Arjuna and Radzik, Tomasz (2006) Reorder notifying TCP (RN-TCP) with explicit packet drop notification (EPDN). Int. J. Communication Systems, 19 (6). pp. 659-678.

Baker, Paul and Harman, Mark and Steinhofel, Kathleen and Skaliotis, Alexandros (2006) Search Based Approaches to Component Selection and Prioritization for the Next Release Problem. In: 22nd IEEE International Conference on Software Maintenance (ICSM 2006), 24-27 September 2006, Philadelphia, Pennsylvania, USA.

Cooper, Colin and Klasing, Ralf and Radzik, Tomasz (2006) Searching for Black-Hole Faults in a Network Using Multiple Agents. In: Principles of Distributed Systems, 10th International Conference,.

Christodoulakis, Manolis and Iliopoulos, Costas S. and Ardila, Y. J. Pinzon (2006) Simple Algorithm for sorting the Fibonacci string rotations. In: SOFSEM 2006: Theory and Practice of Computer Science. Lecture Notes in Computer Science, 4009 2006 (3831). Springer, pp. 218-225.

Crochemore, Maxime and Lecroq, Thierry (2006) Text Searching and Indexing. In: Recent Advances in Formal Languages and Applications. Springer-Verlag, pp. 43-80.

Iliopoulos, Costas S. and Makris, C. and Panagis, Y. and Perdikuri, Katerina and Theodoridis, E. and Tsakalidis, A. (2006) The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications. Fundamenta Informaticae, 71 (2-3). pp. 259-277.

Iliopoulos, Costas S. and Perdikuri, Katerina and Tsakalidis, A. and Tsichlas, K. (2005) Algorithms for extracting structured motifs from biologically weighted sequences. In: Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA). (Unpublished)

Iliopoulos, Costas S. and Pickens, J. (2005) Markov Random Fields and Maximum Entropy Modeling for Music Information Retrieval. In: Proceedings of the 6th International Symposium on Music Information Retrieval.

Lee, I. and Iliopoulos, Costas S. (2005) Two simple heuristics for the pattern matching on weighted sequences. In: Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA).

Pisanti, Nadia and Crochemore, Maxime and Grossi, Roberto and Sagot, Marie-France (2005) A Comparative Study of Bases for Motif Inference. In: String Algorithmics.

Crochemore, Maxime and Désarménien, Jacques and Perrin, Dominique (2005) A note on the Burrows-Wheeler transformation. Theoretical Computer Science, 332 (1-3). pp. 567-572.

Cambouropoulos, Emilios and Crochemore, Maxime and Iliopoulos, Costas S. and Mohamed, Manal and Sagot, Marie-France (2005) A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories. In: Proceedings of the International Symposium on Music Information Retrieval (ISMIR'05).

Christodoulakis, M. and Iliopoulos, Costas S. and Park, K. and Sim, J. S. (2005) Approximate Seeds of Strings. Journal of Automata, Languages and Combinatorics, 10 (5/6). pp. 609-626.

Crochemore, Maxime and Hermelin, Danny and Landau, Gad M. and Vialette, Stéphane (2005) Approximating the 2-Interval Pattern Problem. In: ESA 2005: 13th Annual European Symposium.

Ardila, Yoan José Pinzón and Iliopoulos, Costas S. and Landau, Gad M. and Mohamed, Manal (2005) Approximation algorithm for the cyclic swap problem. In: Proceedings of the Prague Stringology Conference (PSC'05).

Pisanti, Nadia and Crochemore, Maxime and Grossi, Roberto and Sagot, Marie-France (2005) Bases of Motifs for Generating Repeated Patterns with Wild Cards. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2 (1). pp. 40-50.

Crochemore, Maxime and Iliopoulos, Costas and Navarro, Gonzalo and Pinzon, Yoan and Salinger, Alejandro (2005) Bit-parallel (delta,gamma)-matching and suffix automata. Journal of Discrete Algorithms, 3 (2-4). pp. 198-214.

Apostolico, Alberto and Crochemore, Maxime and Park, Kunsoo, eds. (2005) Combinatorial Pattern Matching. LNCS, 3537 . Springer-Verlag.

Chan, Wun-Tat and Lam, Tak Wah and Wong, Prudence W. H. (2005) Dynamic Bin Packing of Unit Fractions Items. In: The 32nd International Colloquium on Automata, Languages and Programming, July 11-15, 2005, Lisbon, Portugal.

Ardila, Yoan Jose Pinzon and Christodoulakis, Manolis and Iliopoulos, Costas S. and Mohamed, Manal (2005) Efficient (delta,gamma)-Matching with Don't Cares. In: Proceedings of the 16th Australasian Workshop on Combinatorial Algorithms (AWOCA).

Chan, Wun-Tat and Zhang, Yong and Fung, Stanley P. Y. and Ye, Deshi and Zhu, Hong (2005) Efficient Algorithms for Finding a Longest Common Increasing Subsequence. In: The 16th International Symposium on Algorithms and Computation, December 19-21, 2005, Sanya, Hainan, China.

Arikat, F. and Bakalis, A. and Christodoulakis, M. and Iliopoulos, Costas S. and Mouchard, Laurent (2005) Experimental Results in Pattern Matching on Weighted Sequences. In: Proceedings of the International Conference on Numerical Analysis and Applied Mathematics (ICNAAM'05).

Clifford, P. and Clifford, R. and Iliopoulos, Costas S. (2005) Faster algorithms for delta, gamma-matching and related problems. In: Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM'05).

Klasing, Ralf and Markou, Euripides and Radzik, Tomasz and Sarracco, Fabiano (2005) Hardness and Approximation Results for Black Hole Search in Arbitrary Graphs. In: Structural Information and Communication Complexity, 12th.

Christodoulakis, Manolis and Iliopoulos, Costas S. and Park, Kunsoo and Sim, J. S. (2005) Implementing Approximate Regularities. Mathematical and Computer Modelling, 42 (7-8).

Baeza-Yates, Ricardo and Crochemore, Maxime, eds. (2005) Indexing and Matching Strings. Elsevier.

Clifford, R. and Groult, R. and Iliopoulos, Costas S. and Byrd, D. (2005) Music Retrieval Algorithms for The Lead Sheet Problem. Journal of New Music Research, 34 (4). pp. 311-317.

Ardila, Yoan and Raphael, Clifford and Mohamed, Manal (2005) Necklace Swap Problem for Rhythmic Similarity Measures. In: SPIRE.

Chan, Wun-Tat and Lam, Tak Wah and Liu, Kin-Shing and Wong, Prudence W. H. (2005) New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling. In: The 30th International Symposium on Mathematical Foundations of Computer Science, August 29 - September 2, 2005, Gdansk, Poland.

Chan, Wun-Tat and Chin, Francis Y. L. and Zhang, Yong and Zhu, Hong and Shen, Hong and Wong, Prudence W. H. (2005) Off-Line Algorithms for Minimizing Total Flow Time in Broadcast Scheduling. In: The 11th Annual International Computing and Combinatorics Conference, August 16-29, 2005, Kunming, China.

Chlebus, Bogdan S. and Gasieniec, Leszek and Kowalski, Dariusz R. and Radzik, Tomasz (2005) On the Wake-Up Problem in Radio Networks. In: Automata, Languages and Programming, 32nd International.

Ye, Deshi and Chan, Wun-Tat and Chin, Francis Y. L. and Zhang, Guochuan and Zhang, Yong (2005) On-line Scheduling of Parallel Jobs on Two Machines. In: The 16th Australasian Workshop on Combinatorial Algorithms, September 18-21, 2005, Ballarat, Victoria, Australia.

Chan, Wun-Tat and Lam, Tak Wah and Ting, Hing-Fung and Wong, Prudence W. H. (2005) On-line Stream Merging with Max Span and Min Coverage. Theory of Computing Systems, 38 (4). pp. 461-479.

Chan, Wun-Tat and Chin, Francis Y. L. and Ye, Deshi and Zhang, Guochuan and Zhang, Yong (2005) Online Bin Packing of Fragile Objects with Application in Cellular Networks. In: The First International Workshop on Internet and Network Economics, December 15-17, 2005, Hong Kong, China.

Béal, Marie-Pierre and Crochemore, Maxime and Fici, Gabriele (2005) Presentations of constrained systems with unconstrained positions. IEEE Transactions on Information Theory, 51 (5). pp. 1891-1900.

Crochemore, Maxime and Landau, Gad M. and Schieber, Baruch and Ziv-Ukelson, Michal (2005) Re-Use Dynamic Programming for Sequence Alignment: An Algorithmic Toolkit. In: String Algorithmics.

Sathiaseelan, Arjuna and Radzik, Tomasz (2005) Robust TCP (TCP-R) with Explicit Packet Drop Notification (EPDN) for Satellite Networks. In: Networking - ICN 2005, 4th International Conference on Networking,.

Christodoulakis, M. and Iliopoulos, Costas S. and Pinzon, Yoan J. (2005) Simple Algorithm for Sorting All the Fibonacci String Rotations. In: Proceedings of the 32nd International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM).

Crochemore, Maxime (2005) Structures for indexes. In: Applied Combinatorics on Words. Cambridge University Press, pp. 106-163.

Cole, Richard and Iliopoulos, Costas S. and Mohamed, Manal and Smyth , W. F. and Yang, Lu (2005) The complexity of the minimum k-cover problem. Journal of Automata, Languages & Combinatorics, 10 (5). pp. 641-653. (In Press)

Ardila, Yoan Jose Pinzon and Christodoulakis, Manolis and Mohamed, Manal (2005) Wildcards in Delta-Matching. In: Franco-Canadian Workshop on Combinatorial Algorithms. (Unpublished)

Zhang, Hui and Guo, Qing and Iliopoulos, Costas S. (2004) String Matching with swaps in a Weighted Sequence. In: Proceedings of the First International Symposium on Computational and Information Sciences (CIS 04).

Lee, I. and Iliopoulos, Costas S. and Park, Kunsoo (2004) Linear time algorithm for the longest common repeat problem. In: Proceedings of the Eleventh Symposium on String Processing and Information Retrieval (SPIRE'04).

Iliopoulos, Costas S. and Perdikuri, Katerina and Theodoridis, E. and Tsakalidis, A. and Tsichlas, K. (2004) Motif Extraction from Weighted Sequences. In: Proceedings of the Eleventh Symposium on String Processing and Information Retrieval (SPIRE'04).

Iliopoulos, Costas S. and McHugh, J. A. M. and Peterlongo, Pierre and Pisanti, Nadia and Rytter, Wojciech and Sagot, Marie-France (2004) A First Approach to Finding Common Motifs with Gaps. International Journal of Foundations of Computer Science, 16 (6). pp. 1145-1154.

Iliopoulos, Costas S. and McHugh, J. A. M. and Peterlongo, Pierre and Pisanti, Nadia and Rytter, Wojciech and Sagot, Marie-France (2004) A First Approach to Finding Common Motifs with Gaps. In: Proceedings of the 2004 Prague Stringology Conference (PSC'04).

Crochemore, Maxime and Epifanio, Chiara and Grossi, Roberto and Mignosi, Filippo (2004) A trie-based approach for compacting automata. In: Combinatorial Pattern Matching.

Clifford, R. and Iliopoulos, Costas S. (2004) Approximate String Matching for Music Analysis. Soft Computing, 8 (9). pp. 597-603.

Iliopoulos, Costas S. and Pedikuri, K. and Zhang, H. (2004) Computing the regularities in biological weighted sequences. In: String Algorithmics. Texts in Algorithmics, 2 . King's College Publications, pp. 109-128.

Iliopoulos, Costas S. and Makris, C. and Panagis, Y. and Theodoridis, E. and Tsakalidis, A. (2004) Efficient Algorithms for Handling Molecular Weighted Sequences. Exploring New Frontiers of Theoretical Informatics, IFIP 18th World Computer Congress, TC1 3rd International Conference on Theoretical Computer Science (TCS2004) .

Clifford, R. and Iliopoulos, Costas S. and Park, K. (2004) Extending the Edit Distance for Musical Applications. In: Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms (AWOCA'04). (Unpublished)

Gasieniec, Leszek and Radzik, Tomasz and Xin, Qin (2004) Faster Deterministic Gossiping in Directed Ad Hoc Radio Networks. In: Algorithm Theory - SWAT 2004, 9th Scandinavian Workshop on Algorithm Theory, Humlebaek, Denmark, July 8-10, 2004, Proceedings.

Sathiaseelan, Arjuna and Radzik, Tomasz (2004) Improving the Performance of TCP in the Case of Packet Reordering. In: High Speed Networks and Multimedia Communications, 7th IEEE International Conference, HSNMC 2004, Toulouse, France, June 30 - July 2, 2004, Proceedings.

Radzik, Tomasz (2004) Improving time bounds on maximum generalised flow computations by contracting the network. Theor. Comput. Sci., 312 (1). pp. 75-97.

Crochemore, Maxime and Giancarlo, Raffaele and Sagot, Marie-France (2004) Longest Motifs with a Functionally Equivalent Block. In: Proc. 11th International Symposium on String Processing and Information Retrieval (SPIRE'2004).

Crochemore, Maxime and Iliopoulos, Costas~S. and Mohamed, Manal and Sagot, Marie-France (2004) Longest repeated motif with a block of don't cares. In: LATIN 2004: Theoretical Informatics.

Crochemore, Maxime and Iliopoulos, Costas S. and Mohamed, Manal and Sagot, Marie-France (2004) Longest Repeats with a Block of Don't Cares. In: LATIN.

Clifford, R. and Groult, R. and Iliopoulos, Costas S. and Byrd, R. (2004) Music retrieval algorithms for the lead sheet problem. In: Proceedings of the Sound and Music Computing International Conference 2004 (SMC'04). (Unpublished)

Iliopoulos, Costas S. and Mohamed, Manal and Smyth, W. F. (2004) New complexity results for the k-covers problem. In: Proceedings of the 15th Australasian Workshop on Combinatorial Algorithms (AWOCA'04).

Chan, Wun-Tat and Lam, Tak Wah and Ting, Hing-Fung and Wong, Prudence W. H. (2004) New Results on On-Demand Broadcasting with Deadline via Job Scheduling with Cancellation. In: The 10th Annual International Computing and Combinatorics Conference, August 17-20, 2004, Jeju Island, Korea.

Chan, Wun-Tat and Wong, Prudence W. H. (2004) On-Line Windows Scheduling of Temporary Items. In: The 15th International Symposium on Algorithms and Computation, December 20-22, 2004, Hong Kong, China.

Christodoulakis, M. and Iliopoulos, Costas S. and Mouchard, Laurent and Tsichlas, K. (2004) Pattern Matching on Weighted Sequences. In: Proceedings of the Algorithms and Computational Methods for Biochemical and Evolutionary Networks 2004 (CompBioNets'04).

Clifford, R. and Crawford, T. and Iliopoulos, Costas S. and Meredith, D. (2004) Problems in Computational Musicology. In: String Algorithmics. NATO Book series . King's College Publications.

Christodoulakis, M. and Iliopoulos, Costas S. and Tsichlas, K. and Perdikuri, Katerina (2004) Searching for Regularities in Weighted Sequences. In: Proc. of the International Conference of Computational Methods in Science and Engineering (ICCMSE), Lecture Series on Computer and Computational Sciences.

Iliopoulos, Costas S. and Perdikuri, Katerina and Tsichlas, K. (2004) The Pattern Matching Problem in Biological Weighted Sequences. In: Proceedings of the Third International Conference on FUN WITH ALGORITHMS (FUN 2004).

Amir, Amihood and Butman, Ayelet and Crochemore, Maxime and Landau, Gad M. and Schaps, Mary (2004) Two-dimensional Pattern Matching with Rotations. Theoretical Computer Science, 314 . pp. 173-187.

Christodoulakis, M. and Iliopoulos, Costas S. and Park, K. and Sim, J. S. (2003) Implementing Approximate Regularities. In: Proceedings of the International Conference on Computational Methods in Science and Engineering (ICCMSE2003).

Pisanti, Nadia and Crochemore, Maxime and Grossi, Roberto and Sagot, Marie-France (2003) A basis of tiling motifs for generating repeated patterns and its complexity for higher quorum. In: Mathematical Foundations of Computer Science (MFCS).

Crochemore, Maxime and Iliopoulos, Costas~S. and Navarro, Gonzalo and Pinzon, Yoan J. (2003) A bit-parallel suffix automaton approach for (delta,gamma)-matching in music retrieval. In: Proc. 10th International Symposium on String Processing and Information Retrieval (SPIRE'2003).

Crochemore, Maxime and Landau, Gad M. and Ziv-Ukelson, Michal (2003) A Sub-quadratic Sequence Alignment Algorithm for Unrestricted Cost Matrices. SIAM Journal of Computing, 32 (6). pp. 1654-1673.

Crochemore, Maxime and Hancart, Christophe and Lecroq, Thierry (2003) A unifying look at the Apostolico-Giancarlo string-matching algorithm. Journal of Discrete Algorithms, 1 (1). pp. 37-52.

Steinhofel, Kathleen and Albrecht, Andreas Alexander and Wong, C. K. (2003) An experimental analysis of local minima to improve neighbourhood search. Computers & OR, 30 (14). pp. 2157-2173.

Christodoulakis, M. and Iliopoulos, Costas S. and Park, K. and Sim, J. S. (2003) Approximate Seeds of Strings. In: Proceedings of the 2003 Prague Stringology Conference (PSC'03).

Baeza-Yates, Ricardo and Chávez, Edgar and Crochemore, Maxime, eds. (2003) Combinatorial Pattern Matching. LNCS, 2676 . Springer-Verlag.

Cole, Richard and Iliopoulos, Costas S. and Mohamed, Manal and Smyth, W. F. and Yang, Lu (2003) Computing the minimum k-cover of a string. In: Proceedings of the 2003 Prague Stringology Conference (PSC'03).

Iliopoulos, Costas S. and Mouchard, Laurent and Perdikuri, Katerina and Tsakalidis, Athanasios K. (2003) Computing the Repetitions in a Weighted Sequence. In: Proceedings of the 2003 Prague Stringology Conference (PSC'03).

Iliopoulos, Costas S. and Makris, C. and Panagis, I. and Perdikuri, Katerina and Theodoridis, E. and Tsakalidis, A. (2003) Computing the Repetitions in a Weighted Sequence using Weighted Suffix Trees. In: European Conference on Computational Biology.

Crochemore, Maxime and Melichar, Bovrivoj and Tron'ivcek, Zdenvek (2003) Directed Acyclic Subsequence Graph - Overview. Journal of Discrete Algorithms, 1 (3-4). pp. 255-280.

Chan, Wun-Tat and Chin, Francis Y. L. and Ting, Hing-Fung (2003) Escaping a Grid by Edge-Disjoint Paths. Algorithmica, 36 (4). pp. 343-359.

Lee, I. and Apostolico, Alberto and Iliopoulos, Costas S. and Park, K. (2003) Finding Approximate Occurrences of a Pattern That Contains Gaps. In: Proceedings of the 14th Australasian Workshop on Combinatorial Algorithms.

Béal, Marie-Pierre and Crochemore, Maxime and Mignosi, Filippo and Restivo, Antonio and Sciortino, Marinella (2003) Forbidden words of regular languages. Fundamenta Informaticae, 56 (1,2). pp. 121-135.

Crochemore, Maxime and Iliopoulos, Costas~S. and Lecroq, Thierry and Pinzon, Yoan J. and Plandowski, Wojciech and Rytter, Wojciech (2003) Occurrence and substring heuristics for delta-matching. Fundamenta Informaticae, 56 (1,2). pp. 1-21.

Cole, Richard and Iliopoulos, Costas S. and Lecroq, Thierry and Plandowski, Wojciech and Rytter, Wojciech (2003) On Special Families of Morphisms Related to delta-Matching and Don't Care Symbols. Information Processing Letters, 85 (5). pp. 227-233.

Holub, Jan and Crochemore, Maxime (2003) On the implementation of compact DAWG's. In: Implementation and Application of Automata.

Chan, Wun-Tat and Lam, Tak Wah and Ting, Hing-Fung and Wong, Prudence W. H. (2003) On-line stream merging in a general setting. Theoretical Computer Science, 296 (1). pp. 27-46.

Chan, Wun-Tat and Lam, Tak Wah and Ting, Hing-Fung and Wong, Prudence W. H. (2003) On-Line Stream Merging, Max Span, and Min Coverage. In: The 5th Italian Conference on Algorithms and Complexity, May 28-30, 2003, Rome, Italy.

Sathiaseelan, Arjuna and Radzik, Tomasz (2003) RD-TCP: Reorder Detecting TCP. In: High Speed Networks and Multimedia Communications, 6th IEEE International Conference HSNMC 2003, Estoril, Portugal, July 23-25, 2003, Proceedings.

Crochemore, Maxime (2003) Reducing space for index implementation. Theoretical Computer Science, 292 (1). pp. 185-197.

Crochemore, Maxime and Iliopoulos, Costas S. and Pinzon, Yoan J. (2003) Speeding-up Hirschberg and Hunt-Szymanski LCS algorithms. Fundamenta Informaticae, 56 (1,2). pp. 89-103.

Iliopoulos, Costas S. and Mohamed, Manal and Mouchard, Laurent and Perdikuri, Katerina and Smyth, William F. and Tsakalidis, Athanasios K. (2003) String Regularities with Don't Cares. Nordic Journal of Computing, 10 (1). pp. 40-51.

Na, Joong Chae and Apostolico, Alberto and Iliopoulos, Costas S. and Park, Kunsoo (2003) Truncated suffix trees and their application to data compression. Theoretical Computer Science, 304 (1-3). pp. 87-101.

Amir, Amihood and Butman, Ayelet and Crochemore, Maxime and Landau, Gad M. and Schaps, Malka (2003) Two-dimensional Pattern Matching with Rotations. In: Combinatorial Pattern Matching.

Pisanti, Nadia and Crochemore, Maxime and Grossi, Roberto and Sagot, Marie-France (2002) A Basis for Repeated Motifs in Pattern Discovery and Text Mining. Technical Report. Institut Gaspard-Monge.

Crochemore, Maxime and Landau, Gad M. and Ziv-Ukelson, Michal (2002) A Sub-quadratic Sequence Alignment Algorithm for Unrestricted Cost Matrices. In: Proceedings of the Thirteen Annual ACM-SIAM Symposium on Discrete Algorithms.

Chan, Wun-Tat and Lam, Tak Wah and Ting, Hing-Fung and Wong, Prudence W. H. (2002) A unified analysis of hot video schedulers. In: The 34th ACM Symposium on Theory of Computing, May 19-21, 2002, Montréal, Québec, Canada.

Albrecht, Andreas Alexander and Loomes, Martin J. and Steinhofel, Kathleen and Taupitz, Matthias (2002) Adaptive Simulated Annealing for CT Image Classification. IJPRAI, 16 (5). pp. 573-588.

Cambouropoulos, Emilios and Crochemore, Maxime and Iliopoulos, Costas S. and Mouchard, Laurent and Pinzon, Yoan J. (2002) Algorithms for computing approximate repetitions in musical sequences. International Journal of Computer Mathematics, 79 (11). pp. 1135-1148.

Crochemore, Maxime and Iliopoulos, Costas S. and Makris, C. and Rytter, Wojciech and Tsakalidis, A. and Tsichlas, K. (2002) Approximate string matching with gaps. Nordic Journal of Computing, 9 (1). pp. 54-65.

Albrecht, Andreas Alexander and Hein, Eike and Steinhofel, Kathleen and Taupitz, Matthias and Wong, C. K. (2002) Bounded-depth threshold circuits for computer-assisted CT image classification. Artificial Intelligence in Medicine, 24 (2). pp. 179-192.

Steinhofel, K. and Jr., C.F. Dewey and Janssens, D. and Macq, B. (2002) Classification of JPEG2000 Compressed CT Images. In: Proc. 4th Int. Conference on Digital Signal Processing.

Chan, Wun-Tat and Lam, Tak Wah and Ting, Hing-Fung and Wong, Prudence W. H. (2002) Competitive Analysis of On-line Stream Merging Algorithms. In: The 27th International Symposium on Mathematical Foundations of Computer Science, August 26-30, 2002, Warsaw, Poland.

Iliopoulos, Costas S. and Lemstrom, K. and Niyad, M. and Pinzon, Yoan J. (2002) Evolution of Musical Motifs in Polyphonic Passages. In: Symposium on AI and Creativity in Arts and Science, Proceedings of AISB'02. (Unpublished)

Iliopoulos, Costas S. and Kurokawa, M. (2002) Exact and Approximate Distributed Matching for Musical Melodic Recognition. In: Symposium on AI and Creativity in Arts and Science, Proceedings of AISB'02. (Unpublished)

Steinhofel, Kathleen and Albrecht, Andreas Alexander and Wong, Chak-Kuen (2002) Fast parallel heuristics for the job shop scheduling problem. Computers & OR, 29 (2). pp. 151-169.

Risler, Jean-Loup and Crochemore, Maxime and Konopka, Andrzej K. and Prum, Bernard and Rouzé, Pierre, eds. (2002) Genome and Informatics. Elsevier Science.

Iliopoulos, Costas S. and Makris, C. and Sioutas, S. and Tsakalidis, A. and Tsichlas, K. (2002) Identifying Occurrences of Maximal Pairs in Multiple Strings. In: Proceedings of Combinatorial Pattern Matching (CPM'02).

Crochemore, Maxime and Navarro, Gonzalo (2002) Improved antidictionary based compression. In: SCCC'02, Chilean Computer Science Society.

Radzik, Tomasz (2002) Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network. In: Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings.

Crochemore, Maxime and Rytter, Wojciech (2002) Jewels of Stringology. World Scientific Publishing, Hong-Kong.

Crochemore, Maxime and Tron'ivcek, Zdenvek (2002) On the size of DASG for multiple texts. In: String Processing and Information Retrieval, SPIRE'2002.

Daskalopulu, Aspassia and Iliopoulos, Costas S. and Mohamed, Manal (2002) On-Line Analysis and Validation of Partially Occluded Images: Implementation and Practice. International Journal of Computer Mathematics, 79 (12). pp. 1245-1257.

Crochemore, Maxime and Iliopoulos, Costas S. and Pinzon, Yoan J. (2002) Recovering an LCS in O(n<sup>2</sup>/w) time and space. Colombian Journal of Computation, 3 (1). pp. 41-52.

Pagourtzis, Aris and Penna, Paolo and Schlude, Konrad and Steinhofel, Kathleen and Taylor, David Scot and Widmayer, Peter (2002) Server Placements, Roman Domination and other Dominating Set Variants. In: Foundations of Information Technology in the Era of Networking and Mobile Computing, IFIP 17th Wolrld Congress, TC1 Stream, 2nd IFIP International Conference on Theoretical Computer Science, August 2002, Montreal, Quebec, Canada.

Iliopoulos, Costas S. and Kurokawa, M. (2002) String matching with Gaps for Musical Melodic Recognition. In: Proceedings of the 2002 Prague Stringology Conference (PSC'02).

Apostolico, Alberto and Crochemore, Maxime (2002) String pattern matching for a deluge survival kit. In: Handbook of Massive Data Sets. Kluwer Academic Publishers, pp. 151-194.

Iliopoulos, Costas S. and Mohamed, Manal and Mouchard, Laurent and Perdikuri, Katerina G. and Smyth , W. F. and Tsakalidis, Athanasios K. (2002) String regularities with don't cares. In: Proceedings of the 2002 Prague Stringology Conference 2002 (PSC'02).

Steinhofel, Kathleen and Albrecht, Andreas Alexander and Wong, C. K. (2002) The convergence of stochastic algorithms solving flow shop scheduling. Theor. Comput. Sci., 285 (1). pp. 101-117.

Crochemore, Maxime and Iliopoulos, Costas~S. and Lecroq, Thierry and Plandowski, Wojciech and Rytter, Wojciech (2002) Three Heuristics for delta-Matching: delta-BM Algorithms. In: Combinatorial Pattern Matching, CPM'2002.

Iliopoulos, Costas S. and Mohamed, Manal (2002) Validation and Decomposition of Partially Occluded Images. In: Proceedings of the 29th Software Seminar (Sofsem 2002)-Theory and Practice of Informatics.

Crochemore, Maxime and Iliopoulos, Costas S. and Pinzon, Yoan J. and Reid, J. F. (2001) A Fast and Practical Bit-Vector Algorithm for the Longest Common Subsequence Problem. Information Processing Letters, 80 (6). pp. 279-285.

Crochemore, Maxime and Iliopoulos, Costas S. and Pinzon, Yoan J. and Reid, James (2001) A fast and practical bit-vector algorithms for the longest common subsequence problem. Information Processing Letters, 80 (6). pp. 279-285.

Albrecht, Andreas Alexander and Loomes, Martin J. and Steinhofel, Kathleen and Taupitz, Matthias and Wong, Chak-Kuen (2001) A local search method for pattern classification. In: ESANN 2001, 9th European Symposium on Artificial Neural Networks, Bruges, Belgium, April 25-27, 2001, Proceedings.

Der, Uwe and Steinhofel, Kathleen (2001) A Parallel Implementation of a Job Shop Scheduling Heuristic. In: Applied Parallel Computing, New Paradigms for HPC in Industry and Academia, 5th International Workshop, PARA 2000 Bergen, Norway, June 18-20, 2000 Proceedings.

Crochemore, Maxime and Hancart, Christophe and Lecroq, Thierry (2001) Algorithmique du texte. Vuibert, France.

Chan, Wun-Tat and Lam, Tak Wah and Ting, Hing-Fung and Wong, Prudence W. H. (2001) An 5-competitive on-line scheduler for merging video streams. In: The 15th International Parallel & Distributed Processing Symposium (Workshop on Scheduling and Telecommunications), April 23-27, 2001, San Francisco, CA, USA.

Crawford, T. and Iliopoulos, Costas S. and Winder, R. and Yu, H. (2001) Approximate musical evolution. Computers and the Humanities, 35 (1). pp. 55-64.

Sim, J. S. and Iliopoulos, Costas S. and Park, K. and Smyth, W. F. (2001) Approximate periods of strings. Theoretical Computer Science, 262 (1). pp. 557-568.

Crochemore, Maxime and Iliopoulos, Costas S. and Lecroq, Thierry and Pinzon, Yoan J. (2001) Approximate String Matching in Musical Sequences. In: Proceedings of Prague Stringology Club Workshop (PSCW'01).

Crochemore, Maxime and Iliopoulos, Costas S. and Pinzon, Yoan J. (2001) Computing Evolutionary Chains in Musical Sequences. Electronic Journal of Combi­na­torics, 8 (2).

Crochemore, Maxime and Iliopoulos, Costas S. and Pinzon, Yoan J. (2001) Computing Evolutionary Chains in Musical Sequences. Electronic Journal of Combinatorics, 8 (2).

Albrecht, Andreas Alexander and Hein, Eike and Melzer, Daniela and Steinhofel, Kathleen and Taupitz, Matthias (2001) CT-Image Classification by Threshold Circuits. In: Bildverarbeitung fur die Medizin.

Iliopoulos, Costas S. and Reid, J. F. (2001) Decomposition of Partially Occluded Strings in the Presence of Errors. International Journal of Pattern Recognition and Artificial Intelligence, 15 (7). pp. 1129-1142.

Albrecht, Andreas Alexander and Hein, Eike and Steinhofel, Kathleen and Taupitz, Matthias and Wong, C. K. (2001) Depth-Four Threshold Circuits for Computer-Assisted X-ray Diagnosis. In: Artificial Intelligence Medicine, 8th Conference on AI in Medicine in Europe, AIME 2001, Cascais, Portugal, July 1-4, 2001, Proceedings.

Holub, J. and Iliopoulos, Costas S. and Melichar, B. and Mouchard, Laurent (2001) Distributed pattern matching using finite Automata. Journal of Automata, Languages and Combinatorics, 6 (2). pp. 191-204.

Allauzen, Cyril and Crochemore, Maxime and Raffinot, Mathieu (2001) Efficient Experimental String Matching by Weak Factor Recognition. In: CPM'2001, Combinatorial Pattern Matching.

Chan, Wun-Tat and Lam, Tak Wah and Ting, Hing-Fung and Wong, Prudence W. H. (2001) Improved On-Line Stream Merging: From a Restricted to a General Setting. In: The 7th Annual International Computing and Combinatorics Conference, August 20-23, 2001, Guilin, China.

Hromkovic, Juraj and Steinhofel, Kathleen and Widmayer, Peter (2001) Job Shop Scheduling with Unit Length Tasks: Bounds and Algorithms. In: Theoretical Computer Science, 7th Italian Conference, ICTCS 2001, Torino, Italy, October 4-6, 2001, Proceedings.

Albrecht, Andreas Alexander and Steinhofel, Kathleen and Taupitz, Matthias and Wong, C. K. (2001) Logarithmic simulated annealing for X-ray diagnosis. Artificial Intelligence in Medicine, 22 (3). pp. 249-260.

Iliopoulos, Costas S. and Simpson, J. (2001) On line validation and analysis of partially occluded images. Journal of Automata, Languages and Combinatorics, 6 (3). pp. 291-303.

Erlebach, Thomas and Gantenbein, Martin and Hurlimann, Daniel and Neyer, Gabriele and Pagourtzis, Aris and Penna, Paolo and Schlude, Konrad and Steinhofel, Kathleen and Taylor, David Scot and Widmayer, Peter (2001) On the Complexity of Train Assignment Problems. In: Algorithms and Computation, 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001, Proceedings.

Cambouropoulos, E. and Crawford, T. and Iliopoulos, C. S. (2001) Pattern processing in melodic sequences: challenges, caveats and prospects. Computers and the Humanities, 35 (1). pp. 9-21.

Cole, R. and Iliopoulos, Costas S. and Lecroq, Thierry and Plandowski, Wojciech and Rytter, Wojciech (2001) Relations between delta-matching and matching with don't care symbols: delta-distinguishing morphisms. In: Proceedings 12th Australasian Workshop on Combinatorial Algorithms.

Crochemore, Maxime and Iliopoulos, Costas S. and Pinzon, Yoan J. (2001) Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. In: Symposium on String Processing and Information Retrieval (SPIRE01).

Iliopoulos, Costas S. and Mouchard, Laurent and Pinzon, Yoan J. (2001) The Max-Shift Algorithm for Approximate String Matching. In: Proceedings of the Workshop on Algorithm Engineering (WAE'01).

Chan, Wun-Tat and Chin, Francis Y. L. (2000) Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids. Journal of Algorithms, 34 (2). pp. 337-369.

This list was generated on Tue Sep 30 16:04:12 2014 BST.