The SCEAS System
Navigation Menu

Conferences in DBLP

International Symposium on Algorithms and Computation (ISAAC) (isaac)
2002 (conf/isaac/2002)

  1. Amitabha Bagchi, Adam L. Buchsbaum, Michael T. Goodrich
    Biased Skip Lists. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:1-13 [Conf]
  2. Kunihiko Sadakane
    Space-Efficient Data Structures for Flexible Text Retrieval Systems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:14-24 [Conf]
  3. John Iacono
    Key Independent Optimality. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:25-31 [Conf]
  4. Seth Pettie
    On the Comparison-Addition Complexity of All-Pairs Shortest Paths. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:32-43 [Conf]
  5. Rodica Boliac, Vadim V. Lozin
    On the Clique-Width of Graphs in Hereditary Classes. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:44-54 [Conf]
  6. Martin Dietzfelbinger
    The Probability of a Rendezvous is Minimal in Complete Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:55-66 [Conf]
  7. Jin-yi Cai
    On the Minimum Volume of a Perturbed Unit Cube. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:67-78 [Conf]
  8. Sumanta Guha, Paula Josiah, Anoop Mittal, Son Dinh Tran
    Non-Delaunay-Based Curve Reconstruction. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:79-90 [Conf]
  9. Marc J. van Kreveld, Bettina Speckmann
    Cutting a Country for Smallest Square Fit. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:91-102 [Conf]
  10. Zhe Dang, Oscar H. Ibarra, Zhi-Wei Sun
    On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:103-114 [Conf]
  11. Hirotada Kobayashi, Keiji Matsumoto
    Quantum Multi-prover Interactive Proof Systems with Limited Prior Entanglement. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:115-127 [Conf]
  12. Qi Cheng
    Some Remarks on the L-Conjecture. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:128-136 [Conf]
  13. Thomas Wolle
    A Framework for Network Reliability Problems on Graphs of Bounded Treewidth. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:137-149 [Conf]
  14. Anna Galluccio, Guido Proietti
    A Faster Approximation Algorithm for 2-Edge-Connectivity Augmentation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:150-162 [Conf]
  15. Andreas Brandstädt, Feodor F. Dragan, Hoàng-Oanh Le, Van Bang Le
    Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:163-174 [Conf]
  16. Klaus Jansen, Roberto Solis-Oba
    An Asymptotic Fully Polynomial Time Approximation Scheme for Bin Covering. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:175-186 [Conf]
  17. Markus Bläser, Bodo Manthey
    Improved Approximation Algorithms for Max-2SAT with Cardinality Constraint. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:187-198 [Conf]
  18. Yoshiyuki Karuno, Hiroshi Nagamochi
    A Better Approximation for the Two-Stage Assembly Scheduling Problem with Two Machines at the First Stage. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:199-210 [Conf]
  19. John Iacono, Stefan Langerman
    Queaps. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:211-218 [Conf]
  20. Gerth Stølting Brodal, Rolf Fagerberg
    Funnel Heap - A Cache Oblivious Priority Queue. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:219-228 [Conf]
  21. Jason D. Hartline, Edwin S. Hong, Alexander E. Mohr, William R. Pentney, Emily Rocke
    Characterizing History Independent Data Structures. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:229-240 [Conf]
  22. Venkatesh Raman, Saket Saurabh, C. R. Subramanian
    Faster Fixed Parameter Tractable Algorithms for Undirected Feedback Vertex Set. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:241-248 [Conf]
  23. Ulrike Stege, Iris van Rooij, Alexander Hertel, Philipp Hertel
    An O(pn + 1.151p)-Algorithm for p-Profit Cover and Its Practical Implications for Vertex Cover. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:249-261 [Conf]
  24. Erik D. Demaine, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos
    Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:262-273 [Conf]
  25. Hee-Kap Ahn, Otfried Cheong, René van Oostrum
    Casting a Polyhedron with Directional Uncertainty. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:274-285 [Conf]
  26. Siu-Wing Cheng, Tamal K. Dey, Sheung-Hung Poon
    Hierarchy of Surface Models and Irreducible Triangulation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:286-295 [Conf]
  27. Boting Yang, Cao An Wang, Francis Y. L. Chin
    Algorithms and Complexity for Tetrahedralization Detections. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:296-307 [Conf]
  28. Chun-Hsi Huang, Xin He
    Average-Case Communication-Optimal Parallel Parenthesis Matching. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:308-319 [Conf]
  29. Andrea E. F. Clementi, Angelo Monti, Riccardo Silvestri
    Optimal F-Reliable Protocols for the Do-All Problem on Single-Hop Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:320-331 [Conf]
  30. Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos
    New Results for Energy-Efficient Broadcasting in Wireless Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:332-343 [Conf]
  31. Ryo Kato, Keiko Imai, Takao Asano
    An Improved Algorithm for the Minimum Manhattan Network Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:344-356 [Conf]
  32. Joachim Gudmundsson, Christos Levcopoulos, Giri Narasimhan, Michiel H. M. Smid
    Approximate Distance Oracles Revisited. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:357-368 [Conf]
  33. Greg Aloupis, Erik D. Demaine, Vida Dujmovic, Jeff Erickson, Stefan Langerman, Henk Meijer, Joseph O'Rourke, Mark H. Overmars, Michael A. Soss, Ileana Streinu, Godfried T. Toussaint
    Flat-State Connectivity of Linkages under Dihedral Motions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:369-380 [Conf]
  34. Alexander Grigoriev, Gerhard J. Woeginger
    Project Scheduling with Irregular Costs: Complexity, Approximability, and Algorithms. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:381-390 [Conf]
  35. Evripidis Bampis, Massimiliano Caramia, Jirí Fiala, Aleksei V. Fishkin, Antonio Iovanella
    Scheduling of Independent Dedicated Multiprocessor Tasks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:391-402 [Conf]
  36. Antonio Miranda, Luz Torres, Jianer Chen
    On the Approximability of Multiprocessor Task Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:403-415 [Conf]
  37. Therese C. Biedl, Dana F. Wilkinson
    Bounded-Degree Independent Sets in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:416-427 [Conf]
  38. Kazuhisa Makino, Yushi Uno, Toshihide Ibaraki
    Minimum Edge Ranking Spanning Trees of Threshold Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:428-440 [Conf]
  39. Hiro Ito, Hiroshi Nagamochi, Yosuke Sugiyama, Masato Fujita
    File Transfer Tree Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:441-452 [Conf]
  40. Vikraman Arvind, Venkatesh Raman
    Approximation Algorithms for Some Parameterized Counting Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:453-464 [Conf]
  41. Adi Avidor, Uri Zwick
    Approximating MIN k-SAT. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:465-475 [Conf]
  42. Hiroshi Fujiwara, Kazuo Iwama
    Average-Case Competitive Analyses for Ski-Rental Problems. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:476-488 [Conf]
  43. Christoph Ambühl, Uli Wagner
    On the Clique Problem in Intersection Graphs of Ellipses. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:489-500 [Conf]
  44. Andrzej Lingas
    A Geometric Approach to Boolean Matrix Multiplication. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:501-510 [Conf]
  45. Evanthia Papadopoulou, D. T. Lee
    The Min-Max Voronoi Diagram of Polygons and Applications in VLSI Manufacturing. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:511-522 [Conf]
  46. Rezaul Alam Chowdhury, Vijaya Ramachandran
    Improved Distance Oracles for Avoiding Link-Failure. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:523-534 [Conf]
  47. Tomasz Jurdzinski, Grzegorz Stachowiak
    Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:535-549 [Conf]
  48. Vivek Shikaripura, Ajay D. Kshemkalyani
    A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:550-562 [Conf]
  49. Christoph Buchheim, Seok-Hee Hong
    Crossing Minimization for Symmetries. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:563-574 [Conf]
  50. Cesim Erten, Stephen G. Kobourov
    Simultaneous Embedding of a Planar Graph and Its Dual on the Grid. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:575-587 [Conf]
  51. Paul M. B. Vitányi
    Meaningful Information. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:588-599 [Conf]
  52. Tuomas Sandholm, Subhash Suri
    Market Clearing with Supply and Demand Curves. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:600-611 [Conf]
  53. Takehiro Ito, Xiao Zhou, Takao Nishizeki
    Partitioning Trees of Supply and Demand. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:612-623 [Conf]
  54. Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel
    Maximizing a Voronoi Region: The Convex Case. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:624-634 [Conf]
  55. Luc Devroye
    Random Tries. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:635- [Conf]
  56. Nicholas Pippenger
    Expected Acceptance Counts for Finite Automata with Almost Uniform Input. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:636-646 [Conf]
  57. János Pach, Géza Tóth
    Monotone Drawings of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:647-654 [Conf]
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