close
1.

図書

図書
Peter Eades, Tadao Takaoka (eds.)
出版情報: Berlin : Springer, c2001  xiv, 780 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2223
所蔵情報: loading…
2.

図書

図書
Hon Wai Leong, Hiroshi Imai, Sanjay Jain (eds.)
出版情報: Berlin ; Tokyo : Springer, c1997  xv, 426 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1350
所蔵情報: loading…
3.

図書

図書
Alok Aggarwal, C. Pandu Rangan (eds.)
出版情報: Berlin : Springer, c1999  xiii, 448 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1741
所蔵情報: loading…
目次情報: 続きを見る
Invited Talk
The Engineering of Some Bipartite Matching Programs / Kurt Mehlhorn
Data Structure I / Session 1(a):
General Splay: A Basic Theory and Calculus / G.F. Georgakopoulos ; D.J. McClurkin
Static Dictionaries Supporting Rank / Venkatesh Raman ; S. Srinivasa Rao
Parallel & Distributed Computing I / Session 1(b):
Multiple Spin-Block Decisions / Peter Damaschke
Asynchronous Random Polling Dynamic Load Balancing / Peter Sanders
Approximate Algorithm I / Session 2(a):
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colarability / Daya Ram Gaur ; Ramesh Krishnamurti
Hardness of Approximating Independent Domination in Circle Graphs / Mirela Damian-Iordache ; Sriram V. Pemmaraju
Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs
Computational Intelligence / Session 2(b):
Ordered Binary Decision Diagrams as Knowledge-Bases / Takashi Horiyama ; Toshihide Ibaraki
Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots / Paola Flocchini ; Giuseppe Prencipe ; Nicola Santoro ; Peter Widmayer
Online Algorithm / Session 3(a):
On-Line Load Balancing of Temporary Tasks Revisited / Kar-Keung To ; Wai-Ha Wong
Online Routing in Triangulations / Prosenjit Bose ; Pat Morin
Complexity Theory I / Session 3(b):
The Query Complexity of Program Checking by Constant-Depth Circuits / V. Arvind ; K.V. Subrahmanyam ; N.V. Vinodchandran
Tree-Like Resolution Is Superpolynomially Slower Than DAG-LikeResolution for the Pigeonhole Principle / Kazuo Iwama ; Shuichi Miyazaki
Approximate Algorithm II / Session 4(a):
Efficient Approximation Algorithms for Multi-label Map Labeling / Binhai Zhu ; C.K. Poon
Approximation Algorithms in Batch Processing / Xiaotie Deng ; Chung Keung Poon ; Yuzhong Zhang
Graph Algorithm I / Session 4(b):
LexBFS-Ordering in Asteroidal Triple-Free Graphs / Jou-Ming Chang ; Chin-Wen Ho ; Ming-Tat Ko
Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs / F.R. Hsu ; Yaw-Ling Lin ; Yin-Te Tsai
Approximation Algorithms for Some Clustering and Classification Problems / Eva Tardos
Computational Geometry I / Session 5(a):
How Many People Can Hide in a Terrain? / Stephan Eidenbenz
Carrying Umbrellas: An Online Relocation Problem on Graphs / Jae-Ha Lee ; Chong-Dae Park ; Kyung-Yong Chwa
Parallel & Distributed Computing II / Session 5(b):
Survivable Networks with Bounded Delay: The Edge Failure Case / Serafino Cicerone ; Gabriele Di Stefano ; Dagmar Handke
Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks / J.L. Bordim ; J. Cui ; T. Hayashi ; K. Nakano ; S. Olariu
Data Structure II / Session 6(a):
Constructing the Suffix Tree of a Tree with a Large Alphabet / Tetsuo Shibuya
An O(1) Time Algorithm for Generating Multiset Permutations / Tadao Takaoka
Complexity Theory II / Session 6(b):
Upper Bounds for MaxSat: Further Improved / Nikhil Bansal
A Linear Time Algorithm for Recognizing Regular Boolean Functions / Kazuhisa Makino
Computational Geometry II / Session 7(a):
Station Layouts in the Presence of Location Constraints / Christos Kaklamanis ; Lefteris M. Kirousis ; Evangelos Kranakis ; Danny Krizanc ; David Peleg
Reverse Center Location Problem / Jianzhong Zhang ; Xiaoguang Yang ; Mao-cheng Cai
Algorithms in Practice / Session 7(b):
Performance Comparison of Linear Sieve and Cubic Sieve Algorithms forDiscrete Logarithms over Prime Fields / Abhijit Das ; C.E. Veni Madhavan
External Memory Algorithms for Outerplanar Graphs / Anil Maheshwari ; Norbert Zeh
Approximate Algorithm III / Session 8(a):
A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree / Tetsuo Asano ; Naoki Katoh ; Kazuhiro Kawashima
Approximation Algorithms for Channel Assignment with Constraints / Jeannette Janssen ; Lata Narayanan
Graph Algorithm II / Session 8(b):
Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs / Yoshiyuki Kusakari ; Daisuke Masubuchi ; Takao Nishizeki
A Linear Algorithm for Finding Total Colorings of Partial k-Trees / Shuji Isobe ; Xiao Zhou
Topology-Oriented Approach to Robust Geometric Computation / Kokichi Sugihara
Approximate Algorithm IV / Session 9(a):
Approximating Multicast Congestion / Santosh Vempala ; Berthold Vöcking
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts / Liang Zhao ; Hiroshi Nagamochi
Parallel & Distributed Computing III / Session 9(b):
Online Scheduling of Parallel Communications with Individual Deadlines
A Faster Algorithm for Finding Disjoint Paths in Grids / Wun-Tat Chan ; Francis Y.L. Chin ; Hing-Fung Ting
Computational Geometry III / Session 10(a):
Output-Sensitive Algorithms for Uniform Partitions of Points / Pankaj K. Agarwal ; Binay K. Bhattacharya ; Sandeep Sen
Convexifying Monotone Polygons / Therese C. Biedl ; Erik D. Demaine ; Sylvain Lazard ; Steven M. Robbins ; Michael A. Soss
Graph Algorithm III / Session 10(b):
Bisecting Two Subsets in 3-Connected Graphs / Tibor Jordán ; Yoshitaka Nakao
Generalized Maximum Independent Sets for Trees in Subquadratic Time / B.K. Bhattacharya ; M.E. Houle
Author Index
Invited Talk
The Engineering of Some Bipartite Matching Programs / Kurt Mehlhorn
Data Structure I / Session 1(a):
4.

