# Publications of Nikhil Kumar

The following listing contains all publications of Dr. Nikhil Kumar. 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 or locally as PDF.

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

- years: 2023, 2022, 2021, 2020, 2019, 2018, 2017, 2016, 2015, 2014, 2013, 2012, 2011, 2010
- researchers: Prof. Dr. Tobias Friedrich, Dr. Samuel Baguley, Dr. Sarel Cohen, Dr. Andreas Göbel, Dr. Davis Issac, Dr. Timo Kötzing, Dr. Nikhil Kumar, Dr. Pascal Lenzner, Dr. Kirill Simonov, Dr. George Skretas
- PhD students: Michelle Döring, Vanja Doskoč, Philipp Fischbeck, Jonathan Gadea Harder, Hans Gawendowicz, Merlin de la Haye, Nicolas Klodt, Simon Krogmann, Gregor Lagodzinski, Xiaoyue Sherry Li, Nadym Mallek, Louise Molitor, Stefan Neubert, Aikaterini Niklanovits, Marcus Pappik, Aishwarya Radhakrishnan, Janosch Ruff, Ziena Zeif
- theory conferences: FOCS, 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

2023 [ nach oben ]

2022 [ nach oben ]

- Friedrich, Tobias; Issac, Davis; Kumar, Nikhil; Mallek, Nadym; Zeif, Ziena
**A Primal-Dual Algorithm for Multicommodity Flows and Multicuts in Treewidth-2 Graphs**Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 2022: 55:1–55:18 - Kumar, Nikhil
**An Approximate Generalization of the Okamura-Seymour Theorem**Symposium on Foundations of Computer Science (FOCS) 2022

2021 [ nach oben ]

2020 [ nach oben ]

- Das, Syamantak; Jain, Lavina; Kumar, Nikhil
**A Constant Factor Approximation for Capacitated Min-Max Tree Cover**Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM) 2020: 55:1–55:13 - Garg, Naveen; Kumar, Nikhil
**Dual Half-Integrality for Uncrossable Cut Cover and Its Application to Maximum Half-Integral Flow**European Symposium on Algorithms (ESA) 2020: 55:1–55:13 - Garg, Naveen; Kumar, Nikhil; Sebö, András
**Integer Plane Multiflow Maximisation: Flow-Cut Gap and One-Quarter-Approximation**Integer Programming and Combinatorial Optimization (IPCO) 2020: 144–157 - Kumar, Nikhil
**Multicommodity Flows in Planar Graphs with Demands on Faces**International Symposium on Algorithms and Computation (ISAAC) 2020: 1–11 - Antoniadis, Antonios; Garg, Naveen; Kumar, Gunjan; Kumar, Nikhil
**Parallel Machine Scheduling to Minimize Energy Consumption**Symposium on Discrete Algorithms (SODA) 2020: 2758–2769

2019 [ nach oben ]

2015 [ nach oben ]