Davis Issac

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 30

Top Topics

Correlation Clustering

Connected Graphs

Monadic Datalog

Top Venues

Publications

Yinon Horev, Shiraz Shay, Sarel Cohen, Tobias Friedrich, Davis Issac, Lior Kamma, Aikaterini Niklanovits, Kirill Simonov
A Contraction Tree SAT Encoding for Computing Twin-Width. PAKDD (2) (2024)
Arnold Filtser, Tobias Friedrich, Davis Issac, Nikhil Kumar, Hung Le, Nadym Mallek, Ziena Zeif
Optimal Padded Decomposition For Bounded Treewidth Graphs. CoRR (2024)
Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, Leo Wendt
Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover. SEA (2023)
Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. STOC (2023)
Ivan Khomutovskiy, Rebekka Dunker, Jessica Dierking, Julian Egbert, Christian Helms, Finn Schöllkopf, Katrin Casel, Philipp Fischbeck, Tobias Friedrich, Davis Issac, Simon Krogmann, Pascal Lenzner
Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm. ALENEX (2023)
Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs. WG (2023)
Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs. CoRR (2022)
Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif
A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs. APPROX/RANDOM (2022)
Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. CoRR (2022)
L. Sunil Chandran, Davis Issac, Juho Lauri, Erik Jan van Leeuwen
Upper bounding rainbow connection number by forest number. Discret. Math. 345 (7) (2022)
Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, Leo Wendt
PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex Set. IPEC (2022)
Ralf Borndörfer, Katrin Casel, Davis Issac, Aikaterini Niklanovits, Stephan Schwartz, Ziena Zeif
Connected $k$-partition of $k$-connected graphs and $c$-claw-free graphs. CoRR (2021)
Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif
Balanced Crown Decomposition for Connectivity Constraints. ESA (2021)
Ralf Borndörfer, Katrin Casel, Davis Issac, Aikaterini Niklanovits, Stephan Schwartz, Ziena Zeif
Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs. APPROX-RANDOM (2021)
Nicolas Klodt, Lars Seifert, Arthur Zahn, Katrin Casel, Davis Issac, Tobias Friedrich
A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved Heuristics. KDD (2021)
Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, Blair D. Sullivan
Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition. ACDA (2021)
Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, Blair D. Sullivan
Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition. CoRR (2021)
Andreas Emil Feldmann, Davis Issac, Ashutosh Rai
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. IPEC (2020)
Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif
Balanced Crown Decomposition for Connectivity Constraints. CoRR (2020)
Andreas Emil Feldmann, Davis Issac, Ashutosh Rai
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. CoRR (2020)
L. Sunil Chandran, Davis Issac, Sanming Zhou
Hadwiger's conjecture for squares of 2-trees. Eur. J. Comb. 76 (2019)
L. Sunil Chandran, Yun Kuen Cheung, Davis Issac
Spanning Tree Congestion and Computation of Generalized Győri-Lov{á}sz Partition. CoRR (2018)
L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen
Algorithms and Bounds for Very Strong Rainbow Coloring. LATIN (2018)
L. Sunil Chandran, Yun Kuen Cheung, Davis Issac
Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition. ICALP (2018)
Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar
Sampling in Space Restricted Settings. Algorithmica 80 (5) (2018)
Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. MFCS (2018)
L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen
Algorithms and Bounds for Very Strong Rainbow Coloring. CoRR (2017)
L. Sunil Chandran, Davis Issac, Sanming Zhou
Hadwiger's Conjecture and Squares of Chordal Graphs. COCOON (2016)
L. Sunil Chandran, Davis Issac, Andreas Karrenbauer
On the Parameterized Complexity of Biclique Cover and Partition. IPEC (2016)
L. Sunil Chandran, Davis Issac, Sanming Zhou
An Approach to Hadwiger's Conjecture through Squares of Chordal Graphs. CoRR (2016)
Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar
Sampling in Space Restricted Settings. COCOON (2015)
Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar
Sampling in Space Restricted Settings. CoRR (2014)
Davis Issac, Ragesh Jaiswal
An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3. CoRR (2013)