Conferences in DBLP
Jon M. Kleinberg , Ravi Kumar , Prabhakar Raghavan , Sridhar Rajagopalan , Andrew Tomkins The Web as a Graph: Measurements, Models, and Methods. [Citation Graph (1, 0)][DBLP ] COCOON, 1999, pp:1-17 [Conf ] Jun Tarui , Seinosuke Toda Some Observations on the Computational Complexity of Graph Accessibility Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:18-30 [Conf ] Hiroshi Nagamochi , Toshihide Ibaraki An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:31-40 [Conf ] Tadao Takaoka Theory of 2-3 Heaps. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:41-50 [Conf ] David A. Hutchinson , Anil Maheshwari , Norbert Zeh An External Memory Data Structure for Shortest Path Queries. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:51-60 [Conf ] Wing-Kai Hon , Tak Wah Lam Approximating the Nearest Neighbor Interchange Distance for Evolutionary Trees with Non-uniform Degrees. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:61-70 [Conf ] Guo-Hui Lin , Guoliang Xue Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:71-80 [Conf ] Atsuko Yamaguchi , Akihiro Sugimoto An Approximation Algorithm for the Two-Layered Graph Drawing Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:81-91 [Conf ] Xuemin Lin , Peter Eades Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:92-102 [Conf ] Josep Díaz , Mathew D. Penrose , Jordi Petit , Maria J. Serna Layout Problems on Lattice Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:103-112 [Conf ] Jin-yi Cai A New Transference Theorem in the Geometry of Numbers. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:113-122 [Conf ] Carsten Damm , Ki Hang Kim , Fred W. Roush On Covering and Rank Problems for Boolean Matrices and Their Applications. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:123-133 [Conf ] Meena Mahajan , P. R. Subramanya , V. Vinay A Combinatorial Algorithm for Pfaffians. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:134-143 [Conf ] Enrico Nardelli , Guido Proietti , Peter Widmayer How to Swap a Failing Edge of a Single Source Shortest Paths Tree. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:144-153 [Conf ] Sergei L. Bezrukov , Robert Elsässer , Ulf-Peter Schroeder On Bounds for the k-Partitioning of Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:154-163 [Conf ] Hiroshi Nagamochi , Shigeki Katayama , Toshihide Ibaraki A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:164-173 [Conf ] Andris Ambainis , Richard F. Bonner , Rusins Freivalds , Arnolds Kikusts Probabilities to Accept Languages by Quantum Finite Automata. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:174-183 [Conf ] Lance Fortnow , Aduri Pavan , Alan L. Selman Distributionally-Hard Languages. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:184-193 [Conf ] Pierre McKenzie , Klaus Reinhardt , V. Vinay Circuits and Context-Free Languages. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:194-203 [Conf ] Kazuyuki Amano , Akira Maruoka , Jun Tarui On the Negation-Limited Circuit Complexity of Merging. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:204-209 [Conf ] Peter Bro Miltersen , N. V. Vinodchandran , Osamu Watanabe Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:210-220 [Conf ] Henning Fernau Efficient Learning of Some Linear Matrix Languages. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:221-230 [Conf ] Xiaotie Deng , Yuzhong Zhang Minimizing Mean Response Time in Batch Processing System. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:231-240 [Conf ] Piotr Krysta , Roberto Solis-Oba Approximation Algorithms for Bounded Facility Location. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:241-250 [Conf ] Satoshi Tayu Scheduling Trees onto Hypercubes and Grids Is NP-complete. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:251-260 [Conf ] Magnús M. Halldórsson Approximations of Weighted Independent Set and Hereditary Subset Problems. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:261-270 [Conf ] Magnús M. Halldórsson , Guy Kortsarz , Andrzej Proskurowski , Ravit Salman , Hadas Shachnai , Jan Arne Telle Multi-coloring Trees. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:271-280 [Conf ] Andrea E. F. Clementi , Pierluigi Crescenzi , Gianluca Rossi On the Complexity of Approximating Colored-Graph Problems. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:281-290 [Conf ] Anna Bernasconi , Carsten Damm , Igor Shparlinski On the Average Sensitivity of Testing Square-Free Numbers. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:291-299 [Conf ] Xizhong Zheng Binary Enumerability of Real Numbers. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:300-309 [Conf ] Gene Cooperman , Sandra Feisel , Joachim von zur Gathen , George Havas GCD of Many Integers. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:310-317 [Conf ] Tomasz Jurdzinski , Miroslaw Kutylowski , Krzysztof Lorys Multi-party Finite Computations. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:318-329 [Conf ] Toshio Nakata , Hiroshi Imahayashi , Masafumi Yamashita Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:330-338 [Conf ] Ambros Marzetta , Adrian Brüngger A Dynamic-Programming Bound for the Quadratic Assignment Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:339-348 [Conf ] Takeaki Uno A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:349-359 [Conf ] Jin-yi Cai , George Havas , Bernard Mans , Ajay Nerurkar , Jean-Pierre Seifert , Igor Shparlinski On Routing in Circulant Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:360-369 [Conf ] Akira Matsubayashi , Ryo Takasu Minimum Congestion Embedding of Complete Binary Trees into Tori. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:370-378 [Conf ] Francis Y. L. Chin , Cao An Wang , Fu Lee Wang Maximum Stabbing Line in 2D Plane. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:379-388 [Conf ] Jeet Chaudhuri , Subhas C. Nandy Generalized Shooter Location Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:389-399 [Conf ] Sung-Pil Hong A Competitive Online Algorithm for the Paging Problem with "Shelf" Memory. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:400-408 [Conf ] Kazuo Iwama , Kouki Yonezawa Using Generalized Forecasts for Online Currency Conversion. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:409-421 [Conf ] Friedrich Otto On S-Regular Prefix-Rewriting Systems and Automatic Structures. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:422-431 [Conf ] Kouichi Hirata , Keizo Yamada , Masateru Harao Tractable and Intractable Second-Order Matching Problems. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:432-441 [Conf ] Sung-Woo Lee , Hyun-Sung Kim , Jung-Joon Kim , Tae-Geun Kim , Kee-Young Yoo Efficient Fixed-Size Systolic Arrays for the Modular Multiplication. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:442-451 [Conf ] Ka Wong Chong , Yijie Han , Yoshihide Igarashi , Tak Wah Lam Improving Parallel Computation with Fast Integer Sorting. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:452-461 [Conf ] Sajal K. Das , Bhabani P. Sinha , Rajarshi Chaudhuri A Cominatorial Approach to Performance Analysis of a Shared-Memory Multiprocessor. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:462-472 [Conf ] Joachim Gudmundsson , Christos Levcopoulos A Fast Approximation Algorithm for TSP with Neighborhoods and Red-Blue Separation. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:473-482 [Conf ] H. Y. Lau , H. F. Ting The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:483-492 [Conf ]