Table of Contents: “…Simultaneous Relevant Feature Identification and Classification in High-Dimensional Spaces -- Pooled Genomic Indexing (PGI): Mathematical Analysis and Experiment Design -- Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem -- Methods for Inferring Block-Wise Ancestral History from Haploid Sequences -- Finding Signal Peptides in Human Protein Sequences Using Recurrent Neural Networks -- Generating Peptide Candidates from Amino-Acid Sequence Databases for Protein Identification via Mass Spectrometry -- Improved Approximation Algorithms for NMR Spectral Peak Assignment -- Efficient Methods for Inferring Tandem Duplication History -- Genome Rearrangement Phylogeny Using Weighbor -- Segment Match Refinement and Applications -- Extracting Common Motifs under the Levenshtein Measure: Theory and Experimentation -- Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics -- FAUST: An Algorithm for Extracting Functionally Relevant Templates from Protein Structures -- Efficient Unbound Docking of Rigid Molecules -- A Method of Consolidating and Combining EST and mRNA Alignments to a Genome to Enumerate Supported Splice Variants -- A Method to Improve the Performance of Translation Start Site Detection and Its Application for Gene Finding -- Comparative Methods for Gene Structure Prediction in Homologous Sequences -- MultiProt — A Multiple Protein Structural Alignment Algorithm -- A Hybrid Scoring Function for Protein Multiple Alignment -- Functional Consequences in Metabolic Pathways from Phylogenetic Profiles -- Finding Founder Sequences from a Set of Recombinants -- Estimating the Deviation from a Molecular Clock -- Exploring the Set of All Minimal Sequences of Reversals — An Application to Test the Replication-Directed Reversal Hypothesis -- Approximating the Expected Number of Inversions Given the Number of Breakpoints -- Invited Lecture — Accelerating Smith-Waterman Searches -- Sequence-Length Requirements for Phylogenetic Methods -- Fast and Accurate Phylogeny Reconstruction Algorithms Based on the Minimum-Evolution Principle -- NeighborNet: An Agglomerative Method for the Construction of Planar Phylogenetic Networks -- On the Control of Hybridization Noise in DNA Sequencing-by-Hybridization -- Restricting SBH Ambiguity via Restriction Enzymes -- Invited Lecture — Molecule as Computation: Towards an Abstraction of Biomolecular Systems -- Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search -- Rapid Large-Scale Oligonucleotide Selection for Microarrays -- Border Length Minimization in DNA Array Design* -- The Enhanced Suffix Array and Its Applications to Genome Analysis -- The Algorithmic of Gene Teams -- Combinatorial Use of Short Probes for Differential Gene Expression Profiling -- Designing Specific Oligonucleotide Probes for the Entire S. cerevisiae Transcriptome -- K-ary Clustering with Optimal Leaf Ordering for Gene Expression Data -- Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data -- Modified Mincut Supertrees.…”
Click to view e-book

Table of Contents: “…Invited Talk -- Interactive Proofs for Quantum Computation -- Drawing Plane Graphs -- 1A Computational Geometry I -- Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve -- A Dynamic Dictionary for Priced Information with Application -- Voronoi Diagram in the Flow Field -- Polygonal Path Approximation: A Query Based Approach -- 1B Graph and Combinatorial Algorithms I -- A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs -- Finding the Maximum Common Subgraph of a Partial k-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees -- Hotlink Enhancement Algorithms for Web Directories -- Finding a Length-Constrained Maximum-Density Path in a Tree -- 2A Computational Complexity I -- The Intractability of Computing the Hamming Distance -- Infinitely-Often Autoreducible Sets -- Limiting Negations in Bounded-Depth Circuits: An Extension of Markov’s Theorem -- Computational Complexity Measures of Multipartite Quantum Entanglement -- 2B Graph and Combinatorial Algorithms II -- A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs -- Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem -- Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems -- A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem -- 3A Quantum Computation -- The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems -- Non-interactive Quantum Perfect and Statistical Zero-Knowledge -- Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? …”
Click to view e-book

Table of Contents: “…Invited Talks -- Branching Systems -- Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology -- Succinct Representations of Trees -- Kt Minors in Large t-Connected Graphs -- Intractability in Graph Drawing and Geometry: FPT Approaches -- Contributed Talks -- Evaluation of Recoverable-Robust Timetables on Tree Networks -- Weighted LCS -- Integrality Properties of Certain Special Balanceable Families -- Forbidden Subgraph Colorings and the Oriented Chromatic Number -- Polynomial Kernels for 3-Leaf Power Graph Modification Problems -- Approximating the Max Edge-Coloring Problem -- Three Complexity Results on Coloring P k -Free Graphs -- Fully Decomposable Split Graphs -- Feedback Vertex Set on Graphs of Low Cliquewidth -- Note on Decomposition of K n,n into (0,j)-prisms -- Edge-Simple Circuits through 10 Ordered Vertices in Square Grids -- Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search -- LPF Computation Revisited -- Limiting Distribution for Distances in k-Trees -- Gray Code Compression -- Embedded Trees and the Support of the ISE -- Combinatorial Models for Cooperation Networks -- Polar Permutation Graphs -- A New Algorithm for Efficient Pattern Matching with Swaps -- The Height and Range of Watermelons without Wall -- Fast Convolutions and Their Applications in Approximate String Matching -- Better Polynomial Algorithms on Graphs of Bounded Rank-Width -- Minimax Trees in Linear Time with Applications -- Planar Biconnectivity Augmentation with Fixed Embedding -- Trivially-Perfect Width -- Lightweight Parameterized Suffix Array Construction -- On the Crossing Numbers of Cartesian Products of Stars and Graphs on Five Vertices -- Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees -- On the Maximal Number of Cubic Subwords in a String -- Solution of Peter Winkler’s Pizza Problem -- An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs -- Simpler Parameterized Algorithm for OCT -- Bipartite Graphs of Large Clique-Width -- Kernel in Oriented Circulant Graphs -- Randomized Postoptimization of Covering Arrays -- New Word-Based Adaptive Dense Compressors -- Rainbow Connection in Graphs with Minimum Degree Three -- The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree -- Computability of Width of Submodular Partition Functions -- The Guarding Problem – Complexity and Approximation -- Antibandwidth of d-Dimensional Meshes.…”
Click to view e-book

