The SCEAS System
Navigation Menu

Conferences in DBLP

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


  1. Bidding on Configurations in Internet Ad Auctions. [Citation Graph (, )][DBLP]


  2. An Attacker-Defender Game for Honeynets. [Citation Graph (, )][DBLP]


  3. On the Performances of Nash Equilibria in Isolation Games. [Citation Graph (, )][DBLP]


  4. Limits to List Decoding Random Codes. [Citation Graph (, )][DBLP]


  5. Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. [Citation Graph (, )][DBLP]


  6. A (4n - 4)-Bit Representation of a Rectangular Drawing or Floorplan. [Citation Graph (, )][DBLP]


  7. Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem. [Citation Graph (, )][DBLP]


  8. Coordinate Assignment for Cyclic Level Graphs. [Citation Graph (, )][DBLP]


  9. Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. [Citation Graph (, )][DBLP]


  10. Edge-Intersection Graphs of k-Bend Paths in Grids. [Citation Graph (, )][DBLP]


  11. Efficient Data Structures for the Orthogonal Range Successor Problem. [Citation Graph (, )][DBLP]


  12. Reconstruction of Interval Graphs. [Citation Graph (, )][DBLP]


  13. A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions. [Citation Graph (, )][DBLP]


  14. Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model. [Citation Graph (, )][DBLP]


  15. Efficient Non-interactive Range Proof. [Citation Graph (, )][DBLP]


  16. Approximation Algorithms for Key Management in Secure Multicast. [Citation Graph (, )][DBLP]


  17. On Smoothed Analysis of Quicksort and Hoare's Find. [Citation Graph (, )][DBLP]


  18. On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis. [Citation Graph (, )][DBLP]


  19. Three New Algorithms for Regular Language Enumeration. [Citation Graph (, )][DBLP]


  20. Convex Partitions with 2-Edge Connected Dual Graphs. [Citation Graph (, )][DBLP]


  21. The Closest Pair Problem under the Hamming Metric. [Citation Graph (, )][DBLP]


  22. Space Efficient Multi-dimensional Range Reporting. [Citation Graph (, )][DBLP]


  23. Approximation Algorithms for a Network Design Problem. [Citation Graph (, )][DBLP]


  24. An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due Dates. [Citation Graph (, )][DBLP]


  25. On the Hardness and Approximability of Planar Biconnectivity Augmentation. [Citation Graph (, )][DBLP]


  26. Determination of Glycan Structure from Tandem Mass Spectra. [Citation Graph (, )][DBLP]


  27. On the Generalised Character Compatibility Problem for Non-branching Character Trees. [Citation Graph (, )][DBLP]


  28. Inferring Peptide Composition from Molecular Formulas. [Citation Graph (, )][DBLP]


  29. Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection. [Citation Graph (, )][DBLP]


  30. Computing Bond Types in Molecule Graphs. [Citation Graph (, )][DBLP]


  31. On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries. [Citation Graph (, )][DBLP]


  32. Finding a Level Ideal of a Poset. [Citation Graph (, )][DBLP]


  33. A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent Noise. [Citation Graph (, )][DBLP]


  34. Extracting Computational Entropy and Learning Noisy Linear Functions. [Citation Graph (, )][DBLP]


  35. HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank. [Citation Graph (, )][DBLP]


  36. Online Tree Node Assignment with Resource Augmentation. [Citation Graph (, )][DBLP]


  37. Why Locally-Fair Maximal Flows in Client-Server Networks Perform Well. [Citation Graph (, )][DBLP]


  38. On Finding Small 2-Generating Sets. [Citation Graph (, )][DBLP]


  39. Convex Recoloring Revisited: Complexity and Exact Algorithms. [Citation Graph (, )][DBLP]


  40. Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. [Citation Graph (, )][DBLP]


  41. Hierarchies and Characterizations of Stateless Multicounter Machines. [Citation Graph (, )][DBLP]


  42. Efficient Universal Quantum Circuits. [Citation Graph (, )][DBLP]


  43. An Improved Time-Space Lower Bound for Tautologies. [Citation Graph (, )][DBLP]


  44. Multiple Round Random Ball Placement: Power of Second Chance. [Citation Graph (, )][DBLP]


  45. The Weighted Coupon Collector's Problem and Applications. [Citation Graph (, )][DBLP]


  46. Sublinear-Time Algorithms for Tournament Graphs. [Citation Graph (, )][DBLP]


  47. Classification of a Class of Counting Problems Using Holographic Reductions. [Citation Graph (, )][DBLP]


  48. Separating NE from Some Nonuniform Nondeterministic Complexity Classes. [Citation Graph (, )][DBLP]


  49. On the Readability of Monotone Boolean Formulae. [Citation Graph (, )][DBLP]


  50. Popular Matchings: Structure and Algorithms. [Citation Graph (, )][DBLP]


  51. Graph-Based Data Clustering with Overlaps. [Citation Graph (, )][DBLP]


  52. Directional Geometric Routing on Mobile Ad Hoc Networks. [Citation Graph (, )][DBLP]

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