7. CIAC 2010: Rome, Italy

• Ricardo A. Baeza-Yates:
  Towards a Distributed Search Engine. 1-5
  
• Paul Dütting, Monika Henzinger:
  Mechanisms for the Marriage and the Assignment Game. 6-12
  
• Giuseppe F. Italiano:
  Resilient Algorithms and Data Structures. 13-24
  
• Faisal N. Abu-Khzam, Amer E. Mouawad, Mathieu Liedloff:
  An Exact Algorithm for Connected Red-Blue Dominating Set. 25-36
  
• Martin Olsen:
  Maximizing PageRank with New Backlinks. 37-48
  
• Bingbing Zhuang, Hiroshi Nagamochi:
  Enumerating Rooted Graphs with Reflectional Block Structures. 49-60
  
• Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Monika Steinová:
  Improved Approximations for TSP with Simple Precedence Constraints. 61-72
  
• Johan M. M. van Rooij:
  Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number. 73-84
  
• Leizhen Cai, Boting Yang:
  Parameterized Complexity of Even/Odd Subgraph Problems. 85-96
  
• Péter Biró, Robert W. Irving, David Manlove:
  Popular Matchings in the Marriage and Roommates Problems. 97-108
  
• Ching-Lueh Chang, Yuh-Dauh Lyuu:
  Bounding the Number of Tolerable Faults in Majority-Based Systems. 109-119
  
• Pinar Heggernes, Federico Mancini, Jesper Nederlof, Yngve Villanger:
  A Parameterized Algorithm for Chordal Sandwich. 120-130
  
• Dana Ron, Gilad Tsur:
  Testing Computability by Width-2 OBDDs Where the Variable Order is Unknown. 131-142
  
• Panagiotis Cheilaris, Géza Tóth:
  Graph Unique-Maximum and Conflict-Free Colorings. 143-154
  
• Bruno Escoffier, Laurent Gourvès, Jérôme Monnot:
  Strategic Coloring of a Graph. 155-166
  
• Reinhard Pichler, Stefan Rümmele, Stefan Woltran:
  Multicut Algorithms via Tree Decompositions. 167-179
  
• Hans-Joachim Böckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Mömke, Andreas Sprock, Björn Steffen:
  The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality. 180-191
  
• Bart M. P. Jansen:
  Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights. 192-203
  
• Marek Cygan, Lukasz Kowalik, Borut Luzar:
  A Planar Linear Arboricity Conjecture. 204-216
  
• Dieter Mitsche, Maria Saumell, Rodrigo I. Silveira:
  On the Number of Higher Order Delaunay Triangulations. 217-228
  
• Jérémie Chalopin, Shantanu Das, Yann Disser, Matús Mihalák, Peter Widmayer:
  How Simple Robots Benefit from Looking Back. 229-239
  
• Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar:
  On Strategy Improvement Algorithms for Simple Stochastic Games. 240-251
  
• Janina A. Brenner, Guido Schäfer:
  Online Cooperative Cost Sharing. 252-263
  
• Burkhard Monien, Tobias Tscheuschner:
  On the Power of Nodes of Degree Four in the Local Max-Cut Problem. 264-275
  
• Jérémie Chalopin, Daniël Paulusma:
  Packing Bipartite Graphs with Covers of Complete Bipartite Graphs. 276-287
  
• Marek Cygan, Marcin Pilipczuk, Jakub Onufry Wojtaszczyk:
  Irredundant Set Faster Than O(2ⁿ). 288-298
  
• Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe:
  The Complexity of Computing Minimal Unidirectional Covering Sets. 299-310
  
• Daniel Binkele-Raible, Ljiljana Brankovic, Henning Fernau, Joachim Kneis, Dieter Kratsch, Alexander Langer, Mathieu Liedloff, Peter Rossmanith:
  A Parameterized Route to Exact Puzzles: Breaking the 2ⁿ-Barrier for Irredundance. 311-322
  
• Gianni Franceschini, Torben Hagerup:
  Finding the Maximum Suffix with Fewer Comparisons. 323-334
  
• Hui Zhang, Qing Guo, Costas S. Iliopoulos:
  An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences. 335-346
  
• Daniel Dressler, Martin Strehler:
  Capacitated Confluent Flows: Complexity and Algorithms. 347-358
  
• Reinhard Bauer, Tobias Columbus, Bastian Katz, Marcus Krug, Dorothea Wagner:
  Preprocessing Speed-Up Techniques Is Hard. 359-370
  
• Jen-Hou Chou, Chi-Jen Lu:
  Communication Requirements for Stable Marriages. 371-382
  

Last update Thu May 24 02:41:48 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page