Table of Contents: “…Bioinformatics -- Computational Biology -- Systems Biology -- Discrete Algorithms -- Machine-learning Methods -- Molecular Biology.…”
Click to view e-book

Table of Contents: “…Compact DFA Representation for Fast Regular Expression Search -- The Max-Shift Algorithm for Approximate String Matching -- Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance -- Experiences with the Design and Implementation of Space-Efficient Deques -- Designing and Implementing a General Purpose Halfedge Data Structure -- Optimised Predecessor Data Structures for Internal Memory -- An Adaptable and Extensible Geometry Kernel -- Efficient Resource Allocation with Noisy Functions -- Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem -- Exploiting Partial Knowledge of Satisfying Assignments -- Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture -- An Experimental Study of Data Migration Algorithms -- An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks -- Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry -- Pareto Shortest Paths is Often Feasible in Practice.…”
Click to view e-book

Table of Contents: “…Introduction : The power of algorithms -- A society, searching -- Searching for Black girls -- Searching for people and communities -- Searching for protections from search engines -- The future of knowledge in the public -- The future of information culture -- Conclusion : Algorithms of oppression -- Epilogue.…”

Table of Contents: “…Models of Computation and Complexity -- Building Mathematics-Based Software Systems to Advance Science and Create Knowledge -- On Negations in Boolean Networks -- The Lovász Local Lemma and Satisfiability -- Kolmogorov-Complexity Based on Infinite Computations -- Pervasive Theory of Memory -- Introducing Quasirandomness to Computer Science -- Sorting and Searching -- Reflections on Optimal and Nearly Optimal Binary Search Trees -- Some Results for Elementary Operations -- Maintaining Ideally Distributed Random Search Trees without Extra Space -- A Pictorial Description of Cole’s Parallel Merge Sort -- Self-matched Patterns, Golomb Rulers, and Sequence Reconstruction -- Combinatorial Optimization with Applications -- Algorithms for Energy Saving -- Minimizing Average Flow-Time -- Integer Linear Programming in Computational Biology -- Via Detours to I/O-Efficient Shortest Paths -- Computational Geometry and Geometric Graphs -- The Computational Geometry of Comparing Shapes -- Finding Nearest Larger Neighbors -- Multi-core Implementations of Geometric Algorithms -- The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension -- On Map Labeling with Leaders -- The Crossing Number of Graphs: Theory and Computation -- Algorithm Engineering, Exactness, and Robustness -- Algorithm Engineering – An Attempt at a Definition -- Of What Use Is Floating-Point Arithmetic in Computational Geometry? …”
Click to view e-book

Table of Contents: “…Competitive analysis of algorithms -- Self-organizing data structures -- Competitive analysis of paging -- Metrical task systems, the server problem and the work function algorithm -- Distributed paging -- Competitive analysis of distributed algorithms -- On-line packing and covering problems -- On-line load balancing -- On-line scheduling -- On-line searching and navigation -- On-line network routing -- On-line network optimization problems -- Coloring graphs on-line -- On-Line Algorithms in Machine Learning -- Competitive solutions for on-line financial problems -- On the performance of competitive algorithms in practice -- Competitive odds and ends.…”
Click to view e-book

Subjects: “…Algorithms.…”
Click to view e-book

Table of Contents: “…Variables, expressions, assignments -- Generation of combinatorial objects -- Tree traversal (backtracking) -- Sorting -- Finite-state algorithms in text processing -- Data types -- Recursion -- Recursive and non-recursive programs -- Graph algorithms -- Pattern matching -- Games analysis -- Optimal coding -- Set representation. …”
Click to view e-book

Subjects: Click to view e-book

Table of Contents: “…Algorithms on graphs -- Algorithms on strings -- Discrete geometry -- Satisfiability.…”
Click to view e-book

Table of Contents: “…Introduction, Background and Biological Inspiration -- 1.1 Biological Background -- 1.2 Conventional Genetic Algorithm -- 1.3 Theory and Hypothesis -- 1.4 A Simple Example -- 2. …”
Click to view e-book

Table of Contents: “…Polynomial equations-solving and its applications -- Quasi-random combinatorial structures -- Hamiltonian abstract Voronoi diagrams in linear time -- Every set of disjoint line segments admits a binary tree -- The traveling cameraman problem, with applications to automatic optical inspection -- On determining the congruity of point sets in higher dimensions -- On random hard sets for NP -- Computing solutions uniquely collapses the polynomial hierarchy -- Verifying the determinant in parallel -- Hardness of approximating graph transformation problem -- Randomized wait-free naming -- Unifying themes for network selection -- Robust asynchronous algorithms in networks with a fault detection ring -- Distributed algorithms for finding small cycle covers in arbitrary networks -- A neural network model for quadratic programming with simple upper and lower bounds and its application to linear programming -- Analysis of the convergency of topology preserving neural networks on learning -- On helping and interactive proof systems -- Average time complexity of the SAT 1.2 algorithm -- Average cost to produce partial orders -- Two notes on low-density subset sum algorithm -- Rotation distance, triangulations of planar surfaces and hyperbolic geometry -- Finitely representable spatial objects and efficient computation -- Computing all small cuts in undirected networks -- Edge-coloring and f-coloring for various classes of graphs -- Edge-disjoint paths in permutation graphs -- Minimum augmentation to k-edge-connect specified vertices of a graph -- Algorithmic Chernoff-Hoeffding inequalities in integer programming -- Approximate pattern matching with samples -- An efficient optimal algorithm for minimizing the overall communication cost in replicated data management -- Multispace search: A new optimization approach -- Realizing degree sequences in parallel -- Efficient sequential and parallel algorithms for the negative cycle problem -- Fast and efficient operations on Parallel Priority Queues -- Heaps with bits -- Components and projections of curves over finite fields -- On the approximation of finding various minimal, maximal, and consistent sequences -- A linear-time algorithm for computing characteristic strings -- The maximum latency and identification of positive Boolean functions -- Fast deterministic Hot-Potato routing on processor arrays -- k-pairwise cluster fault tolerant routing in hypercubes -- On Steiner minimal trees in grid graphs and its application to VLSI routing -- Optimal routing of permutations on rings -- Resource bounded randomness and weakly complete problems -- Deterministic ? …”
Click to view e-book

