This is an archived page of a former group member.

# 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 [ nach oben ]

2023 [ nach oben ]

- Khomutovskiy, Ivan; Dunker, Rebekka; Dierking, Jessica; Egbert, Julian; Helms, Christian; Schöllkopf, Finn; Casel, Katrin; Fischbeck, Philipp; Friedrich, Tobias; Isaac, Davis; Krogmann, Simon; Lenzner, Pascal
**Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm**SIAM Symposium on Algorithm Engineering and Experiments (ALENEX) 2023: 110–122 - Friedrich, Tobias; Issac, Davis; Kumar, Nikhil; Mallek, Nadym; Zeif, Ziena
**Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth**Symposium Theory of Computing (STOC) 2023: 1325–1334 - Casel, Katrin; Friedrich, Tobias; Issac, Davis; Niklanovits, Aikaterini; Zeif, Ziena
**Efficient Constructions for the Gyori-Lovasz Theorem on Almost Chordal Graphs**Workshop Graph-Theoretic Concepts in Computer Science (WG) 2023: 143–156

2022 [ nach oben ]

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

2021 [ nach oben ]

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

2020 [ nach oben ]

2019 [ nach oben ]

2018 [ nach oben ]

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

2016 [ nach oben ]