Conferences in DBLP

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

1. 
   Understanding and Inductive Inference. [Citation Graph (, )][DBLP]
   
   
2. 
   Computing with Cells: Membrane Systems. [Citation Graph (, )][DBLP]
   
   
3. 
   Boxicity and Poset Dimension. [Citation Graph (, )][DBLP]
   
   
4. 
   On the Hardness against Constant-Depth Linear-Size Circuits. [Citation Graph (, )][DBLP]
   
   
5. 
   A K-Provers Parallel Repetition Theorem for a Version of No-Signaling Model. [Citation Graph (, )][DBLP]
   
   
6. 
   The Curse of Connectivity: t-Total Vertex (Edge) Cover. [Citation Graph (, )][DBLP]
   
   
7. 
   Counting Paths in VPA Is Complete for #NC¹. [Citation Graph (, )][DBLP]
   
   
8. 
   Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean Formulas. [Citation Graph (, )][DBLP]
   
   
9. 
   Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle Packing. [Citation Graph (, )][DBLP]
   
   
10. 
    Clustering with or without the Approximation. [Citation Graph (, )][DBLP]
    
    
11. 
    A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary Networks. [Citation Graph (, )][DBLP]
    
    
12. 
    Approximate Weighted Farthest Neighbors and Minimum Dilation Stars. [Citation Graph (, )][DBLP]
    
    
13. 
    Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs. [Citation Graph (, )][DBLP]
    
    
14. 
    Maximum Upward Planar Subgraph of a Single-Source Embedded Digraph. [Citation Graph (, )][DBLP]
    
    
15. 
    Triangle-Free 2-Matchings Revisited. [Citation Graph (, )][DBLP]
    
    
16. 
    The Cover Time of Deterministic Random Walks. [Citation Graph (, )][DBLP]
    
    
17. 
    Finding Maximum Edge Bicliques in Convex Bipartite Graphs. [Citation Graph (, )][DBLP]
    
    
18. 
    A Note on Vertex Cover in Graphs with Maximum Degree 3. [Citation Graph (, )][DBLP]
    
    
19. 
    Computing Graph Spanners in Small Memory: Fault-Tolerance and Streaming. [Citation Graph (, )][DBLP]
    
    
20. 
    Factorization of Cartesian Products of Hypergraphs. [Citation Graph (, )][DBLP]
    
    
21. 
    Minimum-Segment Convex Drawings of 3-Connected Cubic Plane Graphs. [Citation Graph (, )][DBLP]
    
    
22. 
    On Three Parameters of Invisibility Graphs. [Citation Graph (, )][DBLP]
    
    
23. 
    Imbalance Is Fixed Parameter Tractable. [Citation Graph (, )][DBLP]
    
    
24. 
    The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete Graphs. [Citation Graph (, )][DBLP]
    
    
25. 
    Optimal Binary Space Partitions in the Plane. [Citation Graph (, )][DBLP]
    
    
26. 
    Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems. [Citation Graph (, )][DBLP]
    
    
27. 
    Effect of Corner Information in Simultaneous Placement of K Rectangles and Tableaux. [Citation Graph (, )][DBLP]
    
    
28. 
    Detecting Areas Visited Regularly. [Citation Graph (, )][DBLP]
    
    
29. 
    Tile-Packing Tomography Is \mathbbNP{\mathbb{NP}}-hard. [Citation Graph (, )][DBLP]
    
    
30. 
    The Rectilinear k-Bends TSP. [Citation Graph (, )][DBLP]
    
    
31. 
    Tracking a Generator by Persistence. [Citation Graph (, )][DBLP]
    
    
32. 
    Auspicious Tatami Mat Arrangements. [Citation Graph (, )][DBLP]
    
    
33. 
    Faster Generation of Shorthand Universal Cycles for Permutations. [Citation Graph (, )][DBLP]
    
    
34. 
    The Complexity of Word Circuits. [Citation Graph (, )][DBLP]
    
    
35. 
    On the Density of Regular and Context-Free Languages. [Citation Graph (, )][DBLP]
    
    
36. 
    Extensions of the Minimum Cost Homomorphism Problem. [Citation Graph (, )][DBLP]
    
    
37. 
    The Longest Almost-Increasing Subsequence. [Citation Graph (, )][DBLP]
    
    
38. 
    Universal Test Sets for Reversible Circuits. [Citation Graph (, )][DBLP]
    
    
39. 
    Approximate Counting with a Floating-Point Counter. [Citation Graph (, )][DBLP]
    
    
40. 
    Broadcasting in Heterogeneous Tree Networks. [Citation Graph (, )][DBLP]
    
    
41. 
    Contention Resolution in Multiple-Access Channels: k-Selection in Radio Networks. [Citation Graph (, )][DBLP]
    
    
42. 
    Online Preemptive Scheduling with Immediate Decision or Notification and Penalties. [Citation Graph (, )][DBLP]
    
    
43. 
    Discovering Pairwise Compatibility Graphs. [Citation Graph (, )][DBLP]
    
    
44. 
    Near Optimal Solutions for Maximum Quasi-bicliques. [Citation Graph (, )][DBLP]
    
    
45. 
    Fast Coupled Path Planning: From Pseudo-Polynomial to Polynomial. [Citation Graph (, )][DBLP]
    
    
46. 
    Constant Time Approximation Scheme for Largest Well Predicted Subset. [Citation Graph (, )][DBLP]
    
    
47. 
    On Sorting Permutations by Double-Cut-and-Joins. [Citation Graph (, )][DBLP]
    
    
48. 
    A Three-String Approach to the Closest String Problem. [Citation Graph (, )][DBLP]
    
    
49. 
    A 2k Kernel for the Cluster Editing Problem. [Citation Graph (, )][DBLP]
    
    
50. 
    On the Computation of 3D Visibility Skeletons. [Citation Graph (, )][DBLP]
    
    
51. 
    The Violation Heap: A Relaxed Fibonacci-Like Heap. [Citation Graph (, )][DBLP]
    
    
52. 
    Threshold Rules for Online Sample Selection. [Citation Graph (, )][DBLP]
    
    
53. 
    Heterogeneous Subset Sampling. [Citation Graph (, )][DBLP]
    
    
54. 
    Identity-Based Authenticated Asymmetric Group Key Agreement Protocol. [Citation Graph (, )][DBLP]
    
    
55. 
    Zero-Knowledge Argument for Simultaneous Discrete Logarithms. [Citation Graph (, )][DBLP]
    
    
56. 
    Directed Figure Codes: Decidability Frontier. [Citation Graph (, )][DBLP]