Search

ThisbookpresentsselectedandrevisedpapersoftheSecondWorkshoponAd- tive and Learning Agents 2009 (ALA-09), held at the AAMAS 2009 conference in Budapest, Hungary, May 12. The goalof ALA is to provide an interdisciplinaryforum for scientists from a variety of?elds such as computer science, biology, game theory and economics. This year's edition of ALA was the second after the merger of the former wo- shops ALAMAS and ALAg. In 2008 this joint workshop was organized for the?rst time under the?ag of both events. ALAMAS was a yearly returning Eu- pean workshop on adaptive and learning agents and multi-agent systems (held eight times). ALAg was the international workshop on adaptive and learning agents, which was usually held at AAMAS. To increase the strength, visibility and quality of the workshop it was decided to merge both workshops under the?ag of ALA and to set up a Steering Committee as an organizational backbone. This book contains six papers presented during the workshop, which were carefully selected after an additional review round in the summer of 2009. We therefore wish to explicitly thank the members of the Program Committee for the quality and sincerity of their e?orts and service. Furthermore we would like to thank all the members of the senior Steering Committee for making this workshop possible and supporting it with sound advice. We also thank the AAMAS conference for providing us a platform for holding this event. Finally we also wish to thank all authors who responded to our call-for-papers with interesting contributions.

This volume constitutes the thoroughly refereed post-conference proceedings of the 7th International Conference on Mathematical Methods for Curves and Surfaces, MMCS 2008, held in Tønsberg, Norway, in June/July 2008. The 28 revised full papers presented were carefully reviewed and selected from 129 talks presented at the conference. The topics addressed by the papers range from mathematical analysis of various methods to practical implementation on modern graphics processing units.

The 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2010) took place in Zar´ os, Crete, Greece, June 28–30, 2010. About 60 mathematicians and computer scientists from all over the world (Australia, Canada, Czech Republic, France, Germany, Greece, Hungary, Israel, Japan, The Netherlands, Norway, Poland, Switzerland, the UK, and the USA) attended the conference. WG has a long tradition. Since 1975, WG has taken place 21 times in Germany, four times in The Netherlands, twice in Austria, twice in France and once in the Czech Republic, Greece, Italy, Norway, Slovakia, Switzerland, and the UK. WG aims at merging theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science, or by extracting new graph theoretic problems from applications. The goal is to presentemergingresearchresultsand to identify and exploredirections of future research.The conference is well-balanced with respect to established researchers and young scientists. There were 94 submissions, two of which where withdrawn before entering the review process. Each submission was carefully reviewed by at least 3, and on average 4.5, members of the Program Committee. The Committee accepted 28 papers, which makes an acceptance ratio of around 30%. I should stress that, due to the high competition and the limited schedule, there were papers that were not accepted while they deserved to be.

IH 2010 was the 12th Information Hiding Conference, held in Calgary, Canada, June 28–30, 2010. This series of conferences started with the First Workshop on Information Hiding, held in Cambridge, UK in May 1996. Since then, the conference locations have alternated between Europe and North America. The conference has been held annually since 2005. For many years, information hiding has captured the imagination of - searchers. This conference series aims to bring together a number of closely related research areas, including digital watermarking, steganography and s- ganalysis, anonymity and privacy, covert and subliminal channels,?ngerpri- ing and embedding codes, multimedia forensics and counter-forensics, as well as theoretical aspects of information hiding and detection. Since its inception, the conference series has been a premier forum for publishing research in these areas. This volume contains the revised versions of 18 accepted papers (incor- rating the comments from members of the Program Committee), and extended abstracts of two (out of three) invited talks. The conference received 39 anonymous submissions for full papers. The task of selecting 18 of them for presentation was not easy. Each submission was reviewed by at least three members of the Program Committee or external - viewers reporting to a member of the Program Committee. In the case of - authorship by a Program Committee member,?ve reviews were sought. There is no need to say that no member of the Program Committee reviewed his or her own work. Each paper was carefully discussed until consensus was reached.

This book constitutes the thoroughly refereed post-conference proceedings of the 16th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2009, held in Piran, Slovenia, in May 2009. The 23 revised full papers presented were carefully reviewed and selected from 53 submissions. The volume also contains two invited papers. SIROCCO addresses topics such as distributed computing, parallel computing, game theory, social networks, networking, mobile computing, peer to peer systems, communication complexity, combinatorial optimization; special focus is put to compact data structures, information dissemination, informative labeling schemes, distributed scheduling, wireless networks and scheduling of transmissions, routing, broadcasting, and localization.

