Title: Simultaneous MatchingsAbstract: Given a bipartite graph $G=(X \\dotcup D, E\\subseteq X\\times D)$, an $X$-perfect matching is a matching in $G$ that covers every node in $X$. In this talk we study the following generalisation of the $X$-perfect matching problem, which has applications in constraint programming: Given a bipartite…

Kasper Dupont defence his PhD thesisDisk Encryption, Group Identificaton, Byzantine Agreement, and Threshold RSA.

Agenda:WelcomeIntroduction to BRICS2Library ToolsOpen discussionDrinks & Snacks

Dairusz Biernacki defends his PhD thesisTheTheory and Practice of Programming Languages with Delimited Continuations.

BRICS [Pi-Lambda] Seminar: "Typed Delimited Continuations and its Connection to Modal Logic" - Yukiyoshi Kameyama [ University of Tsukuba, Japan ]--See [Pi-Lambda] homepage for more info: [ http://www.brics.dk/pilambda/ ]

Henning Korsholm Rohde defends his PhD thesisFormal Aspects of Partial Evaluation

Abstract:A total dominating set $S$ in a graph $G=(V(G),E(G))$ is a setof vertices such that every vertex in $G$ is adjacent to a vertexin $S$. In other words $\\forall x \\in V(G)$ $\\exists s \\in S$: $xs \\in E(G)$.The minimum size of a total dominating set, $\\gamma_t(G)$, in agraph, $G$, is well studied. We will talk about the following…