Search

This book constitutes the refereed post-conference proceedings on Learning and Intelligent Optimization, LION 14, held in Athens, Greece, in May 2020. The 37 full papers presented together with one invited paper have been carefully reviewed and selected from 75 submissions. LION deals with designing and engineering ways of'learning'about the performance of different techniques, and ways of using past experience about the algorithm behavior to improve performance in the future. Intelligent learning schemes for mining the knowledge obtained online or offline can improve the algorithm design process and simplify the applications of high-performance optimization methods. Combinations of different algorithms can further improve the robustness and performance of the individual components. Due to the COVID-19 pandemic, LION 14 was not held as a physical meeting.

This volume constitutes the post- conference proceedings of the 7th International Conference on Variable Neighborhood Search, ICVNS 2019, held in Rabat, Morocco, in October 2019. The 13 full papers presented in this volume were carefully reviewed and selected from 46 submissions. The papers describe recent advances in methods and applications of variable neighborhood search.

This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Conference on Finite Difference Methods, FDM 2014, held in Lozenetz, Bulgaria, in June 2014.The 36 revised full papers were carefully reviewed and selected from 62 submissions. These papers together with 12 invited papers cover topics such as finite difference and combined finite difference methods as well as finite element methods and their various applications in physics, chemistry, biology and finance.

This book constitutes the refereed conference proceedings of the 15th International Conference, ACG 2017, held in Leiden, The Netherlands, in July 2017.The 19 revised full papers were selected from 23 submissions and cover a wide range of computer games. They are grouped in four classes according to the order of publication: games and puzzles, go and chess, machine learning and MCTS, and gaming.

This book constitutes the thoroughly refereed post-conference proceedings of the 20th International Symposium on Graph Drawing, GD 2012, held in Redmond, WA, USA, in September 2012. The 42 revised full papers presented together with 4 revised short papers and 8 poster descriptions were carefully reviewed and selected from 92 submissions. They cover a wide range of topics in two main tracks: combinatorial and algorithmic aspects, and visualization systems and interfaces. In addition, reports of the 19th Annual Graph Drawing Contest, which was held during the conference, and of a workshop on theory and practice of graph drawing to celebrate Professor Peter Eades'60th birthday are included in the volume.

This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Conference on Computers and Games, CG 2013, held in Yokohama, Japan, in August 2013, in conjunction with the 17th Computer and Games Tournament and the 20th World Computer-Chess Championship. The 21 papers presented were carefully reviewed and selected for inclusion in this book. They cover a wide range of topics which are grouped into five classes: Monte Carlo Tree Search and its enhancements; solving and searching; analysis of game characteristic; new approaches; and serious games.

These are the proceedings of the Workshop on Sequences, Subsequences, and Consequences that was held at the University of Southern California (USC), May 31 - June 2, 2007. There were three one-hour Keynote lectures, 16 invited talks of up to 45 minutes each, and 1 “contributed” paper. The theory of sequences from discrete symbol alphabets has found practical applications in many areas of coded communications and in cryptography, - cluding: signal patterns for use in radar and sonar; spectral spreading sequences for CDMA wireless telephony; key streams for direct sequence stream-cipher cryptography; and a variety of forward-error-correctingcodes. The workshopwasdesigned to bring leading researcherson “sequences”from aroundtheworldtopresenttheirlatestresults,interchangeinformationwithone another, and especially to inform the larger audience of interested participants, includingfaculty,researchers,scholars,andstudentsfromnumerousinstitutions, as well as the readers of these proceedings, about recent developments in this important?eld. There were invited speakers from Canada, China, Germany, India, Israel, Norway, Puerto Rico, and South Korea, in addition to those from the USA. Support for the workshop was generously provided by the O?ce of the Dean of the Viterbi School of Engineering, by the Center for Communications Research (CCR-La Jolla), and by the United States National Science Foundation (NSF). This support is hereby gratefully acknowledged.

This book constitutes the proceedings of the 49th International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2024, held in Cochem, Germany, in February 2024. The 33 full papers presented in this book were carefully reviewed and selected from 81 submissions. The book also contains one invited talk in full paper length. They focus on original research and challenges in foundations of computer science including algorithms, AI-based methods, computational complexity, and formal models.

