| Publication | Date of Publication | Type |
|---|
| Extensions and limits of the Specker-Blatter theorem | 2024-11-25 | Paper |
| Axiomatizing origami planes | 2024-10-01 | Paper |
| How I got to like graph polynomials | 2024-08-27 | Paper |
| Logics capturing relativized complexity classes uniformly | 2023-12-12 | Paper |
| How I got to like graph polynomials | 2023-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6136030 | 2023-08-28 | Paper |
| The exact complexity of the Tutte polynomial | 2023-04-28 | Paper |
| Harary polynomials | 2022-12-07 | Paper |
| Almost unimodal and real-rooted graph polynomials | 2022-12-01 | Paper |
| To Yuri at 80 and More than 40 Years of Friendship | 2022-11-09 | Paper |
| On the Tutte and Matching Polynomials for Complete Graphs | 2022-10-07 | Paper |
| Capturing complexity classes with Lindström quantifiers | 2022-08-18 | Paper |
| Extensions and Limits of the Specker-Blatter Theorem | 2022-06-24 | Paper |
| Some thoughts on computational models: from massive human computing to abstract state machines, and beyond | 2022-03-22 | Paper |
| On the Tutte and matching polynomials for complete graphs | 2021-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4992511 | 2021-06-09 | Paper |
| Almost Unimodal and Real-Rooted Graph Polynomials | 2021-01-30 | Paper |
| Axiomatizing Origami planes | 2020-12-06 | Paper |
| Weakly distinguishing graph polynomials on addable properties | 2020-11-10 | Paper |
| Extensions for open default theories via the domain closure assumption | 2019-10-08 | Paper |
| A logician's view of graph polynomials | 2019-09-18 | Paper |
| On Weakly Distinguishing Graph Polynomials | 2019-05-23 | Paper |
| Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries | 2019-05-16 | Paper |
| The undecidability of orthogonal and origami geometries | 2018-10-18 | Paper |
| Finiteness conditions for graph algebras over tropical semirings | 2018-08-29 | Paper |
| On the exact learnability of graph parameters: The case of partition functions | 2018-03-21 | Paper |
| Keeping logic in the trivium of computer science: a teaching perspective | 2018-02-14 | Paper |
| On the complexity of generalized chromatic polynomials | 2018-01-11 | Paper |
| On sequences of polynomials arising from graph invariants | 2017-10-10 | Paper |
| A Computational Framework for the Study of Partition Functions and Graph Polynomials | 2017-05-31 | Paper |
| Semantic Equivalence of Graph Polynomials Definable in Second Order Logic | 2016-09-09 | Paper |
| Hankel Matrices for Weighted Visibly Pushdown Automata | 2016-04-13 | Paper |
| Hankel Matrices: From Words to Graphs (Extended Abstract) | 2016-04-08 | Paper |
| Efficient Computation of Generalized Ising Polynomials on Graphs with Fixed Clique-Width | 2016-04-01 | Paper |
| Logics of Finite Hankel Rank | 2015-09-22 | Paper |
| Generalizing Parikh’s Theorem | 2015-07-03 | Paper |
| ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P4'S | 2015-04-29 | Paper |
| Connection matrices and the definability of graph parameters | 2014-11-13 | Paper |
| On the location of roots of graph polynomials | 2014-09-02 | Paper |
| Recurrence relations for graph polynomials on bi-iterative families of graphs | 2014-09-02 | Paper |
| A representation theorem for (\(q\)-)holonomic sequences | 2013-12-13 | Paper |
| The universal edge elimination polynomial and the dichromatic polynomial | 2013-11-01 | Paper |
| Fifty years of the spectrum problem: survey and new results | 2013-01-17 | Paper |
| Definability and Complexity of Graph Parameters (Invited Talk). | 2012-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4649562 | 2012-11-22 | Paper |
| Remembering Ernst Specker (1920--2011) | 2012-09-21 | Paper |
| Model theory in computer science: my own recurrent themes | 2012-09-18 | Paper |
| A representation theorem for holonomic sequences based on counting lattice paths | 2012-07-11 | Paper |
| Graph polynomials: from recursive definitions to subset expansion formulas | 2012-05-07 | Paper |
| BCNF via Attribute Splitting | 2012-03-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3118380 | 2012-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3118385 | 2012-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3007253 | 2011-06-21 | Paper |
| The Specker-Blatter Theorem Revisited | 2011-03-18 | Paper |
| Application of Logic to Integer Sequences: A Survey | 2010-09-29 | Paper |
| The Ackermann Award 2010 | 2010-09-03 | Paper |
| Definability of Combinatorial Functions and Their Linear Recurrence Relations | 2010-09-03 | Paper |
| Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions | 2010-08-13 | Paper |
| Incremental model checking for decomposable structures | 2010-06-17 | Paper |
| A Graph Polynomial Arising from Community Structure (Extended Abstract) | 2010-01-21 | Paper |
| Graph-Theoretic Concepts in Computer Science | 2010-01-12 | Paper |
| An extension of the bivariate chromatic polynomial | 2009-12-01 | Paper |
| The Ackermann Award 2009 | 2009-11-12 | Paper |
| From Hilbert's program to a logic tool box | 2009-07-06 | Paper |
| Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning | 2009-06-17 | Paper |
| From a zoo to a zoology: Towards a general theory of graph polynomials | 2009-05-08 | Paper |
| The Ackermann Award 2007 | 2009-03-05 | Paper |
| Connection Matrices for MSOL-Definable Structural Invariants | 2009-02-12 | Paper |
| Evaluations of Graph Polynomials | 2009-01-20 | Paper |
| A Most General Edge Elimination Polynomial | 2009-01-20 | Paper |
| On Counting Generalized Colorings | 2008-11-20 | Paper |
| Computing Graph Polynomials on Graphs of Bounded Clique-Width | 2008-09-04 | Paper |
| Encounters with A. Mostowski | 2008-07-01 | Paper |
| Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants | 2008-06-19 | Paper |
| Complexity of the Bollobás-Riordan Polynomial | 2008-06-05 | Paper |
| Linear Recurrence Relations for Graph Polynomials | 2008-03-25 | Paper |
| Counting truth assignments of formulas of bounded tree-width or clique-width | 2008-02-26 | Paper |
| Logical Approaches to Computational Barriers | 2007-04-30 | Paper |
| Computer Science Logic | 2006-11-01 | Paper |
| On spectra of sentences of monadic second order logic with counting | 2005-08-29 | Paper |
| Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width | 2005-02-22 | Paper |
| The parametrized complexity of knot polynomials | 2004-08-19 | Paper |
| Algorithmic uses of the Feferman-Vaught theorem | 2004-08-06 | Paper |
| On the algebraic complexity of some families of coloured Tutte polynomials | 2004-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4789198 | 2003-09-11 | Paper |
| Tree-width and the monadic quantifier hierarchy. | 2003-08-17 | Paper |
| Farrell polynomials on graphs of bounded tree width | 2003-07-29 | Paper |
| Linear time solvable optimization problems on graphs of bounded clique-width | 2003-03-18 | Paper |
| Fusion in relational structures and the verification of monadic second-order properties | 2002-10-16 | Paper |
| Colored Tutte polynomials and Kauffman brackets for graphs of bounded tree width | 2002-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2757822 | 2001-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753688 | 2001-12-03 | Paper |
| On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic | 2001-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502591 | 2001-11-09 | Paper |
| Capturing relativized complexity classes with Lindström quantifiers | 2001-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525286 | 2001-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501155 | 2000-09-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263795 | 2000-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232773 | 1999-12-13 | Paper |
| Extensions for open default theories via the domain closure assumption | 1998-11-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4395562 | 1998-08-04 | Paper |
| Dependency preserving refinements and the fundamental problem of database design | 1998-06-30 | Paper |
| Finitary sketches | 1998-04-05 | Paper |
| Restrictions of minimum spanner problems | 1997-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364514 | 1997-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4325781 | 1997-01-13 | Paper |
| Arity and alternation in second-order logic | 1996-10-30 | Paper |
| On Average Case Complexity of SAT for Symmetric Distribution | 1996-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4202929 | 1993-09-06 | Paper |
| Query languages for hierarchic databases | 1993-01-17 | Paper |
| The expressive power of side effects in prolog | 1992-08-13 | Paper |
| Weak second order characterizations of various program verification systems | 1989-01-01 | Paper |
| On the existence of polynomial time algorithms for interpolation problems in propositional logic | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832048 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3811697 | 1988-01-01 | Paper |
| Unification as a complexity measure for logic programming | 1987-01-01 | Paper |
| Why Horn formulas matter in computer science: initial structures and generic examples | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3786049 | 1986-01-01 | Paper |
| On the expressive power of data dependencies | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3713561 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3741099 | 1986-01-01 | Paper |
| Propositional dynamic logic with local assignments | 1985-01-01 | Paper |
| Vopěnka's principle and compact logics | 1985-01-01 | Paper |
| A proof rule for fair termination of guarded commands | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3677149 | 1985-01-01 | Paper |
| Characterizing specification languages which admit initial semantics | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3216138 | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3673087 | 1983-01-01 | Paper |
| Positive results in abstract model theory: a theory of compact logics | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3956380 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3917486 | 1981-01-01 | Paper |
| The theorems of beth and Craig in abstract model theory II. Compact logics | 1981-01-01 | Paper |
| Topological model theory with an interior operator: Consistency properties and back — and forth arguments | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3662644 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3917485 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4186303 | 1979-01-01 | Paper |
| Theorems of Beth and Craig in Abstract Model Theory. I The Abstract Settin | 1979-01-01 | Paper |
| Some observations on Uniform Reduction for properties invariant on the range of definable relations | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3922656 | 1978-01-01 | Paper |
| Problemi di decidibilita in logica topologica | 1978-01-01 | Paper |
| Some model theory for monotone quantifiers | 1977-01-01 | Paper |
| Completeness Theorems For Modal Model Theory With the Montague‐Chang Semantics I | 1977-01-01 | Paper |
| δ-Logics and generalized quantifiers | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4068696 | 1975-01-01 | Paper |
| On some conjectures connected with complete sentences | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5181661 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5685073 | 1972-01-01 | Paper |
| Counting Finite Topologies | N/A | Paper |
| Meta-theorems for Graph Polynomials | N/A | Paper |
