Skip to main content or main navigation Institute D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics D5 Databases and Information Systems D6 [...] Institute Hiring: CS/EE postdoc (m/f/d) & PhD positions (m/f/d) on optical networking Departments D1 Algorithms & Complexity D2 Computer Vision and Machine Learning D3 Internet Architecture D4 Computer Graphics [...] Automation of Logic RG2 Network and Cloud Systems RG3 Multimodal Language Processing Publications Algorithms & Complexity Computer Vision and Machine Learning Internet Architecture Computer Graphics Databases
Research Departments Algorithms and Complexity People Simon Döring Simon Döring Address Max-Planck-Institut für Informatik Saarland Informatics Campus Campus E1 4 66123 Saarbrücken Location E1 4 - 324 [...] 681 9325 1099 E-mail sdoering@mpi-inf.mpg.de Research Interests Counting Problems Parameterized Algorithms Complexity Theory Graph Theory Combinatorics Publications Counting Small Induced Subgraphs: Scorpions [...] Small Subgraphs ( arXiv ) Simon Döring, Dániel Marx, Philip Wellnitz ACM-SIAM Symposium on Discrete Algorithms ( SODA 2025 ) Counting Small Induced Subgraphs with Edge-monotone Properties ( arXiv ) Simon Döring
Departments Algorithms & Complexity People Current Members Former Members Research Algorithmic Game Theory Clustering Distributed Computing Fine-Grained Complexity and Algorithm Design Graph Algorithms Learn [...] Learning-Augmented Algorithms Optimization Parameterized and Counting Algorithms and Complexity String Algorithms and Data Compression Offers Postdoc Application Teaching Winter 2023/24 Algorithms and Data Structures [...] Distributed Systems Topics in Algorithmic Game Theory and Economics Summer 2020 Computational Geometry Optimization Parameterized Algorithms Reading Group Algorithms Sublinear Algorithms Winter 2019/20 Ideen und
Approach to Social Relation Recognition. CVPR 2017. [ Paper ] [2] Bugental, D.B.: Acquisition of the Algorithms of Social Life: A Domain-Based Approach. Psychological Bulletin, Vol. 126, No. 2, pp. 187-219,
implements various standard and advanced new algorithms for determining the relevance of Gene Ontology groups from microarrays. A specific feature of the advanced algorithms is the exploitation of the hierarchical [...] ted by accounting for the neighborhood of a GO node when calculating its significance. The new algorithms better detect significant GO terms from gene expression data. Reference : Alexa, A.; Rahnenführer
disambiguating named entities (persons, organizations, ...) in text. CGAL Computational Geometry Algorithms Library ClausIE ClausIE is an open information extractor which extracts relations and their arguments [...] the pipeline for your specific use-case. The software is built using Python. DIPHA Dipha provides algorithms for topological data analysis on distributed systems, including creation of cell complexes and [...] and C virus from the viral genome sequence. LEDA C++ Class Library of Efficient Data Types and Algorithms MINERVA Distributed Search: Minerva . The Peer-to-Peer (P2P) Approach Allows Handling Huge Amounts
MG-FSM MG-FSM is a scalable, distributed (i.e., shared nothing) algorithm for frequent sequence mining (FSM) on MapReduce. The algorithm can handle so-called "gap constraints", which can be used to limit [...] are employed: probabilistic models as efficient score predictors for a variant of the threshold algorithm, judicious scheduling of sequential accesses for scanning index lists and random accesses to compute
II: An Õ(m sqrt(n)) Algorithm for the Minimum Cost Flow Problem Optimization Complexity Theory of Polynomial-Time Problems Randomized Algorithms and Probabilistic Analysis of Algorithms Mathematik für In [...] Research Departments Algorithms and Complexity Teaching State of the Art Linear Programming Theory State of the Art Linear Programming Theory Doctoral Privatissimum Basic Information Given by: Andreas [...] doctoral privatissima, see here . In order to participate, you should bring a very good background in algorithms and data structures, as well as a good knowledge of basic math. Description We will read the recent
models are often only passive descriptions of findings and not algorithms. The challenge in our work is to deliver concrete models and algorithms. These should reliably and efficiently predict human perception