This book constitutes the proceedings of the 19th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2020, held in Novosibirsk, Russia, in July 2020. The 31 full papers presented in this volume were carefully reviewed and selected from 102 submissions. The papers are grouped in these topical sections: discrete optimization; mathematical programming; game theory; scheduling problem; heuristics and metaheuristics; and operational research applications.

This book constitutes the refereed proceedings of the 20th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2020, held as part of Evo•2020, in Seville, Spain, in April 2020, co-located with the Evo•2020 events EuroGP, EvoMUSART and EvoApplications.The 14 full papers presented in this book were carefully reviewed and selected from 37 submissions. The papers cover a wide spectrum of topics, ranging from the foundations of evolutionary computation algorithms and other search heuristics, to their accurate design and application to combinatorial optimization problems.

This book constitutes the refereed proceedings of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017, held in Bordeaux, France, in September 2017. The 29 revised full papers and 5 invited papers presented were carefully reviewed and selected from 99 submissions. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.

This volume constitutes the thoroughly refereed proceedings of the 22nd IFIP WG 1.5International Workshop on Cellular Automata and Discrete ComplexSystems, AUTOMATA 2016, held in Zurich, Switzerland, in June 2016.This volume contains 3 invited talks in full-paper length and 12 regularpapers, which were carefully reviewed and selected from a total of 23submissions. The papers feature research on all fundamental aspects of cellular automata and related discrete complex systems and deal with the following topics: dynamical, topological, ergodic and algebraic aspects; algorithmic and complexity issues; emergent properties; formal language processing; symbolic dynamics; models of parallelism and distributed systems; timing schemes; phenomenological descriptions; scientific modeling; and practical applications.

This book constitutes the refereed proceedings of the 22nd International Conference on Computing and Combinatorics, COCOON 2016, held in Ho Chi Minh City, Vietnam, in August 2016. The 50 revised full papers papers presented in this book were carefully reviewed and selected from various submissions. The papers cover various topics including: Theory and Algorithms; Parameterized Complexity and Algorithms; Database and Data Structures; Computational Complexity; Approximation Algorithms; Cryptography; Network and Algorithms; Graph Theory and Algorithms; Computational Geometry; Scheduling Algorithms and Circuit Complexity; Computational Geometry and Computational Biology; and Logic, Algebra and Automata.

This book constitutes the refereed proceedings of the 20th International Symposium on Fundamentals of Computation Theory, FCT 2015, held in Gdańsk, Poland, in August 2015. The 27 revised full papers presented were carefully reviewed and selected from 60 submissions. The papers cover topics in three main areas: algorithms, formal methods, and emerging fields and are organized in topical sections on geometry, combinatorics, text algorithms; complexity and Boolean functions; languages; set algorithms, covering, and traversal; graph algorithms and networking applications; anonymity and indistinguishability; graphs, automata, and dynamics; and logic and games.

This book constitutes the refereed proceedings of the 21st International Conference on Computing and Combinatorics, COCOON 2015, held in Beijing, China, in August 2015. The 49 revised full papers and 11 shorter papers presented were carefully reviewed and selected from various submissions. The papers cover various topics including algorithms and data structures; algorithmic game theory; approximation algorithms and online algorithms; automata, languages, logic and computability; complexity theory; computational learning theory; cryptography, reliability and security; database theory, computational biology and bioinformatics; computational algebra, geometry, number theory, graph drawing and information visualization; graph theory, communication networks, optimization and parallel and distributed computing.

The two-volume set LNCS 9134 and LNCS 9135 constitutes the refereed proceedings of the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, held in Kyoto, Japan, in July 2015. The 143 revised full papers presented were carefully reviewed and selected from 507 submissions. The papers are organized in the following three tracks: algorithms, complexity, and games; logic, semantics, automata, and theory of programming; and foundations of networked computation: models, algorithms, and information management.

