Courcelle's theorem for Lipschitz continuity

DOI10.4230/LIPICS.ESA.2025.11MaRDI QIDQ7322397zbMATH OpenFDO

Authors Tatsuya Gima, Soh Kumabe, Yuichi Yoshida

Publication date 31 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2025.11

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Algorithmic meta-theorems
• Approximation algorithms for NP-complete problems on planar graphs
• Average sensitivity of dynamic programming
• Average Sensitivity of Graph Algorithms
• Average sensitivity of the knapsack problem
• Complexity classifications of Boolean constraint satisfaction problems
• Differential Privacy
• Elements of finite model theory.
• Graph structure and monadic second-order logic. A language-theoretic approach
• Lipschitz continuous algorithms for covering problems
• Lipschitz continuous algorithms for graph problems
• Lipschitz continuous allocations for optimization games
• Lower bounds on dynamic programming for maximum weight independent set
• Monadic second-order evaluations on tree-decomposable graphs
• Parallel Algorithms with Optimal Speedup for Bounded Treewidth
• Sensitivity analysis of the maximum matching problem
• The approximability of constraint satisfaction problems
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

This page was built for publication: Courcelle's theorem for Lipschitz continuity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322397)