Computing and Software Science


Book Description

The papers of this volume focus on the foundational aspects of computer science, the thematic origin and stronghold of LNCS, under the title “Computing and Software Science: State of the Art and Perspectives”. They are organized in two parts: The first part, Computation and Complexity, presents a collection of expository papers on fashionable themes in algorithmics, optimization, and complexity. The second part, Methods, Languages and Tools for Future System Development, aims at sketching the methodological evolution that helps guaranteeing that future systems meet their increasingly critical requirements. Chapter 3 is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.




SOFSEM 2017: Theory and Practice of Computer Science


Book Description

This book constitutes the refereed proceedings of the 43rd International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017, held in Limerick, Ireland, in January 2017. The 34 papers presented in this volume were carefully reviewed and selected from 41 submissions. They were organized in topical sections named: foundations in computer science; semantics, specification and compositionality; theory of mobile and distributed systems; verification and automated system analysis; petri nets, games and relaxed data structures; graph theory and scheduling algorithms; quantum and matrix algorithms; planar and molecular graphs; coloring and vertex covers; algorithms for strings and formal languages; data, information and knowledge engineering; and software engineering: methods, tools, applications.




Algorithms and Data Structures


Book Description

This book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Data Structures, WADS 2021, held in virtually in August 2021. The 47 full papers, presented together with two invited lectures, were carefully reviewed and selected from a total of 123 submissions. They present original research on the theory, design and application of algorithms and data structures.




Algorithms and Complexity


Book Description

This book constitutes the refereed conference proceedings of the 8th International Conference on Algorithms and Complexity, CIAC 2013, held in Barcelona, Spain, during May 22-24, 2013. The 31 revised full papers presented were carefully reviewed and selected from 75 submissions. The papers present current research in all aspects of computational complexity and the use, design, analysis and experimentation of efficient algorithms and data structures.




Graph-Theoretic Concepts in Computer Science


Book Description

This book constitutes the thoroughly refereed proceedings of the 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012) held in Jerusalem, Israel on June 26-28, 2012. The 29 revised full papers presented were carefully selected and reviewed from 78 submissions. The papers are solicited describing original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, randomized, parameterized, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, random graphs, diagram methods, and support of these concepts by suitable implementations. The scope of WG includes all applications of graph-theoretic concepts in Computer Science, including data structures, data bases, programming languages, computational geometry, tools for software construction, communications, computing on the web, models of the web and scale-free networks, mobile computing, concurrency, computer architectures, VLSI, artificial intelligence, graphics, CAD, operations research, and pattern recognition




Combinatorial Algorithms


Book Description

This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and selected from a total of 91 submissions. The papers are organized in topical sections on algorithms on graphs; algorithms on strings; discrete geometry and satisfiability.




Computing and Combinatorics


Book Description

This book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012. The 50 revised full papers presented were carefully reviewed and selected from 121 submissions. Topics covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization.




Software, Services, and Systems


Book Description

This book is dedicated to Professor Martin Wirsing on the occasion of his emeritation from Ludwig-Maximilians-Universität in Munich, Germany. The volume is a reflection, with gratitude and admiration, on Professor Wirsing’s life highly creative, remarkably fruitful and intellectually generous life. It also gives a snapshot of the research ideas that in many cases have been deeply influenced by Professor Wirsing’s work. The book consists of six sections. The first section contains personal remembrances and expressions of gratitude from friends of Professor Wirsing. The remaining five sections consist of groups of scientific papers written by colleagues and collaborators of Professor Wirsing, which have been grouped and ordered according to his scientific evolution. More specifically, the papers are concerned with logical and algebraic foundations; algebraic specifications, institutions and rewriting; foundations of software engineering; service oriented systems; and adaptive and autonomic systems.




Graph-Theoretic Concepts in Computer Science


Book Description

This book constitutes the thoroughly refereed post-conference proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2014, held in Nouan-le-Fuzelier, France, in June 2014. The 32 revised full papers presented were carefully reviewed and selected from 80 submissions. The book also includes two invited papers. The papers cover a wide range of topics in graph theory related to computer science, such as design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; structural graph theory with algorithmic or complexity applications; computational complexity of graph and network problems; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; computational geometry; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.




WALCOM: Algorithms and Computation


Book Description

This book constitutes the refereed proceedings of the 7th International Workshop on Algorithms and Computation, WALCOM 2013, held in Kharagpur, India, in February 2013. The 29 full papers presented were carefully reviewed and selected from 86 submissions. The papers are organized in topical sections on computational geometry, approximation and randomized algorithms, parallel and distributed computing, graph algorithms, complexity and bounds, and graph drawing.