CIAC C

37 papers

YearTitle / Authors
2006A Near Optimal Scheduler for On-Demand Data Broadcasts.
Hing-Fung Ting
2006A New NC-Algorithm for Finding a Perfect Matching in
Raghav Kulkarni
2006Algorithms and Complexity, 6th Italian Conference, CIAC 2006, Rome, Italy, May 29-31, 2006, Proceedings
Tiziana Calamoneri, Irene Finocchi, Giuseppe F. Italiano
2006An Approximation Algorithm for a Bottleneck Traveling Salesman Problem.
Ming-Yang Kao, Manan Sanghi
2006Approximate Hierarchical Facility Location and Applications to the Shallow Steiner Tree and Range Assignment Problems.
Erez Kantor, David Peleg
2006Approximation Algorithms for Capacitated Rectangle Stabbing.
Guy Even, Dror Rawitz, Shimon Shahar
2006Beware of the Model: Reflections on Algorithmic Research.
Franco P. Preparata
2006Black Hole Search in Asynchronous Rings Using Tokens.
Stefan Dobrev, Rastislav Kralovic, Nicola Santoro, Wei Shi
2006Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms.
Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert
2006Counting All Solutions of Minimum Weight Exact Satisfiability.
Stefan Porschen
2006Covering a Set of Points with a Minimum Number of Lines.
Magdalene Grantson, Christos Levcopoulos
2006Deciding the FIFO Stability of Networks in Polynomial Time.
Maik Weinard
2006Distance Approximating Trees: Complexity and Algorithms.
Feodor F. Dragan, Chenyu Yan
2006Distributed Approximation Algorithms for Planar Graphs.
Andrzej Czygrinow, Michal Hanckowiak, Edyta Szymanska
2006Fair Cost-Sharing Methods for Scheduling Jobs on Parallel Machines.
Yvonne Bleischwitz, Burkhard Monien
2006Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments.
Michael Dom, Jiong Guo, Falk Hüffner, Rolf Niedermeier, Anke Truß
2006Fixed-Parameter Tractable Generalizations of Cluster Editing.
Peter Damaschke
2006Gathering Algorithms on Paths Under Interference Constraints.
Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu
2006Heterogenous Networks Can Be Unstable at Arbitrarily Low Injection Rates.
Dimitrios Koukopoulos, Stavros D. Nikolopoulos
2006How to Pack Directed Acyclic Graphs into Small Blocks.
Yuichi Asahiro, Tetsuya Furukawa, Keiichi Ikegami, Eiji Miyano
2006In-Place Randomized Slope Selection.
Henrik Blunck, Jan Vahrenhold
2006Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations.
Miroslav Chlebík, Janka Chlebíková
2006Locally 2-Dimensional Sperner Problems Complete for the Polynomial Parity Argument Classes.
Katalin Friedl, Gábor Ivanyos, Miklos Santha, Yves F. Verhoeven
2006Matching Subsequences in Trees.
Philip Bille, Inge Li Gørtz
2006Network Discovery and Verification with Distance Queries.
Thomas Erlebach, Alexander Hall, Michael Hoffmann, Matús Mihalák
2006On Broadcast Scheduling with Limited Energy.
Christian Gunia
2006On Search Problems in Complexity Theory and in Logic (Abstract).
Pavel Pudlák
2006On the Hardness of Range Assignment Problems.
Bernhard Fuchs
2006On the Minimum Common Integer Partition Problem.
Xin Chen, Lan Liu, Zheng Liu, Tao Jiang
2006On-Line Coloring of H-Free Bipartite Graphs.
Hajo Broersma, Agostino Capponi, Daniël Paulusma
2006Parameterized Algorithms for Hitting Set: The Weighted Case.
Henning Fernau
2006Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups.
Friedrich Eisenbrand, Edda Happ
2006Quadratic Programming and Combinatorial Minimum Weight Product Problems.
Walter Kern, Gerhard J. Woeginger
2006Reliable and Efficient Geometric Computing.
Kurt Mehlhorn
2006The Linear Arrangement Problem Parameterized Above Guaranteed Value.
Gregory Z. Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo
2006Tighter Approximation Bounds for LPT Scheduling in Two Special Cases.
Annamária Kovács
2006Universal Relations and #P-Completeness.
Hervé Fournier, Guillaume Malod