Table of Contents: “…Invited Talk -- The Engineering of Some Bipartite Matching Programs -- Session 1(a) - Data Structure I -- General Splay: A Basic Theory and Calculus -- Static Dictionaries Supporting Rank -- Session 1(b) - Parallel & Distributed Computing I -- Multiple Spin-Block Decisions -- Asynchronous Random Polling Dynamic Load Balancing -- Session 2(a) - Approximate Algorithm I -- Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colarability -- Hardness of Approximating Independent Domination in Circle Graphs -- Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs -- Session 2(b) - Computational Intelligence -- Ordered Binary Decision Diagrams as Knowledge-Bases -- Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots -- Session 3(a) - Online Algorithm -- On-Line Load Balancing of Temporary Tasks Revisited -- Online Routing in Triangulations -- Session 3(b) - Complexity Theory I -- The Query Complexity of Program Checking by Constant-Depth Circuits -- Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle -- Session 4(a) - Approximate Algorithm II -- Efficient Approximation Algorithms for Multi-label Map Labeling -- Approximation Algorithms in Batch Processing -- Session 4(b) - Graph Algorithm I -- LexBFS-Ordering in Asteroidal Triple-Free Graphs -- Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs -- Invited Talk -- Approximation Algorithms for Some Clustering and Classification Problems -- Session 5(a) - Computational Geometry I -- How Many People Can Hide in a Terrain? …”
Click to view e-book

Table of Contents: “…Invited Talk 1 -- Chain Reconfiguration The Ins and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages -- Combinatorial Generation and Optimization (I) -- Application of M-Convex Submodular Flow Problem to Mathematical Economics -- A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling -- A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times -- Semi-normal Schedulings: Improvement on Goemans’ Algorithm -- Parallel and Distributed Algorithms (I) -- Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness -- Broadcasting with Universal Lists Revisited: Using Competitive Analysis -- On Adaptive Fault Diagnosis for Multiprocessor Systems -- On-Line Multicasting in All-Optical Networks -- Graph Drawing and Algorithms (I) -- Enumerating Floorplans with n Rooms -- On Min-Max Cycle Bases -- On the Minimum Local-Vertex-Connectivity Augmentation in Graphs -- Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number -- Computational Geometry (I) -- Quantum Algorithms for Intersection and Proximity Problems -- BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces -- Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees -- Tree-Approximations for the Weighted Cost-Distance Problem -- Computational Complexity and Cryptology -- Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups -- Generic Algorithms and Key Agreement Protocols Based on Group Actions -- Baire Category and Nowhere Differentiability for Feasible Real Functions -- Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams -- Automata and Formal Languages -- On Removing the Pushdown Stack in Reachability Constructions -- A New Recognition Algorithm for Extended Regular Expressions -- Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata -- An Index for the Data Size to Extract Decomposable Structures in LAD -- Invited Talk 2 -- Parameterized Complexity: The Main Ideas and Some Research Frontiers -- Graph Drawing and Algorithms (II) -- Tight Bounds on Maximal and Maximum Matchings -- Recognition and Orientation Algorithms for P4-Comparability Graphs -- Efficient Algorithms for k-Terminal Cuts on Planar Graphs -- Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths -- Combinatorial Generation and Optimization (II) -- Algorithms for Pattern Involvement in Permutations -- A Fast Algorithm for Enumerating Bipartite Perfect Matchings -- On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time -- On the Complexity of Train Assignment Problems -- Computational Biology and String Matching (I) -- A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model -- Complexity of Comparing Hidden Markov Models -- DNA Self-Assembly For Constructing 3D Boxes -- Exact Solutions for Closest String and Related Problems -- Computational Geometry (II) -- Topological Peeling and Implementation -- Image Segmentation with Monotonicity and Smoothness Constraints -- Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards -- Approximation of a Geometric Set Covering Problem -- Invited Talk 3 -- Shortest Path Algorithms: Engineering Aspects -- Graph Drawing and Algorithms (III) -- Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs -- Go with the Winners Algorithms for Cliques in Random Graphs -- Complexity of Partial Covers of Graphs -- On Game-Theoretic Models of Networks -- Parallel and Distributed Algorithms (II) -- The Complexity of Some Basic Problems for Dynamic Process Graphs -- Delay Optimizations in Quorum Consensus -- Randomized Shared Queues Applied to Distributed Optimization Algorithms -- Multiprocess Time Queue -- Computational Geometry (III) -- Labeling Points with Weights -- Small Convex Quadrangulations of Point Sets -- How to Color a Checkerboard with a Given Distribution — Matrix Rounding Achieving Low 2 × 2-Discrepancy -- Labeling Subway Lines -- Randomized and Approximation Algorithms -- Complexity Study on Two Clustering Problems -- A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2 -- A Unified Framework for Approximating Multiway Partition Problems -- On-Line Algorithms for Cardinality Constrained Bin Packing Problems -- Computational Biology and String Matching (II) -- Suffix Vector: A Space-Efficient Suffix Tree Representation -- Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works -- Computing the Quartet Distance between Evolutionary Trees in Time O(n log2 n) -- Algorithms and Data Structures -- The Cent-dian Path Problem on Tree Networks -- Approximate Hotlink Assignment -- Efficient Algorithms for Two Generalized 2-Median Problems on Trees.…”
Click to view e-book

Table of Contents: “…Invited Papers -- Experimental Study of Resilient Algorithms and Data Structures -- Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs -- Contributed Regular Papers -- Alternative Routes in Road Networks -- Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks -- Space-Efficient SHARC-Routing -- A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation -- Contraction of Timetable Networks with Realistic Transfers -- Distributed Time-Dependent Contraction Hierarchies -- Practical Compressed Suffix Trees -- Maximum Cliques in Protein Structure Comparison -- Exact Bipartite Crossing Minimization under Tree Constraints -- Bit-Parallel Search Algorithms for Long Patterns -- Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments -- Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars -- Time-Dependent Contraction Hierarchies and Approximation -- A New Combinational Logic Minimization Technique with Applications to Cryptology -- Randomized Rounding for Routing and Covering Problems: Experiments and Improvements -- The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm -- An Approximate ?…”
Click to view e-book

