The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Kurt Mehlhorn
    Reliable and Efficient Geometric Computing. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:1-2 [Conf]
  2. Franco P. Preparata
    Beware of the Model: Reflections on Algorithmic Research. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:3-4 [Conf]
  3. Pavel Pudlák
    On Search Problems in Complexity Theory and in Logic (Abstract). [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:5- [Conf]
  4. Magdalene Grantson, Christos Levcopoulos
    Covering a Set of Points with a Minimum Number of Lines. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:6-17 [Conf]
  5. Guy Even, Dror Rawitz, Shimon Shahar
    Approximation Algorithms for Capacitated Rectangle Stabbing. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:18-29 [Conf]
  6. Henrik Blunck, Jan Vahrenhold
    In-Place Randomized Slope Selection. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:30-41 [Conf]
  7. Walter Kern, Gerhard J. Woeginger
    Quadratic Programming and Combinatorial Minimum Weight Product Problems. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:42-49 [Conf]
  8. Stefan Porschen
    Counting All Solutions of Minimum Weight Exact Satisfiability. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:50-59 [Conf]
  9. Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
    Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:60-68 [Conf]
  10. Thomas Erlebach, Alexander Hall, Michael Hoffmann 0002, Matús Mihalák
    Network Discovery and Verification with Distance Queries. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:69-80 [Conf]
  11. Maik Weinard
    Deciding the FIFO Stability of Networks in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:81-92 [Conf]
  12. Dimitrios Koukopoulos, Stavros D. Nikolopoulos
    Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:93-104 [Conf]
  13. Friedrich Eisenbrand, Edda Happ
    Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:105-114 [Conf]
  14. Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu
    Gathering Algorithms on Paths Under Interference Constraints. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:115-126 [Conf]
  15. Bernhard Fuchs
    On the Hardness of Range Assignment Problems. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:127-138 [Conf]
  16. Stefan Dobrev, Rastislav Kralovic, Nicola Santoro, Wei Shi
    Black Hole Search in Asynchronous Rings Using Tokens. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:139-150 [Conf]
  17. Christian Gunia
    On Broadcast Scheduling with Limited Energy. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:151-162 [Conf]
  18. Hing-Fung Ting
    A Near Optimal Scheduler for On-Demand Data Broadcasts. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:163-174 [Conf]
  19. Yvonne Bleischwitz, Burkhard Monien
    Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:175-186 [Conf]
  20. Annamária Kovács
    Tighter Approximation Bounds for LPT Scheduling in Two Special Cases. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:187-198 [Conf]
  21. Miroslav Chlebík, Janka Chlebíková
    Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:199-210 [Conf]
  22. Erez Kantor, David Peleg
    Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:211-222 [Conf]
  23. Ming-Yang Kao, Manan Sanghi
    An Approximation Algorithm for a Bottleneck Traveling Salesman Problem. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:223-235 [Conf]
  24. Xin Chen, Lan Liu, Zheng Liu, Tao Jiang
    On the Minimum Common Integer Partition Problem. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:236-247 [Conf]
  25. Philip Bille, Inge Li Gørtz
    Matching Subsequences in Trees. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:248-259 [Conf]
  26. Feodor F. Dragan, Chenyu Yan
    Distance Approximating Trees: Complexity and Algorithms. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:260-271 [Conf]
  27. Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano
    How to Pack Directed Acyclic Graphs into Small Blocks. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:272-283 [Conf]
  28. Hajo Broersma, Agostino Capponi, Daniël Paulusma
    On-Line Coloring of H-Free Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:284-295 [Conf]
  29. Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
    Distributed Approximation Algorithms for Planar Graphs. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:296-307 [Conf]
  30. Raghav Kulkarni
    A New NC-Algorithm for Finding a Perfect Matching in d-Regular Bipartite Graphs When d Is Small. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:308-319 [Conf]
  31. Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß
    Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:320-331 [Conf]
  32. Henning Fernau
    Parameterized Algorithms for Hitting Set: The Weighted Case. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:332-343 [Conf]
  33. Peter Damaschke
    Fixed-Parameter Tractable Generalizations of Cluster Editing. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:344-355 [Conf]
  34. Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
    The Linear Arrangement Problem Parameterized Above Guaranteed Value. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:356-367 [Conf]
  35. Hervé Fournier, Guillaume Malod
    Universal Relations and #P-Completeness. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:368-379 [Conf]
  36. Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
    Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes. [Citation Graph (0, 0)][DBLP]
    CIAC, 2006, pp:380-391 [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