Davis Issac

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

Publications

2024

•  

  Horev, Yinon; Shay, Shiraz; Cohen, Sarel; Friedrich, Tobias; Issac, Davis; Kamma, Lior; Niklanovits, Aikaterini; Simonov, KirillA Contraction Tree SAT Encoding for Computing Twin-WidthAdvances in Knowledge Discovery and Data Mining 2024

  [ ][ ][ URL ][ DOI ][ Download ]

2023

•  

  Khomutovskiy, Ivan; Dunker, Rebekka; Dierking, Jessica; Egbert, Julian; Helms, Christian; Schöllkopf, Finn; Casel, Katrin; Fischbeck, Philipp; Friedrich, Tobias; Isaac, Davis; Krogmann, Simon; Lenzner, PascalApplying Skeletons to Speed Up the Arc-Flags Routing AlgorithmSIAM Symposium on Algorithm Engineering and Experiments (ALENEX) 2023: 110–122

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Friedrich, Tobias; Issac, Davis; Kumar, Nikhil; Mallek, Nadym; Zeif, ZienaApproximate Max-Flow Min-Multicut Theorem for Graphs of Bounded TreewidthSymposium Theory of Computing (STOC) 2023: 1325–1334

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Casel, Katrin; Friedrich, Tobias; Issac, Davis; Niklanovits, Aikaterini; Zeif, ZienaEfficient Constructions for the Gyori-Lovasz Theorem on Almost Chordal GraphsWorkshop Graph-Theoretic Concepts in Computer Science (WG) 2023: 143–156

  [ ][ ][ URL ][ DOI ][ Download ]

2022

•  

  Friedrich, Tobias; Issac, Davis; Kumar, Nikhil; Mallek, Nadym; Zeif, ZienaA Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 GraphsApproximation Algorithms for Combinatorial Optimization Problems (APPROX) 2022: 55:1–55:18

  [ ][ ][ URL ][ DOI ][ Download ]

2021

•  

  Cooley, Madison; Greene, Casey; Issac, Davis; Pividori, Milton; Sullivan, BlairParameterized Algorithms for Identifying Gene Co-Expression Modules via Weighted Clique DecompositionApplied and Computational Discrete Algorithms (ACDA) 2021: 111–122

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Borndörfer, Ralf; Casel, Katrin; Issac, Davis; Niklanovits, Aikaterini; Schwartz, Stephan; Zeif, ZienaConnected k-Partition of k-Connected Graphs and c-Claw-Free GraphsApproximation Algorithms for Combinatorial Optimization Problems (APPROX) 2021: 27:1–27:14

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Casel, Katrin; Friedrich, Tobias; Issac, Davis; Niklanovits, Aikaterini; Zeif, ZienaBalanced Crown Decomposition for Connectivity ConstraintsEuropean Symposium on Algorithms (ESA) 2021: 26:1–26:15

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Casel, Katrin; Friedrich, Tobias; Issac, Davis; Klodt, Nicolas; Seifert, Lars; Zahn, ArthurA Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved HeuristicsKnowledge Discovery and Data Mining (KDD) 2021: 882–891

  [ ][ ][ URL ][ DOI ][ Download ]

2020

•  

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

  [ ][ ][ URL ][ DOI ]

2019

•  

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

  [ ][ ][ DOI ][ Download ]

2018

•  

  Issac, Davis; Bhattacharya, Anup; Kumar, Amit; Jaiswal, RageshSampling in space restricted settingsAlgorithmica 2018: 1439–1458

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Issac, Davis; Chandran, L. Sunil; Cheung, Yuen KuengSpanning tree congestion and computation of gyori lovasz partitionInternational Colloquium on Automata, Languages, and Programming (ICALP) 2018: 1–14

  [ ][ ][ URL ][ DOI ][ Download ]

•  

  Issac, Davis; van Leeuwen, Erik Jan; Das, Anita; Chandran, L. SunilAlgorithms and bounds for very strong rainbow coloringLatin American Symposium on Theoretical Informatics Conference (LATIN) 2018: 625–639

  [ ][ ][ DOI ][ Download ]

•  

  Issac, Davis; van Leeuwen, Erik Jan; Lauri, Juho; Lima, Paloma; Heggernes, PinarRainbow Vertex Coloring Bipartite Graphs and Chordal GraphsMathematical Foundations of Computer Science (MFCS) 2018: 1–13

  [ ][ ][ DOI ][ Download ]

2016

•  

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

  [ ][ ][ DOI ][ Download ]