This book constitutes the thoroughly refereed post-conference proceedings of the 22nd International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2012, held in Leuven, Belgium in September 2012. The 13 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 27 submissions. Among the topics covered are specification, synthesis, verification, analysis, optimization, specialization, security, certification, applications and tools, program/model manipulation, and transformation techniques for any programming language paradigm.

This book constitutes the thoroughly refereed post workshop proceedings of the 10th International Workshop on Approximation and Online Algorithms, WAOA 2012, held in Ljubljana, Slovenia, in September 2012 as part of the ALGO 2012 conference event. The 22 revised full papers presented together with invited talk were carefully reviewed and selected from 60 submissions. The workshop covered areas such as geometric problems, online algorithms, scheduling, algorithmic game theory, and approximation algorithms.

This book constitutes the refereed proceedings of the Thailand-Japan Joint Conference on Computational Geometry and Graphs, TJJCCGG 2012, held in Bangkok, Thailand, in December 2012.The 15 original research papers presented were selected from among six plenary talks, one special public talk and 41 talks by participants from about 20 countries around the world. TJJCCGG 2012 provided a forum for researchers working in computational geometry, graph theory/algorithms and their applications.

This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Symposium on Parameterized and Exact Computation, IPEC 2013, in Sophia Antipolis, France, in September 2013.The 29 revised full papers presented were carefully reviewed and selected from 58 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 computation, and implementation issues of parameterized and exact algorithms.

This book constitutes the thoroughly refereed post-conference proceedings of the 20th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2013, held in Ischia, Italy, in July 2013. The 28 revised full papers presented were carefully reviewed and selected from 67 submissions. SIROCCO is devoted to the study of communication and knowledge in distributed systems. Special emphasis is given to innovative approaches and fundamental understanding, in addition to efforts to optimize current designs. The typical areas include distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing (including autonomous robots), peer to peer systems, communication complexity, fault tolerant graph theories and randomized/probabilistic issues in networks.

This book constitutes the thoroughly refereed post-conference proceedings of the 4th International Conference on Numerical Analysis and Its Applications, NAA 2008, held in Lozenetz, Bulgaria in June 2008. The 61 revised full papers presented together with 13 invited papers were carefully selected during two rounds of reviewing and improvement. The papers address all current aspects of numerical analysis and discuss a wide range of problems concerning recent achievements in physics, chemistry, engineering, and economics. A special focus is given to numerical approximation and computational geometry, numerical linear algebra and numerical solution of transcendental equations, numerical methods for differential equations, numerical modeling, and high performance scientific computing.

rd This book constitutes a collection of extended versions of papers presented at the 23 IFIP TC7 Conference on System Modeling and Optimization, which was held in C- cow, Poland, on July 23–27, 2007. It contains 7 plenary and 22 contributed articles, the latter selected via a peer reviewing process. Most of the papers are concerned with optimization and optimal control. Some of them deal with practical issues, e. g., p- formance-based design for seismic risk reduction, or evolutionary optimization in structural engineering. Many contributions concern optimization of infini- dimensional systems, ranging from a general overview of the variational analysis, through optimization and sensitivity analysis of PDE systems, to optimal control of neutral systems. A significant group of papers is devoted to shape analysis and opti- zation. Sufficient optimality conditions for ODE problems, and stochastic control methods applied to mathematical finance, are also investigated. The remaining papers are on mathematical programming, modeling, and information technology. The conference was the 23rd event in the series of such meetings biennially org- ized under the auspices of the Seventh Technical Committee “Systems Modeling and Optimization” of the International Federation for Information Processing (IFIP TC7).

The 16th International Symposium on Graph Drawing (GD 2008) was held in Hersonissos, near Heraklion, Crete, Greece, September 21-24, 2008, and was attended by 91 participants from 19 countries. In response to the call for papers the Program Committee received 83 s- missions,eachdescribing originalresearchand/or a systemdemonstration.Each submissionwasreviewedbyatleastthreeProgramCommitteemembersandthe reviewer's comments were returned to the authors. Following extensive disc- sions, the committee accepted 31 long papers and 8 short papers. In addition, 10 posters were accepted and displayed at the conference site. Each poster was granted a two-page description in the conference proceedings. Two invited speakers, Jesper Tegn´ er from Karolinska Institute (Monday) and Roberto Tamassia from Brown University (Tuesday), gave fascinating talks during the conference. Professor Tegn´ er focused on the challenges and oppor- nities posed by the discovery, analysis, and interpretation of biological networks to information visualization, while Prof. Tamassia showed how graph drawing techniques can be used as an e?ective tool in computer security and pointed to future research directions in this area. Following what is now a tradition, the 15th Annual Graph Drawing Contest was held during the conference, also including a Graph Drawing Challenge to the conference attendees. A report is included in the conference proceedings.

