The following pages link to Johann A. Makowsky (Q452475):
Displaying 46 items.
- (Q4364514) (← links)
- Finitary sketches (Q4372902) (← links)
- (Q4395562) (← links)
- Dependency preserving refinements and the fundamental problem of database design (Q4397077) (← links)
- Extensions for open default theories via the domain closure assumption (Q4399717) (← links)
- (Q4501155) (← links)
- (Q4502591) (← links)
- (Q4525286) (← links)
- Finiteness conditions for graph algebras over tropical semirings (Q4584114) (← links)
- On the exact learnability of graph parameters: The case of partition functions (Q4608626) (← links)
- Definability and Complexity of Graph Parameters (Invited Talk). (Q4649534) (← links)
- (Q4649562) (← links)
- On some conjectures connected with complete sentences (Q4770953) (← links)
- (Q4789198) (← links)
- Fifty years of the spectrum problem: survey and new results (Q4902770) (← links)
- Application of Logic to Integer Sequences: A Survey (Q4931587) (← links)
- (Q4992511) (← links)
- On the Tutte and Matching Polynomials for Complete Graphs (Q5038571) (← links)
- To Yuri at 80 and More than 40 Years of Friendship (Q5049035) (← links)
- Harary polynomials (Q5056203) (← links)
- Capturing complexity classes with Lindström quantifiers (Q5096870) (← links)
- (Q5181661) (← links)
- Extensions for open default theories via the domain closure assumption (Q5236446) (← links)
- ON THE CLIQUE–WIDTH OF GRAPH WITH FEW P<sub>4</sub>'S (Q5249008) (← links)
- Generalizing Parikh’s Theorem (Q5261299) (← links)
- A Most General Edge Elimination Polynomial (Q5302041) (← links)
- Evaluations of Graph Polynomials (Q5302054) (← links)
- On spectra of sentences of monadic second order logic with counting (Q5311744) (← links)
- On Weakly Distinguishing Graph Polynomials (Q5377223) (← links)
- Computer Science Logic (Q5394601) (← links)
- Linear Recurrence Relations for Graph Polynomials (Q5452182) (← links)
- (Q5685073) (← links)
- A Computational Framework for the Study of Partition Functions and Graph Polynomials (Q5737993) (← links)
- A Graph Polynomial Arising from Community Structure (Extended Abstract) (Q5851091) (← links)
- The exact complexity of the Tutte polynomial (Q5890003) (← links)
- Logical Approaches to Computational Barriers (Q5898831) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902525) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
- Logics capturing relativized complexity classes uniformly (Q6064295) (← links)
- Almost Unimodal and Real-Rooted Graph Polynomials (Q6359435) (← links)
- On the Tutte and matching polynomials for complete graphs (Q6385481) (← links)
- Counting Finite Topologies (Q6509263) (← links)
- Meta-theorems for Graph Polynomials (Q6533270) (← links)
- How I got to like graph polynomials (Q6593617) (← links)
- Axiomatizing origami planes (Q6612818) (← links)
- Extensions and limits of the Specker-Blatter theorem (Q6642890) (← links)
