March 04, 2000 article Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width Theory of Computing Systems DOI: 10.1007/s002249910009 OpenAlex Authors 0 Author list not loaded yet. Cited by 5 stored of 794 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Canonisation and Definability for Graphs of Bounded Rank Width 2022 ACM Transactions on Computational Logic article Computer Science Advanced Graph Theory Research Open access 7 citations Isomorphism, canonization, and definability for graphs of bounded rank width 2021 Communications of the ACM article Computer Science Advanced Graph Theory Research 6 citations Definable decompositions for graphs of bounded linear cliquewidth 2021 Logical Methods in Computer Science article Computer Science Advanced Graph Theory Research Open access 7 citations Approximate Evaluation of First-Order Counting Queries 2021 Society for Industrial and Applied Mathematics eBooks conference-paper Computer Science Advanced Graph Theory Research Open access 5 citations First-Order Model-Checking in Random Graphs and Complex Networks 2020 arXiv (Cornell University) preprint Computer Science Advanced Graph Theory Research Open access 1 citations 5 results References 0