Computer Science – Theory and Applications

Optimization-friendly generic mechanisms without money.- Expanders in Higher Dimensions.- Private frequency estimation via projective geometry.- Parameterized Algorithms for Finding Highly Connected Solution.- Coloring a Dominating Set without Conflicts: q-Subset Square Coloring.- Quotient structures and groups computable in polynomial time.- Parameterized Complexity of List Coloring and Max Coloring.- Eternal Vertex Cover on Bipartite and Co-Bipartite Graphs.- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time.- Kernelization of Same-Size Clustering.- Output Sensitive Fault Tolerant Maximum Matching.- Bounds for Synchronizing Markov Decision Processes.- Parameterized Complexity of Set-Restricted Disjoint Paths on Chordal Graphs.- Discrete versions of the KKM lemma and their PPAD-completeness.- The Fast Algorithm for Online k-server Problem on Trees.- Finite Ambiguity and Finite Sequentiality in Weighted Automata over Fields.- Bounds for the Flock-of-Birds Problem.- Heterogeneous Multi-Commodity Network Flows Over Time.- On the determinization of event-clock input-driven pushdown automata.- optimization.- graph theory.- algorithms.- parameterized complexity.- group theory.- complexity theory.- grammars and context-free languages.- computational geometry.- quantum computation theory.