Crown reductions for the Minimum Weighted Vertex Cover problem von CHLEBIK, Miroslav, CHLEBIKOVA, Janka

Volltext

Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems von Chlebíková, Janka, Dallard, Clément, Paulsen, Niklas

Volltext

Degree-anonymization using edge rotations von Bazgan, Cristina, Cazals, Pierre, Chlebíková, Janka

Volltext

The firefighter problem: Further steps in understanding its complexity von Chlebíková, Janka, Chopin, Morgan

Volltext

Colourful components in k-caterpillars and planar graphs von Chlebíková, Janka, Dallard, Clément

Volltext

Weighted amplifiers and inapproximability results for Travelling Salesman problem von Chlebík, Miroslav, Chlebíková, Janka

Volltext

Approximation hardness of edge dominating set problems von CHLEBIK, Miroslav, CHLEBIKOVA, Janka

Volltext

The Steiner tree problem on graphs: Inapproximability results von Chlebík, Miroslav, Chlebíková, Janka

Volltext

Graphs without a partition into two proportionally dense subgraphs von Bazgan, Cristina, Chlebíková, Janka, Dallard, Clément

Volltext

Complexity of approximating bounded variants of optimization problems von CHLEBIK, Miroslav, CHLEBIOVA, Janka

Volltext

Proportionally dense subgraph of maximum size: Complexity and approximation von Bazgan, Cristina, Chlebíková, Janka, Dallard, Clément, Pontoizeau, Thomas

Volltext

Complexity of Scheduling for DARP with Soft Ride Times von Chlebíková, Janka, Dallard, Clément, Paulsen, Niklas

Volltext

Approximation Hardness of Travelling Salesman via Weighted Amplifiers von Chlebík, Miroslav, Chlebíková, Janka

Volltext

Approximation Hardness of Dominating Set Problems von CHLEBIK, Miroslav, CHLEBIKOVA, Janka

Volltext

Connection between conjunctive capacity and structural properties of graphs von Chlebík, Miroslav, Chlebíková, Janka

Volltext

Partial k-trees with maximum chromatic number von CHLEBIKOVA, Janka

Volltext

Approximation Hardness of the Steiner Tree Problem on Graphs von CHLEBIK, Miroslav, CHLEBIKOVA, Janka

Volltext

Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs von Chlebíková, Janka, Dallard, Clément

Volltext

A Multi-objective Optimization Approach for the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) von Marrouche, Wissam, Harmanani, Haidar M., Chlebíková, Janka

Volltext

Hardness of approximation for orthogonal rectangle packing and covering problems von Chlebík, Miroslav, Chlebíková, Janka

Volltext