close
1.

電子ブック

EB
edited by Andrew Phillips, Peng Yin
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9211
オンライン: http://dx.doi.org/10.1007/978-3-319-21999-8
目次情報: 続きを見る
Algorithms and models for computation on biomolecular Systems
Computational processes in vitro and in vivo
Molecular switches, gates, devices, and circuits
Molecular folding and self-assembly of nanostructures
Analysis and theoretical models of laboratory techniques
Molecular motors and molecular robotics
Studies of fault-tolerance and error correction
Software tools for analysis, simulation, and design
Synthetic biology and in vitro Evolution
Applications in engineering, physics, chemistry, biology, and medicine
Algorithms and models for computation on biomolecular Systems
Computational processes in vitro and in vivo
Molecular switches, gates, devices, and circuits
2.

電子ブック

EB
edited by Laura Sanita, Martin Skutella
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9499
オンライン: http://dx.doi.org/10.1007/978-3-319-28684-6
目次情報: 続きを見る
Algorithmic game theory
Algorithmic trading
Coloring and partitioning
Competitive analysis
Computational advertising
Computational finance
Cuts and connectivity
Geometric problems
Graph algorithms
Inapproximability
Mechanism design
Natural algorithms
Network design
Packing and covering.-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems. -Real-world applications
Algorithmic game theory
Algorithmic trading
Coloring and partitioning
3.

電子ブック

EB
edited by Giuseppe F Italiano, Giovanni Pighizzini, Donald T. Sannella
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9234
オンライン: http://dx.doi.org/10.1007/978-3-662-48057-1
4.

電子ブック

EB
edited by Khaled Elbassioni, Kazuhisa Makino
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9472
オンライン: http://dx.doi.org/10.1007/978-3-662-48971-0
5.

電子ブック

EB
edited by Ferdinando Cicalese, Ely Porat, Ugo Vaccaro
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9133
オンライン: http://dx.doi.org/10.1007/978-3-319-19929-0
目次情報: 続きを見る
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling
A Framework for Space-Efficient String Kernels
Composite Repetition-Aware Data Structures
Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis
Longest Common Extensions in Trees
Longest Common Extensions in Sublinear Space
Ranked Document Retrieval with Forbidden Pattern
Parameterized Complexity of Superstring Problems
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem
Fast String Dictionary Lookup with One Error
On the Readability of Overlap Digraphs
Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem
Range Minimum Query Indexes in Higher Dimensions
Alphabet-Dependent String Searching with Wexponential Search Trees
Lempel Ziv Computation in Small Space (LZ-CISS)
Succinct Non-overlapping Indexing
Encodings of Range Maximum-Sum Segment Queries and Applications
Compact Indexes for Flexible Top-k Retrieval
LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm
Dictionary Matching with Uneven Gaps
Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets
String Powers in Trees
Online Detection of Repetitions with Backtracking
Greedy Conjecture for Strings of Length 4
Tighter Bounds for the Sum of Irreducible LCP Values
Parallel External Memory Suffix Sorting
On Maximal Unbordered Factors
Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree
Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints
A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS Algorithm
Encoding Nearest Larger Values
Sorting by Cuts, Joins and Whole Chromosome Duplications
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling
A Framework for Space-Efficient String Kernels
Composite Repetition-Aware Data Structures
6.

電子ブック

EB
edited by Francesco Parisi-Presicce, Bernhard Westfechtel
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9151
オンライン: http://dx.doi.org/10.1007/978-3-319-21145-9
目次情報: 続きを見る
Polymorphic Sesqui-Pushout Graph Rewriting
Predictive Top-Down Parsing for Hyperedge Replacement Grammars
AGREE ? Algebraic Graph Rewriting with Controlled Embedding
Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings
Towards Local Confluence Analysis for Amalgamated Graph Transformation
Multi-amalgamated Triple Graph Grammars
Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs
Reachability in Graph Transformation Systems and Slice Languages
Equational Reasoning with Context-Free Families of String Diagrams
Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations
Characterizing Conflicts Between Rule Application and Rule Evolution in Graph Transformation Systems
Graph Pattern Matching as an Embedded Clojure DSL
Using Graph Transformations for Formalizing Prescriptions and Monitoring
Towards Compliance Verification Between Global and Local Process Models
Inductive Invariant Checking with Partial Negative Application Conditions
Tool Support for Multi-amalgamated Triple Graph Grammars
Uncover: Using Coverability Analysis for Verifying Graph Transformation Systems
Local Search-Based Pattern Matching Features in EMF-INCQUERY
Polymorphic Sesqui-Pushout Graph Rewriting
Predictive Top-Down Parsing for Hyperedge Replacement Grammars
AGREE ? Algebraic Graph Rewriting with Controlled Embedding
7.