Table of Contents: “…On the intellectual terrain around NP -- Advances in graph drawing -- On a parallel-algorithms method for string matching problems (overview) -- Some open problems in approximation -- New local search approximation techniques for maximum generalized satisfiability problems -- Learning behaviors of automata from multiplicity and equivalence queries -- Measures of Boolean function complexity based on Harmonic Analysis -- Graph theory and interactive protocols for Reachability Problems on finite Cellular automata -- Parallel pruning decomposition (PDS) and biconnected components of graphs -- A non-interactive electronic cash system -- A unified scheme for routing in expander based networks -- Dynamization of backtrack-free search for the constraint satisfaction problem -- Efficient reorganization of binary search trees -- Time-message trade-offs for the weak unison problem -- On set equality-testing -- On the complexity of some reachability problems -- On self-reducible sets of low information content -- Lower bounds for merging on the hypercube.…”
Click to view e-book

Subjects: “…Algorithms.…”
Click to view e-book

Table of Contents: “…The Basics -- Counting 101 -- Induction and Recursion… and Reduction -- Traversal: The Skeleton Key of Algorithmics -- Divide, Combine, and Conquer -- Greed Is Good? …”
Click to view e-book

Subjects: Click to view e-book

Table of Contents: “…Expression -- Spectral Clustering Gene Ontology Terms to Group Genes by Function -- Dynamic De-Novo Prediction of microRNAs Associated with Cell Conditions: A Search Pruned by Expression -- Clustering Gene Expression Series with Prior Knowledge -- A Linear Time Biclustering Algorithm for Time Series Gene Expression Data -- Time-Window Analysis of Developmental Gene Expression Data with Multiple Genetic Backgrounds -- Phylogeny -- A Lookahead Branch-and-Bound Algorithm for the Maximum Quartet Consistency Problem -- Computing the Quartet Distance Between Trees of Arbitrary Degree -- Using Semi-definite Programming to Enhance Supertree Resolvability -- An Efficient Reduction from Constrained to Unconstrained Maximum Agreement Subtree -- Pattern Identification in Biogeography -- On the Complexity of Several Haplotyping Problems -- A Hidden Markov Technique for Haplotype Reconstruction -- Algorithms for Imperfect Phylogeny Haplotyping (IPPH) with a Single Homoplasy or Recombination Event -- Networks -- A Faster Algorithm for Detecting Network Motifs -- Reaction Motifs in Metabolic Networks -- Reconstructing Metabolic Networks Using Interval Analysis -- Genome Rearrangements -- A 1.375-Approximation Algorithm for Sorting by Transpositions -- A New Tight Upper Bound on the Transposition Distance -- Perfect Sorting by Reversals Is Not Always Difficult -- Minimum Recombination Histories by Branch and Bound -- Sequences -- A Unifying Framework for Seed Sensitivity and Its Application to Subset Seeds -- Generalized Planted (l,d)-Motif Problem with Negative Set -- Alignment of Tandem Repeats with Excision, Duplication, Substitution and Indels (EDSI) -- The Peres-Shields Order Estimator for Fixed and Variable Length Markov Models with Applications to DNA Sequence Similarity -- Multiple Structural RNA Alignment with Lagrangian Relaxation -- Faster Algorithms for Optimal Multiple Sequence Alignment Based on Pairwise Comparisons -- Ortholog Clustering on a Multipartite Graph -- Linear Time Algorithm for Parsing RNA Secondary Structure -- A Compressed Format for Collections of Phylogenetic Trees and Improved Consensus Performance -- Structure -- Optimal Protein Threading by Cost-Splitting -- Efficient Parameterized Algorithm for Biopolymer Structure-Sequence Alignment -- Rotamer-Pair Energy Calculations Using a Trie Data Structure -- Improved Maintenance of Molecular Surfaces Using Dynamic Graph Connectivity -- The Main Structural Regularities of the Sandwich Proteins -- Discovery of Protein Substructures in EM Maps.…”
Click to view e-book

Table of Contents: “…Invited Talks -- Regular Labelings and Geometric Structures -- Algorithmic Aspects of Secure Computation and Communication -- Session 1A. …”
Click to view e-book

Table of Contents: “…1 Introduction -- 1.1 Prologue: Algebra and Algorithms -- 1.2 Motivations -- 1.3 Algorithmic Notations -- 1.4 Epilogue -- Bibliographic Notes -- 2 Algebraic Preliminaries -- 2.1 Introduction to Rings and Ideals -- 2.2 Polynomial Rings -- 2.3 Gröbner Bases -- 2.4 Modules and Syzygies -- 2.5 S-Polynomials -- Problems -- Solutions to Selected Problems -- Bibliographic Notes -- 3 Computational Ideal Theory -- 3.1 Introduction -- 3.2 Strongly Computable Ring -- 3.3 Head Reductions and Gröbner Bases -- 3.4 Detachability Computation -- 3.5 Syzygy Computation -- 3.6 Hilbert’s Basis Theorem: Revisited -- 3.7 Applications of Gröbner Bases Algorithms -- Problems -- Solutions to Selected Problems -- Bibliographic Notes -- 4 Solving Systems of Polynomial Equations -- 4.1 Introduction -- 4.2 Triangular Set -- 4.3 Some Algebraic Geometry -- 4.4 Finding the Zeros -- Problems -- Solutions to Selected Problems -- Bibliographic Notes -- 5 Characteristic Sets -- 5.1 Introduction -- 5.2 Pseudodivision and Successive Pseudodivision -- 5.3 Characteristic Sets -- 5.4 Properties of Characteristic Sets -- 5.5 Wu-Ritt Process -- 5.6 Computation -- 5.7 Geometric Theorem Proving -- Problems -- Solutions to Selected Problems -- Bibliographic Notes -- 6 An Algebraic Interlude -- 6.1 Introduction -- 6.2 Unique Factorization Domain -- 6.3 Principal Ideal Domain -- 6.4 Euclidean Domain -- 6.5 Gauss Lemma -- 6.6 Strongly Computable Euclidean Domains -- Problems -- Solutions to Selected Problems -- Bibliographic Notes -- 7 Resultants and Subresultants -- 7.1 Introduction -- 7.2 Resultants -- 7.3 Homomorphisms and Resultants -- 7.4 Repeated Factors in Polynomials and Discriminants -- 7.5 Determinant Polynomial -- 7.6 Polynomial Remainder Sequences -- 7.7 Subresultants -- 7.8 Homomorphisms and Subresultants -- 7.9 Subresultant Chain -- 7.10 Subresultant Chain Theorem -- Problems -- Solutions to Selected Problems -- Bibliographic Notes -- 8 Real Algebra -- 8.1 Introduction -- 8.2 Real Closed Fields -- 8.3 Bounds on the Roots -- 8.4 Sturm’s Theorem -- 8.5 Real Algebraic Numbers -- 8.6 Real Geometry -- Problems -- Solutions to Selected Problems -- Bibliographic Notes -- Appendix A: Matrix Algebra -- A.1 Matrices -- A.2 Determinant -- A.3 Linear Equations.…”
Click to view e-book