This book constitutes the revised selected papers of the 20th International Workshop on Combinatorial Algorithms, held in June/July 2009 in the castle of Hradec nad Moravicí, Czech Republic. The 41 papers included in this volume together with 5 invited papers were carefully reviewed and selected from over 100 submissions. The topics dealt with are algorithms and data structures, applications, combinatorial enumeration, combinatorial optimization, complexity theory, computational biology, databases, decompositions and combinatorial designs, discrete and computational geometry, including graph drawing, and graph theory and combinatorics.

This book constitutes the refereed proceedings of the 11th International Conference on Information Security and Cryptology, ICISC 2008, held in Seoul, Korea, during December 3-5, 2008. The 26 revised full papers presented have gone through two rounds of reviewing and improvement and were carefully selected from 131 submissions. The papers are organized in topical sections on public key encryption, key management and secret sharing, privacy and digital rights, digital signature and voting, side channel attack, hash and mac, primitives and foundations, as well as block and stream ciphers.

The 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2009) took place at Montpellier (France), June 24–26 2009. About 80 computer scientists from all over the world (Australia, Belgium, Canada, China, Czech Republic, France, Germany, Greece, Israel, Japan, Korea, The Netherlands, Norway, Spain, UK, USA) attended the conference. Since1975,ithastakenplace20timesinGermany,fourtimesinTheNeth- lands, twice in Austria, as well as once in Italy, Slovakia, Switzerland, the Czech Republic, France, Norway, and the UK. The conference aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from appli- tions. The goal is to present recent research results and to identify and explore directions of future research. The conference is well-balanced with respect to established researchers and young scientists. There were 69 submissions. Each submission was reviewed by at least three, and on average four, Program Committee members. The Committee decided to accept 28 papers. Due to the competition and the limited schedule, some good papers could not be accepted. Theprogramalsoincludedexcellentinvitedtalks:onegivenbyDanielKràlon “AlgorithmsforClassesofGraphswithBoundedExpansion,” the otherbyDavid Eppsteinon“Graph-TheoreticSolutionstoComputationalGeometryProblems.” The proceedings contains two survey papers on these topics.

The 10th International Workshop on Information Security Applications (WISA 2009) was held in Busan, Korea during August 25–27, 2009. The workshop was hosted by the Korea Institute of Information Security and Cryptology (KIISC), supported by the Electronics and Telecommunications Research Institute (ETRI) and the Korea Internet and Security Agency (KISA), sponsored by the Ministry of Public Administration and Security (MoPAS) and the Korea Communications Commission (KCC), financially sponsored by the ST. Ltd. The aim of the workshop was to serve as a forum for presenting new research and experimental results in the area of information security applications from academic communities as well as from industry. The workshop program covered a wide range of security aspects, from cryptography to systems and network security and experimental work as well. It was our great pleasure and honor to serve as the Program Committee Co-chairs of WISA2009. This year, too, the proceedings of the workshop were published in the LNCS series of Springer. The WISA 2009 Program Committee received 79 papers form 16 countries. This year the submissions were exceptionally strong, and the committee accepted 27 papers for the full paper presentation track. All the papers were carefully evaluated through blind peer-review by at least three members of the Program Comm- tee. We would like to say that acceptance is a great achievement since the selection process was highly competitive, and many good papers were not accepted.

This volume consolidates selected articles from the 2016 Apprenticeship Program at the Fields Institute, part of the larger program on Combinatorial Algebraic Geometry that ran from July through December of 2016. Written primarily by junior mathematicians, the articles cover a range of topics in combinatorial algebraic geometry including curves, surfaces, Grassmannians, convexity, abelian varieties, and moduli spaces. This book bridges the gap between graduate courses and cutting-edge research by connecting historical sources, computation, explicit examples, and new results.

