Wang Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 3 66123 Saarbrücken Location E1 3 - 4.23 Phone +49 681 9325 0 Fax +49 681 9325 5719 E-mail yanwang@mpi-inf.mpg.de Research [...] Research Interests Randomised algorithms Combinatorial optimisation Education November 2023 - present Ph. D. student in Computer Science at the Universität des Saarlandes, Saarbrücken , Germany; guest at the
conversations, which tell in which contexts information is likely complete, and in which not [17]. 3. Cardinalities from KBs and text as ground truth (40 min): We highlight the challenges in obtaining [...] 14], or by comparison with other comparable entities inside the KB [2]. Slides Part 1+5 Part 2 Part 3 Part 4 Presenters Simon Razniewski (primary contact) - Max Planck Institute for Informatics, simonrazniewski [...] Hiba Arnaout - Max Planck Institute for Informatics, https://hibaarnaout.com/ . Hiba Arnaout is a PhD student at the Max Planck Insitute for Informatics, in Saarbruecken, Germany. Her primary academic interests
testing a graph for 3-connectivity and for 3-edge-connectivity. These problems are important for various applications in the areas of graph drawing and graph embeddings and for validating 3D-polytopes. Although [...] linear-time certifying algorithm for 3-edge-connectivity as well. A current research problem is to find a direct certificate for 3-edge-connectivity, as the algorithm for 3-(vertex-)connectivity is fairly complex [...] describe an easy-to-verify certificate. A natural certificate to prove 3-connectivity is a so-called construction sequence. For a 3-connected graph G, a construction sequence is a sequence of certain operations
Allocation in Cloud Networking : %G eng %U http://hdl.handle.net/21.11116/0000-000D-5762-3 %R 0.1109/OGC55558.2022.10050986 %D 2022 %B The 7th Optoelectronics Global Conference %Z date of event: 2022-12-06 [...] Optical Data Center Networks : %G eng %U http://hdl.handle.net/21.11116/0000-0010-43D5-2 %U https://arxiv.org/abs/2410.17012 %D 2024 %X Optical data center networks (DCNs) are renovating the infrastructure [...] 3542647 %D 2023 %B 6th Asia-Pacific Workshop on Networking %Z date of event: 2022-07-01 - 2022-07-02 %C Fuzhou, China %B 6th Asia-Pacific Workshop on Networking %P 63 - 69 %I ACM %@ 978-1-4503-9748-3 %U h
eleventh (last) meeting (on 15th July): https://cs-uni-saarland-de.zoom.us/j/92719699931?pwd=WlMyaGg3eCsxRG1QeDMrN3hXTkZCZz09 Schedule Date Speaker Topic Reference May 6 Bhaskar Introduction to the Reading Group [...] Golnoosh A Strongly Polynomial Algorithm for Linear Exchange Markets [May27] June 3 Laszlo Kozma Many Visits TSP [Jun3] June 10 Pascal On the Price of Anarchy for Flows over Time [Jun10] June 17 Lukas [...] Reading Group Algorithms Reading Group Algorithms Seminar Postponed by 4 weeks! Please note that on 11.3., the entire Saarland university has postponed the start of the semester by 4 weeks . This also affects
software that enables machines to decide for themselves on the shape of their products. Sophisticated 3-D design, for example, is intended to optimize the effect of individually designed tablets on each patient
testing a graph for 3-connectivity and for 3-edge-connectivity. These problems are important for various applications in the areas of graph drawing and graph embeddings and for validating 3D-polytopes. Although [...] linear-time certifying algorithm for 3-edge-connectivity as well. A current research problem is to find a direct certificate for 3-edge-connectivity, as the algorithm for 3-(vertex-)connectivity is fairly complex [...] describe an easy-to-verify certificate. A natural certificate to prove 3-connectivity is a so-called construction sequence. For a 3-connected graph G, a construction sequence is a sequence of certain operations
Allocation in Cloud Networking : %G eng %U http://hdl.handle.net/21.11116/0000-000D-5762-3 %R 0.1109/OGC55558.2022.10050986 %D 2022 %B The 7th Optoelectronics Global Conference %Z date of event: 2022-12-06 [...] Optical Data Center Networks : %G eng %U http://hdl.handle.net/21.11116/0000-0010-43D5-2 %U https://arxiv.org/abs/2410.17012 %D 2024 %X Optical data center networks (DCNs) are renovating the infrastructure [...] 3542647 %D 2023 %B 6th Asia-Pacific Workshop on Networking %Z date of event: 2022-07-01 - 2022-07-02 %C Fuzhou, China %B 6th Asia-Pacific Workshop on Networking %P 63 - 69 %I ACM %@ 978-1-4503-9748-3 %U h
various settings. In particular, we establish the existence of (3/4 + 3/3836) MMS allocations for agents with additive valuations, and 3/13 MMS allocations for agents with fractionally subadditive (XOS) [...] On March 13, 2025, Hannaneh Akrami successfully defended her PhD thesis entitled “Share-Based and Envy-Based Approaches to Fair Division of Indivisible Goods”. Hannaneh Akrami joined Saarland University [...] valuations. In addition, we consider ordinal approximations of MMS and prove the existence of 1-out-of-4n/3-MMS allocations in the additive setting. The second part of the dissertation focuses on envy-based fairness
