Algorithmics and Computational Complexity


Group MemberDateAward / DistinctionPublicationConferred by
Niclas Böhmer, Klaus HeegerDecember 2020Best Paper Award and Best Student Paper AwardA Fine-Grained View on Stable Many-To-One Matching Problems with Lower and Upper QuotasWINE 2020, (virtual), organized by Peking University, Beijing
Andrzej KaczmarczykJanuary 2020Outstanding Program Committee Member (12 out of 6000) AAAI 2020, New York, USA
Matthias BentertSeptember 2017Best Student Paper AwardParameterized Aspects of Triangle Enumeration.FCT 2017, Bordeaux, France
Matthias Bentert, René van Bevern, André Nichterlein, Rof NiedermeierSeptember 2017Best Paper AwardParameterized Algorithms for Power-Efficient Connected Symmetric Wireless Sensor NetworksALGO 2017 - Algosensors Vienna, Austria
Robert Bredereck, Christian Komusiewicz, Stefan Kratsch, Hendrik Molter, Rolf Niedermeier, Manuel SorgeMay 2017Best Paper AwardAssessing the Computational Complexity of Multi-layer Subgraph DetectionCIAC 2017, Athens, Greece
Nimrod TalmonDecember 2016PhD Thesis AwardAlgorithmic Aspects of Manipulation and Anonymization in Social Choice and Social Networks.Dr. Wilhelmy Foundation
Jiehua ChenOctober 2016Klaus Tschira Award for Understandable Science (PhD Thesis)Exploiting Structure in Computationally Hard Voting Problems.Klaus Tschira Foundation
Anne-Sophie-Himmel, Hendrik Molter, Rolf Niedermeier, Manuel SorgeAugust 2016Paper Runner-UpEnumerating Maximal Cliques In Temporal Graphs.ASONAM 2016, San Francisco, USA
André NichterleinDecember 2015Tiburtius Recognition Award (PhD Thesis)Degree-Constrained Editing of Small-Degree Graphs.Universities of Berlin
René van Bevern, Christian Komusiewicz, Manuel SorgeSeptember 2015Best Paper AwardApproximation Algorithms for Mixed, Windy and Capacitated Arc Routing Problems.ATMOS 2015, Patras, Greece
Manuel SorgeJuly 2015Excellent Student Paper AwardOn Kernelization and Approximation for the Vector Connectivity Problem.IPEC 2015, Patras, Greece
Sepp Hartung, André NichterleinJune 2012Best Student Paper AwardNP-Hardness and Fixed-Parameter Tractability of Realizing Degree Sequences with Directed Acyclic GraphsCiE 2012, Cambridge, UK
Nadja Betzler, Rolf Niedermeier, Gerhard WögingerJuly 2011Distinguished Paper AwardUnweighted Coalitional Manipulation Under the Borda Rule Is NP-Hard.IJCAI 2011, Barcelona, Spain