Authors: Chitnis, Rajesh, Feldmann, Andreas Emil, Suchý, Ondřej

Superior Title: Algorithmica; Aug2019, Vol. 81 Issue 8, p3200-3216, 17p

Subject Terms: DIRECTED graphs, POLYNOMIAL time algorithms, COMPUTABLE functions, PLANAR graphs, NP-complete problems

Authors: Bevern, René, Niedermeier, Rolf, Suchý, Ondřej

Superior Title: Journal of Scheduling; Jun2017, Vol. 20 Issue 3, p255-265, 11p

Subject Terms: COMPUTATIONAL complexity, PRODUCTION scheduling, MACHINE learning, NP-hard problems, POLYNOMIAL time algorithms

Authors: Hartung, Sepp¹ sepp.hartung@tu-berlin.de, Nichterlein, André¹ andre.nichterlein@tu-berlin.de, Niedermeier, Rolf¹ rolf.niedermeier@tu-berlin.de, Suchý, Ondřej² ondrej.suchy@fit.cvut.cz

Superior Title: Information & Computation. Aug2015, Vol. 243, p249-262. 14p.

Subject Terms: *TOPOLOGICAL degree, *GRAPH theory, *NP-hard problems, *PATHS & cycles in graph theory, *ALGORITHMS, *POLYNOMIAL time algorithms