電子ブック

EB
edited by Cheng-Lin Liu, Bin Luo, Walter G. Kropatsch, Jian Cheng
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9069
オンライン: http://dx.doi.org/10.1007/978-3-319-18224-7
目次情報: 続きを見る
Graph-based Representation
Approximation of Graph Edit Distance in Quadratic Time
Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem
An Entropic Edge Assortativity Measure
A Subpath Kernel for Learning Hierarchical Image Representations
Coupled-Feature Hypergraph Representation for Feature Selection
Reeb Graphs Through Local Binary Patterns
Incremental embedding within a dissimilarity-based framework
Graph Matching
A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching
Consensus of Two Graph Correspondences through a Generalisation of the Bipartite Graph Matching Algorithm
Revisiting Volegnant-Jonker for Approximating Graph Edit Distance
A Hypergraph Matching Framework for Refining Multi-source Feature Correspondences
Kite Recognition by means of Graph Matching
GEM++: a tool for solving substitution-tolerant subgraph isomorphism
A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance
Improving Hausdorff Edit Distance Using Structural Node Context
Learning Graph Model for Different Dimensions Image Matching
VF2 Plus: An Improved Version of VF2 For Biological Graphs
Report on the First Contest on Graph Matching Algorithms for Pattern Search in Biological Databases
Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance
Multi-layer Tree Matching Using HSTs
Large-scale Graph Indexing using Binary Embeddings of Node Contexts
Attributed Relational Graph Matching with Sparse Relaxation and Bistochastic Normalization
Graph Clustering and Classification.-On the Influence of Node Centralities on Graph Edit Distance for Graph Classification
A Mixed Weisfeiler-Lehman Graph Kernel
A Quantum Jensen-Shannon Graph Kernel using Discrete-time Quantum Walks
Density Based Cluster Extension and Dominant Sets Clustering
Salient Object Segmentation from Stereoscopic Images
Causal Video Segmentation using Superseeds and Graph Matching
Fast Minimum Spanning Tree based Clustering Algorithms on Local Neighborhood Graph
Graph-based Application
From bags to graphs of stereo subgraphs in order to predict molecule's properties
Thermodynamics of Time Evolving Networks
Isometric Mapping Hashing
Skeletal Graphs from Schrodinger Magnitude and Phase
Graph Based Lymphatic Vessel Wall Localisation and Tracking
A Comic Retrieval System Based on Multilayer Graph Representation and Graph Mining
Learning High-Order Structures for Texture Retrieval
Graph-based Representation
Approximation of Graph Edit Distance in Quadratic Time
Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem
8.

電子ブック

EB
edited by Kratochvil Jan, Mirka Miller, Dalibor Froncek
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8986
オンライン: http://dx.doi.org/10.1007/978-3-319-19315-1
目次情報: 続きを見る
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem
Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk
On the Galois Lattice of Bipartite Distance Hereditary Graphs
Fast Simple Computations Using Prefix Tables under Hamming and Edit Distance
Border Correlations, Lattices and the Subgraph Component Polynomial
Computing Minimum Length Representations of Sets of Words of Uniform Length
Computing Primitively-Rooted Squares and Runs in Partial Words
3-coloring triangle-free planar graphs with a precolored 9-cycle
Computing Heat Kernel Pagerank and a Local Clustering Algorithm
Solving Matching Problems Efficiently in Bipartite Graphs
A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras
On decomposing the complete graph into the union of two disjoint cycles
Reconfiguration of Vertex Covers in a Graph
Space Efficient Data Structures for Nearest Larger Neighbor Playing several variants of Mastermind with constant-size memory is not harder than with unbounded memory
On Maximum Common Subgraph Problems in Series-Parallel Graphs
Profile-based optimal matchings in the Student/Project Allocation Problem
The Min-Max Edge q-Coloring Problem
Speeding up Graph Algorithms via Switching Classes
Metric Dimension for Amalgamations of Graphs
Deterministic Algorithms for the Independent Feedback Vertex Set Problem
Lossless seeds for searching short patterns with high error rates
On the Complexity of Various Parameterizations of Common Induced Subgraph Isomorphism
Approximation and Hardness Results for the Maximum Edges in Transitive Closure Problem
Quantifying Privacy: A Novel Entropy-Based Measure of Disclosure Risk
9.

電子ブック

