The SCEAS System
Navigation Menu

Conferences in DBLP

European Symposium on Algorithms (ESA) (esa)
2009 (conf/esa/2009)

  1. Some Open Questions Related to Cuckoo Hashing. [Citation Graph (, )][DBLP]

  2. Efficient Computation of the Characteristic Polynomial of a Tree and Related Tasks. [Citation Graph (, )][DBLP]

  3. Improved Approximation Algorithms for Label Cover Problems. [Citation Graph (, )][DBLP]

  4. A Linear Time Algorithm for L(2, 1)-Labeling of Trees. [Citation Graph (, )][DBLP]

  5. On Inducing Polygons and Related Problems. [Citation Graph (, )][DBLP]

  6. Computing 3D Periodic Triangulations. [Citation Graph (, )][DBLP]

  7. Cauchy's Theorem for Orthogonal Polyhedra of Genus 0. [Citation Graph (, )][DBLP]

  8. Approximability of Sparse Integer Programs. [Citation Graph (, )][DBLP]

  9. Iterative Rounding for Multi-Objective Optimization Problems. [Citation Graph (, )][DBLP]

  10. A Global-Optimization Algorithm for Mixed-Integer Nonlinear Programs Having Separable Non-convexity. [Citation Graph (, )][DBLP]

  11. Constructing Delaunay Triangulations along Space-Filling Curves. [Citation Graph (, )][DBLP]

  12. Piercing Translates and Homothets of a Convex Body. [Citation Graph (, )][DBLP]

  13. Output-Sensitive Algorithms for Enumerating Minimal Transversals for Some Geometric Hypergraphs. [Citation Graph (, )][DBLP]

  14. On Revenue Maximization in Second-Price Ad Auctions. [Citation Graph (, )][DBLP]

  15. Clustering-Based Bidding Languages for Sponsored Search. [Citation Graph (, )][DBLP]

  16. Altruism in Atomic Congestion Games. [Citation Graph (, )][DBLP]

  17. Geometric Spanners for Weighted Point Sets. [Citation Graph (, )][DBLP]

  18. k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees. [Citation Graph (, )][DBLP]

  19. Narrow-Shallow-Low-Light Trees with and without Steiner Points. [Citation Graph (, )][DBLP]

  20. Bounded Budget Betweenness Centrality Game for Strategic Network Formations. [Citation Graph (, )][DBLP]

  21. Exact and Approximate Equilibria for Optimal Group Network Formation. [Citation Graph (, )][DBLP]

  22. On the Performance of Approximate Equilibria in Congestion Games. [Citation Graph (, )][DBLP]

  23. Optimality and Competitiveness of Exploring Polygons by Mobile Robots. [Citation Graph (, )][DBLP]

  24. Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links. [Citation Graph (, )][DBLP]

  25. Dynamic vs. Oblivious Routing in Network Design. [Citation Graph (, )][DBLP]

  26. Algorithms Meet Art, Puzzles, and Magic. [Citation Graph (, )][DBLP]

  27. Polynomial-Time Algorithm for the Leafage of Chordal Graphs. [Citation Graph (, )][DBLP]

  28. Breaking the O(m2n) Barrier for Minimum Cycle Bases. [Citation Graph (, )][DBLP]

  29. Shape Fitting on Point Sets with Probability Distributions. [Citation Graph (, )][DBLP]

  30. An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants (Extended Abstract). [Citation Graph (, )][DBLP]

  31. Complete Parsimony Haplotype Inference Problem and Algorithms. [Citation Graph (, )][DBLP]

  32. Linear-Time Recognition of Probe Interval Graphs. [Citation Graph (, )][DBLP]

  33. Wireless Scheduling with Power Control. [Citation Graph (, )][DBLP]

  34. On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources. [Citation Graph (, )][DBLP]

  35. Approximability of OFDMA Scheduling. [Citation Graph (, )][DBLP]

  36. Maximum Flow in Directed Planar Graphs with Vertex Capacities. [Citation Graph (, )][DBLP]

  37. A Fast Output-Sensitive Algorithm for Boolean Matrix Multiplication. [Citation Graph (, )][DBLP]

  38. On Optimally Partitioning a Text to Improve Its Compression. [Citation Graph (, )][DBLP]

  39. An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-Time Scheduling. [Citation Graph (, )][DBLP]

  40. Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling. [Citation Graph (, )][DBLP]

  41. Preemptive Online Scheduling with Reordering. [Citation Graph (, )][DBLP]

  42. d-Dimensional Knapsack in the Streaming Model. [Citation Graph (, )][DBLP]

  43. Sparse Cut Projections in Graph Streams. [Citation Graph (, )][DBLP]

  44. Bipartite Graph Matchings in the Semi-streaming Model. [Citation Graph (, )][DBLP]

  45. The Oil Searching Problem. [Citation Graph (, )][DBLP]

  46. Hyperbolic Dovetailing. [Citation Graph (, )][DBLP]

  47. On the Expansion and Diameter of Bluetooth-Like Topologies. [Citation Graph (, )][DBLP]

  48. Minimum Makespan Multi-vehicle Dial-a-Ride. [Citation Graph (, )][DBLP]

  49. Google's Auction for TV Ads. [Citation Graph (, )][DBLP]

  50. Inclusion/Exclusion Meets Measure and Conquer. [Citation Graph (, )][DBLP]

  51. Dynamic Programming on Tree Decompositions Using Generalised Fast Subset Convolution. [Citation Graph (, )][DBLP]

  52. Counting Paths and Packings in Halves. [Citation Graph (, )][DBLP]

  53. Accelerating Multi-modal Route Planning by Access-Nodes. [Citation Graph (, )][DBLP]

  54. Parallel Algorithms for Mean-Payoff Games: An Experimental Evaluation. [Citation Graph (, )][DBLP]

  55. Experimental Study of FPT Algorithms for the Directed Feedback Vertex Set Problem. [Citation Graph (, )][DBLP]

  56. Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth. [Citation Graph (, )][DBLP]

  57. Kernel Bounds for Disjoint Cycles and Disjoint Paths. [Citation Graph (, )][DBLP]

  58. Constant Ratio Fixed-Parameter Approximation of the Edge Multicut Problem. [Citation Graph (, )][DBLP]

  59. Rank-Pairing Heaps. [Citation Graph (, )][DBLP]

  60. 3.5-Way Cuckoo Hashing for the Price of 2-and-a-Bit. [Citation Graph (, )][DBLP]

  61. Hash, Displace, and Compress. [Citation Graph (, )][DBLP]

  62. Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels. [Citation Graph (, )][DBLP]

  63. Contraction Bidimensionality: The Accurate Picture. [Citation Graph (, )][DBLP]

  64. Minimizing Movement: Fixed-Parameter Tractability. [Citation Graph (, )][DBLP]

  65. Storing a Compressed Function with Constant Time Access. [Citation Graph (, )][DBLP]

  66. Experimental Variations of a Theoretically Good Retrieval Data Structure. [Citation Graph (, )][DBLP]

  67. Short Labels for Lowest Common Ancestors in Trees. [Citation Graph (, )][DBLP]

  68. Disproof of the Neighborhood Conjecture with Implications to SAT. [Citation Graph (, )][DBLP]

  69. Reconstructing 3-Colored Grids from Horizontal and Vertical Projections Is NP-hard. [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