This book constitutes the thoroughly refereed post-conference proceedings of the Second International Symposium on Combinatorial Optimization, ISCO 2012, held in Athens, Greece, in April 2012. The 37 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 94 regular and 30 short submissions. They present original research on all aspects of combinatorial optimization, ranging from mathematical foundations and theory of algorithms to computational studies and practical applications.

This book constitutes the refereed proceedings of the first Workshop on Applications of Discrete Geometry and Mathematical Morphology, WADGMM 2010, held at the International Conference on Pattern Recognition in Istanbul, Turkey, in August 2010. The 11 revised full papers presented were carefully reviewed and selected from 25 submissions. The book was specifically designed to promote interchange and collaboration between experts in discrete geometry/mathematical morphology and potential users of these methods from other fields of image analysis and pattern recognition.

This book constitutes the thoroughly refereed post-proceedings of the 9th International Workshop on Approximation and Online Algorithms, WAOA 2011, held in Saarbrücken, Germany, in September 2011. The 21 papers presented were carefully reviewed and selected from 48 submissions. The volume also contains an extended abstract of the invited talk of Prof. Klaus Jansen. The Workshop on Approximation and Online Algorithms focuses on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications in a wide variety of fields. Topics of interest for WAOA 2011 were: algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterized complexity, randomization techniques and scheduling problems.

This book constitutes the refereed post-proceedings of the International Conference on Mathematical Modeling and Computational Physics, MMCP 2011, held in Stará Lesná, Slovakia, in July 2011. The 41 revised papers presented were carefully reviewed and selected from numerous submissions. They are organized in topical sections on mathematical modeling and methods, numerical modeling and methods, computational support of the experiments, computing tools, and optimization and simulation.

This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Symposium on Parameterized and Exact Computation, IPEC 2011, in Saarbrücken, Germany, in September 2011. The 21 revised full papers presented were carefully reviewed and selected from 40 submissions. The topics addressed cover research in all aspects of parameterized and exact computation and complexity, including but 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 computation, and implementation issues of parameterized and exact algorithms.

This book constitutes the refereed proceedings of the 19th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2012, held in Reykjavik, Iceland for 3 days starting June 30, 2012. The 28 revised full papers presented were carefully reviewed and selected from 54 submissions. SIROCCO is devoted to the study of communication and knowledge in distributed systems. Special emphasis is given to innovative approaches and fundamental understanding, in addition to efforts to optimize current designs. The typical areas include distributed computing, communication networks, game theory, parallel computing, social networks, mobile computing (including autonomous robots), peer to peer systems, communication complexity, fault tolerant graph theories, and randomized/probabilistic issues in networks.

The 34th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2008) took place in Van Mildert College at Durham University, UK, 30 June – 2 July 2008. The approximately 80 participants came from va- ous countries all over the world, among them Australia, Brazil, Canada, Chile, Czech Republic, France, Greece, Hungary,Israel, Italy, Japan, The Netherlands, Norway, Poland, Spain, Switzerland, UK and the USA. WG 2008 continued the series of 33 previous WG conferences. Since 1975, the WG conference has taken place 21 times in Germany, four times in The Netherlands, twice in Austria as well as once in Italy, Slovakia, Switzerland, the Czech Republic, France, Norway and now in the UK. The WG conference traditionally aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent researchresults and to identify and exploredirections of future research. The continuing interest in the WG conferences was re?ected in the number and quality of submissions; 76 papers were submitted and in an evaluation p- cess with four reports per submission, 30 papers were accepted by the Program Committee for the conference. Due to the high number of submissions and the limited schedule of 3 days, various good papers could not be accepted. Therewereexcellent invited talks by Giuseppe Di Battista(UniversitàRoma Tre,Italy)onalgorithmicaspectsof(un)-stableroutingintheInternet,byLeszek G?sieniec (University of Liverpool, UK) on memory-e?cient graph exploration, andbyMartinGrohe(Humboldt-UniversitätzuBerlin,Germany)onalgorithmic meta theorems.

This book constitutes the thoroughly refereed post-conference proceedings of the Kyoto Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007, held in Kyoto, Japan, in June 2007, in honor of Jin Akiyama and Vašek Chvátal, on the occasion of their 60th birthdays. The 19 revised full papers, presented together with 5 invited papers, were carefully selected during two rounds of reviewing and improvement from more than 60 talks at the conference. All aspects of Computational Geometry and Graph Theory are covered, including tilings, polygons, impossible objects, coloring of graphs, Hamilton cycles, and factors of graphs.