Table of Contents: “…Introduction -- Kernelization -- Bounded Search Trees -- Iterative Compression -- Randomized Methods in Parameterized Algorithms -- Miscellaneous -- Treewidth -- Finding Cuts and Separators -- Advanced Kernelization Algorithms -- Algebraic Techniques: Sieves, Convolutions, and Polynomials -- Improving Dynamic Programming on Tree Decompositions -- Matroids -- Fixed-Parameter Intractability -- Lower Bounds Based on the Exponential-Time Hypothesis -- Lower Bounds for Kernelization.…”
Click to view e-book

Table of Contents: “…. - The complexity of finding (approximate sized) distance d dominating sets in tournaments -- On Computational Aspects of Greedy Partitioning of Graphs -- Maximum Edge Bicliques in Tree Convex Bipartite Graphs -- Complete Submodularity Characterization in the Comparative Independent Cascade Model -- A Risk-reward Model for On-line Financial Leasing Problem with an Interest Rate -- Designing and Implementing Algorithms for the Closest String Problem -- The Broken-Triangle Property with Adjoint Values -- Online Knapsack Problem under Concave Functions -- Fluctuated Fitting under the L1-metric -- Optimal Partitioning Which Maximizes the Weighted Sum of Products -- Modular-width: An Auxiliary Parameter for Parameterized Parallel Complexity -- Online Strategies for Evacuating from a Convex Region in the Plane -- A further analysis of the dynamic dominant resource fairness mechanism -- A 42k Kernel for the Complementary Maximal Strip Recovery Problem -- On-line Scheduling with a Monotonous Subsequence Constraint -- A 1.4-Approximation Algorithm For Two-sided Scaffold Filling -- FPT algorithms for FVS parameterized by split and cluster vertex deletion sets and other parameters -- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order -- Geodectic Contraction Games on Trees -- On Approximation Algorithms for Two-Stage Scheduling Problems -- A New Lower Bound for Positive Zero Forcing -- Phase Transition for Maximum Not-All-Equal Satisfiability. .…”
Click to view e-book

Table of Contents: “…Algorithms and Linear Programming Relaxations for Scheduling Unrelated Parallel Machines.- The Hub Labeling Algorithm.- Design of Practical Succinct Data Structures for Large Data Collections.- Hub Label Compression.- Faster Customization of Road Networks.- Intriguingly Simple and Fast Transit Routing.- Transit Node Routing Reconsidered.- A New QEA Computing Near-Optimal Low-Discrepancy Colorings in the Hypergraph of Arithmetic Progressions.- Computational Aspects of Ordered Integer Partition with Upper Bounds.- Hypergraph Transversal Computation with Binary Decision Diagrams.- Efficient Counting of Maximal Independent Sets in Sparse Graphs -- An Edge Quadtree for External Memory.- Branchless Search Programs.- Lightweight Lempel-Ziv Parsing.- Space-Efficient, High-Performance Rank and Select Structures on Uncompressed Bit Sequences -- Think Locally, Act Globally: Highly Balanced Graph Partitioning.- Evaluation of ILP-Based Approaches for Partitioning into Colorful Components -- Finding Modules in Networks with Non-modular Regions.- Telling Stories Fast: Via Linear-Time Delay Pitch Enumeration -- Undercover Branching.- Quadratic Outer Approximation for Convex Integer Programming with Box Constraints -- Separable Non-convex Underestimators for Binary Quadratic Programming.- Hybrid SDP Bounding Procedure.- Computing Multimodal Journeys in Practice.- Efficient Computation of Jogging Routes.- Dominator Certification and Independent Spanning Trees: An Experimental Study.- Novel Techniques for Automorphism Group Computation.- Blinking Molecule Tracking.- The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm.- An Improved Branching Algorithm for Two-Layer Planarization Parameterized by the Feedback Edge Set Number.- In-Out Separation and Column Generation Stabilization by Dual Price Smoothing.- Energy Minimization via a Primal-Dual Algorithm for a Convex Program -- Reoptimization in Branch-and-Bound Algorithms with an Application to Elevator Control.- Cluster-Based Heuristics for the Team Orienteering Problem with Time Windows.- Finding Robust Solutions for the Stochastic Job Shop Scheduling Problem by Including Simulation in Local Search.…”
Click to view e-book

Table of Contents: “…,k)-Coverage in Dense Sensor Networks -- Optimal Surface Flattening -- Visiting a Polygon on the Optimal Way to a Query Point -- Constraint Abstraction in Verification of Security Protocols -- Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback -- Applying a New Grid-Based Elitist-Reserving Strategy to EMO Archive Algorithms -- The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants -- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach -- A Scalable Algorithm for Graph-Based Active Learning -- A Supervised Feature Extraction Algorithm for Multi-class -- An Incremental Feature Learning Algorithm Based on Least Square Support Vector Machine -- A Novel Wavelet Image Fusion Algorithm Based on Chaotic Neural Network.…”
Click to view e-book