EB
edited by Frank Dehne, Jorg-Rudiger Sack, Ulrike Stege
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9214
オンライン: http://dx.doi.org/10.1007/978-3-319-21840-3
目次情報: 続きを見る
Contact Graphs of Circular Arcs
Contact Representations of Graphs in 3D
Minimizing the Aggregate Movements for Interval Coverage
Online Bin Packing with Advice of Small Size
On the Approximability of Orthogonal Order Preserving Layout Adjustment
An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs
Generation of Colourings and Distinguishing Colourings of Graphs
Strictly Implicit Priority Queues: On the Number of Moves and Worst-Case Time
On Coct-Free Multi-Coloring
Semi-dynamic connectivity in the plane
Interval Selection in the Streaming Model
On the Bounded-Hop Range Assignment Problem
Greedy Is an Almost Optimal Deque
A New Approach for Contact Graph Representations and Its Applications
Communication and Dynamic Networks
Dealing With 4-Variables by Resolution: An Improved MaxSAT Algorithm
Select with Groups of 3 or 4 Approximating Nearest Neighbor Distances
Linearity is Strictly More Powerful than Contiguity for Encoding Graphs
On the Complexity of an Unregulated Traffic Crossing
Finding Pairwise Intersections Inside a Query Range
Cache-Oblivious Iterated Predecessor Queries via Range Coalescing
Polylogarithmic Fully Retroactive Priority Queues
On the Minimum Eccentricity Shortest Path Problem
Convex polygons in geometric triangulations
Straight-line Drawability of a Planar Graph Plus an Edge
Solving Problems on Graphs of High Rank-Width
The Parametric Closure Problem
Rooted Cycle Bases
On the Chain Pair Simplification Problem
Finding Articulation Points of Large Graphs in Linear Time
LP-based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design
Universal Reconstruction of a String
The complexity of dominating set reconfiguration
Editing Graphs into Few Cliques: Complexity, Approximation, and Kernelization Schemes
Competitive Diffusion on Weighted Graphs
Sorting and Selection with Equality Comparisons
Polynomial Delay Algorithm for Listing Minimal Edge Dominating sets in Graphs
Fast and simple connectivity in graph timelines
Dynamic Set Intersection
Time-Space Trade-of is for Triangulations and Voronoi Diagrams
A 2k-Vertex Kernel for Maximum Internal Spanning Tree
Reconfiguration on sparse graphs
Smoothed Analysis of Local Search Algorithms
Optimal Shue Code with Permutation Instructions
Non-Preemptive Scheduling on Machines with Setup Times
A Moderately Exponential Time Algorithm for k -IBDD Satisfiability
On the Parameterized Complexity of Girth and Connectivity Problems on Linear Matroids
Inferring People's Social Behavior by Exploiting Their Spatiotemporal Location Data
lastic Geometric Shape Matching for Point Sets under Translations
Constant Time Enumeration by Amortization
Computing the Center of Uncertain Points on Tree Networks
Swapping Colored Tokens on Graphs
Contact Graphs of Circular Arcs
Contact Representations of Graphs in 3D
Minimizing the Aggregate Movements for Interval Coverage
10.

電子ブック

EB
edited by Vangelis Th. Paschos, Peter Widmayer
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9079
オンライン: http://dx.doi.org/10.1007/978-3-319-18173-8
目次情報: 続きを見る
Communication, Dynamics and Renormalization
Fast and Powerful Hashing using Tabulation
Green Barrier Coverage with Mobile Sensors
A Re?ned Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths
Orthogonal Graph Drawing with In?exible Edges
Linear time Constructions of some d-Restriction Problems
E?ciently Testing T-Interval Connectivity in Dynamic Graphs
Competitive Strategies for Online Clique Clustering
Scheduling with Gaps: New Models and Algorithms
MinMax-Distance Gathering on given Meeting Points
Evacuating Robots from a Disk Using Face-to-Face Communication
Planarity of Streamed Graphs
Clique-width of Graph Classes De?ned by Two Forbidden Induced Subgraphs
Randomized Adaptive Test Cover
Contraction Blockers for Graphs with Forbidden Induced Paths
Label Placement in Road Maps
Discrete Stochastic Submodular Maximization: Adaptive vs. Non-Adaptive vs. O?ine
Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints
Simple strategies versus optimal schedules in multi-agent patrolling
Sharing Non-Anonymous Costs of Multiple Resources Optimally
Algorithms solving the Matching Cut problem
End-Vertices of Graph Search Algorithms
Deciding the On-line Chromatic Number of a Graph with Pre-coloring is PSPACE-complete
A Lex-BFS-based recognition algorithm for Robinsonian matrices
Mixed Map Labeling
Optimal Online Edge Coloring of Planar Graphs with Advice
Approximability of Two Variants of Multiple Knapsack
Block Sorting is Hard
An opportunistic text indexing structure based on run length encoding
PSPACE-completeness of Bloxorz and of Games with 2-Buttons
Advice Complexity of Fine-Grained Job Shop Scheduling
Communication, Dynamics and Renormalization
Fast and Powerful Hashing using Tabulation
Green Barrier Coverage with Mobile Sensors