The two-volume set LNCS 9134 and LNCS 9135 constitutes the refereed proceedings of the 42nd International Colloquium on Automata, Languages and Programming, ICALP 2015, held in Kyoto, Japan, in July 2015. The 143 revised full papers presented were carefully reviewed and selected from 507 submissions. The papers are organized in the following three tracks: algorithms, complexity, and games; logic, semantics, automata and theory of programming; and foundations of networked computation: models, algorithms and information management.

This volume constitutes the thoroughly refereed proceedings of the 21st International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2015, held in Turku, Finland, in June 2015. This volume contains 4 invited talks in full-paper length and 15 regular papers, which were carefully reviewed and selected from a total of 33 submissions. Topics of interest include, the following aspects and features of such systems: dynamical, topological, ergodic and algebraic aspects; algorithmic and complexity issues; emergent properties; formal language processing aspects; symbolic dynamics; models of parallelism and distributed systems; timing schemes; phenomenological descriptions; scientific modeling; and practical applications.

The two-volume set LNCS 9562 and LNCS 9563 constitutes the refereedproceedings of the 13th International Conference on Theory ofCryptography, TCC 2016, held in Tel Aviv, Israel, in January 2016.The 45 revised full papers presented were carefully reviewed andselected from 112 submissions. The papers are organized in topicalsections on obfuscation, differential privacy, LWR and LPN, public key encryption, signatures, and VRF, complexity of cryptographic primitives, multiparty computation, zero knowledge and PCP, oblivious RAM, ABE and IBE, and codes and interactive proofs. The volume also includes an invited talk on cryptographic assumptions.

The two-volume set LNCS 9562 and LNCS 9563 constitutes the refereedproceedings of the 13th International Conference on Theory ofCryptography, TCC 2016, held in Tel Aviv, Israel, in January 2016.The 45 revised full papers presented were carefully reviewed andselected from 112 submissions. The papers are organized in topicalsections on obfuscation, differential privacy, LWR and LPN, public key encryption, signatures, and VRF, complexity of cryptographic primitives, multiparty computation, zero knowledge and PCP, oblivious RAM, ABE and IBE, and codes and interactive proofs. The volume also includes an invited talk on cryptographic assumptions.

This two-volume set of LNCS 8572 and LNCS 8573 constitutes the refereed proceedings of the 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Semantics, Automata, and Theory of Programming, Foundations of Networked Computation.

This two-volume set of LNCS 8572 and LNCS 8573 constitutes the refereed proceedings of the 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Semantics, Automata, and Theory of Programming, Foundations of Networked Computation.

This book constitutes the refereed proceedings of the 18th International Conference on Principles of Distributed Systems, OPODIS 2014, Cortina d'Ampezzo, Italy, in December 2014. The 32 papers presented together with two invited talks were carefully reviewed and selected from 98 submissions. The papers are organized in topical sections on consistency; distributed graph algorithms; fault tolerance; models; radio networks; robots; self-stabilization; shared data structures; shared memory; synchronization and universal construction.

This book constitutes the refereed proceedings of the 20th International Conference on Computing and Combinatorics, COCOON 2014, held in Atlanta, GA, USA, in August 2014. The 51 revised full papers presented were carefully reviewed and selected from 110 submissions. There was a co-organized workshop on computational social networks (CSoNet 2014) where 8 papers were accepted. The papers cover the following topics: sampling and randomized methods; logic, algebra and automata; database and data structures; parameterized complexity and algorithms; computational complexity; computational biology and computational geometry; approximation algorithm; graph theory and algorithms; game theory and cryptography; scheduling algorithms and circuit complexity and CSoNet.

With the rapid growth of bandwidth demand from network users and the advances in optical technologies, optical networks with multiterabits­ per-second capacity has received significant interest from both researchers and practitioners. Optical networks deployment raises a number of challenging problems that require innovative solutions, including net­ work architectures, scalable and fast network management, resource­ efficient routing and wavelength assignment algorithms, QoS support and scheduling algorithms, and switch and router architectures. In this book, we put together some important developments in this exiting area during last several years. Some of the articles are research papers and some are surveys. All articles were reviewed by two reviewers. The paper,'On Dynamic Wavelength Assignment in WDM Optical Networks,'by Alanyali gives an overview of some issues in the analy­ sis and synthesis of dynamic wavelength assignment policies for optical WDM networks and illustrates a new method of analysis. The paper by Ellinas and Bala,'Wavelength Assignment Algorithms for WDM Ring Architectures,'presents two optimal wavelength assignment algorithms that assign the minimum number of wavelengths between nodes on WDM rings to achieve full mesh connectivity. In the paper,'Optimal Placement of Wavelength Converters in WDM Networks for Parallel and Distributed Computing Systems,'Jia et al.

