People & Publications

We collaborate with vision, health and media technology innovation hubs. Here is a selected list of our most rescent publications. 

• Fedor V. Fomin, Pierre Fraigniaud, Petr A. Golovach:Present-Biased Optimization. AAAI 2021: 5415-5422https://arxiv.org/abs/2012.14736
• Sayan Bandyapadhyay, Fedor V. Fomin, Kirill Simonov:On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications. ICALP 2021: 23:1-23:15https://arxiv.org/abs/2007.10137
• Eduard Eiben, Fedor V. Fomin, Fahad Panolan, Kirill Simonov:Manipulating Districts to Win Elections: Fine-Grained Complexity. AAAI 2020: 1902-1909https://arxiv.org/abs/2002.07607
• Yogesh Dahiya, Fedor V. Fomin, Fahad Panolan, Kirill Simonov:Fixed-Parameter and Approximation Algorithms for PCA with Outliers. ICML 2021: 2341-2351http://proceedings.mlr.press/v139/dahiya21b.html
• Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Kirill Simonov:Parameterized Complexity of Feature Selection for Categorical Data Clustering. MFCS 2021: 14:1-14:14https://arxiv.org/abs/2104.07974
• Eduard Eiben, Fedor V. Fomin, Petr A. Golovach, William Lochet, Fahad Panolan, Kirill Simonov: EPTAS for k-means Clustering of Affine Subspaces. SODA 2021: 2649-2659https://arxiv.org/abs/2010.09580
• Sushmita Gupta, Pallavi Jain, Saket Saurabh, Nimrod Talmon:Even More Effort Towards Improved Bounds and Fixed-Parameter Tractability for Multiwinner Rules. IJCAI 2021: 217-223https://www.ijcai.org/proceedings/2021/31
• Sushmita Gupta, Pallavi Jain, Fahad Panolan, Sanjukta Roy, Saket Saurabh:Gerrymandering on Graphs: Computational Complexity and Parameterized Algorithms. SAGT 2021: 140-155https://arxiv.org/abs/2102.09889
• Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:Popular Matching in Roommates Setting Is NP-hard. ACM Trans. Comput. Theory 13(2): 9:1-9:20 (2021)https://arxiv.org/abs/1803.09370
• Sushmita Gupta, Pallavi Jain, Saket Saurabh:Well-Structured Committees. IJCAI 2020: 189-195https://www.ijcai.org/proceedings/2020/27
• Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:Gehrlein stability in committee selection: parameterized hardness and algorithms. Auton. Agents Multi Agent Syst. 34(1): 27 (2020)https://link.springer.com/article/10.1007%2Fs10458-020-09452-z
• Erik Parmann, Thomas Ågotnes:Reasoning about strategic voting in modal logic quickly becomes undecidable. J. Log. Comput. 31(4): 1055-1078 (2021)
• Rustam Galimullin, Thomas Ågotnes:Dynamic Coalition Logic: Granting and Revoking Dictatorial Powers. LORI 2021: 88-101
• Zuojun Xiong, Thomas Ågotnes:On the Logic of Balance in Social Networks. J. Log. Lang. Inf. 29(1): 53-75 (2020)
• Mina Young Pedersen, Sonja Smets, Thomas Ågotnes:Further Steps Towards a Logic of Polarization in Social Networks. CLAR 2020: 324-345
• Alessandro Artale, Jean Christoph Jung, Andrea Mazzullo, Ana Ozaki, Frank Wolter:Living Without Beth and Craig: Definitions and Interpolants in Description Logics with Nominals and Role Inclusions. AAAI 2021: 6193-6201
• Sirin Botan, Ronald de Haan, Marija Slavkovik, Zoi Terzopoulou:Egalitarian Judgment Aggregation. AAMAS 2021: 214-222
• Mina Young Pedersen, Marija Slavkovik, Sonja Smets:Social Bot Detection as a Temporal Logic Model Checking Problem. LORI 2021: 158-173
• Ulle Endriss, Ronald de Haan, Jérôme Lang, Marija Slavkovik:The Complexity Landscape of Outcome Determination in Judgment Aggregation. J. Artif. Intell. Res. 69: 687-731 (2020)
• Ramin Hasibi, Tom Michoel:A Graph Feature Auto-Encoder for the prediction of unobserved node features on biological networks. BMC Bioinform. 22(3): 525 (2021)
• Laura Garrison, Juliane Müller, Stefanie Schreiber, Steffen Oeltze-Jafra, Helwig Hauser, Stefan Bruckner:DimLift: Interactive Hierarchical Data Exploration Through Dimensional Bundling. IEEE Trans. Vis. Comput. Graph. 27(6): 2908-2922 (2021)
• Alexander Selvikvåg Lundervold, Arvid Lundervold:An overview of deep learning in medical imaging focusing on MRI. CoRR abs/1811.10052 (2018)
• Pål Grønås Drange, Irene Muzi, Felix ReidlKernelization and hardness of harmless sets in sparse classes https://arxiv.org/abs/2111.11834
• Pål Grønås Drange, Markus Fanebust Dregi, Daniel Lokshtanov, Blair D.SullivanOn the threshold of intractability. JCSS vol 124.https://doi.org/10.1016/j.jcss.2021.09.003
• Christophe Crespelle, Pål Grønås Drange, Fedor V. Fomin, Petr A. GolovachA survey of parameterized algorithms and the complexity of edge modificationhttps://arxiv.org/abs/2001.06867