Prof. Dr. Tobias Friedrich

Dr. Davis Issac

Chair for Algorithm Engineering
Hasso Plattner Institute

Office: A-1.11
Tel.: +49 331 5509-4841
E-Mail: Davis.Issac(at)hpi.de

Research Interests

I have so far worked mainly in the areas of

  • Graph algorithms,
  • Graph theory, and
  • Parameterized algorithms.

Broadly, I am interested in working on problems that are combinatorial in nature and also appear in real applications.

Some specific topics that i am working on are the following: 

  • Covering and partitioning of the edges of a graph with cliques/bicliques
  • Binary Matrix Factorization
  • Partitioning a graph into connected subgraphs
  • Graph cut problems such as multi-way cut and multi-cut



[ 2019 ] [ 2018 ] [ 2016 ]

2019 [ to top ]

  • Hadwiger's conjecture for... - Download
    Issac, Davis; Chandran, L. Sunil; Zhou, SanmingHadwiger's conjecture for squares of 2-trees. European Journal of Combinatorics 2019

2018 [ to top ]

  • Sampling in space restric... - Download
    Issac, Davis; Bhattacharya, Anup; Kumar, Amit; Jaiswal, RageshSampling in space restricted settings. Algorithmica 2018: 1439-1458
  • Spanning tree congestion ... - Download
    Issac, Davis; Chandran, L. Sunil; Cheung, Yuen KuengSpanning tree congestion and computation of gyori lovasz partition. International Colloquium on Automata, Languages, and Programming (ICALP) 2018
  • Algorithms and bounds for... - Download
    Issac, Davis; van Leeuwen, Erik Jan; Das, Anita; Chandran, L. SunilAlgorithms and bounds for very strong rainbow coloring. Latin American Symposium on Theoretical Informatics Conference (LATIN) 2018
  • Rainbow Vertex Coloring B... - Download
    Issac, Davis; van Leeuwen, Erik Jan; Lauri, Juho; Lima, Paloma; Heggernes, PinarRainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. Mathematical Foundations of Computer Science (MFCS) 2018

2016 [ to top ]

  • On the Parameterized Comp... - Download
    Issac, Davis; Chandran, L. Sunil; Karrenbauer, AndreasOn the Parameterized Complexity of Biclique Cover and Partition. International Symposium on Parameterized and Exact Computation (IPEC) 2016