This book constitutes the refereed proceedings of the 19th International Conference on Computing and Combinatorics, COCOON 2013, held in Hangzhou, China, in June 2013. The 56 revised full papers presented were carefully reviewed and selected from 120 submissions. There was a co-organized workshop on discrete algorithms of which 8 short papers were accepted and a workshop on computational social networks where 12 papers out of 25 submissions were accepted.

This book constitutes the refereed proceedings of the 17th International Conference on Principles of Distributed Systems, OPODIS 2013, held in Nice, France, in December 2013. The 19 papers presented together with two invited talks were carefully reviewed and selected from 41 submissions. The conference is an international forum for the exchange of state-of-the-art knowledge on distributed computing and systems. Papers were sought soliciting original research contributions to the theory, specification, design and implementation of distributed systems.

This book constitutes the proceedings of the 10th Latin American Symposium on Theoretical Informatics, LATIN 2012, held in Arequipa, Peru, in April 2012. The 55 papers presented in this volume were carefully reviewed and selected from 153 submissions. The papers address a variety of topics in theoretical computer science with a certain focus on algorithms, automata theory and formal languages, coding theory and data compression, algorithmic graph theory and combinatorics, complexity theory, computational algebra, computational biology, computational geometry, computational number theory, cryptography, theoretical aspects of databases and information retrieval, data structures, networks, logic in computer science, machine learning, mathematical programming, parallel and distributed computing, pattern matching, quantum computing and random structures.

This book constitutes the refereed proceedings of the 6th International Workshop on Internet and Network Economics, WINE 2010, held in Stanford, USA, in December 2010. The 52 revised full papers presented were carefully reviewed and selected from 95 submissions. The papers are organized in 33 regular papers and 19 short papers.

This volume contains papers selected for presentation during the 24th Interna­ tional Symposium on Mathematical Foundations of Computer Science held on September 6-10, 1999 in Szklarska Por^ba, Poland. The symposium, organized alternately in the Czech Republic, Slovakia, and Poland, focuses on theoretical aspects and mathematical foundations of computer science. The scientific program of the symposium consists of five invited talks given by Martin Dyer, Dexter Kozen, Giovanni Manzini, Sergio Rajsbaum, and Mads Tofte, and 37 accepted papers chosen out of 68 submissions. The volume contains all accepted contributed papers, and three invited papers. The contributed papers have been selected for presentation based on their scientific quality, novelty, and interest for the general audience of MFCS par­ ticipants. Each paper has been reviewed by at least three independent referees — PC members and/or sub-referees appointed by them. The papers were se­ lected for presentation during a fully electronic virtual meeting of the program committee on May 7, 1999. The virtual PC meeting was supported by software written by Artur Zgoda, Ph.D. student at the University of Wroclaw. The entire communication and access to quite a sensitive database at PC headquarters in Wroclaw was secured by cryptographic protocols based on technology of certificates.

This book constitutes the refereed proceedings of the 18th International Symposium on Algorithms and Computation, ISAAC 2007, held in Sendai, Japan, in December 2007. The 77 revised full papers presented together with two invited talks were carefully reviewed and selected from 220 submissions. The papers included topical sections on graph algorithms, computational geometry, complexity, graph drawing, distributed algorithms, optimization, data structure, and game theory.

This book constitutes the refereed proceedings of the 5th International Workshop on Algorithms and Models for the Web-Graph, WAW 2007, held in San Diego, CA, USA, in December 2007 - colocated with WINE 2007, the Third International Workshop on Internet and Network Economics. The 13 revised full papers and five revised short papers presented were carefully reviewed and selected from a large pool of submissions for inclusion in the book. The papers address a wide variety of topics.

