CIAC C

34 papers

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