Davis Issac

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