You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book constitutes the refereed proceedings of the 15th International Symposium on Algorithms and Computation, ISAAC 2004, held in Hong Kong, China in December 2004. The 76 revised full papers presented were carefully reviewed and selected from 226 submissions. Among the topics addressed are computational geometry, graph computations, computational combinatorics, combinatorial optimization, computational complexity, scheduling, distributed algorithms, parallel algorithms, data structures, network optimization, randomized algorithms, and computational mathematics more generally.
This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Computation, ISAAC 2005, held in Sanya, Hainan, China in December 2005. The 112 revised full papers presented were carefully reviewed and selected from 549 submissions. The papers are organized in topical sections on computational geometry, computational optimization, graph drawing and graph algorithms, computational complexity, approximation algorithms, internet algorithms, quantum computing and cryptography, data structure, computational biology, experimental algorithm mehodologies and online algorithms, randomized algorithms, parallel and distributed algorithms.
This book constitutes the refereed proceedings of the 29th International Colloquium on Automata, Languages and Programming, ICALP 2002, held in Malaga, Spain, in July 2002.The 83 revised full papers presented together with 7 invited papers were carefully reviewed and selected from a total of 269 submissions. All current aspects of theoretical computer science are addressed and major new results are presented.
This book constitutes the refereed proceedings of the 14th International Symposium on Algorithms and Computation, ISAAC 2003, held in Kyoto, Japan, in December 2003. The 73 revised full papers presented were carefully reviewed and selected from 207 submissions. The papers are organized in topical sections on computational geometry, graph and combinatorial algorithms, computational complexity, quantum computing, combinatorial optimization, scheduling, computational biology, distributed and parallel algorithms, data structures, combinatorial and network optimization, computational complexity and cryptography, game theory and randomized algorithms, and algebraic and arithmetic computation.
This book constitutes the refereed proceedings of the 46th International Conference on Current Trends in Theory and Practice of Informatics, SOFSEM 2020, held in Limassol, Cyprus, in January 2020. The 40 full papers presented together with 17 short papers and 3 invited papers were carefully reviewed and selected from 125 submissions. They presented new research results in the theory and practice of computer science in the each sub-area of SOFSEM 2020: foundations of computer science, foundations of data science and engineering, foundations of software engineering, and foundations of algorithmic computational biology.
This book constitutes the thoroughly refereed post-conference proceedings of the 9th International Symposium on Parameterized and Exact Computation, IPEC 2014, in Wroclaw, Poland, in September 2014. The 27 revised full papers presented together with one invited paper were carefully reviewed and selected from 42 submissions. The topics addressed cover research in all aspects of parameterized/exact algorithms and complexity including but are not limited to new techniques for the design and analysis of parameterized and exact algorithms, fixed-parameter tractability results; parameterized complexity theory, relationship between parameterized complexity and traditional complexity classifications; applications of parameterized and exact exponential-time computation; and implementation issues of parameterized and exact exponential-time algorithms.
This book constitutes the refereed proceedings of the 22nd International Symposium on Algorithms and Computation, ISAAC 2011, held in Yokohama, Japan in December 2011. The 76 revised full papers presented together with two invited talks were carefully reviewed and selected from 187 submissions for inclusion in the book. This volume contains topics such as approximation algorithms; computational geometry; computational biology; computational complexity; data structures; distributed systems; graph algorithms; graph drawing and information visualization; optimization; online and streaming algorithms; parallel and external memory algorithms; parameterized algorithms; game theory and internet algorithms; randomized algorithms; and string algorithms.
The 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010) took place in Big Island, Hawaii, USA, December 18–20, 2010. Past COCOA conferences were held in Xi’an, China (2007), Newfoundland, Canada (2008)and Huangshan, China (2009). COCOA2010providedaforumforresearchersworkingintheareasofcom- natorial optimization and its applications. In addition to theoretical results, the conference also included recent works on experimental and applied research of general algorithmic interest. The Program Committee received 108 submissions from more than 23 countries and regions, including Australia, Austria, Canada, China, Denmark, France, Germany, Hong Kong,...
This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Approximation and Online Algorithms, WAOA 2006, held in Zurich, Switzerland in September 2006 as part of the ALGO 2006 conference event. The 26 revised full papers presented were carefully reviewed and selected from 62 submissions.