| 2024 | CSL | Extensions and Limits of the Specker-Blatter Theorem. | Eldar Fischer, Johann A. Makowsky |
| 2018 | WoLLIC | The Undecidability of Orthogonal and Origami Geometries. | Johann A. Makowsky |
| 2016 | LATA | Hankel Matrices for Weighted Visibly Pushdown Automata. | Nadia Labai, Johann A. Makowsky |
| 2016 | MFCS | On the Exact Learnability of Graph Parameters: The Case of Partition Functions. | Nadia Labai, Johann A. Makowsky |
| 2016 | WoLLIC | Semantic Equivalence of Graph Polynomials Definable in Second Order Logic. | Johann A. Makowsky, Elena V. Ravve |
| 2015 | LATA | Hankel Matrices: From Words to Graphs (Extended Abstract). | Johann A. Makowsky, Nadia Labai |
| 2012 | CSL | Connection Matrices and the Definability of Graph Parameters. | Tomer Kotek, Johann A. Makowsky |
| 2012 | CSL | Definability and Complexity of Graph Parameters (Invited Talk). | Johann A. Makowsky |
| 2012 | SYNASC | A Computational Framework for the Study of Partition Functions and Graph Polynomials. | Tomer Kotek, Johann A. Makowsky, Elena V. Ravve |
| 2011 | CSL | Model Theory in Computer Science: My Own Recurrent Themes. | Johann A. Makowsky |
| 2010 | CSL | The Ackermann Award 2010. | Johann A. Makowsky, Damian Niwinski |
| 2010 | WoLLIC | Application of Logic to Integer Sequences: A Survey. | Johann A. Makowsky |
| 2009 | CSL | The Ackermann Award 2009. | Johann A. Makowsky, Alexander A. Razborov |
| 2009 | WG | A Graph Polynomial Arising from Community Structure (Extended Abstract). | Ilya Averbouch, Johann A. Makowsky, Peter Tittmann |
| 2008 | CiE | Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants. | Johann A. Makowsky |
| 2008 | CSL | On Counting Generalized Colorings. | Tomer Kotek, Johann A. Makowsky, Boris Zilber |
| 2008 | CSL | The Ackermann Award 2008. | Johann A. Makowsky, Damian Niwinski |
| 2008 | CSR | Complexity of the Bollobs-Riordan Polynomial. | Markus Blser, Holger Dell, Johann A. Makowsky |
| 2008 | ISAIM | From Hilbert's Program to a Logic Toolbox. | Johann A. Makowsky |
| 2008 | WG | A Most General Edge Elimination Polynomial. | Ilya Averbouch, Benny Godlin, Johann A. Makowsky |
| 2008 | WG | Evaluations of Graph Polynomials. | Benny Godlin, Tomer Kotek, Johann A. Makowsky |
| 2007 | CSL | The Ackermann Award 2007. | Martin Grohe, Martin Hyland, Johann A. Makowsky, Damian Niwinski |
| 2007 | LPAR | From Hilbert's Program to a Logic Toolbox. | Johann A. Makowsky |
| 2006 | CiE | From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials. | Johann A. Makowsky |
| 2006 | CSL | The Ackermann Award 2006. | Samson Abramsky, Erich Grdel, Johann A. Makowsky |
| 2006 | WG | Computing Graph Polynomials on Graphs of Bounded Clique-Width. | Johann A. Makowsky, Udi Rotics, Ilya Averbouch, Benny Godlin |
| 2005 | CSL | Clemens Lautemann: 1951-2005 | Johann A. Makowsky |
| 2003 | COCOON | The Specker-Blatter Theorem Revisited. | Eldar Fischer, Johann A. Makowsky |
| 2003 | WG | NCE Graph Grammars and Clique-Width. | Alexander Glikson, Johann A. Makowsky |
| 2001 | SODA | Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width. | Johann A. Makowsky |
| 2000 | CSL | On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale. | Johann A. Makowsky, Klaus Meer |
| 1998 | CSL | Invariant Definability and P/ | Johann A. Makowsky |
| 1998 | WG | Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. | Bruno Courcelle, Johann A. Makowsky, Udi Rotics |
| 1997 | SOFSEM | The Fundamental Problem of Database Design. | Johann A. Makowsky, Elena V. Ravve |
| 1996 | ER | Translation Schemes and the Fundamental Problem of Database Design. | Johann A. Makowsky, Elena V. Ravve |
| 1996 | JELIA | Extensions for Open Default Theories via the Domain Closure Assumption. | Michael Kaminski, Johann A. Makowsky, Michael L. Tiomkin |
| 1995 | MFCS | Incremental Model Checking for Decomposable Structures (Extended Abstract). | Johann A. Makowsky, Elena V. Ravve |
| 1994 | LFCS | Arity vs. Alternation in Second Order Logic. | Johann A. Makowsky, Y. B. Pnueli |
| 1994 | MFCS | Capturing Complexity Classes with Lindstrm Quantifiers. | Johann A. Makowsky |
| 1993 | CSL | Oracles and Quantifiers. | Johann A. Makowsky, Y. B. Pnueli |
| 1992 | LFCS | The Ehrenfeucht-Fraisse Games for Transitive Closure. | A. Cal, Johann A. Makowsky |
| 1991 | CSL | The Expressive Power of Transitive Closue and 2-way Multihead Automata. | Yaniv Bargury, Johann A. Makowsky |
| 1988 | ICDE | Incremental Restructuring of Relational Schemas. | Victor M. Markowitz, Johann A. Makowsky |
| 1987 | VLDB | Incremental Reorganization of Relational Databases. | Victor M. Markowitz, Johann A. Makowsky |
| 1986 | ESOP | The Choice of Programming Primitives for SETL-Like Programming Languages. | Elias Dahlhaus, Johann A. Makowsky |
| 1986 | ICDT | Entity-Relationship Consistency for Relational Schemas. | Johann A. Makowsky, Victor M. Markowitz, Nimrod Rotics |
| 1986 | LICS | On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems | Johann A. Makowsky, Ildik Sain |
| 1981 | ICALP | Characterizing Data Base Dependencies. | Johann A. Makowsky |
| 1981 | ICALP | Errata: Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory. | Johann A. Makowsky |
| 1981 | STOC | Embedded Implicational Dependencies and their Inference Problem | Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky |
| 1980 | ICALP | Measuring the Expressive Power of Dynamic Logics: An Application of Abstract Model Theory. | Johann A. Makowsky |
| 1980 | XP | Embedded Implicational Dependencies and their Inference Problem. | Ashok K. Chandra, Harry R. Lewis, Johann A. Makowsky |