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
2007Online Frequency Assignment in Wireless Communication Networks.Francis Y. L. Chin
2007An Improved Algorithm for Tree Edit Distance Incorporating Structural Linearity.Shihyen Chen, Kaizhong Zhang
2007Finding Many Optimal Paths Without Growing Any Optimal Path Trees.Danny Z. Chen, Ewa Misiolek
2007Improved Algorithms for Weighted and Unweighted Set Splitting Problems.Jianer Chen, Songjian Lu
2007A New Field Splitting Algorithm for Intensity-Modulated Radiation Therapy.Danny Z. Chen, Mark A. Healy, Chao Wang, Xiaodong Wu
2007Efficient Testing of Forecasts.Ching-Lueh Chang, Yuh-Dauh Lyuu
2007Improved Throughput Bounds for Interference-Aware Routing in Wireless Networks.Chiranjeeb Buragohain, Subhash Suri, Csaba D. Tth, Yunhong Zhou
2007On the Number of Cycles in Planar Graphs.Kevin Buchin, Christian Knauer, Klaus Kriegel, Andr Schulz, Raimund Seidel
2007Colored Simultaneous Geometric Embeddings.Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis
2007Generating Minimal k-Vertex Connected Spanning Subgraphs.Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gbor Rudolf
2007Quadratic Kernelization for Convex Recoloring of Trees.Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer
2007Approximation Algorithms for the Black and White Traveling Salesman Problem.Binay K. Bhattacharya, Yuzhuang Hu, Alexander V. Kononov
2007When Does Greedy Learning of Relevant Attributes Succeed?Jan Arpe, Rdiger Reischuk
2007Optimal Offline Extraction of Irredundant Motif Bases.Alberto Apostolico, Claudia Tagliacollo
2007The Combinatorics of Sequencing the Corn Genome.Srinivas Aluru
2007Can a Graph Have Distinct Regular Partitions?Noga Alon, Asaf Shapira, Uri Stav
2007Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs.Noga Alon, Shai Gutner
2007On the Complexity of Finding an Unknown Cut Via Vertex Queries.Peyman Afshani, Ehsan Chiniforooshan, Reza Dorrigiv, Arash Farzan, Mehdi Mirzazadeh, Narges Simjour, Hamid Zarrabi-Zadeh
2006Improved On-Line Broadcast Scheduling with Deadlines.Feifeng Zheng, Stanley P. Y. Fung, Wun-Tat Chan, Francis Y. L. Chin, Chung Keung Poon, Prudence W. H. Wong
2006Improved Algorithms for the Minmax Regret 1-Median Problem.Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang
2006TheYing Xiao, Christoforos N. Hadjicostis, Krishnaiyan Thulasiraman
2006The Class Constrained Bin Packing Problem with Applications to Video-on-Demand.E. C. Xavier, Flvio Keidi Miyazawa
2006Robust Quantum Algorithms withTomoya Suzuki, Shigeru Yamashita, Masaki Nakanishi, Katsumasa Watanabe
2006On the Negation-Limited Circuit Complexity of Sorting and InvertingTakayuki Sato, Kazuyuki Amano, Akira Maruoka
2006Creation and Growth of Components in a Random Hypergraph Process.Vlady Ravelomanana, Alphonse Laza Rijamamy
1,1511,175 of 1,865← PreviousNext →

Comparable venues

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