default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavis Issac
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c18]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: 444-456- [i11]Arnold Filtser, Tobias Friedrich, Davis Issac, Nikhil Kumar, Hung Le, Nadym Mallek, Ziena Zeif:
Optimal Padded Decomposition For Bounded Treewidth Graphs. CoRR abs/2407.12230 (2024) - 2023
- [c17]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: 110-122 - [c16]Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif:
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. STOC 2023: 1325-1334 - [c15]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: 10:1-10:14 - [c14]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: 143-156 - 2022
- [j3]L. Sunil Chandran, Davis Issac, Juho Lauri, Erik Jan van Leeuwen:
Upper bounding rainbow connection number by forest number. Discret. Math. 345(7): 112829 (2022) - [c13]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: 55:1-55:18 - [c12]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: 28:1-28:4 - [i10]Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif:
Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs. CoRR abs/2207.09262 (2022) - [i9]Tobias Friedrich, Davis Issac, Nikhil Kumar, Nadym Mallek, Ziena Zeif:
Approximate Max-Flow Min-Multicut Theorem for Graphs of Bounded Treewidth. CoRR abs/2211.06267 (2022) - 2021
- [c11]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: 111-122 - [c10]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: 27:1-27:14 - [c9]Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif:
Balanced Crown Decomposition for Connectivity Constraints. ESA 2021: 26:1-26:15 - [c8]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: 882-891 - [i8]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 abs/2106.00657 (2021) - [i7]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 abs/2107.04837 (2021) - 2020
- [c7]Andreas Emil Feldmann, Davis Issac, Ashutosh Rai:
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. IPEC 2020: 17:1-17:16 - [i6]Andreas Emil Feldmann, Davis Issac, Ashutosh Rai:
Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. CoRR abs/2002.07761 (2020) - [i5]Katrin Casel, Tobias Friedrich, Davis Issac, Aikaterini Niklanovits, Ziena Zeif:
Balanced Crown Decomposition for Connectivity Constraints. CoRR abs/2011.04528 (2020)
2010 – 2019
- 2019
- [b1]Davis Issac:
On some covering, partitions, and connectivity problems in graphs. Saarland University, Germany, 2019 - [j2]L. Sunil Chandran, Davis Issac, Sanming Zhou:
Hadwiger's conjecture for squares of 2-trees. Eur. J. Comb. 76: 159-174 (2019) - 2018
- [j1]Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar:
Sampling in Space Restricted Settings. Algorithmica 80(5): 1439-1458 (2018) - [c6]L. Sunil Chandran, Yun Kuen Cheung, Davis Issac:
Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition. ICALP 2018: 32:1-32:14 - [c5]L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen:
Algorithms and Bounds for Very Strong Rainbow Coloring. LATIN 2018: 625-639 - [c4]Pinar Heggernes, Davis Issac, Juho Lauri, Paloma T. Lima, Erik Jan van Leeuwen:
Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. MFCS 2018: 83:1-83:13 - [i4]L. Sunil Chandran, Yun Kuen Cheung, Davis Issac:
Spanning Tree Congestion and Computation of Generalized Győri-Lov{á}sz Partition. CoRR abs/1802.07632 (2018) - 2017
- [i3]L. Sunil Chandran, Anita Das, Davis Issac, Erik Jan van Leeuwen:
Algorithms and Bounds for Very Strong Rainbow Coloring. CoRR abs/1703.00236 (2017) - 2016
- [c3]L. Sunil Chandran, Davis Issac, Sanming Zhou:
Hadwiger's Conjecture and Squares of Chordal Graphs. COCOON 2016: 417-428 - [c2]L. Sunil Chandran, Davis Issac, Andreas Karrenbauer:
On the Parameterized Complexity of Biclique Cover and Partition. IPEC 2016: 11:1-11:13 - [i2]L. Sunil Chandran, Davis Issac, Sanming Zhou:
An Approach to Hadwiger's Conjecture through Squares of Chordal Graphs. CoRR abs/1603.03205 (2016) - 2015
- [c1]Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar:
Sampling in Space Restricted Settings. COCOON 2015: 483-494 - 2014
- [i1]Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar:
Sampling in Space Restricted Settings. CoRR abs/1407.1689 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