This book constitutes the proceedings of the 16th Latin American Symposium on Theoretical Informatics, LATIN 2042, which took place in Puerto Varas, Chile, in March 2024. The 44 papers presented in this volume were carefully reviewed and selected from 93 submissions. They were organized in topical sections as follows:Part I: Algorithms and Data Structures; Approximation and Online Algorithms; Complexity Theory; Part II: Combinatorics and Graph Theory; Parameterized Algorithms; Automata Theory and Formal Languages; and Game Theory and Fairness.

This book constitutes the proceedings of the 16th Latin American Symposium on Theoretical Informatics, LATIN 2042, which took place in Puerto Varas, Chile, in March 2024. The 44 papers presented in this volume were carefully reviewed and selected from 93 submissions. They were organized in topical sections as follows:Part I: Algorithms and Data Structures; Approximation and Online Algorithms; Complexity Theory; Part II: Combinatorics and Graph Theory; Parameterized Algorithms; Automata Theory and Formal Languages; and Game Theory and Fairness.

ANTS – The International Workshop on Ant Colony Optimization and Swarm Intelligence is now at its?fth edition. The series started in 1998 with the - ganization of ANTS 1998. At that time the goal was to gather in a common meeting those researchers interested in ant colony optimization: more than 50 researchers from around the world joined for the?rst time in Brussels, Belgium, to discuss ant colony optimization and swarm intelligence related research. A selectionofthebest paperspresentedatthe workshopwaspublished asa special issue of the Future Generation Computer Systems journal (Vol. 16, No. 8, 2000). Two years later, ANTS 2000, organized again in Brussels, attracted more than 70 participants. The 41 extended abstracts presented as talks or posters at the workshopwere collected in a booklet distributed to participants, and a selection of the best papers was published as a special section of the IEEE Transactions on Evolutionary Computation (Vol. 6, No. 4, 2002). After these?rst two successful editions, it was decided to make of ANTS a seriesofbiannualeventswitho?cialworkshopproceedings.Thethirdandfourth editions were organized in September 2002 and September 2004, respectively. Proceedings were published by Springer within the Lecture Notes in Computer Science (LNCS) series. The proceedings of ANTS 2002, LNCS Volume 2463, contained 36 contri- tions: 17 full papers, 11 short papers, and 8 extended abstracts,selected out of a total of 52 submissions. Those of ANTS 2004, LNCS Volume 3172, contained 50 contributions:22 full papers, 19 shortpapers, and 9 extended abstracts,selected out of a total of 79 submissions.

This book presents the refereed proceedings of the 12th Annual International Computing and Combinatorics Conference, COCOON 2006, held in Taipei, Taiwan, August 2006. The book offers 52 revised full papers presented together with abstracts of 2 invited talks. The papers are organized in topical sections on computational economics, finance, and management, graph algorithms, computational complexity and computability, quantum computing, computational biology and medicine, computational geometry, graph theory, and more.

This book constitutes the proceedings of the 15th Latin American Symposium on Theoretical Informatics, LATIN 2022, which took place in Guanajuato, Mexico, in November 2022. The 46 papers presented in this volume were carefully reviewed and selected from 114 submissions. They were organized in topical sections as follows: Algorithms and Data Structures; Approximation Algorithms; Cryptography; Social Choice Theory; Theoretical Machine Learning; Automata Theory and Formal Languages; Combinatorics and Graph Theory; Complexity Theory; Computational Geometry.Chapter “Klee's Measure Problem Made Oblivious” is available open access under a CC BY 4.0 license.

The mathematical theory and practice of cryptography and coding underpins the provision of effective security and reliability for data communication, processing, and storage. Theoretical and implementational advances in the fields of cryptography and coding are therefore a key factor in facilitating the growth of data communications and data networks of various types. Thus, this Eight International Conference in an established and successful IMA series on the theme of “Cryptography and Coding” was both timely and relevant. The theme of this conference was the future of coding and cryptography, which was touched upon in presentations by a number of invited speakers and researchers. The papers that appear in this book include recent research and development in error control coding and cryptography. These start with mathematical bounds, statistical decoding schemes for error correcting codes, and undetected error probabilities and continue with the theoretical aspects of error correction coding such as graph and trellis decoding, multifunctional and multiple access communication systems, low density parity check codes, and iterative decoding. These are followed by some papers on key recovery attack, authentication, stream cipher design, and analysis of ECIES algorithms, and lattice attacks on IP based protocols.

