1

Preface: 47th International Symposium on Mathematical Foundations of Computer Science, MFCS 2022, August 22-26, 2022, Vienna, Austria
PDF Cite
SAT-Based Local Search for Plane Subgraph Partitions (CG Challenge)
PDF Cite Project Project DOI
Testing Upward Planarity of Partial 2-Trees
PDF Cite Project DOI
The Complexity of Envy-Free Graph Cutting
PDF Cite Project Project DOI
The Complexity of k-Means Clustering when Little is Known
PDF Cite Project Project
The Complexity of Temporal Vertex Cover in Small-Degree Graphs
PDF Cite Project Project
Towards Uniform Certification in QBF
PDF Cite Project DOI
Tractable Abstract Argumentation via Backdoor-Treewidth
PDF Cite Project Project
Treelike Decompositions for Transductions of Sparse Graphs
PDF Cite
Turbocharging Heuristics for Weak Coloring Numbers
Cite Project Project DOI