Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Makowsky, Johann A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A graph polynomial arising from community structure
Ilia Averbouch
,
Johann A. Makowsky
,
Peter Tittmann
Lecture Notes in Computer Science
5911
, 2010, pp. 33-43
Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reuctions
Markus Bläser
,
Holger Dell
,
Johann A. Makowsky
Theory of Computing Systems
44
(4), 2009, pp. 690-706
A most general edge elimination polynomial
Ilia Averbouch
,
Benny Godlin
,
Johann A. Makowsky
Lecture Notes in Computer Science
5344
, 2008, pp. 31-42
Evaluations of graph polynomials
Benny Godlin
,
Tomer Kotek
,
Johann A. Makowsky
Lecture Notes in Computer Science
5344
, 2008, pp. 183-194
NCE graph grammars and clique-width
Alexander Glikson
,
Johann A. Makowsky
Lecture Notes in Computer Science
2880
, 2003, pp. 237-248
Gandy's principles for mechanisms as a model of parallel computation
Elias Dahlhaus
,
Johann A. Makowsky
Computerkultur
2
, 1995, pp. 283-288
Mental images and the architecture of concepts
Johann A. Makowsky
Computerkultur
2
, 1995, pp. 421-432