Concurrency and distribution have become the dominant paradigm and concern in computer science. Despite the fact that much of the early research in object-oriented programming focused on sequential systems, objects are a natural unit of distribution and concurrency - as elucidated early on by research on the Actor model. Thus, models and theories of concurrency, the oldest one being Petri nets, and their relation to objects are an attractive topic of study.This book presents state-of-the-art results on Petri nets and concurrent object-oriented programming in a coherent and competent way. The 24 thoroughly reviewed and revised papers are organized in three sections. The first consists of long papers, each presenting a detailed approach to integrating Petri nets and object-orientation. Section II includes shorter papers with emphasis on concrete examples to demonstrate the approach. Finally, section III is devoted to papers which significantly build on the Actor model of computation.

The abstracts and papers in this volume were presented at the Fifth Annual International Computing and Combinatorics Conference (COCOON'99), which was held in Tokyo, Japan from July 26 to 28, 1999. The topics cover most aspects of theoretical computer science and combinatorics pertaining to computing. In response to the call for papers, 88 high-quality extended abstracts were submitted internationally, of which 46 were selected for presentation by the p- gram committee. Every submitted paper was reviewed by at least three program committee members. Many of these papers represent reports on continuing - search, and it is expected that most of them will appear in a more polished and complete form in scienti c journals. In addition to the regular papers, this v- ume contains abstracts of two invited plenary talks by Prabhakar Raghavan and Seinosuke Toda. The conference also included a special talk by Kurt Mehlhorn on LEDA (Library of E cient Data types and Algorithms). The Hao Wang Award (inaugurated at COCOON'97) is given to honor the paper judged by the program committee to have the greatest scienti c merit. The recipients of the Hao Wang Award 1999 were Hiroshi Nagamochi and Tos- hide Ibaraki for their paper \An Approximation for Finding a Smallest 2-Edge- Connected Subgraph Containing a Speci ed Spanning Tree'.

The ninth in the series of IMA Conferences on Cryptography and Coding was held (as ever) at the Royal Agricultural College, Cirencester, from 16–18 Dec- ber 2003. The conference's varied programme of 4 invited and 25 contributed papers is represented in this volume. The contributed papers were selected from the 49 submissions using a - reful refereeing process. The contributed and invited papers are grouped into 5 topics: coding and applications; applications of coding in cryptography; cryp- graphy; cryptanalysis; and network security and protocols. These topic headings represent the breadth of activity in the areas of coding, cryptography and c- munications, and the rich interplay between these areas. Assemblingtheconferenceprogrammeandthisproceedingsrequiredthehelp of many individuals. I would like to record my appreciation of them here. Firstly, I would like to thank the programme committee who aided me - mensely by evaluating the submissions, providing detailed written feedback for the authors of many of the papers, and advising me at many critical points - ring the process. Their help and cooperation was essential, especially in view of the short amount of time available to conduct the reviewing task. The c- mittee this year consisted of Mike Darnell, Mick Ganley, Bahram Honary, Chris Mitchell, Matthew Parker, Nigel Smart and Mike Walker.

This two-volume set LNCS 12269 and LNCS 12270 constitutes the refereed proceedings of the 16th International Conference on Parallel Problem Solving from Nature, PPSN 2020, held in Leiden, The Netherlands, in September 2020. The 99 revised full papers were carefully reviewed and selected from 268 submissions. The topics cover classical subjects such as automated algorithm selection and configuration; Bayesian- and surrogate-assisted optimization; benchmarking and performance measures; combinatorial optimization; connection between nature-inspired optimization and artificial intelligence; genetic and evolutionary algorithms; genetic programming; landscape analysis; multiobjective optimization; real-world applications; reinforcement learning; and theoretical aspects of nature-inspired optimization.

