Davis Issac

Orcid: 0000-0001-5559-7471

According to our database1, Davis Issac authored at least 24 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Optimal Padded Decomposition For Bounded Treewidth Graphs.
CoRR, 2024

A Contraction Tree SAT Encoding for Computing Twin-Width.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2024

2023
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022
Upper bounding rainbow connection number by forest number.
Discret. Math., 2022

PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex Set.
Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs.
Proceedings of the Approximation, 2022

2021
A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved Heuristics.
Proceedings of the KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2021

Balanced Crown Decomposition for Connectivity Constraints.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021

Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs.
Proceedings of the Approximation, 2021

Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition.
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021

2020
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem.
Proceedings of the 15th International Symposium on Parameterized and Exact Computation, 2020

2019
On some covering, partitions, and connectivity problems in graphs.
PhD thesis, 2019

Hadwiger's conjecture for squares of 2-trees.
Eur. J. Comb., 2019

2018
Spanning Tree Congestion and Computation of Generalized Győri-Lov{á}sz Partition.
CoRR, 2018

Sampling in Space Restricted Settings.
Algorithmica, 2018

Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Algorithms and Bounds for Very Strong Rainbow Coloring.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2016
An Approach to Hadwiger's Conjecture through Squares of Chordal Graphs.
CoRR, 2016

On the Parameterized Complexity of Biclique Cover and Partition.
Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

Hadwiger's Conjecture and Squares of Chordal Graphs.
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016


  Loading...