Proceedings Fourth Athens Colloquium on Algorithms and Complexity

Evangelos Markakis; Ioannis Milis

doi:10.4204/eptcs.4

Home/Archive/arXiv

arXiv · 0909.5479

Proceedings Fourth Athens Colloquium on Algorithms and Complexity

Evangelos Markakis·Ioannis Milis

View original source ↗Read source document ↗Export metadata ↓

Abstract

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).

Explore related subjects

cs.CC

Keep this discovery

BibTeX RIS

Evangelos Markakis, Ioannis Milis. 2009-09-30. Proceedings Fourth Athens Colloquium on Algorithms and Complexity. https://doi.org/10.4204/eptcs.4

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗

arXiv2026

Max Independent Set Remains NP-hard when Excluding a Planar Induced Minor

We show that there is a fixed planar graph $H$, namely the $5 \times 5$ grid, such that Max Independent Set remains NP-hard in $H$-induced-minor-free graphs. This refutes the Dallard--Milani\v{c}--\v{S}torgel conjecture and a weakening of it by Gartland and Lokshtanov, and by Korhonen.

cs.CC↗

arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