| 2026 | SOFSEM | A Quadratic Lower Bound for 2dfas Against One-Way Liveness. | Kehinde Adeogun, Christos A. Kapoutsis |
| 2019 | LATA | An Oracle Hierarchy for Small One-Way Finite Automata. | Malek Anabtawi, Sabit Hassan, Christos A. Kapoutsis, Mohammad Zakzok |
| 2019 | SOFSEM | Minicomplexity - Some Motivation, Some History, and Some Structure (Invited Talk Extended Abstract). | Christos A. Kapoutsis |
| 2014 | CiE | Predicate Characterizations in the Polynomial-Size Hierarchy. | Christos A. Kapoutsis |
| 2012 | CSR | Two-Way Automata Characterizations of L/poly versus NL. | Christos A. Kapoutsis, Giovanni Pighizzini |
| 2012 | DLT | Analogs of Fagin's Theorem for Small Nondeterministic Finite Automata. | Christos A. Kapoutsis, Nans Lefebvre |
| 2012 | MFCS | Reversal Hierarchies for Small 2DFAs. | Christos A. Kapoutsis, Giovanni Pighizzini |
| 2011 | CSR | Two-Way Automata versus Logarithmic Space. | Christos A. Kapoutsis |
| 2011 | ICALP | Nondeterminism Is Essential in Small 2FAs with Few Reversals. | Christos A. Kapoutsis |
| 2009 | DLT | Size Complexity of Two-Way Finite Automata. | Christos A. Kapoutsis |
| 2008 | DLT | On the Size Complexity of Rotating and Sweeping Automata. | Christos A. Kapoutsis, Richard Krlovic, Tobias Mmke |
| 2006 | ICALP | Small Sweeping 2NFAs Are Not Closed Under Complement. | Christos A. Kapoutsis |
| 2005 | MFCS | Removing Bidirectionality from Nondeterministic Finite Automata. | Christos A. Kapoutsis |
| 1998 | ICIP | Morphological Techniques in the Iterative Closest Point Algorithm. | Christos A. Kapoutsis, C. P. Vavoulidis, Ioannis Pitas |