This book constitutes the proceedings of the 17th International Workshop on Algorithms and Models for the Web Graph, WAW 2020, held in Warsaw, Poland, in September 2020. The 12 full papers presented in this volume were carefully reviewed and selected from 19 submissions. The aim of the workshop was to further the understanding of graphs that arise from the Web and various user activities on the Web, and stimulate the development of high-performance algorithms and applications that exploit these graphs.Due to the corona pandemic the conference was postponed from June 2020 to September 2020.

The LNCS journal Transactions on Computational Science reflects recent developments in the field of Computational Science, conceiving the field not as a mere ancillary science but rather as an innovative approach supporting many other scientific disciplines. The journal focuses on original high-quality research in the realm of computational science in parallel and distributed environments, encompassing the facilitating theoretical foundations and the applications of large-scale computations and massive data processing. It addresses researchers and practitioners in areas ranging from aerospace to biochemistry, from electronics to geosciences, from mathematics to software architecture, presenting verifiable computational methods, findings, and solutions, and enabling industrial users to apply techniques of leading-edge, large-scale, high performance computational methods. This, the 27th issue of the Transactions on Computational Science journal, is devoted to the topic ofhigh-performance computing. It contains eight full papers, covering the areas of cloud middleware, multi-processor systems, quantum computing, optimization, and secure biometric-based encryption methods.

This two-volume set of LNCS 7965 and LNCS 7966 constitutes the refereed proceedings of the 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, held in Riga, Latvia, in July 2013. The total of 124 revised full papers presented were carefully reviewed and selected from 422 submissions. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation.

This two-volume set of LNCS 7965 and LNCS 7966 constitutes the refereed proceedings of the 40th International Colloquium on Automata, Languages and Programming, ICALP 2013, held in Riga, Latvia, in July 2013. The total of 124 revised full papers presented were carefully reviewed and selected from 422 submissions. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation.

This two-volume set of LNCS 7391 and LNCS 7392 constitutes the refereed proceedings of the 39th International Colloquium on Automata, Languages and Programming, ICALP 2012, held in Warwick, UK, in July 2012. The total of 123 revised full papers presented in this volume were carefully reviewed and selected from 432 submissions. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation.

The three-volume set LNCS 6675, 6676 and 6677 constitutes the refereed proceedings of the 8th International Symposium on Neural Networks, ISNN 2011, held in Guilin, China, in May/June 2011. The total of 215 papers presented in all three volumes were carefully reviewed and selected from 651 submissions. The contributions are structured in topical sections on computational neuroscience and cognitive science; neurodynamics and complex systems; stability and convergence analysis; neural network models; supervised learning and unsupervised learning; kernel methods and support vector machines; mixture models and clustering; visual perception and pattern recognition; motion, tracking and object recognition; natural scene analysis and speech recognition; neuromorphic hardware, fuzzy neural networks and robotics; multi-agent systems and adaptive dynamic programming; reinforcement learning and decision making; action and motor control; adaptive and hybrid intelligent systems; neuroinformatics and bioinformatics; information retrieval; data mining and knowledge discovery; and natural language processing.

The three-volume set LNCS 6675, 6676 and 6677 constitutes the refereed proceedings of the 8th International Symposium on Neural Networks, ISNN 2011, held in Guilin, China, in May/June 2011. The total of 215 papers presented in all three volumes were carefully reviewed and selected from 651 submissions. The contributions are structured in topical sections on computational neuroscience and cognitive science; neurodynamics and complex systems; stability and convergence analysis; neural network models; supervised learning and unsupervised learning; kernel methods and support vector machines; mixture models and clustering; visual perception and pattern recognition; motion, tracking and object recognition; natural scene analysis and speech recognition; neuromorphic hardware, fuzzy neural networks and robotics; multi-agent systems and adaptive dynamic programming; reinforcement learning and decision making; action and motor control; adaptive and hybrid intelligent systems; neuroinformatics and bioinformatics; information retrieval; data mining and knowledge discovery; and natural language processing.