Invited Talks -- Automorphisms of Finite Rings and Applications to Complexity of Problems -- Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages -- Algorithmics in Exponential Time -- Session 1A -- Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics -- Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algor…
Systems of Containers and Enumeration Problems -- Some Heuristic Analysis of Local Search Algorithms for SAT Problems -- Clustering in Stochastic Asynchronous Algorithms for Distributed Simulations -- On Construction of the Set of Irreducible Partial Covers -- Recent Advances in Multiobjective Optimization -- Polynomial Time Checking for Generation of Finite Distributions of Rational Probabilit…
Invited Talks -- Security by, and for, Converged Mobile Devices -- Security for Ubiquitous Computing -- Block Cipher and Stream Cipher -- Algebraic Attacks on Combiners with Memory and Several Outputs -- New Method for Bounding the Maximum Differential Probability for SPNs and ARIA -- Dragon: A Fast Word Based Stream Cipher -- Public Key Cryptosystem -- An Efficient and Verifiable Solution to t…
An External Partial Permutations Memory for Ant Colony Optimization -- A Novel Application of Evolutionary Computing in Process Systems Engineering -- Choosing the Fittest Subset of Low Level Heuristics in a Hyperheuristic Framework -- An Attribute Grammar Decoder for the 01 MultiConstrained Knapsack Problem -- EvoGeneS, a New Evolutionary Approach to Graph Generation -- On the Application of E…
Hardness Amplification and Error Correction -- Optimal Error Correction Against Computationally Bounded Noise -- Hardness Amplification of Weakly Verifiable Puzzles -- On Hardness Amplification of One-Way Functions -- Graphs and Groups -- Cryptography in Subgroups of -- Efficiently Constructible Huge Graphs That Preserve First Order Properties of Random Graphs -- Simulation and Secure Computat…
Papers -- Reconfiguring Triangulations with Edge Flips and Point Moves -- Drawing Power Law Graphs -- Hexagonal Grid Drawings: Algorithms and Lower Bounds -- Improved Bounds for the Number of (? k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of K n -- On the Realizable Weaving Patterns of Polynomial Curves in -- Drawing the AS Graph in 2.5 Dimensions -- Boundary Labeling:…
Restricted Towers of Hanoi and Morphisms -- Collapsing Words: A Progress Report -- Locally Consistent Parsing and Applications to Approximate String Comparisons -- Central Sturmian Words: Recent Developments -- Reversible Cellular Automata -- Inexpressibility Results for Regular Languages in Nonregular Settings -- Complexity of Quantum Uniform and Nonuniform Automata -- Membership and Finitenes…
Invited Talks -- Discovering Treewidth -- From Research Prototypes to Industrial Strength Open Source Products – The ObjectWeb Experience -- How Hard Is It to Take a Snapshot? -- Logical Foundations for Data Integration -- Recent Advances in Graph Drawing -- The Hyperdatabase Network – New Middleware for Searching and Maintaining the Information Space -- Architecture of a Business Framework…
Mixed-Integer Cuts from Cyclic Groups -- Optimizing over the First Chvàtal Closure -- Sequential Pairing of Mixed Integer Inequalities -- Approximate Min-max Relations for Odd Cycles in Planar Graphs -- Disjoint Cycles: Integrality Gap, Hardness, and Approximation -- A Combinatorial Algorithm to Find a Maximum Even Factor -- Improved Approximation Schemes for Linear Programming Relaxations of …
Foundations -- Formal Concept Analysis as Mathematical Theory of Concepts and Concept Hierarchies -- Semiconcept and Protoconcept Algebras: The Basic Theorems -- Features of Interaction Between Formal Concept Analysis and Algebraic Geometry -- From Formal Concept Analysis to Contextual Logic -- Contextual Attribute Logic of Many-Valued Attributes -- Treating Incomplete Knowledge in Formal Conce…