Change font size
Change page layout
Change menu position
Sapienza University of Rome    
CIAC 2007

Accepted Papers

  1. Faisal Abu-Khzam, Amer Mouawad, and Mathieu Liedloff. An Exact Algorithm for Connected Red-Blue Dominating Set.
  2. Reinhard Bauer, Tobias Columbus, Bastian Katz, Marcus Krug, and Dorothea Wagner. Preprocessing Speed-Up Techniques is Hard.
  3. Dorothea Baumeister, Felix Brandt, Felix Fischer, Jan Hoffmann, and Joerg Rothe. The Complexity of Computing Minimal Unidirectional Covering Sets.
  4. Peter Biro, Rob Irving, and David Manlove. Popular matchings in the Marriage and Roommates problems.
  5. Hans-Joachim Boeckenhauer, Karin Freiermuth, Juraj Hromkovic, Tobias Moemke, Andreas Sprock, and Björn Steffen. The Steiner Tree Reoptimization Problem with Sharpened Triangle Inequality.
  6. Hans-Joachim Boeckenhauer, Ralf Klasing, Tobias Moemke, and Monika Steinov√°. Improved Approximations for TSP with Simple Precedence Constraints.
  7. Janina Brenner and Guido Schaefer. Online Cooperative Cost Sharing.
  8. Leizhen Cai and Boting Yang. Parameterized Complexity of Even/Odd Subgraph Problems.
  9. Jérémie Chalopin, Shantanu Das, Yann Disser, Matus Mihalak, and Peter Widmayer. How simple robots benefit from looking back.
  10. Jeremie Chalopin and Daniel Paulusma. Packing Bipartite Graphs with Covers of Complete Bipartite Graphs.
  11. Ching-Lueh Chang and Yuh-Dauh Lyuu. Bounding the number of tolerable faults in majority-based systems.
  12. Panagiotis Cheilaris and Géza Tóth. Graph unique-maximum and conflict-free colorings.
  13. Jen-Hou Chou and Chi-Jen Lu. Communication Requirements for Stable Marriages.
  14. Marek Cygan, Lukasz Kowalik, and Borut Luzar. A Planar Linear Arboricity Conjecture.
  15. Marek Cygan, Marcin Pilipczuk, and Jakub Wojtaszczyk. Irredundant set faster than O(2n).
  16. Daniel Dressler and Martin Strehler. Capacitated Confluent Flows: Complexity and Algorithms.
  17. Bruno Escoffier, Laurent Gourves, and Jerome Monnot. Strategic Coloring of a Graph.
  18. Torben Hagerup and Gianni Franceschini. Finding the Maximum Suffix with Fewer Comparisons.
  19. Pinar Heggernes, Federico Mancini, Jesper Nederlof, and Yngve Villanger. A parameterized algorithm for Chordal Sandwich.
  20. Bart Jansen. Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights.
  21. V. S. Anil Kumar, Rahul Tripathi, and Elena Valkanova. On Strategy Improvement Algorithms for Simple Stochastic Games.
  22. Dieter Mitsche, Maria Saumell, and Rodrigo I. Silveira. On the Number of Higher Order Delaunay Triangulations.
  23. Burkhard Monien and Tobias Tscheuschner. On the power of nodes of degree four in the local max-cut problem.
  24. Martin Olsen. Maximizing PageRank with new Backlinks.
  25. Reinhard Pichler, Stefan Rümmele, and Stefan Woltran. Multicut Algorithms via Tree Decompositions.
  26. Daniel Raible, Henning Fernau, Alexander Langer, Ljiljana Brankovic, Joachim Kneis, Peter Rossmanith, Mathieu Liedloff, and Dieter Kratsch. A Parameterized Route to Exact Puzzles: Breaking the 2n-barrier for irredundancy.
  27. Dana Ron and Gilad Tsur. Testing computability by width-2 OBDDs where the variable order is unknown.
  28. Johan M. M. van Rooij. Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number.
  29. Hui Zhang, Qing Guo, and Costas S. Iliopoulos. An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences.
  30. Bingbing Zhuang and Hiroshi Nagamochi. Enumerating Rooted Graphs with Reflectional Block Structures.
XHTML 1.0 | CSS 2.1 | Design by Saverio Caminiti | Inspired by fusion