This book constitutes the refereed proceedings of the Second Western European Workshop on Research in Cryptology, WEWoRC 2007, held in Bochum, Germany, in July 2007 The 12 revised full papers were carefully reviewed and selected from a total of 36 submissions. The papers cover topics such as foundations of cryptology, secret-key cryptosystems and hash functions, public-key cryptosystems, cryptographic protocols, implementation of cryptosystems and their integration into secure systems, secure operating systems and trusted computing, applications such as watermarking and code obfuscation.

This comprehensive new Springer publication constitutes the thoroughly refereed post-conference proceedings of the 15th International Symposium on Graph Drawing, GD 2007, held in Sydney, Australia, in September of 2007. The 27 full papers and 9 short papers presented together with 2 invited talks, and a report on the symposium's graph drawing contest were carefully selected from 74 initial submissions. All of the current hot topics in graph drawing are addressed here.

This book constitutes the thoroughly refereed proceedings of the 15th International Workshop on Fast Software Encryption, FSE 2008, held in Lausanne, Switzerland in February 2008. The 26 revised full papers presented together with 4 short papers were carefully reviewed and selected from 72 submissions. The papers address all current aspects of fast and secure primitives for symmetric cryptology and are organized in topical sections on SHA collisions, new hash function designs, block cipher cryptanalysis, implementation aspects, hash function cryptanalysis, stream cipher cryptanalysis, security bounds, and entropy.

This book constitutes the thoroughly referred post-workshop proceedings of the 22nd International Workshop on Combinatorial Algorithms, IWOCA 2011, held in Victoria, BC, Canada, in July 2011. The 30 revised full papers presented were carefully reviewed and selected from a total of 71 submissions. A broad variety of topics in combinatorics and graph theory are addressed, such as combinatorics on words, string algorithms, codes, Venn diagrams, set partitions; Hamiltonian & Eulerian properties, graph drawing, colouring, dominating sets, spanning trees, and others.

This book constitutes the proceedings of the 6th International Computer Science Symposium in Russia, CSR 2011, held in St. Petersburg, Russia, in June 2011. The 29 papers presented were carefully reviewed and selected from 76 submissions. The scope of topics of the symposium was quite broad and covered basically all areas of the foundations of theoretical computer science.

This book constitutes the thoroughly referred post-proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in London, UK, in July 2010. The 31 revised full papers presented together with extended abstracts of 8 poster presentations were carefully reviewed and selected from a total of 85 submissions. A broad variety of combinatorial graph algorithms for the computations of various graph features are presented; also algorithms for network compuation, approximation, computational geometry, games, and search are presented and complexity aspects of such algorithms are discussed.

This book constitutes the thoroughly refereed post-conference proceedings of the China-Japan Joint Conference on Computational Geometry, Graphs and Applications, CGGA 2010, held in Dalian, China, in November 2010. The 23 revised full papers presented were carefully selected during two rounds of reviewing and improvement from numerous submissions. All aspects of computational and discrete geometry, graph theory, graph algorithms, and their applications are covered.

This book constitutes the thoroughly refereed post workshop proceedings of the 8th International Workshop on Approximation and Online Algorithms, WAOA 2010, held in Liverpool, UK, in September 2010 as part of the ALGO 2010 conference event.The 23 revised full papers presented were carefully reviewed andselected from 58 submissions. The workshop covered areas such asalgorithmic game theory, approximation classes, coloring andpartitioning, competitive analysis, computational finance, cuts andconnectivity, geometric problems, inapproximability results, echanismdesign, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, parameterizedcomplexity, randomization techniques, real-world applications, andscheduling problems.

This state-of-the-art survey features papers that were selected after an open call following the International Dagstuhl Seminar on Algorithmic Methods for Railway Optimization. The second part of the volume constitutes the refereed proceedings of the 4th International Workshop on Algorithmic Methods and Models for Optimization of Railways. The 17 full papers presented here were carefully reviewed and selected from numerous submissions.

This book constitutes the thoroughly refereed post-proceedings of the 14th International Symposium on Graph Drawing, GD 2006, held in Karlsruhe, Germany. The 33 revised full papers and 5 revised short papers presented together with 2 invited talks, 1 system demo, 2 poster papers address all current aspects in graph drawing, ranging from foundational and methodological issues to applications for various classes of graphs in a variety of fields.

