( en | de | ru )

 

Disambiguation of "Makowsky, Johann A."

Author of the publication

copydeleteadd this publication to your clipboard
A Computational Framework for the Study of Partition Functions and Graph Polynomials.

, , and . SYNASC, page 365-368. IEEE Computer Society, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Johannes Makowsky

Katja Makowsky

Herbert Makowsky

Ludwig Makowsky

Lutz Makowsky

 

Other publications of authors with the same name

On the Equivalence of Weak Second Order and Nonstandard Time Semantics For Various Program Verification Systems, and . LICS, page 293-300. IEEE Computer Society, (1986)Incremental Reorganization of Relational Databases., and . VLDB, page 127-135. Morgan Kaufmann, (1987)Graph Polynomials: Towards a Comparative Theory (Dagstuhl Seminar 16241)., , , and . Dagstuhl Reports, 6 (6): 26-48 (2016)Graph Polynomials: From Recursive Definitions To Subset Expansion Formulas, , and . CoRR, (2008)Translation Schemes and the Fundamental Problem of Database Design., and . ER, volume 1157 of Lecture Notes in Computer Science, page 5-26. Springer, (1996)Can one design a geometry engine? - On the (un)decidability of certain affine Euclidean geometries.. Ann. Math. Artif. Intell., 85 (2-4): 259-291 (2019)To Yuri at 80 and More than 40 Years of Friendship.. Fields of Logic and Computation III, volume 12180 of Lecture Notes in Computer Science, page 3-6. Springer, (2020)Arity vs. Alternation in Second Order Logic., and . LFCS, volume 813 of Lecture Notes in Computer Science, page 240-252. Springer, (1994)Foreword., , and . Fundam. Informaticae, (2012)Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width., , and . WG, volume 1517 of Lecture Notes in Computer Science, page 1-16. Springer, (1998)