図書

図書
Kyung-Yong Chwa, Oscar H. Ibarra (eds.)
出版情報: Berlin ; Tokyo : Springer, c1998  xiii, 478 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1533
所蔵情報: loading…
目次情報: 続きを見る
Invited Presentation
The Discrepancy Method / Bernard Chazelle
Implementing Algorithms and Data Structures: An Educational and Research Perspective / Roberto Tamassia
Geometry I
Facility Location on Terrains / Evanthia Papadopoulou ; Boris Aronov ; Marc van Kreveld ; René van Oostrum ; Kasturirangan Varadarajan
Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles / Joonsoo Choi ; Chan-Su Shin ; Sung Kwon Kim
Complexity I
Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words / Hiroki Arimura ; Shinichi Shimozono
Disjunctions of Horn Theories and Their Cores / Thomas Eiter ; Toshihide Ibaraki ; Kazuhisa Makino
Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently While Concealing It / Giovanni Di Crescenzo ; Kouichi Sakurai ; Moti Yung
Graph Drawing
Two-Layer Planarization in Graph Drawing / Petra Mutzel ; René Weiskircher
Computing Orthogonal Drawings in a Variable Embedding Setting / Walter Didimo ; Giuseppe Liotta
Dynamic Grid Embedding with Few Bends and Changes / Ulrik Brandes ; Dorothea Wagner
On-Line Algorithm and Scheduling
Two New Families of List Update Algorithms / Frank Schulz
An Optimal Algorithm for On-Line Palletizing at Delivery Industry / J. Rethmann ; E. Wanke
On-Line Scheduling of Parallel Jobs with Runtime Restrictions / Stefan Bischof ; Ernst W. Mayr
CAD/CAM and Graphics
Testing the Quality of Manufactured Disks and Cylinders / Prosenjit Bose ; Pat Morin
Casting with Skewed Ejection Direction / Hee-Kap Ahn ; Siu-Wing Cheng ; Otfried Cheong
Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image / Tetsuo Asano ; Hiro Ito ; Souichi Kimura ; Shigeaki Shimazu
Graph Algorithm I
k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph / Toshimasa Ishii ; Hiroshi Nagamochi
Polyhedral Structure of Submodular and Posi-modular Systems
Maximizing the Number of Connections in Optical Tree Networks / Thomas Erlebach ; Klaus Jansen
Best Paper Presentation
Selecting the k Largest Elements with Parity Tests / Tak Wah Lam ; Hing Fung Ting
Randomized Algorithm
Randomized K-Dimensional Binary Search Trees / Amalia Duch ; Vladimir Estivill-Castro ; Conrado Martínez
Randomized 0(log log n)-Round Leader Election Protocols in Packet Radio Networks / Koji Nakano ; Stephan Olariu
Random Regular Graphs with Edge Faults: Expansion through Cores / Andreas Goerdt
Complexity II
A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem / Takashi Mihara ; Shao Chin Sung
Generalized Graph Colorability and Compressibility of Boolean Formulae / Richard Nock ; Pascal Jappy ; Jean Sallantin
On the Complexity of Free Monoid Morphisms / Klaus-Jörn Lange ; Pierre McKenzie
Graph Algorithm II
Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs / Sun-Yuan Hsieh ; Chin-Wen Ho ; Tsan-Sheng Hsu ; Ming-Tat Ko ; Gen-Huey Chen
Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs / Yaw-Ling Lin
Finding Planar Geometric Automorphisms in Planar Graphs / Seok-Hee Hong ; Peter Eades ; Sang-Ho Lee
Combinatorial Problem
A New Approach for Speeding Up Enumeration Algorithms / Takeaki Uno
Hamiltonian Decomposition of Recursive Circulants / Jung-Heum Park
Convertibility among Grid Filling Curves / Naoki Katoh ; Hisao Tamaki ; Takeshi Tokuyama
Geometry II
Generalized Self-Approaching Curves / Oswin Aichholzer ; Franz Aurenhammer ; Christian Icking ; Rolf Klein ; Elmar Langetepe ; Günter Rote
Computational Biology / Guo-Hui Lin ; Guoliang Xue
Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free Languages / Tatsuya Akutsu
On the Multiple Gene Duplication Problem / Michael Fellows ; Michael Hallett ; Ulrike Stege
Geometry III
Visibility Queries in Simple Polygons and Applications / Leonidas J. Guibas ; Marek Teichmann ; Li Zhang
Quadtree Decomposition and Steiner Triangulation and Ray Shooting / Kam-Hing Lee
Optimality and Integer Programming Formulations of Triangulations in General Dimension / Akira Tajima
Approximation Algorithm
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs / Philip N. Klein ; Hsueh-I Lu
A Capacitated Vehicle Routing Problem on a Tree / Shin-ya Hamaguchi
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems / Bang Ye Wu ; Kun-Mao Chao ; Chuan Yi Tang
Complexity III
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees / Xiao Zhou ; Takao Nishizeki
Inapproximability Results for Guarding Polygons without Holes / Stephan Eidenbenz
The Inapproximability of Non NP-hard Optimization Problems / Liming Cai ; David Juedes ; Iyad Kanj
Parallel and Distributed Algorithm
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate / Toru Hasunuma
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution / J. Diaz ; J. Petit ; P. Psycharis ; M. Serna
Optimal Approximate Agreement with Omission Faults / Richard Plunkett ; Alan Fekete
Author Index
Invited Presentation
The Discrepancy Method / Bernard Chazelle
Implementing Algorithms and Data Structures: An Educational and Research Perspective / Roberto Tamassia
5.

