Conferences in DBLP
Christos H. Papadimitriou Theoretical Problems Related to the Internet. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:1-2 [Conf ] Richard P. Brent Recent Progress and Prospects for Integer Factorisation Algorithms. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:3-22 [Conf ] Franz Aurenhammer , Naoki Katoh , Hiromichi Kojima , Makoto Ohsaki , Yinfeng Xu Approximating Uniform Triangular Meshes in Polygons. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:23-33 [Conf ] William Duckworth , Nicholas C. Wormald , Michele Zito Maximum Induced Matchings of Random Cubic Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:34-43 [Conf ] Gill Barequet A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:44-53 [Conf ] M. Carmen Hernando , Michael E. Houle , Ferran Hurtado On Local Transformation of Polygons with Visibility Properties. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:54-63 [Conf ] Giuseppe Di Battista , Giuseppe Liotta , Anna Lubiw , Sue Whitesides Embedding Problems for Paths with Direction Constrained Edges. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:64-73 [Conf ] Patrick Healy , Ago Kuusik , Sebastian Leipert Characterization of Level Non-planar Graphs by Minimal Patterns. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:74-84 [Conf ] Md. Saidur Rahman , Shin-Ichi Nakano , Takao Nishizeki Rectangular Drawings of Plane Graphs Without Designated Corners. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:85-94 [Conf ] Petra Mutzel , René Weiskircher Computing Optimal Embeddings for Planar Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:95-104 [Conf ] Zhi-Zhong Chen Approximation Algorithms for Independent Sets in Map Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:105-114 [Conf ] Zhi-Zhong Chen , Xin He Hierarchical Topological Inference on Planar Disc Maps. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:115-125 [Conf ] Yaw-Ling Lin , Fang-Rong Hsu , Yin-Te Tsai Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:126-136 [Conf ] Subhash Khot , Venkatesh Raman Parameterized Complexity of Finding Subgraphs with Hereditary Properties. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:137-147 [Conf ] Yuriy A. Reznik Some Results on Tries with Adaptive Branching. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:148-158 [Conf ] Ferdinando Cicalese , Daniele Mundici Optimal Coding with One Asymmetric Error: Below the Sphere Packing Bound. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:159-169 [Conf ] Xizhong Zheng Closure Properties of Real Number Classes under Limits and Computable Operators. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:170-179 [Conf ] Michael J. Dinneen , Liu Xiong A Characterization of Graphs with Vertex Cover Six. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:180-192 [Conf ] Mirka Miller , Slamin On the Monotonicity of Minimum Diameter with Respect to Order and Maximum Out-Degree. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:193-201 [Conf ] Magnús M. Halldórsson , Kazuo Iwama , Shuichi Miyazaki , Shiro Taketomi Online Independent Sets. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:202-209 [Conf ] Satoshi Fujita , Takeshi Hada Two-Dimensional On-Line Bin Packing Problem with Rotatable Items. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:210-220 [Conf ] Eric Bach , Joan Boyar , Tao Jiang , Kim S. Larsen , Guo-Hui Lin Better Bounds on the Accommodating Ratio for the Seat Reservation Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:221-231 [Conf ] Zhiyi Tan , Yong He Ordinal On-Line Scheduling on Two Uniform Machines. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:232-241 [Conf ] Sukumar Ghosh Agents, Distributed Algorithms, and Stabilization. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:242-251 [Conf ] Shyue-Horng Shiau , Chang-Biau Yang A Fast Sorting Algorithm and Its Generalization on Broadcast Communications. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:252-261 [Conf ] Sung-Ryul Kim , Kunsoo Park Efficient List Ranking Algorithms on Reconfigurable Mesh. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:262-271 [Conf ] Alexandre Tiskin Tripods Do Not Pack Densely. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:272-280 [Conf ] Subhas C. Nandy An Efficient k Nearest Neighbor Searching Algorithm for a Query Line. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:281-290 [Conf ] Cao An Wang , Bo-Ting Yang Tetrahedralization of Two Nested Convex Polyhedra. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:291-298 [Conf ] Sung Kwon Kim , Chan-Su Shin Efficient Algorithms for Two-Center Problems for a Convex Polygon. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:299-309 [Conf ] Xiaotie Deng , Zhongfei Li , Shouyang Wang On Computation of Arbitrage for Markets with Friction. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:310-319 [Conf ] Zhongping Qin , Yin-Feng Xu , Binhai Zhu On Some Optimization Problems in Obnoxious Facility Location. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:320-329 [Conf ] Frank Ruskey , Joe Sawada Generating Necklaces and Strings with Forbidden Substrings. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:330-339 [Conf ] Gunnar W. Klau , Petra Mutzel Optimal Labelling of Point Features in the Slider Model. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:340-350 [Conf ] Alan A. Bertossi , Maria Cristina Pinotti Mappings for Conflict-Free Access of Paths in Elementary Data Structures. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:351-361 [Conf ] Tadao Takaoka Theory of Trinomial Heaps. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:362-372 [Conf ] Marcus Oswald , Gerhard Reinelt Polyhedral Aspects of the Consecutive Ones Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:373-382 [Conf ] Stephan Weis , Rüdiger Reischuk The Complexity of Physical Mapping with Strict Chimerism. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:383-395 [Conf ] Hirotaka Ono , Kazuhisa Makino , Toshihide Ibaraki Logical Analysis of Data with Decomposable Structures. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:396-406 [Conf ] Shirley H. C. Cheung Learning from Approximate Data. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:407-415 [Conf ] Reihaneh Safavi-Naini , Yejing Wang A Combinatorial Approach to Asymmetric Traitor Tracing. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:416-425 [Conf ] Giovanni Di Crescenzo Removing Complexity Assumptions from Concurrent Zero-Knowledge Proofs. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:426-435 [Conf ] Tomohiro Yamasaki , Hirotada Kobayashi , Yuuki Tokunaga , Hiroshi Imai One-Way Probabilistic Reversible and Quantum One-Counter Automata. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:436-446 [Conf ] Zhuhan Jiang , Bruce E. Litow , Olivier Y. de Vel Similarity Enrichment in Image Compression through Weighted Finite Automata. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:447-456 [Conf ] Hiroaki Yamamoto On the Power of Input-Synchronized Alternating Finite Automata. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:457-466 [Conf ] Masaki Nakanishi , Kiyoharu Hamaguchi , Toshinobu Kashiwabara Ordered Quantum Branching Programs Are More Powerful than Ordered Probabilistic Branching Programs under a Bounded-Width Restriction. [Citation Graph (0, 0)][DBLP ] COCOON, 2000, pp:467-476 [Conf ]