CIAC C

26 papers

YearTitle / Authors
2000Algorithms and Complexity, 4th Italian Conference, CIAC 2000, Rome, Italy, March 2000, Proceedings
Gian Carlo Bongiovanni, Giorgio Gambosi, Rossella Petreschi
2000Algorithms for a Simple Point Placement Problem.
Joshua Redstone, Walter L. Ruzzo
2000An Efficient Algorithm for the Approximate Median Selection Problem.
Sebastiano Battiato, Domenico Cantone, Dario Catalano, Gianluca Cincotti, Micha Hofri
2000Approximating SVP
Irit Dinur
2000Computing a Diameter-Constrained Minimum Spanning Tree in Parallel.
Narsingh Deo, Ayman M. Abdalla
2000Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems.
Kathleen Steinhöfel, Andreas Alexander Albrecht, Chak-Kuen Wong
2000Duality in ATM Layout Problems.
Shmuel Zaks
2000Dynamically Maintaining the Widest k -Dense Corridor.
Subhas C. Nandy, Tomohiro Harayama, Tetsuo Asano
2000Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes.
Emanuele Covino, Giovanni Pani, Salvatore Caporaso
2000Faster Exact Solutions for MAX2SAT.
Jens Gramm, Rolf Niedermeier
2000Group Updates for Red-Black Trees.
Sabine Hanke, Eljas Soisalon-Soininen
2000Labeling Downtown.
Gabriele Neyer, Frank Wagner
2000Modified Binary Searching for Static Tables.
Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri
2000On Salesmen, Repairmen, Spiders, and Other Traveling Agents.
Giorgio Ausiello, Stefano Leonardi, Alberto Marchetti-Spaccamela
2000On the Lovász Number of Certain Circulant Graphs.
Valentin E. Brimkov, Bruno Codenotti, Valentino Crespi, Mauro Leoncini
2000Online Strategies for Backups.
Peter Damaschke
2000QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms.
Domenico Cantone, Gianluca Cincotti
2000Reconstruction of Discrete Sets from Three or More X-Rays.
Elena Barcucci, Sara Brunetti, Alberto Del Lungo, Maurice Nivat
2000Semantical Counting Circuits.
Fabrice Noilhan, Miklos Santha
2000Speeding Up Pattern Matching by Text Compression.
Yusuke Shibata, Takuya Kida, Shuichi Fukamachi, Masayuki Takeda, Ayumi Shinohara, Takeshi Shinohara, Setsuo Arikawa
2000The Hardness of Placing Street Names in a Manhattan Type Map.
Sebastian Seibert, Walter Unger
2000The Independence Number of Random Interval Graphs.
Wenceslas Fernandez de la Vega
2000The Online Dial-a-Ride Problem under Reasonable Load.
Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau
2000The Online-TSP against Fair Adversaries.
Michiel Blom, Sven Oliver Krumke, Willem de Paepe, Leen Stougie
2000Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem.
Hans-Joachim Böckenhauer, Juraj Hromkovic, Ralf Klasing, Sebastian Seibert, Walter Unger
2000Triangulations without Minimum-Weight Drawing.
Cao An Wang, Francis Y. L. Chin, Bo-Ting Yang