図書

図書
Rudolf Fleischer, Gerhard Trippen (eds.)
出版情報: Berlin : Springer, c2004  xvii, 935 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3341
所蔵情報: loading…
6.

図書

図書
D.T. Lee, Shang-Hua Teng (eds.)
出版情報: Berlin ; New York : Springer, c2000  xiv, 578 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1969
所蔵情報: loading…
目次情報: 続きを見る
Invited Presentations
Voronoi-Based Systems of Coordinates and Surface Reconstruction / Jean-Daniel Boissonnat
Essentially Every Unimodular Matrix Defines an Expander / Jin-Yi Cai
Algorithms and Data Structures (I)
Strategies for Hotlink Assignments / Prosenjit Bose ; Evangelos Kranakis ; Danny Krizanc ; Jurek Czyzowicz ; Andrzej Pelc ; Leszek Gasieniec ; Miguel V. Martin
A New Competitive Analysis of Randomized Caching / Ching Law ; Charles E. Leiserson
Online Routing in Convex Subdivisions / Pat Morin ; Andrej Brodnik ; Svante Carlsson ; Erik D. Demaine ; Rudolf Fleischer ; J. Ian Munro ; Alejandro López-Ortiz
Combinatorial Optimization
A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors / Jingui Huang ; Jianer Chen ; Songqiao Chen
Classification of Various Neighborhood Operations for the Nurse Scheduling Problem / Takayuki Osogami ; Hiroshi Imai
Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets / Yuyu Chen ; Ming-Yang Kao ; Hsueh-I. Lu
Algorithms and Data Structures (II)
Coping with Delays and Time-Outs in Binary Search Procedures / Ferdinando Cicalese ; Ugo Vaccaro
Some Formal Analysis of Rocchio's Similarity-Based Relevance Feedback Algorithm / Zhixiang Chen ; Binhai Zhu
Reasoning with Ordered Binary Decision Diagrams / Takashi Horiyama ; Toshihide Ibaraki
Approximation and Randomized Algorithms (I)
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching / Iyad A. Kanj
A 2-Approximation Algorithm for Path Coloring on Trees of Rings / Xiaotie Deng ; Yi Zhou ; Guojun Li ; Wenan Zang
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree / Q. S. Wu ; C. L. Lu ; R. C. T. Lee
Algorithms and Data Structures (III)
Finding Independent Spanning Trees in Partial k-Trees / Xiao Zhou ; Takao Nishizeki
On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover / Rolf Niedermeier ; Peter Rossmanith
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width / Dimitros M. Thilikos, Maria J. Serna ; Hans L. Bodlaender
Approximation and Randomized Algorithms (II)
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits / Takao Asano ; Magnús M. Halldórsso ; Kazuo Iwama ; Takeshi Matsuda
A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane / Norihiro Kubo ; Shinichi Shimozono ; Katsuhiro Muramoto
Simple Algorithms for a Weighted Interval Selection Problem / Thomas Erlebach ; Frits C. R. Spieksma
Graph Drawing and Algorithms
Efficient Minus and Signed Domination in Graphs / Chin L. Lu ; Sheng-Lung Peng ; Chuan Y. Tang
Convex Grid Drawings of Four-Connected Plane Graphs / Kazuyuki Miura ; Shin-ichi Nakano
An Algorithm for Finding Three-Dimensional Symmetry in Series-Parallel Digraphs / Seok-Hee Hong ; Peter Eades
Automata, Cryptography, and Complexity Theory
Undecidability Results for Monoids with Linear-Time Decidable Word Problems / Masashi Katsura ; Yuji Kobayashi ; Friedrich Otto
Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures / Reina Yoshikawa ; Shimin Guo ; Kazuhiro Motegi ; Yoshihide Igarashi
Derandomizing Arthur-Merlin Games under UniformAssumptions / Chi-Jen Lu
Algorithms and Data Structures (IV)
A Near Optimal Algorithm for Vertex Connectivity Augmentation / Bill Jackson ; Tibor Jordan
Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph / Toshimasa Ishii ; Hiroshi Nagamoch
Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets / Hiro Ito ; Yuichiro Itatsu ; Hideyuki Uehara ; Mitsuo Yokoyama ; otoyasu Ito (Hitachi, Ltd.)
Parallel and Distributed Algorithms
An Intuitive and Effective New Representation for Interconnection Network Structures / Lihua Liu ; Weijia Jia
Randomized Leader Election Protocols in Radio Networks with no Collision Detection / Koji Nakano ; Stephan Olari
Deterministic Broadcasting Time with Partial Knowledge of the Network . / Gianluca De Marco
Algorithms and Data Structures (V)
Minimizing Makespan in Batch Machine Scheduling / Chung K Poon ; Pixing Zhang
Preemptive Parallel Task Scheduling in O(n) + Poly(m) Time / Klaus Jansen ; Lorant Porkolab
Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array / Kunihiko Sadakane
Computational Geometry (I)
A Better Lower Bound for Two-Circle Point Labeling / Alexander Wolff ; Michael Thon ; Yinfeng Xu
Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set / Deok-So Kim ; Donguk Kim ; Kokichi Sugihara
An Improved Algorithm for Subdivision Traversal without Extra Storage
Algorithms and Data Structures (VI)
Generalized H-Coloring of Graphs / Petter Kristiansen ; Jan A. Telle
Finding a Two-Core of a Tree in Linear Time / Biing-Fing Wang ; Jyh-Jye Lin
Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison / Tak-Wah Lam ; Wing-Kin Sung ; Hing-Fung Ting
Computational Geometry (II)
Optimal Beam Penetrations in Two and Three Dimensions / Danny Z. Chen ; Xiaobo S. Hu ; Jinhui Xu
Searching a Simple Polygon by a k-Searcher / Xuehou Tan
Characterization of Rooms Searchable by Two Guards / Sang-Min Park ; Kyung-Yong Chwa ; Jae-Ha Lee
Computational Biology
Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers Wing-Kai Hon
Phylogenetic k-Root and Steiner k-Root / Guo-Hui Lin ; Tao Jiang ; Paul E. Kearney
Computational Geometry (III)
Maintenance of a Piercing Set for Intervals with Applications / Matthew J. Katz ; Frank Nielsen ; Michael Segal
Optimal Polygon Cover Problems and Applications / Xiaodong Wu
Author Index
Invited Presentations
Voronoi-Based Systems of Coordinates and Surface Reconstruction / Jean-Daniel Boissonnat
Essentially Every Unimodular Matrix Defines an Expander / Jin-Yi Cai
7.