Table of Contents: “…String Rearrangement Metrics: A Survey -- Maximal Words in Sequence Comparisons Based on Subword Composition -- Fast Intersection Algorithms for Sorted Sequences -- Indexing and Searching a Mass Spectrometry Database -- Extended Compact Web Graph Representations -- A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches -- Covering Analysis of the Greedy Algorithm for Partial Cover -- From Nondeterministic Suffix Automaton to Lazy Suffix Tree -- Clustering the Normalized Compression Distance for Influenza Virus Data -- An Evolutionary Model of DNA Substring Distribution -- Indexing a Dictionary for Subset Matching Queries -- Transposition and Time-Scale Invariant Geometric Music Retrieval -- Unified View of Backward Backtracking in Short Read Mapping -- Some Applications of String Algorithms in Human-Computer Interaction -- Approximate String Matching with Reduced Alphabet -- ICT4D: A Computer Science Perspective -- Searching for Linear Dependencies between Heart Magnetic Resonance Images and Lipid Profiles -- The Support Vector Tree.…”
Click to view e-book

Table of Contents: “…Methods in parallel algorithmics and who may need to know them? -- Rectilinear paths among rectilinear obstacles -- Linear time algorithms for k-cutwidth problem -- The k-edge-connectivity augmentation problem of weighted graphs -- Principal lattice of partitions of submodular functions on graphs: Fast algorithms for principal partition and generic rigidity -- The application of the searching over separators strategy to solve some NP-complete problems on planar graphs -- Parallel and on-line graph coloring algorithms -- Competitive analysis of the Round Robin algorithm -- Competitive analysis of the on-line algorithms for multiple stacks systems -- Self-adjusting augmented search trees -- Algorithms for a class of Min-Cut and Max-Cut problem -- Algorithms for rectilinear optimal multicast tree problem -- Approximating treewidth and pathwidth of some classes of perfect graphs -- Graph spanners and connectivity -- Randomized range-maxima in nearly-constant parallel time -- Fault-tolerant broadcasting in binary jumping networks -- Routing problems on the mesh of buses -- Selection networks with 8n log2 n size and O(log n) depth -- Relativizations of the P=? …”
Click to view e-book

Table of Contents: “…Tribute -- Grzegorz Rozenberg: A Magical Scientist and Brother -- Sequence Discovery, Generation, and Analysis -- Monotony and Surprise -- Information Content of Sets of Biological Sequences Revisited -- Duplication in DNA Sequences -- Sequence and Structural Analyses for Functional Non-coding RNAs -- Gene Assembly in Ciliates -- Strategies for RNA-Guided DNA Recombination -- Reality-and-Desire in Ciliates -- Template-Guided Recombination: From Theory to Laboratory -- Nanoconstructions and Self-assembly -- DNA Cages with Icosahedral Symmetry in Bionanotechnology -- Applying Symmetric Enumeration Method to One-Dimensional Assembly of Rotatable Tiles -- A Self-assembly Model of Time-Dependent Glue Strength -- The Perils of Polynucleotides Revisited -- Algorithmic Control: The Assembly and Operation of DNA Nanostructures and Molecular Machinery -- Membrane Computing -- On Nonuniversal Symport/Antiport P Systems -- Spiking Neural P Systems. …”
Click to view e-book

Table of Contents: “…Genetic algorithms as multi-coordinators in large-scale optimization -- Telecommunication network optimization with genetic algorithms: A decade of practice -- Using evolutionary algorithms to search for control parameters in a nonlinear partial differential equation -- Applying genetic algorithms to real-world problems -- An overview of evolutionary programming -- A hierarchical genetic algorithm for system identification and curve fitting with a supercomputer implementation -- Experiences with the PGAPack parallel genetic algorithm library -- The significance of the evaluation function in evolutionary algorithms -- Genetic algorithm optimization of atomic clusters -- Search, binary representations and counting optima -- An investigation of GA performance results for different cardinality alphabets -- Genetic algorithms and the design of experiments -- Efficient parameter optimization based on combination of direct global and local search methods -- What are genetic algorithms? …”
Click to view e-book

Table of Contents: “…Geometric Algorithms for the Constrained 1-D K-Means Clustering Problems and IMRT Applications -- A Fast Preprocessing Algorithm to Select Gene-Specific Probes of DNA Microarrays -- Approximation Algorithms for a Point-to-Surface Registration Problem in Medical Navigation -- Biometric Digital Signature Key Generation and Cryptography Communication Based on Fingerprint -- New Algorithms for the Spaced Seeds -- Region-Based Selective Encryption for Medical Imaging -- Extracting Information of Anti-AIDS Inhibitor from the Biological Literature Based on Ontology -- A Novel Biology-Based Reversible Data Hiding Fusion Scheme -- On the Approximation and Smoothed Complexity of Leontief Market Equilibria -- On Coordination Among Multiple Auctions -- The On-Line Rental Problem with Risk and Probabilistic Forecast -- Distributed Planning for the On-Line Dial-a-Ride Problem -- Maximizing the Number of Independent Labels in the Plane -- On the Fractional Chromatic Number of Monotone Self-dual Boolean Functions -- On the Complexity of Approximation Streaming Algorithms for the k-Center Problem -- Scheduling an Unbounded Batch Machine to Minimize Maximum Lateness -- A Non-interleaving Denotational Semantics of Value Passing CCS with Action Refinement -- Constraints Solution for Time Sensitive Security Protocols -- Using Bit Selection to Do Routing Table Lookup -- A New Fuzzy Decision Tree Classification Method for Mining High-Speed Data Streams Based on Binary Search Trees -- Hamiltonian Property on Binary Recursive Networks -- A Performance Guaranteed New Algorithm for Fault-Tolerant Routing in Folded Cubes -- Pathologic Region Detection Algorithm for Prostate Ultrasonic Image Based on PCNN -- A Novel Heuristic Approach for Job Shop Scheduling Problem -- An Efficient Physically-Based Model for Chinese Brush -- A Trigram Statistical Language Model Algorithm for Chinese Word Segmentation -- An O(nm)-Time Certifying Algorithm for Recognizing HHD-Free Graphs -- Easy Problems for Grid-Structured Graphs -- Long Alternating Cycles in Edge-Colored Complete Graphs -- Notes on Fractional (1,f)-Odd Factors of Graphs -- Some New Structural Properties of Shortest 2-Connected Steiner Networks -- The Parameterized Complexity of the Induced Matching Problem in Planar Graphs -- Removable Edges of a Spanning Tree in 3-Connected 3-Regular Graphs.…”
Click to view e-book

