# Publications of Dr. Davis Issac

The following listing contains all publications of Dr. Davis Issac. Further publications of the research group can be found on the current list of publications and the complete list of publications. Individual listings are available externally on DBLP and Google Scholar or locally as PDF.

You can view all publications of the current members of the Algorithm Engineering group. For other listings, please see:

- years: 2021, 2020, 2019, 2018, 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010
- researchers: Prof. Dr. Tobias Friedrich, Dr. Katrin Casel, Dr. Sarel Cohen, Dr. Ágnes Cseh, Dr. Andreas Göbel, Dr. Davis Issac, Dr. Timo Kötzing, Dr. Nikhil Kumar, Dr. Pascal Lenzner
- PhD students: Vanja Doskoč, Ziena Elijazyfer, Philipp Fischbeck, Maximilian Katzmann, Simon Krogmann, Gregor Lagodzinski, Anna Melnichenko, Louise Molitor, Stefan Neubert, Marcus Pappik, Francesco Quinzan, Ralf Rothenberger, Martin Schirneck, Karen Seidel, Christopher Weyand
- theory conferences: ICALP, MFCS, SAGT, STACS, STOC, WINE

algorithm conferences: ALENEX, ESA, GD, ISAAC, SODA, SPAA, SWAT, WAW - artificial intelligence conferences: AAAI, AAMAS, ALT, COLT, ECAI, ICAPS, IJCAI, SAT

evolutionary computation conferences: CEC, EMO, EvoCOP, FOGA, GECCO, PPSN

2021 [ nach oben ]

- Parameterized Algorithms for Identifying Gene Co-Expression Modules via Weighted Clique Decomposition. Applied and Computational Discrete Algorithms (ACDA) 2021
- A Color-blind 3-Approximation for Chromatic Correlation Clustering and Improved Heuristics. Knowledge Discovery and Data Mining (KDD) 2021

2020 [ nach oben ]

- Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem. International Symposium on Parameterized and Exact Computation (IPEC) 2020: 1-16

2019 [ nach oben ]

- Hadwiger's conjecture for squares of 2-trees. European Journal of Combinatorics 2019: 159-174

2018 [ nach oben ]

- Sampling in space restricted settings. Algorithmica 2018: 1439-1458
- Spanning tree congestion and computation of gyori lovasz partition. International Colloquium on Automata, Languages, and Programming (ICALP) 2018: 1-14
- Algorithms and bounds for very strong rainbow coloring. Latin American Symposium on Theoretical Informatics Conference (LATIN) 2018: 625-639
- Rainbow Vertex Coloring Bipartite Graphs and Chordal Graphs. Mathematical Foundations of Computer Science (MFCS) 2018: 1-13

2016 [ nach oben ]

- On the Parameterized Complexity of Biclique Cover and Partition. International Symposium on Parameterized and Exact Computation (IPEC) 2016: 1-13