図書

東工大
目次DB

図書
東工大
目次DB
Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  xvii, 748 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2906
所蔵情報: loading…
目次情報: 続きを見る
Invited Talk
   Interactive Proofs for Quantum Computation Andrew Chi-Chih Yao 1
   Drawing Plane Graphs Takao Nishizeki 2
1A Computational Geometry I
   Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama 6
   A Dynamic Dictionary for Priced Information with Application Anil Maheshwari, Michiel Smid 16
   Voronoi Diagram in the Flow Field Tetsushi Nishida, Kokichi Sugihara 26
   Polygonal Path Approximation: A Query Based Approach Ovidiu Daescu, Ningfang Mi 36
1B Graph and Combinatorial Algorithms I
   A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs Anne Berry, Pinar Heggernes, Yngve Villanger 47
   Finding the Maximum Common Subgraph of a Partial κ-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees Atsuko Yamaguchi, Hiroshi Mamitsuka 58
   Hotlink Enhancement Algorithms for Web Directories Ori Gerstel, Shay Kutten, Rachel Matichin, David Peleg 68
   Finding a Length-Constrained Maximum-Density Path in a Tree Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao 78
2A Computational Complexity I
   The Intractability of Computing the Hamming Distance Bodo Manthey, Ruediger Reischuk 88
   Infinitely-Often Autoreducible Sets Richard Beigel, Lance Fortnow, Frank Stephan 98
   Limiting Negations in Bounded-Depth Circuits: An Extension of Markov's Theorem Shao Chin Sung, Keisuke Tanaka 108
   Computational Complexity Measures of Multipartite Quantum Entanglement Tomoyuki Yamakami 117
2B Graph and Combinatorial Algorithms II
   A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs Gabriel Valiente 129
   Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Probem Hiroshi Nagamochi, Kohei Okada 138
   Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems Jianer Chen, Iyad A. Kanj, Ge Xia 148
   A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem Hiroaki Yamamoto 158
3A Quantum Computation
   The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems V. Arvind, Rainer Schuler 168
   Non-interactive Quantum Perfect and Statistical Zero-Knowledge Hirotada Kobayashi 178
   Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami 189
   A Faster Lattice Reduction Method Using Quantum Search Christoph Ludwig 199
3B Graph and Combinatorial Algorithms III
   Three Sorting Algorithms Using Priority Queues Amr Elmasry 209
   Lower Bounds on Correction Networks Grzegorz Stachowiak 221
   Approximate Regular Expression Searching with Arbitrary Integer Weights Gonzalo Navarro 230
   Constructing Compressed Suffix Arrays with Large Alphabets Wing-Kai Hon, Tak-Wah Lam, Kunihiko Sadakane, Wing-Kin Sung 240
4A Computational Geometry II
   On the Geometric Dilation of Finite Point Sets Annette Ebbers-Baumann, Ansgar Gruene, Rolf Klein 250
   On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen 260
   Optimal Point Set Projections onto Regular Grids Jose Miguel Diaz-Banez, Ferran Hurtado, Mario Alberto Lopez, J. Antoni Sellares 270
4B Combinatorial Optimization I
   An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas Hiroshi Nagamochi, Yuusuke Abe 280
   A Faster Algorithm for Two-Variable Integer Programming Friedrich Eisenbrand, Soeren Laue 290
   Efficient Algorithms for Generation of Combinatorial Covering Suites Adrian Dumitrescu 300
5A Scheduling
   A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags Yoshiyuki Karuno, Hiroshi Nagamochi 309
   On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli 319
   Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes Deshi Ye, Guochuan Zhang 329
5B Computational Biology
   Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome Yaw-Ling Lin, Tsan-Sheng Hsu 339
   Settling the Intractability of Multiple Alignment Isaac Elias 352
   Efficient Algorithms for Optimizing Whole Genome Alignment with Noise T.W. Lam, N. Lu, H.F. Ting, Prudence W.H. Wong, S.M. Yiu 364
6A Computational Geometry III
   Segmenting Doughnut-Shaped Objects in Medical Images Xiaodong Wu 375
   On the Locality Properties of Space-Filling Curves H.K. Dai, H.C. Su 385
   Geometric Restrictions on Producible Polygonal Protein Chains Erik D. Demaine, Stefan Langerman, Joseph O'Rourke 395
   Symmetric Layout of Disconnected Graphs Seok-Hee Hong, Peter Eades 405
6B Graph and Combinatorial Algorithms IV
   Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching Miroslav Chlebik, Janka Chlebikova 415
   Enumerating Global Roundings of an Outerplanar Graph Nadia Takki-Chebihi, Takeshi Tokuyama 425
   Augmenting Forests to Meet Odd Diameter Requirements Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi 434
   On the Existence and Determination of Satisfactory Partitions in a Graph Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten 444
7A Distributed and Parallel Algorithms
   A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model Tom Altman, Yoshihide Igarashi, Michiko Omori 454
   An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees Md. Abul Kashem, M. Ziaur Rahman 464
7B Graph and Combinatorial Algorithms V
   The Student-Project Allocation Problem David J. Abraham, Robert W. Irving, David F. Manlove 474
   Algorithms for Enumerating Circuits in Matroids Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan 485
   A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model Akinobu Eguchi, Satoru Fujishige, Akihisa Tamura 495
8A Data Structure
   Succinct Data Structures for Searchable Partial Sums Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung 505
   Range Mode and Range Median Queries on Lists and Trees Danny Krizanc, Pat Morin, Michiel Smid 517
   Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests Ferdinando Cicalese, Christian Deppe 527
   New Ways to Construct Binary Search Trees Travis Gagie 537
8B Graph and Combinatorial Algorithms VI
   Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth Artur Czumaj, Andrzej Lingas, Johan Nilsson 544
   Biconnectivity on Symbolically Represented Graphs: A Linear Solution Raffaella Gentilini, Alberto Policriti 554
   A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs Torsten Tholey 565
   Deterministic Algorithm for the t-Threshold Set Problem Jeremy Barbay, Claire Kenyon 575
9A Combinatorial and Network Optimization
   Energy-Efficient Wireless Network Design Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos 585
   Wavelength Conversion in Shortest-Path All-Optical Networks Thomas Erlebach, Stamatis Stefanakos 595
   A Heuristic for the Stacker Crane Problem on Trees which Is Almost Surely Exact Amin Coja-Oghlan, Sven O. Krumke, Till Nierhoff 605
   Flexible Train Rostering Stephan Eidenbenz, Aris Pagourtzis, Peter Widmayer 615
9B Computational Complexity and Cryptography
   Counting Complexity Classes over the Reals I: The Additive Case Peter Buergisser, Felipe Cucker 625
   Some Properties of One-Pebble Turing Machines with Sublogarithmic Space Atsuyuki Inoue, Akira Ito, Katsushi Inoue, Tokio Okazaki 635
   Hypergraph Decomposition and Secret Sharing Giovanni Di Crescenzo, Clemente Galdi 645
   A Promising Key Agreement Protocol Eun-Kyung Ryu, Kee-Won Kim, Kee-Young Yoo 655
10A Game Theory and Randomized Algorithm
   Rapid Mixing of Several Markov Chains for a Hard-Core Model Ravi Kannan, Michael W. Mahoney, Ravi Montenegro 663
   Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani 676
   Fair Cost Allocations under Conflicts - A Game-Theoretic Point of View - Yoshio Okamoto 686
   Equilibria for Networks with Malicious Users George Karakostas, Anastasios Viglas 696
10B Algebraic and Arithmetic Computation
   Quasi-optimal Arithmetic for Quaternion Polynomials Martin Ziegler 705
   Upper Bounds on the Complexity of Some Galois Theory Problems V. Arvind, Piyush P Kurur 716
   Unfolded Modular Multiplication Wieland Fischer, Jean-Pierre Seifert 726
   Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong 736
Author Index 747
Invited Talk
   Interactive Proofs for Quantum Computation Andrew Chi-Chih Yao 1
   Drawing Plane Graphs Takao Nishizeki 2
8.

図書

図書
Prosenjit Bose, Pat Morin (eds.)
出版情報: Berlin ; Tokyo : Springer, c2002  xiii, 656 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2518
所蔵情報: loading…
9.

図書

図書
Tetsuo Asano ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer, c1996  x, 448 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1178
所蔵情報: loading…
10.

図書

図書
John Staples ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer, c1995  xv, 440 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1004
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