The SCEAS System
Navigation Menu

Conferences in DBLP

Computing and Combinatorics (COCOON) (cocoon)
1995 (conf/cocoon/1995)

  1. Uri Zwick, Mike Paterson
    The Complexity of Mean Payoff Games. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:1-10 [Conf]
  2. Kazuo Iwama, Shuichi Miyazaki
    Approximation of coNP Sets by NP-complete Sets. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:11-20 [Conf]
  3. Qing-Wen Feng, Robert F. Cohen, Peter Eades
    How to Draw a Planar Clustered Graph. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:21-30 [Conf]
  4. Tiziana Calamoneri, Rossella Petreschi
    An Efficient Orthogonal Grid Drawing Algorithm For Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:31-40 [Conf]
  5. Siu-Wing Cheng, Yin-Feng Xu
    Constrained Independence System and Triangulations of Planar Point Sets. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:41-50 [Conf]
  6. Cao An Wang, Binhai Zhu
    Three Dimensional Weak Visibility: Complexity and Applications. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:51-60 [Conf]
  7. Sung Kwon Kim
    Rectangulating Rectilinear Polygons in Parallel. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:61-70 [Conf]
  8. V. Kamakoti, Kamala Krithivasan, C. Pandu Rangan
    Efficient Randomized Incremental Algorithm For The Closest Pair Problem Using Leafary Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:71-80 [Conf]
  9. Edward P. F. Chan, Ron van der Meyden
    Testing Containment of Object-Oriented Conjunctive Queries is Pi_2^p-hard. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:81-90 [Conf]
  10. Ruogu Zhang
    Computing Infinite Relations Using Finite Expressions: A New Approach To The Safety Issue In Relational Databases. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:91-100 [Conf]
  11. Seung Jin Lim, Yiu-Kai Ng
    Set-Term Unification in a Logic Database Language. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:101-110 [Conf]
  12. Marcel Wild
    Computations with Finite Closure Systems and Implications. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:111-120 [Conf]
  13. Andrzej Lingas
    Maximum Tree-Packing in Time O(n5/2). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:121-130 [Conf]
  14. Weiping Shi, Douglas B. West
    Optimal Algorithms for Finding Connected Components of an Unknown Graph. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:131-140 [Conf]
  15. Joseph L. Ganley, Mordecai J. Golin, Jeffrey S. Salowe
    The Multi-Weighted Spanning Tree Problem (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:141-150 [Conf]
  16. Jianer Chen
    Algorithmic Graph Embeddings (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:151-160 [Conf]
  17. Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi
    Analysis of Quorum-Based Protocols for Distributed (k+1)-Exclusion. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:161-170 [Conf]
  18. Xuemin Lin, Maria E. Orlowska
    A Highly Fault-Tolerant Quorum Consensus Method for Managing Replicated Data. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:171-180 [Conf]
  19. Guoxiang Huang
    Constructing Craig Interpolation Formulas. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:181-190 [Conf]
  20. Yoshinobu Kawabe, Naohiro Ishii
    Currying of Order-Sorted Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:191-202 [Conf]
  21. S. Rengarajan, C. E. Veni Madhavan
    Stack and Queue Number of 2-Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:203-212 [Conf]
  22. Scott K. Walley, Harry H. Tan
    Shortest Paths in Random Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:213-222 [Conf]
  23. Xiao Zhou, Takao Nishizeki
    Simple Reduction of f-Colorings to Edge-Colorings. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:223-228 [Conf]
  24. Kazuyoshi Hayase, Kunihiko Sadakane, Seiichiro Tani
    Output-size Sensitiveness of OBDD Construction Through Maximal Independent Set Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:229-234 [Conf]
  25. John Tromp, Louxin Zhang, Ying Zhao
    Small Weight Bases for Hamming Codes. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:235-243 [Conf]
  26. Julien Cassaigne, Juhani Karhumäki
    Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:244-253 [Conf]
  27. Elena Barcucci, Alberto Del Lungo, Elisa Pergola, Renzo Pinzani
    A Construction for Enumerating k-coloured Motzkin Paths. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:254-263 [Conf]
  28. Vladimir A. Oleshchuk
    On Public-Key Cryptosystem Based on Church-Rosser String-Rewriting Systems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:264-269 [Conf]
  29. John E. Savage
    Extending the Hong-Kung Model to Memory Hierarchies. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:270-281 [Conf]
  30. Liming Cai, Jianer Chen
    On log-Time Alternating Turing Machines of Alternation Depth k (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:282-291 [Conf]
  31. Kaoru Kurosawa, Sanpei Kageyama
    New Bound for Afine Resolvable Designs and Its Application to Authentication Codes. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:292-302 [Conf]
  32. Boris D. Lubachevsky, Ronald L. Graham
    Dense Packings of 3k(k+1)+1 Equal Disks in a Circle for k=1, 2, 3, 4 and 5. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:303-312 [Conf]
  33. Josep Díaz, Alan Gibbons, Grammati E. Pantziou, Maria J. Serna, Paul G. Spirakis, Jacobo Torán
    Efficient Parallel Algorithms for some Tree Layout Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:313-323 [Conf]
  34. Yijie Han, Xiaojun Shen
    Conservative Algorithms for Parallel and Sequential Integer Sorting. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:324-333 [Conf]
  35. Zhixiang Chen
    An Optimal Algorithm for Proper Learning of Unions of Two Rectangles with Queries. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:334-343 [Conf]
  36. Zhixiang Chen
    Disjunctions of Negated Counting Functions Are Efficiently Learnable with Equivalence Queries. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:344-349 [Conf]
  37. Shiquan Wu
    Non-empty Cross-3-Intersection Theorems of Subsets. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:350-356 [Conf]
  38. Bo Yu
    Convexity of Minimal Total Dominating Functions in Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:357-365 [Conf]
  39. Jean Hardouin Duparc, Philippe Rolland
    Transformations for Maximal Planar Graphs with Minimum Degree Five. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:366-371 [Conf]
  40. You Zhaoyong, Wang Chuanglong
    An Asynchrolous Parallel Method for Linaer Systems. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:372-378 [Conf]
  41. Zhang Xiangde
    On a Kind of Sequence of Polynomials. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:379-383 [Conf]
  42. Jixiang Meng
    Hamiltonian Cycles in 2-generated Cayley Digraphs of Abelian Groups. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:384-387 [Conf]
  43. Cheng-Xu Xu, Zhun-Wei Lu
    Pandiagonal Magic Squares. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:388-391 [Conf]
  44. Hua Wang, Zhao-yong You
    PFFM and Quasi-Morishima Matrices. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:392-395 [Conf]
  45. C. F. Chang, J. X. Chang, X. C. Lu, Peter Che Bor Lam, J. F. Wang
    Edge-Face Total Chromatic Number of Outerplanar Graphs with Delta(G)=6. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:396-399 [Conf]
  46. Rainer Schuler, Tomoyuki Yamakami
    Sets Computable in Polynomial Time on Average. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:400-409 [Conf]
  47. Jay Belanger, Jie Wang
    Rankable Distributions Do Not Provide Harder Instances Than Uniform Distributions. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:410-419 [Conf]
  48. Kojiro Kabayashi
    Transformations that Preserve Maligness of Universal Distributions. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:420-429 [Conf]
  49. Lane A. Hemaspaandra, Jörg Rothe
    Intersection Suffices for Boolean Hierarchy Equivalence. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:430-435 [Conf]
  50. Dean Kelley, Peng-Jun Wan, Quifan Yang
    A 3/2 log3-Competive Algorithm for the Counterfeit Cain Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:436-445 [Conf]
  51. Svante Carlsson, Jingsen Chen
    Searching Rigid Data Structures (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:446-451 [Conf]
  52. Bo-Ting Yang
    A Better Subgraph of the Minimum Weight Triangulation. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:452-455 [Conf]
  53. Wen Gao, Baocai Yin
    Sequence Decomposition Method for Computing a Gröbner Basis and Its Application to Bivariate Spline. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:456-461 [Conf]
  54. Leqiang Bai, Peter M. Yamakawa, Hiroyuki Ebara, Hideo Nakando
    A Broadcasting Algorithm on the Arrangement Graph. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:462-471 [Conf]
  55. Shyue-Horng Shiau, Chang-Biau Yang
    A Fast Maximum Finding Algorithm on Broadcast Communication. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:472-481 [Conf]
  56. Aditya Shastri
    Broadcasting in General Networks I: Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:482-489 [Conf]
  57. Shyh-Chain Chern, Tai-Ching Tuan, Jung-Sing Jwo
    Uni-directional Alternating Group Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:490-495 [Conf]
  58. Kouichi Sakurai
    On Separating Proofs of Knowledge from Proofs of Membership of Languages and Its Application to Secure Identification Schemes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:496-509 [Conf]
  59. Sven Oliver Krumke, Hartmut Noltemeier, S. S. Ravi, Madhav V. Marathe
    Compact Location Problems with Budget and Communication Constraints. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:510-519 [Conf]
  60. Siu-Wing Cheng, Michael Kaminski, Shmuel Zaks
    Minimum Dominating Sets of Intervals on Lines (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:520-529 [Conf]
  61. Ying Choi, Tak Wah Lam
    Two-Dimensional Pattern Matching on a Dynamic Library of Texts. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:530-538 [Conf]
  62. Pierluigi Crescenzi, Viggo Kann, Riccardo Silvestri, Luca Trevisan
    Structure in Approximation Classes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:539-548 [Conf]
  63. Marcus Peinado
    Improved Lower Bounds for the Randomized Boppana-Halldórsson Algorithm for MAXCLIQUE. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:549-558 [Conf]
  64. Qi Cheng, Hong Zhu
    MNP: A Class of NP Optimization Problems (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:559-565 [Conf]
  65. Roman Bacik, Sanjeev Mahajan
    Semidefinite Programming and its Applications to NP Problems. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:566-575 [Conf]
  66. Lucas Chi Kwong Hui, Kwok-Yan Lam
    Analysis and Experimentation on List Update Algorithms. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:576-581 [Conf]
  67. B. N. Khoury, Panos M. Pardalos
    An Exact Branch and Bound Algorithm for the Steiner Problem in Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:582-590 [Conf]
  68. Huang Wenqui, Li Wei, Lu Weifeng, Zhang Yuping
    A Physical Model for the Satisfiability Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:591-596 [Conf]
  69. Sam M. Kim, Robert McNaughton
    An Efficient Algorithm for Local Testability Problem of Finite State Automata. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:597-606 [Conf]
  70. Xiangdong Yu, Moti Yung
    Scheduling Task-Tree with Additive Scales on Parallel / Distributed Machines. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:607-616 [Conf]
  71. Chi-lok Chan, Gilbert H. Young
    Single-vehicle Scheduling Problem on a Straight Line with Time Window Constraints. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:617-626 [Conf]
  72. Rongheng Li, Lijie Shi
    An On-Line Algorithm for Some Uniform Processor Scheduling. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:627-632 [Conf]
  73. Peter Jeavons, David A. Cohen
    An Algebraic Characterization of Tractable Constraints. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:633-642 [Conf]
  74. Jiyu Ding, Chngxiang Qing, Guodong Song
    Limit Property of Unbalanced Development in Economic Network. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:643-646 [Conf]
  75. Derick Wood
    Document Processing, Theory, and Practice (Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:647- [Conf]
  76. Tao Jiang
    Matching and Comparing Sequences in Molecular Biology (Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:648-649 [Conf]
  77. Vijay V. Vazirani
    Primal-Dual Schema Based Approximation Algorithms (Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:650-652 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002