| 2020 | COCOA | How to Get a Degree-Anonymous Graph Using Minimum Number of Edge Rotations. | Cristina Bazgan, Pierre Cazals, Janka Chlebkov |
| 2019 | CIAC | Complexity of Scheduling for DARP with Soft Ride Times. | Janka Chlebkov, Clment Dallard, Niklas Paulsen |
| 2019 | COCOON | Approximation Hardness of Travelling Salesman via Weighted Amplifiers. | Miroslav Chlebk, Janka Chlebkov |
| 2019 | IWOCA | Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs. | Janka Chlebkov, Clment Dallard |
| 2015 | COCOA | New Insight into 2-Community Structures in Graphs with Applications in Social Networks. | Cristina Bazgan, Janka Chlebkov, Thomas Pontoizeau |
| 2013 | COCOON | On the Conjunctive Capacity of Graphs. | Miroslav Chlebk, Janka Chlebkov |
| 2006 | CIAC | Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations. | Miroslav Chlebk, Janka Chlebkov |
| 2005 | AAIM | Assign Ranges in General Ad-Hoc Networks. | Janka Chlebkov, Deshi Ye, Hu Zhang |
| 2005 | SODA | Approximation hardness of optimization problems in intersection graphs of | Miroslav Chlebk, Janka Chlebkov |
| 2004 | ESA | Approximation Hardness of Dominating Set Problems. | Miroslav Chlebk, Janka Chlebkov |
| 2004 | MFCS | On Approximation Hardness of the Minimum 2SAT-DELETION Problem. | Miroslav Chlebk, Janka Chlebkov |
| 2004 | SIROCCO | On Approximability of the Independent Set Problem for Low Degree Graphs. | Miroslav Chlebk, Janka Chlebkov |
| 2003 | CIAC | Approximation Hardness for Small Occurrence Instances of NP-Hard Problems. | Miroslav Chlebk, Janka Chlebkov |
| 2003 | FCT | Inapproximability Results for Bounded Variants of Optimization Problems. | Miroslav Chlebk, Janka Chlebkov |
| 2003 | ISAAC | Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching. | Miroslav Chlebk, Janka Chlebkov |