Skip to content

International Conference on Computing and Combinatorics

COCOON

National

CORE rank

CORE rank (raw)

National:China

Fields of research

Theory of Computation

Papers indexed

1,865

1995–2026

Papers per year

1995103 peak2026

COCOON papers

1,865 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
1999Binary Enumerability of Real Numbers.Xizhong Zheng
1999An Approximation Algorithm for the Two-Layered Graph Drawing Problem.Atsuko Yamaguchi, Akihiro Sugimoto
1999A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases.Takeaki Uno
1999Scheduling Trees onto Hypercubes and Grids Is NP-complete.Satoshi Tayu
1999Some Observations on the Computational Complexity of Graph Accessibility Problem.Jun Tarui, Seinosuke Toda
1999Theory of 2-3 Heaps.Tadao Takaoka
1999On S-Regular Prefix-Rewriting Systems and Automatic Structures.Friedrich Otto
1999How to Swap a Failing Edge of a Single Source Shortest Paths Tree.Enrico Nardelli, Guido Proietti, Peter Widmayer
1999Probabilistic Local Majority Voting for the Agreement Problem on Finite Graphs.Toshio Nakata, Hiroshi Imahayashi, Masafumi Yamashita
1999A Faster Algorithm for Computing Minimum 5-Way and 6-Way Cuts in Graphs.Hiroshi Nagamochi, Shigeki Katayama, Toshihide Ibaraki
1999An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree.Hiroshi Nagamochi, Toshihide Ibaraki
1999Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy.Peter Bro Miltersen, N. V. Vinodchandran, Osamu Watanabe
1999Circuits and Context-Free Languages.Pierre McKenzie, Klaus Reinhardt, V. Vinay
1999Minimum Congestion Embedding of Complete Binary Trees into Tori.Akira Matsubayashi, Ryo Takasu
1999A Dynamic-Programming Bound for the Quadratic Assignment Problem.Ambros Marzetta, Adrian Brngger
1999A Combinatorial Algorithm for Pfaffians.Meena Mahajan, P. R. Subramanya, V. Vinay
1999Signed Genome Rearrangement by Reversals and Transpositions: Models and Approximations.Guo-Hui Lin, Guoliang Xue
1999Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs.Xuemin Lin, Peter Eades
1999Efficient Fixed-Size Systolic Arrays for the Modular Multiplication.Sung-Woo Lee, Hyun-Sung Kim, Jung-Joon Kim, Tae-Geun Kim, Kee-Young Yoo
1999The Greedier the Better: An Efficient Algorithm for Approximating Maximum Independent Set.Hing-Yip Lau, H. F. Ting
1999Approximation Algorithms for Bounded Facility Location.Piotr Krysta, Roberto Solis-Oba
1999The Web as a Graph: Measurements, Models, and Methods.Jon M. Kleinberg, Ravi Kumar, Prabhakar Raghavan, Sridhar Rajagopalan, Andrew Tomkins
1999Multi-party Finite Computations.Tomasz Jurdzinski, Miroslaw Kutylowski, Krzysztof Lorys
1999Using Generalized Forecasts for Online Currency Conversion.Kazuo Iwama, Kouki Yonezawa
1999An External Memory Data Structure for Shortest Path Queries.David A. Hutchinson, Anil Maheshwari, Norbert Zeh
1,6011,625 of 1,865← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.