The 33rd International Conference “Workshop on Graph-Theoretic Concepts in Computer Science” (WG 2007) took place in the Conference Center in old castleinDornburgnearJena,Germany,June21–23,2007.Theapproximately80 participants came from various countries all over the world, among them Brazil, Canada, the Czech Republic, France, UK, Greece, Hungary, Italy, Japan, The Netherlands, Norway, Sweden, Taiwan, and the USA. WG 2007 continued the series of 32 previous WG conferences. Since 1975, the WG conference has taken place 20 times in Germany, four times in The Netherlands, twice in Austria as well as once in Italy, Slovakia, Switzerland, the Czech Republic, France and in Norway. The WG conference traditionally aims at uniting theory and practice by demonstrating how graph-theoretic concepts can be applied to various areas in computer science, or by extracting new problems from applications. The goal is to present recent researchresults and to identify and exploredirections of future research. Thecontinuinginterestinthe WGconferenceswasre?ectedin thehighn- ber of submissions; 99 papers were submitted and in an evaluation process with four reports per submission, 30 papers were accepted by the Program Comm- tee for the conference. Due to the high number of submissions and the limited schedule of 3 days, various good papers could not be accepted. There were invited talks by Ming-Yang Kao (Evanston, Illinois) on algori- mic DNA assembly, and by Klaus Jansen (Kiel, Germany) on approximation algorithms for geometric intersection graphs.

The papers in this volume show the lively variety of topics and methods in automated deduction in geometry, and their applicability to different branches of mathematics as well as to other sciences and technologies. The book is made up of the thoroughly refereed post-proceedings of the 6th International Workshop on Automated Deduction in Geometry, ADG 2006, held at Pontevedra, Spain, in 2006. There are a total of 13 revised full papers selected from a number of submissions.

This volume contains a selection of the papers presented at the Sixth Int- national Conference on the Practice and Theory of Automated Timetabling (PATAT) which was organized in Brno, Czech Republic, from August 30 to September 1 of 2006. The PATAT conferences, which are held every 2 years, bring together - searchers and practitioners from across the broad spectrum of inter-disciplinary research activity in search methodologies for automated timetable generation. This includes university timetabling, school timetabling, personnel rostering, transportation timetabling, sports scheduling. The programme of the 2006 c- ference featured 70 presentations which represented the state of the art in au- mated timetabling: there were four plenary papers, 17 full papers, 41 extended abstracts, and eight system demonstrations. After the conference, all authors were invited to submit their papers to a second round of rigorous refereeing for this volume of selected revised papers. We are pleased to have accepted 25 - pers for this volume. This?gure represents the highest number of acceptances in a PATAT post-proceedings volume and is a testament to the high standards of the papers that were submitted. The organization of the book is structured around particular problem areas.

This book contains refereed and improved papers presented at the 6th IAPR Workshop on Graphics Recognition (GREC 2005). This year is the tenth anniversary of GREC, which was started in 1995 and has been held every 2 years: GREC 1995 in Penn State University, USA (LNCS Volume 1072, Springer, 1996); GREC 1997 in Nancy, France (LNCS Volume 1389, Springer, 1998); GREC 1999 in Jaipur, India (LNCS Volume 1941, Springer, 2000); GREC 2001 in Kingston, Canada (LNCS Volume 2390, Springer, 2002); and GREC 2003 in Barcelona, Spain (LNCS Volume 3088, Springer, 2004). GREC is the main event of IAPR TC-10 (the Technical Committee on Graphics Recognition within the International Association for Pattern Recognition) and provides an excellent opportunity for researchers and practitioners at all levels of experience to meet colleagues and to share new ideas and knowledge about graphics recognition methods. Graphics recognition is a particular field in the domain of document analysis, which combines pattern recognition and image processing techniques for the analysis of any kind of graphical information in documents from either paper or electronic formats. In its 10 year history, the graphics recognition community has extended its research topics from the analysis and understanding of graphic documents (including engineering drawings vectorization and recognition), to graphics-based information retrieval and symbol recognition, to new media analysis, and even stepped into research areas of other communities, e. g.

This book constitutes the thoroughly refereed post-proceedings of the 4th International Conference on Computers and Games, CG 2004, held in July 2004. The 21 revised full papers presented together with one keynote article were carefully selected during two rounds of reviewing and improvement from 37 submissions. The papers cover all aspects of artificial intelligence in computer-game playing. Topics addressed include evaluation and learning, search, single-agent search and planning, and computer Go.