Table of Contents: “…The Boyer—Moore—Horspool Algorithm -- 7 Depth-First Search (Ariadne & Co.) -- 8 Pledge's Algorithm – How to Escape from a Dark Maze -- 9 Cycles in Graphs -- 10 PageRank – What Is Really Relevant in the World-Wide Web? …”
Click to view e-book

Table of Contents: “…A note on handicap incomplete tournaments -- Computing the k-Crossing Visibility Region of a Point in a Polygon -- An Improved Scheme in the Two Query Adaptive Bitprobe Model -- On Erdős‒Szekeres-type problems for k-convex point sets -- Algorithms and Hardness results on Liar's Dominating Set and k-tuple Dominating Set -- Fixed-parameter tractability of (n-k) List Coloring -- Finding Periods in Cartesian Tree Matching -- Parameterized Complexity of Min-Power Asymmetric Connectivity -- Solving Group Interval Scheduling Efficiently -- Call Admission on Trees with Advice (Extended Abstract) -- Power Edge Set and Zero Forcing Set remain difficult in cubic graphs -- Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs -- Maximal irredundant set enumeration in bounded-degeneracy and bounded-degree hypergraphs -- Dual Domination -- Reaching 3-Connectivity via Edge-edge Additions -- Cops and robber on some families of oriented graphs -- Disjoint clustering in combinatorial circuits -- The hull number in the convexity of induced paths of order 3 -- Supermagic graphs with many odd degrees -- Incremental algorithm for minimum cut and edge connectivity in Hypergraph -- A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications -- Shortest-Path-Preserving Rounding -- Complexity and Algorithms for Semipaired Domination in Graphs -- Computing the Rooted Triplet Distance between Phylogenetic Networks -- Parameterized Algorithms for Graph Burning Problem -- Extension and its price for the connected vertex cover problem -- An Improved Fixed-Parameter Algorithm for Max-Cut Parameterized by Crossing Number -- An Efficient Algorithm for Enumerating Chordal Bipartite Induced Subgraphs in Sparse Graphs -- Complexity of fall coloring for restricted graph classes -- Succinct Representation of Linear Extensions via MDDs and Its Application to Scheduling under Precedence Constraints -- Maximum clique exhaustive search in circulant k-hypergraphs -- Burrows-Wheeler transform of words defined by morphisms -- Stable Noncrossing Matchings -- On the Average Case of MergeInsertion -- Shortest Unique Palindromic Substring Queries on Run-Length Encoded Strings -- A Partition Approach to Lower Bounds for Zero-Visibility Cops and Robber.…”
Click to view e-book

Table of Contents: “…Applications of a numbering scheme for polygonal obstacles in the plane -- Multicast communication in high speed networks -- Incremental convex hull algorithms are not output sensitive -- Separating and shattering long line segments -- Optimal line bipartitions of point sets -- Interval finding and its application to data mining -- On the approximability of the Steiner tree problem in phylogeny -- Approximation and special cases of common subtrees and editing distance -- Two-dimensional dynamic dictionary matching -- Discovering unbounded unions of regular pattern languages from positive examples -- Extremal problems for geometric hypergraphs -- Computing fair and bottleneck matchings in geometric graphs -- Computing the maximum overlap of two convex polygons under translations -- OBDDs of a monotone function and of its prime implicants -- Algorithms for maximum matching and minimum fill-in on chordal bipartite graphs -- Graph searching on chordal graphs -- An algorithm for enumerating all directed spanning trees in a directed graph -- Vertex ranking of asteroidal triple-free graphs -- Recursively divisible problems -- StUSPACE(log n) ?…”
Click to view e-book

Table of Contents: “…1. Foundations of Algorithm Engineering -- 2. Modeling -- 3. Selected Design Issues -- 4. …”
Click to view e-book

Click to view e-book

Table of Contents: “…Reducing Splaying by Taking Advantage of Working Sets -- Engineering Burstsort: Towards Fast In-Place String Sorting -- Comparing Integer Data Structures for 32 and 64 Bit Keys -- A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems -- Layer-Free Upward Crossing Minimization -- On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations -- Computing Branch Decomposition of Large Planar Graphs -- Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem -- Computing Multiple Watchman Routes -- Engineering Parallel In-Place Random Generation of Integer Permutations -- Parallel Partition Revisited -- Broadword Implementation of Rank/Select Queries -- Efficient Implementations of Heuristics for Routing and Wavelength Assignment -- Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games -- When to Reap and When to Sow – Lowering Peak Usage with Realistic Batteries -- Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design -- Fast Local Search for the Maximum Independent Set Problem -- Optimal University Course Timetables and the Partial Transversal Polytope -- A Basic Toolbox for Constrained Quadratic 0/1 Optimization -- Empirical Investigation of Simplified Step-Size Control in Metaheuristics with a View to Theory -- Reconstructing Phylogenetic Networks with One Recombination -- Exact Algorithms for Cluster Editing: Evaluation and Experiments -- Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra’s Algorithm -- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks -- Bidirectional A ??? …”
Click to view e-book

Table of Contents: “…Invited Presentations -- Voronoi-Based Systems of Coordinates and Surface Reconstruction -- Essentially Every Unimodular Matrix Defines an Expander -- Algorithms and Data Structures (I) -- Strategies for Hotlink Assignments -- A New Competitive Analysis of Randomized Caching -- Online Routing in Convex Subdivisions -- Combinatorial Optimization -- A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors -- Classification of Various Neighborhood Operations for the Nurse Scheduling Problem -- Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets -- Algorithms and Data Structures (II) -- Coping with Delays and Time-Outs in Binary Search Procedures -- Some Formal Analysis of Rocchio’s Similarity-Based Relevance Feedback Algorithm -- Reasoning with Ordered Binary Decision Diagrams -- Approximation and Randomized Algorithms (I) -- On Approximating Minimum Vertex Cover for Graphs with Perfect Matching -- A 2-Approximation Algorithm for Path Coloring on Trees of Rings -- An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree -- Algorithms and Data Structures (III) -- Finding Independent Spanning Trees in Partial k-Trees -- On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover -- Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width -- Approximation and Randomized Algorithms (II) -- Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits -- A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane -- Simple Algorithms for a Weighted Interval Selection Problem -- Graph Drawing and Algorithms -- Efficient Minus and Signed Domination in Graphs -- Convex Grid Drawings of Four-Connected Plane Graphs -- An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs -- Automata, Cryptography, and Complexity Theory -- Undecidability Results for Monoids with Linear-Time Decidable Word Problems -- Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures -- Derandomizing Arthur-Merlin Games under Uniform Assumptions -- Algorithms and Data Structures (IV) -- A Near Optimal Algorithm for Vertex Connectivity Augmentation -- Simultaneous Augmentation of Two Graphs to an ?…”
Click to view e-book

