FOREWORD (Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク

概要

著者

関連論文

Constant Time Generation of Trees with Degree Bounds
A Memory-Efficient Algorithm and Its Implementation of Variable-Size All-to-All Communication
k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph
Augmenting Edge-Connectivity and Vertex-Connectivity Simultaneously
Enumerating Colored and Rooted Outerplanar Graphs
Two Enhanced Heuristic Algorithms for the Minimum Initial Marking Problem of Petri Nets
Improved Heuristic Algorithms for Minimizing Initial Markings of Petri Nets(Concurrent/Hybrid Systems : Theory and Applications)
Experimental Evaluation of Two Algorithms for Computing Petri Net Invariants(Special Section on Concurrent Systems Technology)
BI-CRITERIA FOOD PACKING BY DYNAMIC PROGRAMMING(the 50th Anniversary of the Operations Research Society of Japan)
APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(the 50th Anniversary of the Operations Research Society of Japan)
On Ambiguity in Coppersmith' Attacking Method against NIKS-TAS Scheme (Special Section on Cryptgraphy and Information Security)
Enhancing PC Cluster-Based Parallel Branch-and-Bound Algorithms for the Graph Coloring Problem
Enhanced Approximation Algorithms for Maximum Weight Matchings of Graphs
Performance Comparison of Algorithms for the Dynamic Shortest Path Problem(Selected Papers from the 19th Workshop on Circuits and Systems in Karuizawa)
An Efficient Vector Transfer for Sparse Matrix-Vector Multiplication on Distributed Memory Systems
Orthogonal Drawings for Plane Graphs with Specified Face Areas
Efficient Representation of Constraints and Propagation of Variable-Value Symmetries in Distributed Constraint Reasoning
Symmetry Breaking by Dominance Detection in Distributed Environments
RECENT DEVELOPMENTS IN MAXIMUM FLOW ALGORITHMS
Finding Minimal Siphons in General Petri Nets (Special Section on Description Models for Concurrent Systems and Their Applications)
Around the Constructive Orbit Problem in Distributed Constraint Programming
A linear time algorithm for tri-connectivity augmentation of bi-connected graphs with upper bounds on vertex-degree increase (第21回回路とシステム軽井沢ワークショップ論文集) -- (グラフアルゴリズム)
On Minimum k-Edge-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree(Selected Papers from the 18th Workshop on Circuits and Systems in Karuizawa)
Bi-Connectivity Augmentation for Specified Vertices of a Graph with Upper Bounds on Vertex-Degree Increase(Graph Algorithm, Foundations of Computer Science)
A 2-Approximation Algorithm to (k+1)-Edge-Connect a Specified Set of Vertices in a k-Edge-Connected Graph(Discrete Mathematics and Its Applications)
A Linear Time Algorithm for Bi-Connectivity Augmentation of Graphs with Upper Bounds on Vertex-Degree Increase(Selected Papers from the 17th Workshop on Circuits and Systems in Karuizawa)
Extracting Minimal Siphon-Traps of Petri Nets and Its Application to Computing Nonnegative Integer-Invariants(Special Section on Concurrent System Technology and Its Application to Multiple Agent Systems)
The Next-to-Shortest Path in Undirected Graphs with Nonnegative Weights
FOREWORD (Special Section on Discrete Mathematics and Its Applications)
Special Section on Discrete Mathematics and Its Applications
FOREWORD (Special Section of Letters Selected from the 1995 Society Conference of IEICE)
Topological Walk Revisited(Special Section on Discrete Mathematics and Its Applications)
A generating function of strict Gelfand patterns and some formulas on characters of general linear groups
GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(Network Design, Control and Optimization)
Accelerating A* algorithms by sweeping out small-degree nodes
Special Section on Theoretical Foundation of Computing
Estimating the Gowers Norm of Modulo Functions over Prime Fields
CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS
A Fast Algorithm for Augmenting Edge-Connectivity by One with Bipartition Constraints
A Simulation-Based Analysis for Worst Case Delay of Single and Multiple Interruptions
Multilingualization Based on RPC for Job-level Parallel Script Language, Xcrypt
Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds
Breadth-first Search Approach to Enumeration of Tree-like Chemical Compounds
CONSTANT FACTOR APPROXIMATION ALGORITHMS FOR REPETITIVE ROUTING PROBLEMS OF GRASP-AND-DELIVERY ROBOTS IN PRODUCTION OF PRINTED CIRCUIT BOARDS

もっと見る

スポンサーリンク