Approximating the Maximally Balanced Connected Partition Problem in Graphs. - Janka Chlebíková (Inf. Process. Lett., 1996)

Approximation Hardness of the Steiner Tree Problem on Graphs. - Miroslav Chlebík; Janka Chlebíková (SWAT, 2002)

The structure of obstructions to treewidth and pathwidth. - Janka Chlebíková (Discret. Appl. Math., 2002)

Partial k-trees with maximum chromatic number. - Janka Chlebíková (Discret. Math., 2002)

Approximation Hardness for Small Occurrence Instances of NP-Hard Problem - Janka Chlebíková; Miroslav Chlebík (Electron. Colloquium Comput. Complex., 2002)

Approximation Hardness for Small Occurrence Instances of NP-Hard Problems. - Miroslav Chlebík; Janka Chlebíková (CIAC, 2003)

Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching. - Miroslav Chlebík; Janka Chlebíková (ISAAC, 2003)

Inapproximability results for bounded variants of optimization problems - Janka Chlebíková; Miroslav Chlebík (Electron. Colloquium Comput. Complex., 2003)

Approximation Hardness of Dominating Set Problems. - Miroslav Chlebík; Janka Chlebíková (ESA, 2004)

On Approximation Hardness of the Minimum 2SAT-DELETION Problem. - Miroslav Chlebík; Janka Chlebíková (MFCS, 2004)

On Approximability of the Independent Set Problem for Low Degree Graphs. - Miroslav Chlebík; Janka Chlebíková (SIROCCO, 2004)

Improvement of Nemhauser-Trotter Theorem and Its Applications in Parametrized Complexity. - Miroslav Chlebík; Janka Chlebíková (SWAT, 2004)

Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes. - Miroslav Chlebík; Janka Chlebíková (SODA, 2005)

Inapproximability Results for Orthogonal Rectangle Packing Problems with Rotations. - Miroslav Chlebík; Janka Chlebíková (CIAC, 2006)

Hard coloring problems in low degree planar bipartite graphs. - Miroslav Chlebík; Janka Chlebíková (Discret. Appl. Math., 2006)

Hardness of asymptotic approximation for orthogonal rectangle packing and covering problems - Janka Chlebíková; Miroslav Chlebík (Electron. Colloquium Comput. Complex., 2006)

Approximation hardness of edge dominating set problems. - Miroslav Chlebík; Janka Chlebíková (J. Comb. Optim., 2006)

Assign ranges in general ad-hoc networks. - Janka Chlebíková; Deshi Ye; Hu Zhang 004 (J. Parallel Distributed Comput., 2006)

Complexity of approximating bounded variants of optimization problems. - Miroslav Chlebík; Janka Chlebíková (Theor. Comput. Sci., 2006)

Minimum 2SAT-DELETION: Inapproximability results and relations to Minimum Vertex Cover. - Miroslav Chlebík; Janka Chlebíková (Discret. Appl. Math., 2007)

The d-precoloring problem for k-degenerate graphs. - Janka Chlebíková; Klaus Jansen (Discret. Math., 2007)

A characterization of some graph classes using excluded minors. - Janka Chlebíková (Period. Math. Hung., 2007)

The Complexity of Combinatorial Optimization Problems on d-Dimensional Boxes. - Miroslav Chlebík; Janka Chlebíková (SIAM J. Discret. Math., 2007)

Crown reductions for the Minimum Weighted Vertex Cover problem. - Miroslav Chlebík; Janka Chlebíková (Discret. Appl. Math., 2008)

Approximation hardness of dominating set problems in bounded degree graphs. - Miroslav Chlebík; Janka Chlebíková (Inf. Comput., 2008)

The Steiner tree problem on graphs: Inapproximability results. - Miroslav Chlebík; Janka Chlebíková (Theor. Comput. Sci., 2008)

Hardness of approximation for orthogonal rectangle packing and covering problems. - Miroslav Chlebík; Janka Chlebíková (J. Discrete Algorithms, 2009)

On the Conjunctive Capacity of Graphs. - Miroslav Chlebík; Janka Chlebíková (COCOON, 2013)

The Firefighter Problem: A Structural Analysis. - Janka Chlebíková; Morgan Chopin (Electron. Colloquium Comput. Complex., 2013)

Connection between conjunctive capacity and structural properties of graphs. - Miroslav Chlebík; Janka Chlebíková (Theor. Comput. Sci., 2014)

New Insight into 2-Community Structures in Graphs with Applications in Social Networks. - Cristina Bazgan; Janka Chlebíková; Thomas Pontoizeau (COCOA, 2015)

The firefighter problem: Further steps in understanding its complexity. - Janka Chlebíková; Morgan Chopin (Theor. Comput. Sci., 2017)

Structural and Algorithmic Properties of 2-Community Structures. - Cristina Bazgan; Janka Chlebíková; Thomas Pontoizeau (Algorithmica, 2018)

Complexity of Scheduling for DARP with Soft Ride Times. - Janka Chlebíková; Clément Dallard; Niklas Paulsen (CIAC, 2019)

Approximation Hardness of Travelling Salesman via Weighted Amplifiers. - Miroslav Chlebík; Janka Chlebíková (COCOON, 2019)

Towards a Complexity Dichotomy for Colourful Components Problems on k-caterpillars and Small-Degree Planar Graphs. - Janka Chlebíková; Clément Dallard (IWOCA, 2019)

Proportionally dense subgraph of maximum size: Complexity and approximation. - Cristina Bazgan; Janka Chlebíková; Clément Dallard; Thomas Pontoizeau (Discret. Appl. Math., 2019)

How to Get a Degree-Anonymous Graph Using Minimum Number of Edge Rotations. - Cristina Bazgan; Pierre Cazals; Janka Chlebíková (COCOA, 2020)

Graphs without a partition into two proportionally dense subgraphs. - Cristina Bazgan; Janka Chlebíková; Clément Dallard (Inf. Process. Lett., 2020)

Degree-anonymization using edge rotations. - Cristina Bazgan; Pierre Cazals; Janka Chlebíková (Theor. Comput. Sci., 2021)

Colourful components in k-caterpillars and planar graphs. - Janka Chlebíková; Clément Dallard (Theor. Comput. Sci., 2021)

Weighted amplifiers and inapproximability results for Travelling Salesman problem. - Miroslav Chlebík; Janka Chlebíková (J. Comb. Optim., 2022)

Safe Edges: A Study of Triangulation in Fill-in and Tree-Width Problems. - Mani Ghahremani; Janka Chlebíková (CoRR, 2023)

Impact of soft ride time constraints on the complexity of scheduling in Dial-A-Ride Problems. - Janka Chlebíková; Clément Dallard; Niklas Paulsen (Theor. Comput. Sci., 2023)