Table of Contents: “…and Overview -- Population, Sample, and Sampling Design -- Sampling Algorithms -- Simple Random Sampling -- Unequal Probability Exponential Designs -- The Splitting Method -- More on Unequal Probability Designs -- Balanced Sampling -- An Example of the Cube Method.…”
Click to view e-book

Table of Contents: “…Algorithmic Challenges in Digital Microfluidic Biochips: Protocols, Design and Test -- Monitoring Distributed, Heterogeneous Data Streams: The Emergence of Safe Zones -- Exploiting Heterogeneous Data Sources: A Computing Paradigm for Live Web and Sustainability Applications -- Constructing an n-dimensional Cell Complex from a Soup of (n − 1)-Dimensional Faces -- A Digital-Geometric Algorithm for Generating a Complete Spherical Surface in Z3 -- Bar 1-Visibility Drawings of 1-Planar Graphs -- Search Strategies for Subgraph Isomorphism Algorithms -- Analysis of Concentration Errors in Sample Dilution Algorithms on a Digital Microfluidic Biochip -- Choosing and Working of an Anonymous Leader -- An Efficient ID Based Security Algorithm for Mutual Node Authentication and Key Management: An Elliptic Curve Cryptography Based Approach -- Automata for Modeling the Distributed Probabilistic Reversible Processes -- Finding Influential Nodes in Social Networks Using Minimum k-Hop Dominating Set -- Efficient Heuristics for the Time Dependent Team Orienteering Problem with Time Windows -- Color Texture Image Segmentation Based on Neutrosophic Set and Nonsubsampled Contourlet Transformation -- An Experimental Analysis of Vertex Coloring Algorithms on Sparse Random Graphs -- An Experimental Study of a Novel Move-to-Front-or-Middle (MFM) List Update Algorithm -- Too Long-Didnt Read: A Practical Web Based Approach towards Text Summarization -- A Comparative Study of Tag SNP Selection Using Clustering -- Application of Spectral Unmixing Algorithm on Hyperspectral Data for Mangrove Species Classification -- Automatic Extraction of Headlines from Punjabi Newspapers -- A Similarity Measure for Clustering Gene Expression Data -- A Huffman Code Based Image Steganography Technique -- Expression-Invariant 3D Face Recognition Using K-SVD Method -- An Efficient Face Recognition Method by Fusing Spatial Discriminant Facial Features.…”
Click to view e-book

Table of Contents: “…Graph Modification Problems: A Modern Perspective -- Soft Subdivision Search in Motion Planning, II: Axiomatics -- On r-Gatherings on the Line -- A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow -- Efficient Computation of the Characteristic Polynomial of a Threshold Graph -- A Fast and Practical Method to Estimate Volumes of Convex Polytopes -- Social Models and Algorithms for Optimization of Contact Immunity of Oral Polio Vaccine -- The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation -- A Linear Time Algorithm for Ordered Partition -- Machine Scheduling with a Maintenance Interval and Job Delivery Coordination -- Lower and Upper Bounds for Random Mimimum Satisfiability Problem -- On Solving Systems of Diagonal Polynomial Equations Over Finite Fields -- Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints -- On the Sound Covering Cycle Problem in Paired de Bruijn Graphs -- Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties -- Smaller Kernels for Several FPT Problems Based on Simple Observations -- ParameterizedMinimum Cost Partition of a Tree with Supply and Demand -- The Online Storage Strategy for Automated Storage and Retrieval System with Single Open in One Dimension -- Union Closed Tree Convex Sets -- Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores -- A New Distributed Algorithm for Computing a Dominating Set on Grids -- Approximate Model Counting via Extension Rule -- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory -- Truthful Strategy and Resource Integration for Multi-tenant Data Center Demand Response -- Local Search to Approximate Max NAE-k-Sat Tightly -- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs -- Enumeration, Counting, and Random Generation of Ladder Lotteries -- Efficient Modular Reduction Algorithm Without Correction Phase -- Super Solutions of Random Instances of Satisfiability -- A Data Streams Analysis Strategy Based on Hadoop Scheduling Optimization for Smart Grid Application.…”
Click to view e-book

Subjects: Click to view e-book

Subjects: “…Computer algorithms.…”

Click to view e-book

Subjects: “…Graph algorithms.…”

Table of Contents: “…Towards fault-tolerant and secure agentry -- Workflow management — An exercise in distributed computing -- In memory of Anya Pogosyants -- Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study -- A simple DFS-Based algorithm for linear interval routing -- ATM layouts with bounded hop count and congestion -- Scheduling in synchronous networks and the greedy algorithm -- Rapid convergence of a local load balancing algorithm for asynchronous rings -- Performing tasks on restartable message-passing processors -- Revisiting the Paxos algorithm -- Heartbeat: A timeout-free failure detector for quiescent reliable communication -- Genuine atomic multicast -- Low-overhead time-triggered group membership -- Virtual precedence in asynchronous systems: Concept and applications -- Detecting global predicates in distributed systems with clocks -- Fault tolerance bounds for memory consistency -- Precedence-based memory models -- Strong interaction fairness in a fully distributed system with unbounded speed variability -- Reliable communication over partially authenticated networks -- Self-stabilizing depth-first token passing on rooted networks -- Secure distributed storage and retrieval -- Optimal wait-free clock synchronization protocol on a shared-memory multi-processor system -- Transparent support for wait-free transactions -- On the power of multi-objects.…”
Click to view e-book

Subjects: