Conferences in DBLP
Sue Whitesides Chain Reconfiguration. The INs and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:1-13 [Conf ] Kazuo Murota , Akihisa Tamura Application of M-Convex Submodular Flow Problem to Mathematical Economics. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:14-25 [Conf ] Xiaotie Deng , Haodi Feng , Pixing Zhang , Hong Zhu A Polynomial Time Approximation Scheme for Minimizing Total Completion Time of Unbounded Batch Scheduling. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:26-35 [Conf ] Yoshiyuki Karuno , Hiroshi Nagamochi A Polynomial Time Approximation Scheme for the Multi-vehicle Scheduling Problem on a Path with Release and Handling Times. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:36-47 [Conf ] Jianer Chen , Jingui Huang Semi-normal Schedulings: Improvement on Goemans' Algorithm. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:48-60 [Conf ] Hisashi Koga Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:61-73 [Conf ] Jae-Hoon Kim , Kyung-Yong Chwa Broadcasting with Universal Lists Revisited: Using Competitive Analysis. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:74-85 [Conf ] Kumiko Nomura , Toshinori Yamada , Shuichi Ueno On Adaptive Fault Diagnosis for Multiprocessor Systems. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:86-98 [Conf ] Kenta Hashimoto , Toshinori Yamada , Shuichi Ueno On-Line Multicasting in All-Optical Networks. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:99-106 [Conf ] Shin-Ichi Nakano Enumerating Floorplans with n Rooms. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:107-115 [Conf ] Giulia Galbiati On Min-Max Cycle Bases. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:116-123 [Conf ] Hiroshi Nagamochi , Toshimasa Ishii On the Minimum Local-Vertex-Connectivity Augmentation in Graphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:124-135 [Conf ] Takayuki Nagoya Counting Graph Isomorphisms among Chordal Graphs with Restricted Clique Number. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:136-147 [Conf ] Kunihiko Sadakane , Norito Sugawara , Takeshi Tokuyama Quantum Algorithms for Intersection and Proximity Problems. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:148-159 [Conf ] Zheng Sun , John H. Reif BUSHWHACK: An Approximation Algorithm for Minimal Paths through Pseudo-Euclidean Spaces. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:160-171 [Conf ] Francis Y. L. Chin , Stanley P. Y. Fung Approximation of Minimum Triangulation for Polyhedron with Bounded Degrees. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:172-184 [Conf ] Christian Schindelhauer , Birgitta Weber Tree-Approximations for the Weighted Cost-Distance Problem. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:185-195 [Conf ] Takaaki Mizuki , Takao Nishizeki Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:196-207 [Conf ] Akihiro Yamamura , Kaoru Kurosawa Generic Algorithms and Key Agreement Protocols Based on Group Actions. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:208-218 [Conf ] Josef M. Breutzmann , David W. Juedes , Jack H. Lutz Baire Category and Nowhere Differentiability for Feasible Real Functions. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:219-230 [Conf ] Takashi Horiyama , Toshihide Ibaraki Translation among CNFs, Characteristic Models and Ordered Binary Decision Diagrams. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:231-243 [Conf ] Oscar H. Ibarra , Zhe Dang On Removing the Pushdown Stack in Reachability Constructions. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:244-256 [Conf ] Hiroaki Yamamoto A New Recognition Algorithm for Extended Regular Expressions. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:257-267 [Conf ] Takeshi Koshiba Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:268-278 [Conf ] Hirotaka Ono , Mutsunori Yagiura , Toshihide Ibaraki An Index for the Data Size to Extract Decomposable Structures in LAD. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:279-290 [Conf ] Michael R. Fellows Parameterized Complexity: The Main Ideas and Some Research Frontiers. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:291-307 [Conf ] Therese C. Biedl , Erik D. Demaine , Christian A. Duncan , Rudolf Fleischer , Stephen G. Kobourov Tight Bounds on Maximal and Maximum Matchings. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:308-319 [Conf ] Stavros D. Nikolopoulos , Leonidas Palios Recognition and Orientation Algorithms for P_{4} -Comparability Graphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:320-331 [Conf ] Danny Z. Chen , Xiaodong Wu Efficient Algorithms for k-Terminal Cuts on Planar Graphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:332-344 [Conf ] Anna Galluccio , Guido Proietti Polynomial Time Algorithms for Edge-Connectivity Augmentation of Hamiltonian Paths. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:345-354 [Conf ] Michael H. Albert , Robert E. L. Aldred , Mike D. Atkinson , Derek A. Holton Algorithms for Pattern Involvement in Permutations. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:355-366 [Conf ] Takeaki Uno A Fast Algorithm for Enumerating Bipartite Perfect Matchings. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:367-379 [Conf ] Bo Chen , Xiaotie Deng , Wenan Zang On-Line Scheduling a Batch Processing System to Minimize Total Weighted Job Completion Time. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:380-389 [Conf ] Thomas Erlebach , Martin Gantenbein , Daniel Hürlimann , Gabriele Neyer , Aris Pagourtzis , Paolo Penna , Konrad Schlude , Kathleen Steinhöfel , David Scot Taylor , Peter Widmayer On the Complexity of Train Assignment Problems. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:390-402 [Conf ] James Aspnes , Julia Hartling , Ming-Yang Kao , Junhyong Kim , Gauri Shah A Combinatorial Toolbox for Protein Sequence Design and Landscape Analysis in the Grand Canonical Model. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:403-415 [Conf ] Rune B. Lyngsø , Christian N. S. Pedersen Complexity of Comparing Hidden Markov Models. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:416-428 [Conf ] Ming-Yang Kao , Vijay Ramachandran DNA Self-Assembly For Constructing 3D Boxes. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:429-440 [Conf ] Jens Gramm , Rolf Niedermeier , Peter Rossmanith Exact Solutions for CLOSEST STRING and Related Problems. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:441-453 [Conf ] Danny Z. Chen , Shuang Luan , Jinhui Xu Topological Peeling and Implementation. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:454-466 [Conf ] Danny Z. Chen , Jie Wang , Xiaodong Wu Image Segmentation with Monotonicity and Smoothness Constraints. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:467-479 [Conf ] Jae-Ha Lee , Sang-Min Park , Kyung-Yong Chwa Optimization Algorithms for Sweeping a Polygonal Region with Mobile Guards. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:480-492 [Conf ] Sofia Kovaleva , Frits C. R. Spieksma Approximation of a Geometric Set Covering Problem. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:493-501 [Conf ] Andrew V. Goldberg Shortest Path Algorithms: Engineering Aspects. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:502-513 [Conf ] Xiao Zhou , Takao Nishizeki Efficient Algorithms for Weighted Colorings of Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:514-524 [Conf ] Marcus Peinado Go with the Winners Algorithms for Cliques in Random Graphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:525-536 [Conf ] Jirí Fiala , Jan Kratochvíl Complexity of Partial Covers of Graphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:537-549 [Conf ] Hans L. Bodlaender , Michael J. Dinneen , Bakhadyr Khoussainov On Game-Theoretic Models of Networks. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:550-561 [Conf ] Andreas Jakoby , Maciej Liskiewicz The Complexity of Some Basic Problems for Dynamic Process Graphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:562-574 [Conf ] Xuemin Lin Delay Optimizations in Quorum Consensus. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:575-586 [Conf ] Hyunyoung Lee , Jennifer L. Welch Randomized Shared Queues Applied to Distributed Optimization Algorithms. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:587-598 [Conf ] Andrej Brodnik , Johan Karlsson Multiprocess Time Queue. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:599-609 [Conf ] Sheung-Hung Poon , Chan-Su Shin , Tycho Strijk , Alexander Wolff Labeling Points with Weights. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:610-622 [Conf ] David Bremner , Ferran Hurtado , Suneeta Ramaswami , Vera Sacristan Small Convex Quadrangulations of Point Sets. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:623-635 [Conf ] Tetsuo Asano , Takeshi Tokuyama How to Color a Checkerboard with a Given Distribution - Matrix Rounding Achieving Low 2×2-Discrepancy. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:636-648 [Conf ] Maria Angeles Garrido , Claudia Iturriaga , Alberto Márquez , José Ramón Portillo , Pedro Reyes , Alexander Wolff Labeling Subway Lines. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:649-659 [Conf ] Louxin Zhang , Song Zhu Complexity Study on Two Clustering Problems. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:660-669 [Conf ] Toshihiro Fujito , Tsuyoshi Okumura A Modified Greedy Algorithm for the Set Cover Problem with Weights 1 and 2. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:670-681 [Conf ] Liang Zhao , Hiroshi Nagamochi , Toshihide Ibaraki A Unified Framework for Approximating Multiway Partition Problems. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:682-694 [Conf ] Luitpold Babel , Bo Chen , Hans Kellerer , Vladimir Kotov On-Line Algorithms for Cardinality Constrained Bin Packing Problems. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:695-706 [Conf ] Krisztián Monostori , Arkady B. Zaslavsky , István Vajk Suffix Vector: A Space-Efficient Suffix Tree Representation. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:707-718 [Conf ] Hideaki Hori , Shinichi Shimozono , Masayuki Takeda , Ayumi Shinohara Fragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:719-730 [Conf ] Gerth Stølting Brodal , Rolf Fagerberg , Christian N. S. Pedersen Computing the Quartet Distance between Evolutionary Trees in Time O(n log^{2} n). [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:731-742 [Conf ] Ronald I. Becker , Yen-I Chiang , Isabella Lari , Andrea Scozzari The Cent-dian Path Problem on Tree Networks. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:743-755 [Conf ] Evangelos Kranakis , Danny Krizanc , Sunil M. Shende Approximate Hotlink Assignment. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:756-767 [Conf ] Shan-Chyun Ku , Chi-Jen Lu , Biing-Feng Wang , Tzu-Chin Lin Efficient Algorithms for Two Generalized 2-Median Problems on Trees. [Citation Graph (0, 0)][DBLP ] ISAAC, 2001, pp:768-778 [Conf ]