Published: 30th September 2009|
|Preface Evangelos Markakis and Ioannis Milis|
|Complexity of Strong Implementability Clemens Thielen and Sven O. Krumke||1|
|An Exponential Lower Bound on OBDD Refutations for Pigeonhole Formulas Olga Tveretina, Carsten Sinz and Hans Zantema||13|
|Cartesian product of hypergraphs: properties and algorithms Alain Bretto, Yannick Silvestre and Thierry Vallée||22|
|Regular Matroids with Graphic Cocircuits Konstantinos Papalamprou and Leonidas Pitsoulis||29|
ACAC 2009 is organized by the Athens University of Economics and Business (AUEB) and it is the fourth in a series of meetings that aim to bring together researchers working on all areas of the theory of algorithms and computational complexity. These meetings are expected to serve as a lively forum for presenting results that are in a preliminary stage or have been recently presented in some major conference. For the first time this year all submitted papers were reviewed and ACAC also offered to the authors the choice of publishing their contribution (provided it has not been published anywhere else before) with the post-proceedings of EPTCS (Electronic Proceedings in Theoretical Computer Science).
During the first three years ACAC was supported by the General Secretariat of Research and Technology of Greece through the PENED 2003 program. This year we would like to acknowledge the support of the Athens University of Economics and Business, the Department of Informatics of AUEB as well as the publishing company Kleidarithmos.
We would also like to thank all contributors. Finally special thanks go to those who helped us with the organization of ACAC, such as the Network Operation Center, the administration services, the printing unit and the catering services of AUEB.