The SCEAS System
Navigation Menu

Conferences in DBLP

Italian Conference on Algorithms and Complexity (CIAC) (ciac)
2000 (conf/ciac/2000)

  1. Giorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela
    On Salesmen, Repairmen, Spiders, and Other Traveling Agents. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:1-16 [Conf]
  2. Narsingh Deo, Ayman Abdalla
    Computing a Diameter-Constrained Minimum Spanning Tree in Parallel. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:17-31 [Conf]
  3. Joshua Redstone, Walter L. Ruzzo
    Algorithms for a Simple Point Placement Problem. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:32-43 [Conf]
  4. Shmuel Zaks
    Duality in ATM Layout Problems. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:44-58 [Conf]
  5. Wenceslas Fernandez de la Vega
    The Independence Number of Random Interval Graphs. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:59-62 [Conf]
  6. Peter Damaschke
    Online Strategies for Backups. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:63-71 [Conf]
  7. Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
    Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:72-86 [Conf]
  8. Fabrice Noilhan, Miklos Santha
    Semantical Counting Circuits. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:87-101 [Conf]
  9. Sebastian Seibert, Walter Unger
    The Hardness of Placing Street Names in a Manhattan Type Map. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:102-112 [Conf]
  10. Gabriele Neyer, Frank Wagner
    Labeling Downtown. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:113-124 [Conf]
  11. Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau
    The Online Dial-a-Ride Problem under Reasonable Load. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:125-136 [Conf]
  12. Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie
    The Online-TSP against Fair Adversaries. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:137-149 [Conf]
  13. Domenico Cantone, Gianluca Cincotti
    QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:150-162 [Conf]
  14. Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang
    Triangulations without Minimum-Weight Drawing. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:163-173 [Conf]
  15. Jens Gramm, Rolf Niedermeier
    Faster Exact Solutions for MAX2SAT. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:174-186 [Conf]
  16. Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano
    Dynamically Maintaining the Widest k -Dense Corridor. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:187-198 [Conf]
  17. Elena Barcucci, Sara Brunetti, Alberto Del Lungo, Maurice Nivat
    Reconstruction of Discrete Sets from Three or More X-Rays. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:199-210 [Conf]
  18. Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri
    Modified Binary Searching for Static Tables. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:211-225 [Conf]
  19. Sebastiano Battiato, Domenico Cantone, Dario Catalano, Gianluca Cincotti, Micha Hofri
    An Efficient Algorithm for the Approximate Median Selection Problem. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:226-238 [Conf]
  20. Emanuele Covino, Giovanni Pani, Salvatore Caporaso
    Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:239-252 [Conf]
  21. Sabine Hanke, Eljas Soisalon-Soininen
    Group Updates for Red-Black Trees. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:253-262 [Conf]
  22. Irit Dinur
    Approximating SVPinfty to within Almost-Polynomial Factors Is NP-Hard. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:263-276 [Conf]
  23. Kathleen Steinhöfel, Andreas Alexander Albrecht, Chak-Kuen Wong
    Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:277-290 [Conf]
  24. Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Mauro Leoncini
    On the Lovász Number of Certain Circulant Graphs. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:291-305 [Conf]
  25. Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Masayuki Takeda, Ayumi Shinohara, Takeshi Shinohara, Setsuo Arikawa
    Speeding Up Pattern Matching by Text Compression. [Citation Graph (0, 0)][DBLP]
    CIAC, 2000, pp:306-315 [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