Fast Software Encryption (FSE) 2006 is the 13th in a series of workshops on symmetric cryptography. It has been sponsored for the last?ve years by the International Association for Cryptologic Research (IACR), and previous FSE workshops have been held around the world: 1993 Cambridge, UK 1994 Leuven, Belgium 1996 Cambridge, UK 1997 Haifa, Israel 1998 Paris, France 1999 Rome, Italy 2000 New York, USA 2001 Yokohama, Japan 2002 Leuven, Belgium 2003 Lund, Sweden 2004 New Delhi, India 2005 Paris, France The FSE workshop is devoted to research on fast and secure primitives for symmetric cryptography, including the design and analysis of block ciphers, stream ciphers, encryption schemes, analysis and evaluation tools, hash fu- tions, and message authentication codes. This year more than 100 papers were submitted to FSE for the?rst time. After an extensive review by the ProgramCommittee, 27 papers were presented at the workshop. Of course, the programwould not have been complete without the invited speaker, and the presentation by Eli Biham on the early history of di?erential cryptanalysis was particularly appreciated by workshop attendees.

Thisvolumecontainsrefereedpapersdevotedtocodingandcryptography.These papers arethe full versionsof a selectionof the best extended abstractsaccepted for presentation at the International Workshop on Coding and Cryptography (WCC 2005) held in Bergen, Norway, March 14–18, 2005. Each of the 118 - tended abstracts originallysubmitted to the workshop were reviewed by at least two members of the Program Committee. As a result of this screening process, 58 papers were selected for presentation, of which 52 were eventually presented at the workshop together with four invited talks. The authors of the presented papers were in turn invited to submit full v- sions of their papers to the full proceedings. Each of the full-version submissions were once again thoroughly examined and commented upon by at least two reviewers. This volume is the end result of this long process. I am grateful to the reviewers who contributed to guaranteeing the high standards of this volume, and who are named on the next pages. It was a pl- sure for me to work with my program co-chair Pascale Charpin, whose expe- enced advice I havefurther bene?ted greatly from during the preparationof this ´ volume. Discussions with Tor Helleseth and Angela Barbero were also useful in putting the volume together. Finally, I would like to thank all the authors and all the other participants of the WCC 2005 for making it in every sense a highly enjoyable event.

The 13th International Symposium on Graph Drawing (GD 2005) was held in Limerick, Ireland, September 12-14, 2005. One hundred and?fteen participants from 19 countries attended GD 2005. In response to the call for papers the Program Committee received 101 subm- sions, each detailing original research or a system demonstration. Each submission was reviewed by at least three Program Committee members; each referee's c- ments were returned to the authors. Following extensive discussions, the comm- tee accepted 38 long papers, 3 short papers and 3 long system demos, each of which were presented during one of the conference's 12 sessions. Eight posters were also accepted and were on display throughout the conference. Two invited speakers, Kurt Mehlhorn and George Robertson, gave fascinating talks during the conference. Prof. Mehlhorn spoke on the use of minimum cycle bases for reconstructing surfaces, while Dr. Robertson gave a perspective, past and present, on the visualization of hierarchies. As is now traditional, a graph drawing contest was held during the conference. The accompanying report, written by Stephen Kobourov, details this year's c- test. This year a day-long workshop, organized by Seok-Hee Hong and Dorothea Wagner, was held in conjunction with the conference. A report on the “Workshop on Network Analysis and Visualization,” written by Seok-Hee Hong, is included in the proceedings.

This book constitutes the thoroughly refereed post-conference proceedings of the 8th International Conference on Learning and Optimization, LION 8, which was held in Gainesville, FL, USA, in February 2014. The 33 contributions presented were carefully reviewed and selected for inclusion in this book. A large variety of topics are covered, such as algorithm configuration; multiobjective optimization; metaheuristics; graphs and networks; logistics and transportation; and biomedical applications.

This book constitutes the thoroughly refereed post workshop proceedings of the 6th International Workshop on Approximation and Online Algorithms, WAOA 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 conference event. The 22 revised full papers presented were carefully reviewed and selected from 56 submissions. The workshop covered areas such as algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms for design and analysis of approximation and online algorithms, randomization techniques, real-world applications, and scheduling problems.

