Skip to content
cs-conference-ranking.org

Miroslav Chlebk

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

10

Venues

8

Active years

2003–2019

Best venue rank

A*

Where they publish

Papers

10 indexed papers, newest first.

YearVenueTitleAuthors
2019COCOONApproximation Hardness of Travelling Salesman via Weighted Amplifiers.Miroslav Chlebk, Janka Chlebkov
2013COCOONOn the Conjunctive Capacity of Graphs.Miroslav Chlebk, Janka Chlebkov
2006CIACInapproximability Results for Orthogonal Rectangle Packing Problems with Rotations.Miroslav Chlebk, Janka Chlebkov
2005SODAApproximation hardness of optimization problems in intersection graphs ofMiroslav Chlebk, Janka Chlebkov
2004ESAApproximation Hardness of Dominating Set Problems.Miroslav Chlebk, Janka Chlebkov
2004MFCSOn Approximation Hardness of the Minimum 2SAT-DELETION Problem.Miroslav Chlebk, Janka Chlebkov
2004SIROCCOOn Approximability of the Independent Set Problem for Low Degree Graphs.Miroslav Chlebk, Janka Chlebkov
2003CIACApproximation Hardness for Small Occurrence Instances of NP-Hard Problems.Miroslav Chlebk, Janka Chlebkov
2003FCTInapproximability Results for Bounded Variants of Optimization Problems.Miroslav Chlebk, Janka Chlebkov
2003ISAACApproximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching.Miroslav Chlebk, Janka Chlebkov