Foundations of Computing

Showing 1–16 of 17 results

Dualities in graphs and digraphs

zzgl. Versandkosten

Matching minors in bipartite graphs

zzgl. Versandkosten

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

zzgl. Versandkosten

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

zzgl. Versandkosten

Classic graph problems made temporal – a parameterized complexity analysis

zzgl. Versandkosten

Event structures with higher-order dynamics

zzgl. Versandkosten

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

zzgl. Versandkosten

Fine-grained complexity analysis of some combinatorial data science problems

zzgl. Versandkosten

Be sparse! Be dense! Be robust!

zzgl. Versandkosten

Parity games, separations, and the modal μ-calculus

zzgl. Versandkosten

Exploiting structure in computationally hard voting problems

zzgl. Versandkosten

On the Foundations of dynamic coalitions

zzgl. Versandkosten

Nowhere Dense Classes of Graphs

zzgl. Versandkosten

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

zzgl. Versandkosten

Multivariate Complexity Analysis of Team Management Problems

zzgl. Versandkosten

Degree-Constrained Editing of Small-Degree Graphs

zzgl. Versandkosten