Conferences in DBLP
Markus Bläser Complete Problems for Valiant's Class of qp-Computable Families of Polynomials. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:1-10 [Conf ] Michal Koucký Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n^{4.03} ). [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:11-20 [Conf ] Nicholas Tran On Universally Polynomial Context-Free Languages. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:21-27 [Conf ] Kazuo Iwama , Yasuo Okabe , Toshiro Takase Separating Oblivious and Non-oblivious BPs. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:28-38 [Conf ] Iain A. Stewart Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:39-48 [Conf ] Lane A. Hemaspaandra , Harald Hempel , Arfst Nickelsen Algebraic Properties for P-Selectivity. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:49-58 [Conf ] Carla Denise Castanho , Wei Chen , Koichi Wada , Akihiro Fujiwara Parallelizability of Some P-Complete Geometric Problems in the EREW-PRAM. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:59-63 [Conf ] Samuel A. Heath , Franco P. Preparata Enhanced Sequence Reconstruction with DNA Microarray Application. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:64-74 [Conf ] Bodo Siebert Non-approximability of Weighted Multiple Sequence Alignment. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:75-85 [Conf ] Shiquan Wu , Xun Gu A Greedy Algorithm for Optimal Recombination. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:86-90 [Conf ] Xiang-Yang Li Generating Well-Shaped d-dimensional Delaunay Meshes. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:91-100 [Conf ] Oswin Aichholzer , Franz Aurenhammer , Hannes Krasser , Ferran Hurtado Towards Compatible Triangulations. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:101-110 [Conf ] Abdullah N. Arslan , Ömer Egecioglu An Improved Upper Bound on the Size of Planar Convex-Hulls. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:111-120 [Conf ] Sergei Bespamyatnikh , Zhixiang Chen , Kanliang Wang , Binhai Zhu On the Planar Two-Watchtower Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:121-130 [Conf ] Shin-Ichi Nakano Efficient Generation of Triconnected Plane Triangulations. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:131-141 [Conf ] Prosenjit Bose , Pat Morin , Antoine Vigneron Packing Two Disks into a Polygonal Environment. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:142-149 [Conf ] Danny Z. Chen , Xiaobo Hu , Xiaodong Wu Maximum Red/Blue Interval Matching with Applications. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:150-158 [Conf ] Otfried Cheong , Chan-Su Shin , Antoine Vigneron Computing Farthest Neighbors on a Convex Polytope. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:159-169 [Conf ] Xuehou Tan Finding an Optimal Bridge between Two Polygons. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:170-180 [Conf ] Xiang-Yang Li , Yu Wang How Good Is Sink Insertion? [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:181-190 [Conf ] Rob Duncan , Jianbo Qian , Binhai Zhu Polynomial Time Algorithms for Three-Label Point Labeling. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:191-200 [Conf ] Xuehou Tan Approximation Algorithms for the Watchman Route and Zookeeper's Problems. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:201-206 [Conf ] Wen-Lian Hsu PC-Trees vs. PQ-Trees. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:207-217 [Conf ] Holger Petersen Stacks versus Deques. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:218-227 [Conf ] H. K. Dai Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:228-236 [Conf ] Hee-Kap Ahn , Siu-Wing Cheng , Otfried Cheong , Mordecai J. Golin , René van Oostrum Competitive Facility Location along a Highway. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:237-246 [Conf ] Qizhi Fang , Shanfeng Zhu , Mao-cheng Cai , Xiaotie Deng Membership for Core of LP Games and Other Games. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:247-256 [Conf ] Pino Caballero-Gil , Candelaria Hernández-Goya Strong Solutions to the Identification Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:257-261 [Conf ] Hyun-Sung Kim , Kee-Young Yoo Area Efficient Exponentiation Using Modular Multiplier/Squarer in GF(2^{m} . [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:262-267 [Conf ] Valerie King , Mikkel Thorup A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:268-277 [Conf ] Enrico Nardelli , Guido Proietti , Peter Widmayer Finding the Most Vital Node of a Shortest Path. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:278-287 [Conf ] Xiao Zhou , Takao Nishizeki Algorithm for the Cost Edge-Coloring of Trees. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:288-297 [Conf ] Josep Díaz , Maria J. Serna , Dimitrios M. Thilikos Counting H-Colorings of Partial k-Trees. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:298-307 [Conf ] L. Sunil Chandran A Linear Time Algorithm for Enumerating All the Minimum and Minimal Separators of a Chordal Graph. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:308-317 [Conf ] Jochen Alber , Henning Fernau , Rolf Niedermeier Graph Separators: A Parameterized View. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:318-327 [Conf ] N. S. Narayanaswamy , C. E. Veni Madhavan On Assigning Prefix Free Codes to the Vertices of a Graph. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:328-337 [Conf ] Chin Lung Lu , Zheng-Yao Su , Chuan Yi Tang A New Measure of Edit Distance between Labeled Trees. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:338-348 [Conf ] Dingjun Lou , Ning Zhong A Highly Efficient Algorithm to Determine Bicritical Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:349-356 [Conf ] Irene Finocchi Layered Drawings of Graphs with Crossing Constraints. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:357-367 [Conf ] Irene Finocchi , Rossella Petreschi On the Validity of Hierarchical Decompositions. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:368-374 [Conf ] Liying Kang , Hong Qiao , Erfang Shan , Ding-Zhu Du Lower Bounds on the Minus Domination and k-Subdomination Numbers. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:375-383 [Conf ] L. Sunil Chandran Edge Connectivity vs Vertex Connectivity in Chordal Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:384-389 [Conf ] Ting-Yi Sung , Jeng-Jung Wang Changing the Diameter of Graph Products. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:390-394 [Conf ] Baogang Xu Plane Graphs with Acyclic Complex. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:395-399 [Conf ] Yosuke Kikuchi , Yukio Shibata On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:400-408 [Conf ] Milind Dawande A Notion of Cross-Perfect Bipartite Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:409-413 [Conf ] Haodi Feng Some Results on Orthogonal Factorizations. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:414-419 [Conf ] Myra B. Cohen , Charles J. Colbourn , Dalibor Froncek Cluttered Orderings for the Complete Graph. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:420-431 [Conf ] Wun-Tat Chan , Tak Wah Lam , Hing-Fung Ting , Prudence W. H. Wong Improved On-Line Stream Merging: From a Restricted to a General Setting. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:432-442 [Conf ] Jae-Hoon Kim , Kyung-Yong Chwa On-Line Deadline Scheduling on Multiple Resources. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:443-452 [Conf ] Ee-Chien Chang , Chee-Keng Yap Competitive Online Scheduling with Level of Service. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:453-462 [Conf ] Leah Epstein On-Line Variable Sized Covering. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:463-472 [Conf ] Jin-yi Cai , Eric Bach On Testing for Zero Polynomials by a Set of Points with Bounded Precision. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:473-482 [Conf ] Marek Chrobak , Leszek Gasieniec , Wojciech Rytter A Randomized Algorithm for Gossiping in Radio Networks. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:483-492 [Conf ] Kyoichi Okamoto , Osamu Watanabe Deterministic Application of Grover's Quantum Search Algorithm. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:493-501 [Conf ] Mitsuo Motoki Random Instance Generation for MAX 3SAT. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:502-508 [Conf ] Ding-Zhu Du , Lusheng Wang , Baogang Xu The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:509-518 [Conf ] Guangting Chen , Guoliang Xue An FPTAS for Weight-Constrained Steiner Trees in Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:519-528 [Conf ] Zhe Dang , Oscar H. Ibarra , Richard A. Kemmerer Decidable Approximations on Generalized and Parameterized Discrete Timed Automata. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:529-539 [Conf ] Zhixiang Chen Multiplicative Adaptive Algorithms for User Preference Retrieval. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:540-549 [Conf ] K. Subramani Parametric Scheduling for Network Constraints. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:550-560 [Conf ] Kaile Su , Xudong Luo , Huaiqing Wang , Chengqi Zhang , Shichao Zhang , Qingfeng Chen A Logical Framework for Knowledge Sharing in Multi-agent Systems. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:561-570 [Conf ] Kumiko Obokata , Michiko Omori , Kazuhiro Motegi , Yoshihide Igarashi A Lockout Avoidance Algorithm without Using Time-Stamps for the k-Exclusion Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:571-575 [Conf ] Guohua Wu Prefix-Free Languages and Initial Segments of Computably Enumerable Degrees. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:576-585 [Conf ] Robert Rettinger , Xizhong Zheng , Romain Gengler , Burchard von Braunmühl Weakly Computable Real Numbers and Total Computable Real Functions. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:586-595 [Conf ] Klaus Weihrauch , Ning Zhong 0002 Turing Computability of a Nonlinear Schrödinger Propagator. [Citation Graph (0, 0)][DBLP ] COCOON, 2001, pp:596-600 [Conf ]