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



[ 2021 ] [ 2020 ] [ 2019 ] [ 2018 ] [ 2016 ]

2021 [ nach oben ]

  • Parameterized Algorithms ... - Download
    Cooley, Madison; Greene, Casey; Issac, Davis; Pividori, Milton; Sullivan, Blair Parameterized Algorithms for Identifying Gene Co-Expression Modules via Weighted Clique DecompositionApplied and Computational Discrete Algorithms (ACDA) 2021: 111–122
  • Connected k-Partition of ... - Download
    Borndörfer, Ralf; Casel, Katrin; Issac, Davis; Niklanovits, Aikaterini; Schwartz, Stephan; Zeif, Ziena Connected k-Partition of k-Connected Graphs and c-Claw-Free GraphsApproximation Algorithms for Combinatorial Optimization Problems (APPROX) 2021: 27:1–27:14
  • Balanced Crown Decomposit... - Download
    Casel, Katrin; Friedrich, Tobias; Issac, Davis; Niklanovits, Aikaterini; Zeif, Ziena Balanced Crown Decomposition for Connectivity ConstraintsEuropean Symposium on Algorithms (ESA) 2021: 26:1–26:15
  • A Color-blind 3-Approxima... - Download
    Casel, Katrin; Friedrich, Tobias; Issac, Davis; Klodt, Nicolas; Seifert, Lars; Zahn, Arthur A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved HeuristicsKnowledge Discovery and Data Mining (KDD) 2021: 882–891

2020 [ nach oben ]

  • Feldmann, Andreas; Issac, Davis; Rai, Ashutosh Fixed-Parameter Tractability of the Weighted Edge Clique Partition ProblemInternational Symposium on Parameterized and Exact Computation (IPEC) 2020: 1–16

2019 [ nach oben ]

  • Hadwiger's conjecture for... - Download
    Issac, Davis; Chandran, L. Sunil; Zhou, Sanming Hadwiger’s conjecture for squares of 2-treesEuropean Journal of Combinatorics 2019: 159–174

2018 [ nach oben ]

  • Sampling in space restric... - Download
    Issac, Davis; Bhattacharya, Anup; Kumar, Amit; Jaiswal, Ragesh Sampling in space restricted settingsAlgorithmica 2018: 1439–1458
  • Spanning tree congestion ... - Download
    Issac, Davis; Chandran, L. Sunil; Cheung, Yuen Kueng Spanning tree congestion and computation of gyori lovasz partitionInternational Colloquium on Automata, Languages, and Programming (ICALP) 2018: 1–14
  • Algorithms and bounds for... - Download
    Issac, Davis; van Leeuwen, Erik Jan; Das, Anita; Chandran, L. Sunil Algorithms and bounds for very strong rainbow coloringLatin American Symposium on Theoretical Informatics Conference (LATIN) 2018: 625–639
  • Rainbow Vertex Coloring B... - Download
    Issac, Davis; van Leeuwen, Erik Jan; Lauri, Juho; Lima, Paloma; Heggernes, Pinar Rainbow Vertex Coloring Bipartite Graphs and Chordal GraphsMathematical Foundations of Computer Science (MFCS) 2018: 1–13

2016 [ nach oben ]

  • On the Parameterized Comp... - Download
    Issac, Davis; Chandran, L. Sunil; Karrenbauer, Andreas On the Parameterized Complexity of Biclique Cover and PartitionInternational Symposium on Parameterized and Exact Computation (IPEC) 2016: 1–13