This book constitutes the thoroughly refereed post-conference proceedings of the 7th International Workshop on Digital Watermarking, IWDW 2008, held in Busan, Korea, in November 2008. The 36 regular papers included in the volume were carefully reviewed and selected from 62 submissions. Areas of interest to the conference are mathematical modeling of embedding and detection; information theoretic, stochastic aspects of data hiding; security issues, including attacks and counter-attacks; combination of data hiding and cryptography; optimum watermark detection and reliable recovery; estimation of watermark capacity; channel coding techniques for watermarking; large-scale experimental tests and benchmarking; new statistical and perceptual models of content; reversible data hiding; data hiding in special media; data hiding and authentication; steganography and steganalysis; data forensics; copyright protection, DRM, and forensic watermarking; and visual cryptography.

Thisvolumecontainsaselectionofpapersfromthe5thInternationalConference on the Practice and Theory of Automated Timetabling (PATAT 2004) held in Pittsburgh, USA, August 18–20, 2004. Indeed, as we write this preface, in the Summer of 2005, we note that we are about one month away from the tenth anniversary of the very?rst PATAT conference in Edinburgh. Since those very early days, the conference series has gone from strength to strength and this volume represents the latest in a series of?ve rigorously refereed volumes which showcase a broad spectrum of ground-breaking timetabling research across a very wide range of timetabling problems and applications. Timetabling is an area that unites a number of disparate?elds and which cuts across a number of diverse academic disciplines. While the most obvious instances of timetabling occur in educational institutions, timetabling also - pears in sports applications, transportation planning, project scheduling, and many other?elds. Viewing timetabling as a unifying theme enables researchers fromthesevariousareastolearnfromeachotherandtoextendtheirown- searchandpracticeinnewandinnovativeways.Thisvolumecontinuesthetrend of the conference series to extend the de?nition of timetabling beyond its edu- tional roots. In this volume, seven of the 19 papers involve domains other than education. Of course, educationaltimetabling remains at the coreof timetabling research, and the papers in this volume represent the full range of this area including exam timetabling, room scheduling, and class rostering.

This volume contains the refereed proceedings of the 3rd International Conf- ence on Sequences and Their Applications (SETA 2004), held in Seoul, Korea during October 24–28, 2004. The previous two conferences, SETA 1998 and SETA 2001, were held in Singapore and Bergen, Norway, respectively. These conferences are motivated by the many widespread applications of sequences in modern communication systems. These applications include pseudorandom sequences in spread spectrum systems, code-division multiple-access, stream ciphers in cryptography and several connections to coding theory. The Technical Program Committee of SETA 2004 received 59 submitted - pers, many more than the submissions to previous SETA conferences. The C- mittee therefore had the di?cult task of selecting the 33 papers to be presented at the Conference in addition to four invited papers. The authors of papers p- sented at the conference were invited to submit full papers that were refereed before appearing in this proceedings. These proceedings have been edited by the Co-chairs of the Technical P- gram Committee for SETA 2004: Tor Helleseth of the University of Bergen, Norway, and Dilip Sarwate of the University of Illinois at Urbana-Champaign, USA, and Technical Program Committee members Hong-Yeop Song of Yonsei University, Korea, and Kyeongcheol Yang of Pohang University of Science and Technology, Korea.

A central theme in the study of dynamic systems is the modelling and control of uncertain systems. While ‘uncertainty'has long been a strong motivating factor behind many techniques developed in the modelling, control, statistics and mathematics communities, the past decade, in particular, has witnessed remarkable progress in this area with the emergence of a number of powerful newmethodsforbothmodellingandcontrollinguncertaindynamicsystems. The speci?c objective of this book is to describe and review some of these exciting new approaches within a single volume. Our approach was to invite some of the leading researchers in this area to contribute to this book by submitting both tutorial papers on their speci?c area of research, and to submit more focussed research papers to document some of the latest results in the area. We feel that collecting some of the main results together in this manner is particularly important as many of the important ideas that emerged in the past decade were derived in a variety of academic disciplines. By providing both tutorial and researchpaperswehopetobeabletoprovidetheinterestedreaderwithsu?cient background to appreciate some of the main concepts from a variety of related, but nevertheless distinct?elds, and to provide a?avor of how these results are currently being used to cope with ‘uncertainty.'It is our sincere hope that the availability of these results within a single volume will lead to further cro- fertilization of ideas and act as a spark for further research in this important area of applied mathematics.