( en | de | ru )

 

Disambiguation of "Chlebíková, Janka"

Author of the publication

copydeleteadd this publication to your clipboard
Complexity of Scheduling for DARP with Soft Ride Times.

, , and . CIAC, volume 11485 of Lecture Notes in Computer Science, page 149-160. Springer, (2019)

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.

Hans Uwe Janka

Peter Janka

Oliver Janka

Christine Janka

Markus Janka

 

Other publications of authors with the same name

Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity., and . SWAT, volume 3111 of Lecture Notes in Computer Science, page 174-186. Springer, (2004)A characterization of some graph classes using excluded minors.. Period. Math. Hung., 55 (1): 1-9 (2007)Approximation Hardness for Small Occurrence Instances of NP-Hard Problems., and . CIAC, volume 2653 of Lecture Notes in Computer Science, page 152-164. Springer, (2003)Approximation Hardness of Dominating Set Problems., and . ESA, volume 3221 of Lecture Notes in Computer Science, page 192-203. Springer, (2004)Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems, and . Electron. Colloquium Comput. Complex., (2006)Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs., and . IWOCA, volume 11638 of Lecture Notes in Computer Science, page 136-147. Springer, (2019)Approximating the Maximally Balanced Connected Partition Problem in Graphs.. Inf. Process. Lett., 60 (5): 223-230 (1996)On Approximation Hardness of the Minimum 2SAT-DELETION Problem., and . MFCS, volume 3153 of Lecture Notes in Computer Science, page 263-273. Springer, (2004)Approximation Hardness of Travelling Salesman via Weighted Amplifiers., and . COCOON, volume 11653 of Lecture Notes in Computer Science, page 115-127. Springer, (2019)Proportionally dense subgraph of maximum size: complexity and approximation., , , and . CoRR, (2019)