The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Efficient Compression of Web Graphs. [Citation Graph (, )][DBLP]

  2. Damaged BZip Files Are Difficult to Repair. [Citation Graph (, )][DBLP]

  3. Isoperimetric Problem and Meta-Fibonacci Sequences. [Citation Graph (, )][DBLP]

  4. On the Complexity of Equilibria Problems in Angel-Daemon Games. [Citation Graph (, )][DBLP]

  5. Average-Case Competitive Analyses for One-Way Trading. [Citation Graph (, )][DBLP]

  6. On the Monotonicity of Weak Searching. [Citation Graph (, )][DBLP]

  7. VC Dimension Bounds for Analytic Algebraic Computations. [Citation Graph (, )][DBLP]

  8. Resource Bounded Frequency Computations with Three Errors. [Citation Graph (, )][DBLP]

  9. A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model. [Citation Graph (, )][DBLP]

  10. Smallest Formulas for Parity of 2k. [Citation Graph (, )][DBLP]

  11. Counting Polycubes without the Dimensionality Curse. [Citation Graph (, )][DBLP]

  12. Polychromatic Colorings of n-Dimensional Guillotine-Partitions. [Citation Graph (, )][DBLP]

  13. The Computational Complexity of Link Building. [Citation Graph (, )][DBLP]

  14. Improved Parameterized Algorithms for Weighted 3-Set Packing. [Citation Graph (, )][DBLP]

  15. Structural Identifiability in Low-Rank Matrix Factorization. [Citation Graph (, )][DBLP]

  16. Complexity of Counting the Optimal Solutions. [Citation Graph (, )][DBLP]

  17. The Orbit Problem Is in the GapL Hierarchy. [Citation Graph (, )][DBLP]

  18. Quantum Separation of Local Search and Fixed Point Computation. [Citation Graph (, )][DBLP]

  19. Multi-party Quantum Communication Complexity with Routed Messages. [Citation Graph (, )][DBLP]

  20. Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments. [Citation Graph (, )][DBLP]

  21. Approximating Alternative Solutions. [Citation Graph (, )][DBLP]

  22. Dimensions of Points in Self-similar Fractals. [Citation Graph (, )][DBLP]

  23. Visual Cryptography on Graphs. [Citation Graph (, )][DBLP]

  24. Algebraic Cryptanalysis of CTRU Cryptosystem. [Citation Graph (, )][DBLP]

  25. Detecting Community Structure by Network Vectorization. [Citation Graph (, )][DBLP]

  26. Quasi-bicliques: Complexity and Binding Pairs. [Citation Graph (, )][DBLP]

  27. Complexity of a Collision-Aware String Partition Problem and Its Relation to Oligo Design for Gene Synthesis. [Citation Graph (, )][DBLP]

  28. Genome Halving under DCJ Revisited. [Citation Graph (, )][DBLP]

  29. Haplotype Inferring Via Galled-Tree Networks Is NP-Complete. [Citation Graph (, )][DBLP]

  30. Adjacent Swaps on Strings. [Citation Graph (, )][DBLP]

  31. Efficient Algorithms for SNP Haplotype Block Selection Problems. [Citation Graph (, )][DBLP]

  32. Sequence Alignment Algorithms for Run-Length-Encoded Strings. [Citation Graph (, )][DBLP]

  33. A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations. [Citation Graph (, )][DBLP]

  34. A Practical Exact Algorithm for the Individual Haplotyping Problem MEC/GI. [Citation Graph (, )][DBLP]

  35. Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance. [Citation Graph (, )][DBLP]

  36. On Center Regions and Balls Containing Many Points. [Citation Graph (, )][DBLP]

  37. On Unfolding 3D Lattice Polygons and 2D Orthogonal Trees. [Citation Graph (, )][DBLP]

  38. New Algorithms for Online Rectangle Filling with k-Lookahead. [Citation Graph (, )][DBLP]

  39. Geometric Spanner of Objects under L1 Distance. [Citation Graph (, )][DBLP]

  40. Star-Shaped Drawings of Graphs with Fixed Embedding and Concave Corner Constraints. [Citation Graph (, )][DBLP]

  41. A New Characterization of P6-Free Graphs. [Citation Graph (, )][DBLP]

  42. Maximum Connected Domatic Partition of Directed Path Graphs with Single Junction. [Citation Graph (, )][DBLP]

  43. Efficient Algorithms for the kSmallest Cuts Enumeration. [Citation Graph (, )][DBLP]

  44. Covering Directed Graphs by In-Trees. [Citation Graph (, )][DBLP]

  45. On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints. [Citation Graph (, )][DBLP]

  46. Probe Ptolemaic Graphs. [Citation Graph (, )][DBLP]

  47. Diagnosability of Two-Matching Composition Networks. [Citation Graph (, )][DBLP]

  48. The Iterated Restricted Immediate Snapshot Model. [Citation Graph (, )][DBLP]

  49. Finding Frequent Items in a Turnstile Data Stream. [Citation Graph (, )][DBLP]

  50. A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constraints. [Citation Graph (, )][DBLP]

  51. Optimal Tree Structures for Group Key Tree Management Considering Insertion and Deletion Cost. [Citation Graph (, )][DBLP]

  52. Throughput Maximization with Traffic Profile in Wireless Mesh Network. [Citation Graph (, )][DBLP]

  53. Joint Topology Control and Power Conservation for Wireless Sensor Networks Using Transmit Power Adjustment. [Citation Graph (, )][DBLP]

  54. (6+epsilon)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs. [Citation Graph (, )][DBLP]

  55. Spectrum Bidding in Wireless Networks and Related. [Citation Graph (, )][DBLP]

  56. (1+rho)-Approximation for Selected-Internal Steiner Minimum Tree. [Citation Graph (, )][DBLP]

  57. Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities. [Citation Graph (, )][DBLP]

  58. Spreading Messages. [Citation Graph (, )][DBLP]

  59. On Some City Guarding Problems. [Citation Graph (, )][DBLP]

  60. Optimal Insertion of a Segment Highway in a City Metric. [Citation Graph (, )][DBLP]

  61. Approximating the Generalized Capacitated Tree-Routing Problem. [Citation Graph (, )][DBLP]

  62. Column Generation Algorithms for the Capacitated m-Ring-Star Problem. [Citation Graph (, )][DBLP]

  63. Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine. [Citation Graph (, )][DBLP]

  64. A Two-Stage Flexible Flowshop Problem with Deterioration. [Citation Graph (, )][DBLP]

  65. A Lower Bound for the On-Line Preemptive Machine Scheduling with lp. [Citation Graph (, )][DBLP]

  66. The Coordination of Two Parallel Machines Scheduling and Batch Deliveries. [Citation Graph (, )][DBLP]

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
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 [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002