Your search for Foundations of Computing

Basic Category Theory for Computer Scientists

Dualities in graphs and digraphs

Elements of Dynamic and 2-SAT Programming: Paths, Trees, and Cuts

Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments

Matching minors in bipartite graphs

Classic graph problems made temporal - a parameterized complexity analysis

Computational Aspects of Linear Logic

Fine-grained complexity analysis of some combinatorial data science problems

On the feasibility of multi-leader replication in the early tiers

Event structures with higher-order dynamics

Circuit Complexity and Neural Networks

On the Foundations of dynamic coalitions

Parity games, separations, and the modal µ-calculus

Exploiting structure in computationally hard voting problems

Be sparse! Be dense! Be robust!

Multivariate Complexity Analysis of Team Management Problems

Degree-Constrained Editing of Small-Degree Graphs

Algorithmic Aspects of Manipulation and Anonymization in Social Choice and Social Networks

Nowhere Dense Classes of Graphs

Complexity Issues in VLSI