( en | de | ru )

 

Disambiguation of "Issac, Davis"

Author of the publication

copydeleteadd this publication to your clipboard
Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs.

, , , , , and . APPROX-RANDOM, volume 207 of LIPIcs, page 27:1-27:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Matthew Davis

Abey Issac

Issac Odoom

Geoffrey Davis

Richard Davis

 

Other publications of authors with the same name

Applying Skeletons to Speed Up the Arc-Flags Routing Algorithm., , , , , , , , , and 2 other author(s). ALENEX, page 110-122. SIAM, (2023)A Contraction Tree SAT Encoding for Computing Twin-Width., , , , , , , and . PAKDD (2), volume 14646 of Lecture Notes in Computer Science, page 444-456. Springer, (2024)Connected k-Partition of k-Connected Graphs and c-Claw-Free Graphs., , , , , and . APPROX-RANDOM, volume 207 of LIPIcs, page 27:1-27:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex Set., , , , , , , , , and 1 other author(s). IPEC, volume 249 of LIPIcs, page 28:1-28:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved Heuristics., , , , , and . KDD, page 882-891. ACM, (2021)Solving Directed Feedback Vertex Set by Iterative Reduction to Vertex Cover., , , , , , , , , and 1 other author(s). SEA, volume 265 of LIPIcs, page 10:1-10:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Spanning Tree Congestion and Computation of Generalized Győri-Lovász Partition., , and . CoRR, (2018)Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs., , , , and . CoRR, (2022)On some covering, partitions, and connectivity problems in graphs.. Saarland University, Germany, (2019)Optimal Padded Decomposition For Bounded Treewidth Graphs., , , , , , and . CoRR, (2024)